An improved ant-based routing protocol in Wireless Sensor Networks

Routing in wireless sensor networks (WSNs) is very challenging due to their inherent characteristics of large scale, no global identification, dynamic topology, and very limited power, memory, and computational capacities for each sensor. Recent research on WSNs routing protocol has proved that data-centric technologies are needed for performing in-network aggregation of data to yield energy-efficient dissemination. As an effective distributed approach, Ant Colony Optimization (ACO) algorithms have been introduced to the design of data-centric routing protocol and have got many achievements, but still have some shortcomings blocking their further application in the large scale WSNs. To overcome the flaws of conventional ant-based data-centric routing algorithms, we proposed an improved protocol by adding a new type of ant, search ant, to supply prior information to the following ants. Besides, we introduced the strategy of simulating global pheromone update to accelerate the convergence of our algorithm and defined a "retry" rule to avoid dead-lock of the protocol. All of these modifications made the routing protocol scalable, practicable and energy-conservative. Simulation results showed the great advantages of the new protocol.

[1]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[2]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

[3]  Ian F. Akyildiz,et al.  Wireless sensor networks , 2007 .

[4]  Gurdip Singh,et al.  Ant Colony Algorithms for Steiner Trees: An Application to Routing in Sensor Networks , 2005 .

[5]  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).

[6]  Marco Dorigo,et al.  Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks , 1998, PPSN.

[7]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[8]  Wendi B. Heinzelman,et al.  Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.

[9]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[11]  Antonella Carbonaro,et al.  Ant Colony Optimization: An Overview , 2002 .

[12]  Deborah Estrin,et al.  Modelling Data-Centric Routing in Wireless Sensor Networks , 2002 .

[13]  Thomas Stützle,et al.  A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..

[14]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[15]  Thomas Stützle,et al.  A SHORT CONVERGENCE PROOF FOR A CLASS OF ACO ALGORITHMS , 2002 .

[16]  Devika Subramanian,et al.  Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks , 1997, IJCAI.