Simple Ant Routing Algorithm for WSNs Used in Power Line Monitoring

Abstract:

The special class of wireless sensor networks for monitoring power transmission lines may extend for hundreds of miles in distances. The sensor nodes in this class of networks are deployed along narrowly elongated geographical areas and form a chain-type topology. Thus routing protocols in such environments must be kept as simple as possible. In this paper, we present the Simple Ant Routing Optimizing Algorithm (SAROA) to offer a low overhead solution in optimizing the routing process. Four improved strategies were used in our approach. During the route discovery we have used a new local search mechanism, in which each node broadcasts a control message (FANT) to its neighbors, but only one of them broadcast this message again. During the route maintenance phase, we only use data packets to refresh the paths of active sessions. Finally, the route repair phase is also enhanced, by using a deep search procedure as a way of restricting the number of nodes used to recover a route. A broadest search is only executed when the deeper one fails to succeed. The simulation results show that the enhance algorithm can effectively jump out of the local optimum and satisfy the tolerable delay in network-wide data collection.

• Periodical: Applied Mechanics and Materials (Volumes 401-403)
• Pages: 1981-1985
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.401-403.1981
• Online since: September 2013
• Authors: Li Fen Li
• Keywords: Ant Colony Optimization (ACO), Local Search, Power Line Monitoring, Routing, Wireless Sensor Network (WSN)

References

[1] LV Zhi-an, ZigBee network theory and applications development[M]. Beijing: Beihang University Press, (2008).

[2] Qian Chunli, Zhang Xingmin, Mine environmental monitoring for wireless sensor networks, Application of Electronic Technique. 2006, (9): 21-23.

[3] He Peng, Study on routing and topology control techniques in mobile Ad Hoc networks, Xidian University, (2007).

[4] ZHANG Xia, YU Hongyi, YANG Baiwei, Algorithm for probabil istic link selection in wireless sensor networks using Bayesian estimation, J. Huazhong Univ. of Sci. & Tech. (Natural Science Edition), 2009, 37 (2): 40-44.

[5] Mesut G¨unes, Udo Sorges, and Imed Bouazizi. ARA - the antcolony based routing algorithm for MANETs. In ICPP Workshops, pages 79–85. IEEE Computer Society, (2002).

[6] Gianni Di Caro, Frederick Ducatelle, and Luca Maria Gambardella. AntHocNet: an Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks. In Parallel Problem Solving from Nature - PPSN VIII, volume 3242 of LNCS, pages 461–470, 18-22 Sep (2004).

DOI: 10.1007/978-3-540-30217-9_47

[7] Fernando Correia and Teresa Vaz. Simple ant routing algorithm. In Information Networking, 2008. ICOIN 2008. International Conference on, pages 1–8, Jan. (2008).

DOI: 10.1109/icoin.2008.4472772

[8] Fernando Correia, Teresa Vaz and Victor J. Lobo. Models for pheromone evaluation in ant systems for mobile ad-hoc networks. In Emerging Network Intelligence, 2009 First International Conference on, pages 85–90, Oct. (2009).

DOI: 10.1109/emerging.2009.16

[9] DUAN Haibin, WANG Daobo , YU Xiufen, MAX-M IN meeting ant colony algorithm based on cloud model theory and niche ideology, Journal of Jilin University(Engineering and Technology Edition). 2006(9) 36(5) 803-808.

DOI: 10.1109/wcica.2006.1712928

[10] Chunshi Feng. Swarm Intelligence Optimization Algorithms and Their Applications [D]. China University of Science and Technology, (2009).