Adaptive ant-based routing in wireless sensor networks using Energy*Delay metrics

To find the optimal routing is always an important topic in wireless sensor networks (WSNs). Considering a WSN where the nodes have limited energy, we propose a novel Energy*Delay model based on ant algorithms (“E&D ANTS” for short) to minimize the time delay in transferring a fixed number of data packets in an energy-constrained manner in one round. Our goal is not only to maximize the lifetime of the network but also to provide real-time data transmission services. However, because of the tradeoff of energy and delay in wireless network systems, the reinforcement learning (RL) algorithm is introduced to train the model. In this survey, the paradigm of E&D ANTS is explicated and compared to other ant-based routing algorithms like AntNet and AntChain about the issues of routing information, routing overhead and adaptation. Simulation results show that our method performs about seven times better than AntNet and also outperforms AntChain by more than 150% in terms of energy cost and delay per round.

[1]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Gianni A. Di Caro,et al.  AntNet: A Mobile Agents Approach to Adaptive Routing , 1999 .

[3]  Yücel Altunbasak,et al.  Adaptive sensing for environment monitoring using wireless sensor networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[4]  Benjamín Barán,et al.  A new approach for AntNet routing , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[5]  Marco Dorigo,et al.  Ant algorithms and stigmergy , 2000, Future Gener. Comput. Syst..

[6]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[8]  Nada Golmie,et al.  Performance analysis of low rate wireless technologies for medical applications , 2005, Comput. Commun..

[9]  Wu Chun-ming,et al.  The Research on Initialization of Ants System and Configuration of Parameters for Different TSP Problems in Ant Algorithm , 2006 .

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

[11]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[12]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[13]  Peter Xiaoping Liu,et al.  Data gathering communication in wireless sensor networks using ant colony optimization , 2004, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[14]  J. Nemeroff,et al.  Application of sensor network communications , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).