Integrating machine learning in ad hoc routing: A wireless adaptive routing protocol

The nodes in a wireless ad hoc network act as routers in a self-configuring network without infrastructure. An application running on the nodes in the ad hoc network may require that intermediate nodes act as routers, receiving and forwarding data packets to other nodes to overcome the limitations of noise, router congestion and limited transmission power. In existing routing protocols, the ‘self-configuring’ aspects of network construction have generally been limited to the construction of routes that minimize the number of intermediate nodes on a route while ignoring the effects that the resulting traffic has on the overall communication capacity of the network. This paper presents a context-aware routing metric that factors the effects of environmental noise and router congestion into a single time-based metric, and further presents a new cross-layer routing protocol, called Warp-5 (Wireless Adaptive Routing Protocol, Version 5), that uses the new metric to make better routing decisions in heterogeneous network systems. Simulation results for Warp-5 are presented and compared to the existing, well-known AODV (Ad hoc On-Demand Distance Vector) routing protocol and the reinforcement-learning based routing protocol, Q-routing. The results show Warp-5 to be superior to shortest path routing protocols and Q-routing for preventing router congestion and packet loss due to noise. Copyright © 2011 John Wiley & Sons, Ltd. This paper presents a cross-layer predictor for route selection in wireless ad hoc networks that combines the effects of noise and router congestion into a single time-based routing metric based on statistical estimation from recent experience. A new cross-layer, adaptive routing protocol, called Warp-5, uses this new routing metric to make better routing decisions in noisy or congested wireless ad hoc networks.

[1]  Jim Dowling,et al.  Using feedback in collaborative reinforcement learning to adaptively optimize MANET routing , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[2]  Alec Wolman,et al.  A multi-radio unification protocol for IEEE 802.11 wireless networks , 2004, First International Conference on Broadband Networks.

[3]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[4]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[5]  Shailesh Kumar and Risto Miikkulainen Dual Reinforcement Q-Routing: An On-Line Adaptive Routing Algorithm , 1997 .

[6]  John C. Bicket,et al.  Bit-rate selection in wireless networks , 2005 .

[7]  Luca Maria Gambardella,et al.  AntHocNet: An Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks , 2004, PPSN.

[8]  Emin Gün Sirer,et al.  SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks , 2003, MobiHoc '03.

[9]  Leo Monteban,et al.  WaveLAN®-II: A high-performance wireless LAN for the unlicensed band , 1997, Bell Labs Technical Journal.

[10]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[11]  Andrew W. Moore,et al.  Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..

[12]  Chien-Chung Shen,et al.  Ad Hoc Multicast Routing Algorithm with Swarm Intelligence , 2005, Mob. Networks Appl..

[13]  E. Gelenbe,et al.  Genetic Algorithms for Autonomic Route Discovery , 2006, IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS'06).

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

[15]  Zygmunt J. Haas,et al.  A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[16]  Michael L. Littman,et al.  A Distributed Reinforcement Learning Scheme for Network Routing , 1993 .

[17]  Michele Zorzi,et al.  Statistically assisted routing algorithms (SARA) for hop count based forwarding in wireless sensor networks , 2008, Wirel. Networks.

[18]  Chris Watkins,et al.  Learning from delayed rewards , 1989 .

[19]  Srinivasan Keshav A control-theoretic approach to flow control , 1991, SIGCOMM 1991.

[20]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.