Joint Optimization of Spectrum Handoff Scheduling and Routing in Multi-hop Multi-radio Cognitive Networks

W. Feng, Jiannong Cao, Chisheng Zhang, Chuda Liu
{"title":"Joint Optimization of Spectrum Handoff Scheduling and Routing in Multi-hop Multi-radio Cognitive Networks","authors":"W. Feng, Jiannong Cao, Chisheng Zhang, Chuda Liu","doi":"10.1109/ICDCS.2009.64","DOIUrl":null,"url":null,"abstract":"Spectrum handoff causes performance degradation of the cognitive network when the primary user reclaims its right to access the licensed spectrum. In a multi-hop cognitive network, this problem becomes even worse since multiple links are involved. Spectrum handoff of multiple links seriously affects the network connectivity and routing. In this paper, we describe a cross-layer optimization approach to solve the spectrum handoff problem with joint consideration of spectrum handoff scheduling and routing. We propose a protocol, called Joint Spectrum Handoff Scheduling and Routing Protocol (JSHRP). This paper makes the following major contributions. First, the concept \"spectrum handoff of single link\" is extended to \"spectrum handoff of multiple links\", termed as \"multi-link spectrum handoff\". Second, we define the problem of coordinating the spectrum handoff of multiple links to minimize the total spectrum handoff latency under the constraint of the network connectivity. This problem is proven to be NP-hard, and we propose both centralized and distributed greedy algorithms to minimize the total latency of spectrum handoff for multiple links in a multi-hop cognitive network. Moreover, we jointly design the rerouting mechanism with spectrum handoff scheduling algorithm to improve the network throughput. Different from previous works in which rerouting is performed after spectrum handoff, our rerouting mechanism is executed before the spectrum handoff really happens. Simulation results show that JSHRP improves the network performance by 50% and the higher degree of interference the cognitive network experiences, the more improvement our solution will bring to the network.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 29th IEEE International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2009.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 44

Abstract

Spectrum handoff causes performance degradation of the cognitive network when the primary user reclaims its right to access the licensed spectrum. In a multi-hop cognitive network, this problem becomes even worse since multiple links are involved. Spectrum handoff of multiple links seriously affects the network connectivity and routing. In this paper, we describe a cross-layer optimization approach to solve the spectrum handoff problem with joint consideration of spectrum handoff scheduling and routing. We propose a protocol, called Joint Spectrum Handoff Scheduling and Routing Protocol (JSHRP). This paper makes the following major contributions. First, the concept "spectrum handoff of single link" is extended to "spectrum handoff of multiple links", termed as "multi-link spectrum handoff". Second, we define the problem of coordinating the spectrum handoff of multiple links to minimize the total spectrum handoff latency under the constraint of the network connectivity. This problem is proven to be NP-hard, and we propose both centralized and distributed greedy algorithms to minimize the total latency of spectrum handoff for multiple links in a multi-hop cognitive network. Moreover, we jointly design the rerouting mechanism with spectrum handoff scheduling algorithm to improve the network throughput. Different from previous works in which rerouting is performed after spectrum handoff, our rerouting mechanism is executed before the spectrum handoff really happens. Simulation results show that JSHRP improves the network performance by 50% and the higher degree of interference the cognitive network experiences, the more improvement our solution will bring to the network.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多跳多无线电认知网络中频谱切换调度和路由的联合优化
频谱切换会导致认知网络的性能下降,主要是由于主用户对授权频谱的回收。在多跳认知网络中,由于涉及多个链路,这个问题变得更加严重。多链路频谱切换严重影响网络连通性和路由。本文提出了一种结合频谱切换调度和路由的跨层优化方法来解决频谱切换问题。我们提出了一种联合频谱切换调度和路由协议(JSHRP)。本文的主要贡献如下:首先,将“单链路频谱切换”的概念扩展为“多链路频谱切换”,称为“多链路频谱切换”。其次,我们定义了在网络连通性约束下,多链路频谱切换协调问题,以最小化总频谱切换延迟。该问题被证明是np困难的,我们提出了集中式和分布式贪婪算法来最小化多跳认知网络中多链路频谱切换的总延迟。此外,我们还联合设计了重路由机制和频谱切换调度算法,以提高网络吞吐量。与以往在频谱切换后进行重路由不同的是,我们的重路由机制是在频谱切换真正发生之前执行的。仿真结果表明,JSHRP将网络性能提高了50%,认知网络受到的干扰程度越高,我们的解决方案对网络的改善越大。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Sampling Based (epsilon, delta)-Approximate Aggregation Algorithm in Sensor Networks TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks PADD: Power Aware Domain Distribution Rethinking Multicast for Massive-Scale Platforms ISP Friend or Foe? Making P2P Live Streaming ISP-Aware
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1