A NEW AD HOC ROUTING ALGORITHM BASED ON MINIMIZING THE CHANNEL HANDOFF
A NEW AD HOC ROUTING ALGORITHM BASED ON MINIMIZING THE CHANNEL HANDOFF作者机构:Jiangsu Key Laboratory of Wireless Communications Nanjing University of Posts and Telecommunications Nanjing 210003 China) Key Lab on Wideband Wireless Communications and Sensor Network Technology of Ministry of Education Nanjing University of Posts and Telecommunications Nanjing 210003 China National Mobile Communications Research Laboratory Southeast University Nanjing 210003 China
出 版 物:《Journal of Electronics(China)》 (电子科学学刊(英文版))
年 卷 期:2010年第27卷第6期
页 面:749-755页
学科分类:080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0808[工学-电气工程] 0809[工学-电子科学与技术(可授工学、理学学位)] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统]
基 金:Supported by the National Natural Science Foundation of China (No. 60772062) 973 Program (2007CB310607) National Science & Technology Key Project (2009ZX 03003-002, 2011ZX03001-006-02, 2011ZX03005-004-03) 863 Program (2009AA01Z241)
主 题:Ad Hoc Multi-channel Channel handoff Network throughputs Routing
摘 要:How to improve the performance of the wireless Ad Hoc network by utilizing the spectrum resources efficiently has become a hot research topic in recent years. In this paper we propose a reactive routing algorithm that supports multiple channels to improve the performance of the Ad Hoc network based on the minimizing of the channel handoff. Our approach allocates the communication channel during the route discovery, and notifies the allocated channel information to the corresponding node in the route reply packets. Each node in the route tries its best to choose the same channel with the upstream node without interference. The simulation results show that our algorithm performs better than the K-hop distinct protocols in both average delays and network throughputs