期刊文献+

移动自组织认知网络中的路由选择与信道分配方法 被引量:8

Routing Selection and Channel Assignment Method for Mobile Ad Hoc Cognitive Network
下载PDF
导出
摘要 针对移动自组织认知网络中路由不稳定的问题,提出了一种路由选择与信道分配方法。首先,设计数据传输花费度量,兼顾路由稳健性和信道干扰;其次,依据认知节点的位置和速度信息计算链路剩余时间,预测路由稳健性;再次,针对不同的信道干扰模式实施信道分配,规避主节点干扰;最后,通过路由发现和路由确认步骤,选择最佳链路。仿真实验表明,与经典的AODV方法相比,所提方法丢包率低、传输时延小。 In order to solve the routing instability problem in mobile ad hoc cognitive network,a method of routing se- lection and channel assignment was proposed. First, it developes a data transfer costs measure, taking into account both routing stability and channel interference. Then, the remanding time of a link is calculated according to the position and velocity information of cognitive nodes, and the stability of routing is predictived. And then interference of primary nodes is avoided, through assigning channels according to different channel interference patterns. Finally, the best link is selected through two steps including route discovery and route confirmation. Simulation results show that, by comparing with the classical AODV method, the new method has lower packet loss rate and smaller transmission delay.
作者 刘萍 袁培燕 LIU Ping YUAN Pei-yan(College of Computer and Information Engineering, Henan Normal University, Xinxiang 453007, China School of Information Engineering, Wuhan University of Technology, Wuhan 430070, China)
出处 《计算机科学》 CSCD 北大核心 2017年第3期140-144,共5页 Computer Science
基金 国家自然科学基金(U1404602) 河南省高等学校重点科研项目(15A520079) 河南省教育厅2015年度教师教育课程改革研究项目(2015-JSJYYB-016) 河南师范大学2014年教育科学研究基金(5102079279301)资助
关键词 移动自组织认知网络 路由选择 信道分配 认知节点 主节点 最佳链路 Mobile ad hoe cognitive networks, Routing selection, Channel assignment, Cognitive nodes, Primary nodes, Best link
  • 相关文献

参考文献2

二级参考文献21

  • 1Akyildiz I, Wang X. A survey on wireless mesh networks [ J ]. IEEE Communications Magazine, 2005,43 ( 9 ) : 23 -30.
  • 2Bruno R, Conti M, Gregori E. Mesh networks : commodity multi-hop ad hoc networks [ J ]. IEEE Communications Magazine ,2005,43 (3) : 123 - 131.
  • 3Audhya G K, Sinha K, Ghosh S C, et al. A survey on the channel assignment problem in wireless networks [ J ]. Wireless Communications and Mobile Computing, 2011, 11(5) :583 -609.
  • 4Kodialam M , Nandagopai T. The effect of interference on the capacity of multi-hop wireless networks [ M ]. Chica- go, IEEE Symposium on Information Theory, 2004:470 - 479.
  • 5Singh M, Saxena A. Secure computation for data privacy [ C ]//Proc SECCOM 07. Nice: [ s. n. ],2007:58 - 62.
  • 6Blough D, Resta G, Santi P. Approximation algorithms for wireless link scheduling with SINR-based interference [J ]. IEEE/ACM Transactions on Networking (TON), 2010,18(6) :1701 -1712.
  • 7Mondere D, Shapley L. Potential Games and Economic [ J ]. Behavior, 1996,14 : 124 - 143.
  • 8Yu Q, Chen J, Fan Y, et al. Multi-channel assignment in wireless sensor networks: A game theoretic approach [ C ]//Proc of INFOCOM 10. San Diego : IEEE ,2010 : 1 - 9.
  • 9LuoJ H, YeDX, XueL, FanMY. Asurveyofmulticast routing protocols for mobile Ad-Hoc networks. IEEE Com- munications Surveys g~ Tutorials, 2009, 11(1): 78-91.
  • 10Torkestani J Akbari, Meybodi M Reza. Mobility-based mul- ticast routing algorithm for wireless mobile Ad-hoc net- works: A learning automata approach. Computer Communi- cations, 2010, 33(6): 721-735.

共引文献43

同被引文献60

引证文献8

二级引证文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部