Robust MANET routing using adaptive path redundancy and coding

Providing efficient networking services in MANETs is very challenging in presence of mobility, unpredictable radio channel and interference: a significant number of packets can be corrupted and/or lost. To increase reliability, various measures have been proposed. A popular approach is to use multiple paths and transmit identical copies of the packet on each path (i.e., path redundancy). A more efficient way is to use random Network Coding on top of the multiple paths and send differently coded packets on each path. Network Coding can improve delivery efficiency. But, it also increases delays and network overhead. If channel disruption is intermittent, it behooves us to turn “on and off” path redundancy and Network Coding depending on measured packet loss. In this paper we compare via simulation the performance of multipath routing with and without Network Coding (and with/without dynamic adaptation) for various motion and packet loss scenarios in terms of reliability, efficiency, robustness, and scalability.

[1]  Muriel Médard,et al.  Codecast: a network-coding-based ad hoc multicast protocol , 2006, IEEE Wireless Communications.

[2]  M. Gerla,et al.  Network coding vs. erasure coding: Reliable multicast in ad hoc networks , 2008, MILCOM 2008 - 2008 IEEE Military Communications Conference.

[3]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.

[4]  K. Jain,et al.  Practical Network Coding , 2003 .

[5]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[6]  Sung-Ju Lee,et al.  AODV-BR: backup routing in ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[7]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[8]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[9]  Satish K. Tripathi,et al.  A framework for reliable routing in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Sung-Ju Lee,et al.  Split multipath routing with maximally disjoint paths in ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[11]  Giovanni Pau,et al.  Code torrent: content distribution using network coding in VANET , 2006, MobiShare '06.

[12]  Jiwei Chen,et al.  Multipath TCP in Lossy Wireless Environment , 2004 .

[13]  Jim Kurose,et al.  Robust Routing in Dynamic MANETs , 2008 .

[14]  Mario Gerla,et al.  TCP performance over multipath routing in mobile ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[15]  Winston Khoon Guan Seah,et al.  Cooperative packet caching and shortest multipath routing in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.