Computer Science ›› 2019, Vol. 46 ›› Issue (11): 58-64.doi: 10.11896/jsjkx.181001865

• Network & Communication • Previous Articles     Next Articles

Time Slot Optimization for Channel Hopping in CRN

JI Yi1,2, JIA Jun-cheng1,2,3, SHENG Kai4   

  1. (School of Computer Science and Technology,Soochow University,Suzhou,Jiangsu 215006,China)1
    (Provincial Key Laboratory for Computer Information Processing Technology,Soochow University,Suzhou,Jiangsu 215006,China)2
    (Collaborative Innovation Center of Novel Software Technology and Industrialization,Nanjing 210000,China)3
    (Energy Research Laboratory,Soochow University,Suzhou,Jiangsu 215006,China)4
  • Received:2018-10-08 Online:2019-11-15 Published:2019-11-14

Abstract: With the rapid development of wireless communication technology in recent years,radio spectrum resources are becoming scarcer.Cognitive radio networks (CRNs) attracts widespread attention because they can improve the utilization of existing spectrum resources.For the issue that the traditional random channel hopping rendezvous strategy of cognitive radio network do not considere the channel collision and switching delay,this paper proposed an optimal random channel hopping rendezvous strategy based on time slot ALOHA protocol with calculation of switching delay.Firstly,the proposed strategy differentiates the whole process in time slot,defines the model about time slot of channel staying and switching delay,integrates the channel hopping process with ALOHA protocol,and gives the calculation formula of time-to-rendezvous (TTR).Then,by analyzing the process of rendezvous strategy step by step,it derives the formula of time slot expectation for available channel number and switching delay based on joint probability.Finally,it calculates the lowest point according to the derivative and the trend graph of the function.And then according to the idea of integer programming,this paper proposed an algorithm for calculating the optimal number of slots to optimize the overall rendezvous strategy.The experiment was carried out under the control of the number of available slots and switching delay.The experimental results show that the effect of switching delay on the rendezvous efficiency is greater than that of channel number.Also,the proposed scheme can achieve rendezvous in an optimal way with full account of the switching delay.It also can reduce the total rendezvous time effectively than the traditional strategy.When the number of time slots of switching delay is not more than 5,the ATTR is generally reduced by about 15%,which can promote the rendezvous and accelerate the message exchange between nodes and futher improve the spectrum utilization.

Key words: Channel hopping, Cognitive radio network, Rendezvous strategy, Time slot optimization

CLC Number: 

  • TP393.1
[1]LIU Q,ZHAO G S,WANG X D,et al.A Survey of ChannelRendezvous in Cognitive Radio Networks[J].Chinese Journal of Software,2014,25(3):606-630.(in Chinese)
刘权,赵光胜,王晓东,等.认知无线电网络信道交汇研究综述[J].软件学报,2014,25(3):606-630.
[2]ZHANG X,LIU C,HU S,et al.Centralized spectrum allocation strategy based on Queuing Theory in cognitive radio networks[J].Chinese Application Research of Computers,2015,32(1):187-190.(in Chinese)
张旭,刘聪,胡胜,等.认知无线电网络中基于排队论的集中式频谱分配策略[J].计算机应用研究,2015,32(1):187-190.
[3]THEIS N C,THOMAS R W,DASILVA L A.Rendezvous for cognitive radios[J].IEEE TransActions on Mobile Computing,2011,10(2):216-227.
[4]JIA J C,QIAN Z.Rendezvous protocols based on message passing in cognitive radio networks[J].IEEE Transactions on Wireless Communications,2013,12(11):5594-5606.
[5]ROBERTSON A,LAN T,MOLNAR J,et al.Experimentalcomparison of blind rendezvous algorithms for tactical networks[C]∥IEEE International Symposium on A World of Wireless,Mobile and Multimedia Networks.IEEE Computer Society,2012:1-6.
[6]CHANG G Y,TENG W H,CHEN H Y,et al.Novel Channel-Hopping Schemes for Cognitive Radio Networks[J].IEEE Transactions on Mobile Computing,2014,13(2):407-421.
[7]LIU H,LIN Z,CHU X,et al.Ring-Walk Based ChannelHopping Algorithms with Guaranteed Rendezvous for Cognitive Radio Networks[C]∥Ieee/acm Int’l Conference on Green Computing and Communications & Int’l Conference on Cyber,Physical and Social Computing.IEEE Computer Society,2010:755-760.
[8]SHIN J,YANG D,KIM C.A channel rendezvous scheme for cognitive radio networks[J].IEEE Communications Letters,2010,14(10):954-956.
[9]LIN Z,LIU H,CHU X,et al.Jump-stay based channel-hopping algorithm with guaranteed rendezvous for cognitive radio networks[C]∥INFOCOM,2011 Proceedings IEEE.IEEE,2011:2444-2452.
[10]ZHANG Y,LI Q,YU G,et al.ETCH:Efficient ChannelHopping for communication rendezvous in dynamic spectrum access networks[C]∥IEEE INFOCOM.IEEE,2011:2471-2479.
[11]YU L,LIU H,LEUNG Y W,et al.Adjustable rendezvous in multi-radio cognitive radio networks[C]∥Global Communications Conference (GLOBECOM),2015 IEEE.IEEE,2015:1-7.
[12]GÖZÜPEK D,BUHARI S,ALAGÖZ F.A Spectrum Switching Delay-Aware Scheduling Algorithm for Centralized Cognitive Radio Networks[J].IEEE Transactions on Mobile Computing,2013,12(7):1270-1280.
[13]ERYIGIT S,BAYHAN S,TUGCU T.Channel switching costaware and energy-efficient cooperative sensing scheduling for cognitive radio networks[C]∥IEEE International Conference on Communications.IEEE,2013:2633-2638.
[14]SCHOUTE F C.Dynamic Frame Length ALOHA[J].Mobile Communications,1983,31(4):565-568.
[15]SHEU J P,LIN J J.A Multi-Radio Rendezvous AlgorithmBased on Chinese Remainder Theorem in Heterogeneous Cognitive Radio Networks[J].IEEE Transactions on Mobile Computing,2018,PP(99):1-1.
[16]XU D,GAO Y,YANG C,et al.Performance Analysis of Opportunistic Cooperation Schemes in Cognitive Radio Networks[J].IEEE Transactions on Vehicular Technology,2018,67(4):3658-3662.
[17]XIN C S,ULLAH S,SONG M,et al.Throughput oriented lightweight near-optimal rendezvous algorithm for cognitive radio networks[J].Computer Networks,2018,137:49-60.
[18]LI J,ZHAO H,WEI J,et al.Sender-Jump Receiver-Wait:a simple blind rendezvous algorithm for distributed cognitive radio networks[J].IEEE Transactions on Mobile Computing,2018,17(1):183-196.
[19]AKYILDIZ I F,LEE W Y,VURAN M C,et al.A survey on spectrum management in cognitive radio networks[J].IEEE Communications Magazine,2008,46(4):40-48.
[1] XU Yong, ZHANG Xiao-rong, ZHU Yu-jun. High Speed Joining Scheme Based on Channel Evaluation for IEEE 802.15.4e TSCH [J]. Computer Science, 2019, 46(6A): 332-335.
[2] HAN Jie, SONG Xiao-qin, DONG Li and JIN hui. Suboptimal Dynamic Resource Allocation Algorithm in OFDM Based Cognitive Radio Network [J]. Computer Science, 2017, 44(5): 48-52.
[3] TANG Lin, LIU Jun-xia, ZHAO Li and QI Xing-bin. Time Synchronization Scheme for Distributed Cognitive Radio Networks Based on M&S Model [J]. Computer Science, 2017, 44(12): 64-67.
[4] WANG Jun-ming, LIU Jia-qi, CHEN Zhi-gang and GUO Lin. Spectrum Allocation Algorithm Based on Hybrid Multigroup Evolution and Particle Swarm Optimization [J]. Computer Science, 2016, 43(4): 28-32.
[5] GAO Rui-feng, NI Dan-yan, BAO Zhi-hua and HU Ying-dong. Time-bandwidth Allocation Scheme for Physical Layer Security in Cooperative Cognitive Radio Networks [J]. Computer Science, 2016, 43(4): 163-166.
[6] YANG Jin-song, ZENG Bi-qing and HU Pian-pian. Spectrum Allocation and Power Control Based on Harmony Search Algorithm in Cognitive Radio Network [J]. Computer Science, 2015, 42(Z11): 258-262.
[7] WANG Zhen-chao, MA Ming-lei and LI Yan. Optimal Power Allocation in Broadband Cognitive Radio Networks Based on SC-FDMA [J]. Computer Science, 2015, 42(4): 56-59.
[8] FENG Guang-sheng,ZHENG Chen,WANG Hui-qiang,ZHAO Qian and LV Hong-wu. Survey towards Cognitive Ability Guarantee in Cognitive Radio Networks [J]. Computer Science, 2014, 41(5): 8-13.
[9] PANG De-ming,HU Gang,XU Ming. Detecting Primary Emulation Attacks Based on Energy Fingerprint Matching in Cognitive Radio Networks [J]. Computer Science, 2011, 38(3): 28-33.
[10] XUE Nan,ZHOU Xian-wei,LIN Lin,ZHOU Jian. Security Routing Algorithm Based on Shortest Delay for Cognitive Radio Networks [J]. Computer Science, 2010, 37(1): 68-71.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!