›› 2014, Vol. 29 ›› Issue (3): 487-501.doi: 10.1007/s11390-014-1444-7

Special Issue: Computer Networks and Distributed Computing

• Computer Networks and Distributed Computing • Previous Articles     Next Articles

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

Shi-Ming He (何施茗), Student Member, CCF, Da-Fang Zhang* (张大方), Member, CCF Kun Xie (谢鲲), Member, CCF, Hong Qiao (乔宏), and Ji Zhang (张继)   

  1. College of Computer Science and Electronics Engineering, Hunan University, Changsha 410082, China
  • Received:2013-05-20 Revised:2013-12-20 Online:2014-05-05 Published:2014-05-05
  • About author:Shi-Ming He received her B.S. degree in information security, Ph.D. degree in computer application from Hunan University, Changsha, in 2006 and 2013 respectively. Her current research interests include wireless mesh network, opportunistic routing, and channel assignment.
  • Supported by:

    This work was supported by the National Basic Research 973 Program of China under Grant No. 2012CB315805, the National Natural Science Foundation of China under Grant Nos. 61173167, 61003305, and 61173168, and the National Science and Technology Major Project of China under Grant No. 2011ZX03002-005-02.

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.

[1] Biswas S, Morris R. Exor: Opportunistic multi-hop routing for wireless networks. In Proc. the ACM SIGCOMM 2005, August 2005, pp.133-144.

[2] Rozner E, Seshadri J, Mehta Y et al. SOAR: Simple opportunistic routing protocol for wireless mesh networks. IEEE Transactions on Mobile Computing, 2009, 8(12): 1622-1635

[3] Chachulski S, Jennings M, Katti S et al. Trading structure for randomness in wireless opportunistic routing. In Proc. the ACM SIGCOMM 2007, August 2007, pp.169-180.

[4] Katti S, Katabi D, Balakrishnan H et al. Symbol-level network coding for wireless mesh networks. In Proc. the ACM SIGCOMM 2008, August 2008, pp.401-412.

[5] Li T, Leith D, Qiu L. Opportunistic routing for interactive traffc in wireless networks. In Proc. ICDCS 2010, June 2010, pp.458-467.

[6] Zhang Y, Luo J, Hu H. Wireless Mesh Networking: Architectures, Protocols and Standards. Boca Raton, Florida, USA: Auerbach Publications, 2006.

[7] Zeng K, Yang Z, Lou W. Opportunistic routing in multi-radio multi-channel multi-hop wireless networks. In Proc. the 29th INFOCOM 2010, March 2010, pp.476-480.

[8] Wu F, Vaidya N. Workload-aware opportunistic routing in multi-channel, multi-radio wireless mesh networks. In Proc. the 9th SECON, June 2012, pp.344-352.

[9] He S, Zhang D, Xie K et al. A simple channel assignment for opportunistic routing in multi-radio multi-channel wireless mesh networks. In Proc. the 7th MSN, Dec. 2011, pp.201208.

[10] Couto D, Aguayo D, Bicket J et al. A high-throughput path metric for multi-hop wireless routing. In Proc. the 9th MobiCom, September 2003, pp.134-146.

[11] Zhong Z, Nelakuditi S. On the effcacy of opportunistic routing. In Proc. the 4th SECON, June 2007, pp.441-450.

[12] Laufer R, Dubois-Ferri鑢e H, Kleinrock L. Multirate anypath routing in wireless mesh networks. In Proc. the 28th INFOCOM, April 2009, pp.37-45.

[13] Draves R, Padhye J, Zill B. Routing in multi-radio, multi-hop wireless mesh networks. In Proc. the 10th Mobicom, September 2004, pp.114-128.

[14] Das S, Wu Y, Chandra R, Hu Y C. Context-based routing: Technique, applications and experience. In Proc. the 5th USENIX NSDI, April 2008, pp.379-392.

[15] Yang Y, Wang J, Kravets R. Designing routing metrics for mesh networks. In Proc. the IEEE WiMesh, Sept. 2005.

[16] He S, Zhang D, Xie K, Qiao H, Zhang J. Distributed lowcomplexity channel assignment for opportunistic routing. China Communications, 2012, 9(11): 9-22.

[17] He S, Zhang D, Xie K et al. A candidate forwarder set based channel assignment for opportunistic routing in multi-radio wireless mesh networks. In Proc. the 6th CWSN, Oct. 2012, pp.103-116.

[18] Zubow A, Kurth M, Redlich J. An opportunistic cross-layer protocol for multi-channel wireless networks. In Proc. the 18th PIMRC, Sept. 2007.

[19] Zhang X, Li B. Dice: A game theoretic framework for wireless multipath network coding. In Proc. the 9th ACM MobiHoc, May 2008, pp.293-302.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved