Energy Efficient Multimeric Multichannel Routing Protocol for Cognitive Radio Ad Hoc Network

Shiraz Khurana, S. Upadhyaya
{"title":"Energy Efficient Multimeric Multichannel Routing Protocol for Cognitive Radio Ad Hoc Network","authors":"Shiraz Khurana, S. Upadhyaya","doi":"10.2139/ssrn.3511005","DOIUrl":null,"url":null,"abstract":"In recent times, wireless networks have seen unprecedented growth. This leads to shortage of scarce resources like radio spectrum. With the conventional approach, it is very tough to manage this frightening number of devices. Therefore, Cognitive Radio Ad Hoc Networks (CRAHNs) envisioned. In CRAHNs, the unlicensed users can communicate in licensed bands opportunistically when it is not in use by licensed users. A special routing protocol is required to implement this objective, as the conventional protocols proposed for mobile ad hoc network will not be suitable for CRAHNs. There are many additional routing challenges involved. For instance, the routing protocols must be dynamic to provide protection to primary users & it must be energy efficient since all the devices involved in conventional ad hoc networks are battery operated. This paper proposes an Energy Efficient Multimeric Multichannel routing protocol for CRAHNs. It is an on demand routing protocol which takes residual energy, the probability of primary user appearance on a channel and route cost as metrics to evaluate the best route between a source and destination. The proposed work is simulated on a custom simulator. The route establishment and route maintenance delay are observed alongside by varying primary users activities. The simulation results prove the efficiency of the proposed approach as it takes less time as compared to Dijkstra algorithm with random channel selection.","PeriodicalId":343060,"journal":{"name":"ICCS 2019: Proceedings","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICCS 2019: Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3511005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In recent times, wireless networks have seen unprecedented growth. This leads to shortage of scarce resources like radio spectrum. With the conventional approach, it is very tough to manage this frightening number of devices. Therefore, Cognitive Radio Ad Hoc Networks (CRAHNs) envisioned. In CRAHNs, the unlicensed users can communicate in licensed bands opportunistically when it is not in use by licensed users. A special routing protocol is required to implement this objective, as the conventional protocols proposed for mobile ad hoc network will not be suitable for CRAHNs. There are many additional routing challenges involved. For instance, the routing protocols must be dynamic to provide protection to primary users & it must be energy efficient since all the devices involved in conventional ad hoc networks are battery operated. This paper proposes an Energy Efficient Multimeric Multichannel routing protocol for CRAHNs. It is an on demand routing protocol which takes residual energy, the probability of primary user appearance on a channel and route cost as metrics to evaluate the best route between a source and destination. The proposed work is simulated on a custom simulator. The route establishment and route maintenance delay are observed alongside by varying primary users activities. The simulation results prove the efficiency of the proposed approach as it takes less time as compared to Dijkstra algorithm with random channel selection.
认知无线电自组织网络的节能多模多信道路由协议
近年来,无线网络得到了前所未有的发展。这导致了无线电频谱等稀缺资源的短缺。使用传统方法,很难管理如此多的设备。因此,认知无线电自组织网络(CRAHNs)设想。在crahn中,当许可用户不使用许可频段时,未许可用户可以在许可频段中进行机会性通信。为了实现这一目标,需要一种特殊的路由协议,因为针对移动自组织网络提出的传统协议将不适合crahn。还涉及到许多额外的路由挑战。例如,路由协议必须是动态的,以便为主用户提供保护。它必须节能,因为传统AD hoc网络中涉及的所有设备都是电池供电的。提出了一种适用于crahn的节能多通道路由协议。它是一种按需路由协议,以剩余能量、信道上主用户出现的概率和路由开销作为衡量源和目的之间最佳路由的指标。所提出的工作在一个定制的模拟器上进行了模拟。通过不同的主用户活动来观察路由建立和路由维护延迟。与随机信道选择的Dijkstra算法相比,仿真结果证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信