We use cookies to improve your experience with our site.
何施茗, 张大方, 谢鲲, 乔宏, 张继. 多射频多信道无线网状网中信道感知的机会路由[J]. 计算机科学技术学报, 2014, 29(3): 487-501. DOI: 10.1007/s11390-014-1444-7
引用本文: 何施茗, 张大方, 谢鲲, 乔宏, 张继. 多射频多信道无线网状网中信道感知的机会路由[J]. 计算机科学技术学报, 2014, 29(3): 487-501. DOI: 10.1007/s11390-014-1444-7
Shi-Ming He, Da-Fang Zhang, Kun Xie, Hong Qiao, Ji Zhang. Channel Aware Opportunistic Routing in Multi-radio Multi-channel Wireless Mesh Networks[J]. Journal of Computer Science and Technology, 2014, 29(3): 487-501. DOI: 10.1007/s11390-014-1444-7
Citation: Shi-Ming He, Da-Fang Zhang, Kun Xie, Hong Qiao, Ji Zhang. Channel Aware Opportunistic Routing in Multi-radio Multi-channel Wireless Mesh Networks[J]. Journal of Computer Science and Technology, 2014, 29(3): 487-501. DOI: 10.1007/s11390-014-1444-7

多射频多信道无线网状网中信道感知的机会路由

Channel Aware Opportunistic Routing in Multi-radio Multi-channel Wireless Mesh Networks

  • 摘要: 机会路由利用无线媒介广播性质和多用户分集特性,每一跳使用多个候选节点转发数据包,比传统路由更能对抗不可靠的无线链路,能明显提升无线网状网端到端的吞吐量。但是目前对机会路由的研究多在单射频无线网络中。在多射频多信道场景下的机会路由研究还处于起始阶段。为了验证多射频多信道网络场景下机会路由的优势,我们设计了多信道期望任意传输时间(Multi-channel Expected Anypath Transmission Time,MEATT)机会路由指标,兼顾多信道特性和多用户分集特性,并在指标基础上提出分布式信道感知机会路由算法(Channel Awared Opportunistic Routing,CAOR)。实验结果表明,与单信道机会路由指标期望任意传输次数(Expected Anypath Transmission Time, EATT)和多信道路由指标(Metric Interference and Channel switching cost, MIC)的机会路由相比,MEATT/CAOR更能提升网络吞吐量,降低延时。吞吐量平均分别提升1.14和1.53倍,延时分别降低17%和40%。

     

    Abstract: Opportunistic routing (OR) involves multiple candidate forwarders to relay packets by taking advantage of the broadcast nature and multi-user diversity of the wireless medium. Compared with traditional routing (TR), OR is more suitable for the unreliable wireless link, and can evidently improve the end to end throughput. At present, there are many achievements concerning OR in the single radio wireless network. However, the study of OR in multi-radio wireless network stays the beginning stage. To demonstrate the benefit of OR in multi-radio multi-channel network, we propose a new route metric——multi-channel expected anypath transmission time (MEATT), which exploits the channel diversity and resource of multiple candidate forwarders for OR. Based on the new metric, a distributed algorithm named Channel Aware Opportunistic Routing (CAOR) is proposed. The simulation results demonstrate that MEATT improves 1.14 and 1.53 times of the average throughput than existing expected anypath transmission time (EATT)and metric of interference and channel switching cost (MIC) respectively. The average delay of MEATT is 17% and 40% lower than those of EATT, MIC, respectively.

     

/

返回文章
返回