• Article
  • | |
  • Metrics
  • |
  • Reference [22]
  • |
  • Related [20]
  • | | |
  • Comments
    Abstract:

    This paper proposes a network coding-aware multi-path routing (CAMP) protocol, which forwards packets over multiple paths dynamically based on path reliability and coding opportunity. CAMP employs a route discovery mechanism which returns to the source multiple paths along with ETX (expected transmission count) of all links on each path. With its unique forwarding mechanism, CAMP splits the traffic among multiple paths and actively creates, while not merely waiting for, the coding opportunity by switching its path to maximize the switching gain and thus improves the network throughput. The experimental results demonstrate that CAMP can achieve much higher throughput than peer schemes for delivering packets in wireless networks.

    Reference
    [1] de Couto DSJ, Aguayo D, Bicket J, Morris R. A high-throughput path metric for multi-hop wireless routing. In: Proc. of the 9th Annual Int’l Conf. on Mobile Computing and Networking (ACM MOBICOM 2003). New York: ACM Press, 2003. 134?146.
    [2] Draves R, Padhye J, Zill B. Routing in multi-radio, multi-hop wireless mesh networks. In: Proc. of the 10th Annual Int’l Conf. on Mobile Computing and Networking (ACM MOBICOM 2004). New York: ACM Press, 2004. 114?128.
    [3] De S, Qiao CM, Wu HY. Meshed multipath routing with selective forwarding: An efficient strategy in wireless sensor networks. Elsevier Computer Communications Journal, 2003,26(4):481?497.
    [4] Mosko M, Garcia-Luna-Aceves JJ. Multipath routing in wireless mesh networks. In: Proc. of the 1st IEEE Workshop on Wireless Mesh Networks (IEEE WiMesh 2005). IEEE Press, 2005.
    [5] Ganesan D, Govindan R, Shenker S, Estrin D. Highly-Resilient, energy-efficient multipath routing in wireless sensor networks. ACM SIGMOBILE Mobile Computing and Communications Review, 2001,5(4):11?25.
    [6] Marina MK, Das SR. On-Demand multipath distance vector routing in ad hoc networks. In: Proc. of the IEEE Int’l Conf. on Network Protocols (ICNP 2001). IEEE Press, 2001. 14?23.
    [7] Perkins CE, Royer EM. Ad hoc on-demand distance vector routing. In: Proc. of the 2nd IEEE Workshop on Mobile Computing Systems and Applications. IEEE Press, 1999.
    [8] Nasipuri A, Casta?eda R, Das SR. Performance of multipath routing for on-demand protocols in ad hoc networks. ACM/Kluwer Mobile Networks and Applications (MONET) Journal, 2001,6(4):339?349. [doi: 10.1023/A:1011426611520]
    [9] Johnson DB, Maltz DA, Broch J. DSR: The dynamic source routing protocol for multihop wireless ad hoc networks. In: Perkins CE, ed. Proc. of the Ad hoc Networking. Boston: Addison-Wesley, 2001. 139?172.
    [10] Lee SJ, Gerla M. Split multipath routing with maximally disjoint paths in ad hoc networks. In: Proc. of the IEEE Int’l Conf. on Communications (IEEE ICC 2001). IEEE Press, 2001. 3201?3205.
    [11] Cetinkaya C, Knightly EW. Opportunistic traffic scheduling over multiple network paths. In: Proc. of the 23rd IEEE Conf. on Computer Communications (INFOCOM 2004). IEEE Press, 2004.
    [12] Flury R, Wattenhofer R. Routing, anycast, and multicast for mesh and sensor networks. In: Proc. of the 26th IEEE Conf. on Computer Communications (INFOCOM 2007). IEEE Press, 2007. 946?954.
    [13] Lou WJ, Liu W, Zhang YC. Performance optimization using multipath routing in mobile ad hoc and wireless sensor networks. Combinatorial Optimization in Communication Networks, 2006,18:117?146. [doi: 10.1007/0-387-29026-5_5]
    [14] Katti S, Rahul H, Hu WJ, Katabi D, Médard M, Crowcroft J. Xors in the air: Practical wireless network coding. IEEE/ACM Trans. on Networking (TON), 2008,16(3):497?510. [doi: 10.1109/TNET.2008.923722]
    [15] Kamra A, Misra V, Feldman J, Rubenstein D. Growth codes: Maximizing sensor network data persistence. In: Proc. of the 2006 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications (ACM SIGCOMM 2006). New York: ACM Press, 2006. 255?266.
    [16] Sudipta S, Rayanchu S, Banerjee S. An analysis of wireless network coding for unicast sessions: The case for coding-aware routing. In: Proc. of the 26th IEEE Conf. on Computer Communications (INFOCOM 2007). IEEE Press, 2007. 1028?1036.
    [17] Tsirigos A, Hass ZJ. Analysis of multipath routing, part 1: The effect on the packet delivery ratio. IEEE Trans. on Wireless Communications, 2004,3(1):138?146. [doi: 10.1109/TWC.2003.821207]
    [18] Tsirigos A, Hass ZJ. Analysis of multipath routing, part 2: Mitigation of the effect of frequently changing network topologies. IEEE Trans. on Wireless Communications, 2004,3(2):500?511. [doi: 10.1109/TWC.2004.825355]
    [19] Ayano?lu E, I CL, Gitlin RD, Mazo JE. Diversity coding for transparent self-healing and fault-tolerant communication networks. IEEE Trans. Communications, 1993,41(11):1677?1686. [doi: 10.1109/26.241748]
    [20] Jain S, Demmer M, Patra R, Fall K. Using redundancy to cope with failures in a delay tolerant network. ACM SIGCOMM Computer and Communication Review, 2005,35(4):109?120.
    [21] Wang Y, Jain S, Martonosi M, Fall K. Erasure-Coding based routing for opportunistic networks. In: Proc. of the SIGCOMM Workshop on Delay Tolerant Networking and Related Networks. New York: ACM Press, 2005. 229?236.
    [22] NS2. http://www.isi.edu/nsnam/ns/
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

陈贵海,李宏兴,韩 松,钟子飞,陈明达.多跳无线网络中基于网络编码的多路径路由.软件学报,2010,21(8):1908-1919

Copy
Share
Article Metrics
  • Abstract:5238
  • PDF: 7240
  • HTML: 0
  • Cited by: 0
History
  • Received:April 08,2008
  • Revised:October 23,2009
You are the first2044125Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063