A Coding-Based Routing for Scalable MANET

In this paper, we present a novel approach for MANET routing that holds a potential to drastically increase scalability in terms of number of nodes (network size) and number of hops (network diameter). The new approach is founded on paradigm-shifting principles that are fundamentally scalable and secure. We first describe fundamental drawbacks of wire-based MANET routing protocols. Then, we lay out fundamental theories that overcome such drawbacks while inherently capturing the unique wireless characteristics and effectively supporting the evolving requirements of distributed network applications for military MANET user communities. Focusing on the fundamental aspects of the problem rather than "heuristics" provides us the maximum opportunity to extend the scalability of the new protocols over a wide range of scenarios and applications. Next, we describe high-level concepts of practical MANET routing protocols that build upon these fundamentals. We claim that these protocols are likely to be inherently scalable, robust and efficient because they leverage and exploit information-theoretic principles as well as the unique MANET characteristics rather than eliminate them in order to force the wired architecture. Preliminary simulation results show considerable performance gain over legacy MANET routing approach

[1]  Muriel Médard,et al.  Achieving minimum-cost multicast: a decentralized approach based on network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Yunnan Wu Network Coding for Multicasting , 2005 .

[3]  Yunnan Wu,et al.  Distributed utility maximization for network coding based multicasting: a shortest path approach , 2006, IEEE Journal on Selected Areas in Communications.

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

[5]  Bernd Freisleben,et al.  Proactive Distance-Vector Multipath Routing for Wireless Ad Hoc Networks , 2003 .

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

[7]  Tracey Ho,et al.  Toward a Random Operation of Networks , 2004 .

[8]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  Yunnan Wu,et al.  Minimum-energy multicast in mobile ad hoc networks using network coding , 2004, Information Theory Workshop.

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

[11]  Abbas El Gamal,et al.  Capacity theorems for relay channels , 1979 .

[12]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[13]  Shahrokh Valaee,et al.  Minimum Energy Reliable Multipath Ad Hoc Networks , 2004 .