| Paper title: |
Energy Efficient Data Gathering Schemes in Wireless Sensor Networks Using Ant Colony Optimization |
| Published in: | Issue 1, (Vol. 3) / 2009 |
| Publishing date: | 2009-04-14 |
| Pages: | 19-28 |
| Author(s): | Seetharam Anand, Akharya Ayan, BHATTACHARYYA Abhishek, NASKAR K. Mrinal |
| Abstract. | Wireless sensor nodes are highly energy constrained and hence formulating energy-efficient protocols in order to enhance network lifetime and performance are of utmost importance in wireless sensor networks. A few solutions exist to the problem, LEACH and PEGASIS protocols being the most elegant ones. Both schemes try to achieve a solution by minimizing the overall energy dissipation by the nodes in the network. While randomizing cluster heads for achieving equal energy dissipation has been done in the LEACH protocol, the PEGASIS protocol forms a chain of all the nodes in the network, each node taking rounds in transmitting to the base station. In this paper we propose energy efficient protocols which enhance the performance of LEACH, PEGASIS. The individual nodes being deployed randomly in the play field the base station is located at variable distances from them. Hence it is clear that the nodes would actually dissipate a different amount of energy during their turn of transmission to the base station. The inter-nodal distance also being variable it too plays a role in unequal energy dissipation of the nodes. This energy difference between the various nodes keeps on increasing resulting in poorer network performance. In our schemes we try to nullify the differences occurring due to these above mentioned causes and thus increase the network performance by balancing the energy dissipation by the nodes. We also employ the Ant Colony Optimization algorithm (ACO) for chain construction instead of the greedy algorithm to enhance the network performance. Extensive simulations have been carried out which show significant improvement over PEGASIS which in turn implies substantial increment over LEACH. |
| Keywords: | Wireless Sensor Network, Data Gathering Round, Ant Colony Optimization, Network Lifetime |
| References: | 1. Wendi Heinzelman, Anantha Chandrakasan and Hari Balakrishna,“Energy-Efficient Communication Protocol for Wireless MicrosensorNetworks”, In Proceedings of 33rd Hawaii International Conferenceon System Sciences, Jan. 2000, pp. 1-10 2. S. Lindsey, C.S.Raghavendra, “PEGASIS: Power Efficient Gathering in Sensor Information Systems”, In Proceedings of IEEE ICC 2001, pp. 1125-1130, June 2001. 3. D.Estrin, R.Govindan, J.Hiedemann and Satish Kumar, “Next Century Challenges : Scalable Coordination in sensor networks”, In Proceedings of Mobicom ’99, 1999 4. Yunxia Chen and Qing Zhao, “On the Lifetime of Wireless Sensor Networks”, IEEE Communications Letters, Vol. 9, No. 11, November 2005. 5. S.Lindsey, C.S.Raghavendra and K.Sivalingam, “Data Gathering in Sensor Networks using energy delay metric”, In Proceedings of the 15th International Parallel and Distributed Processing Symposium 2001, pp 188-200. 6. Niannian Ding and Peter Xiaoping Liu, “Data Gathering Communication in Wireless Sensor Networks Using Ant Colony Optimization”, In Proceedings of the IEEE Conference on Robotics and Biomimetics, August 22-26, 2004, Shenyang, China pp. 822- 827 7. Ning Ye, Jie Shao, Ruchuan Wang and Zhili Wang, “Colony Algorithm for Wireless Sensor Networks Adaptive Data Aggregation Routing Schema”, In Proceedings of LSMS 2007, LNCS 4688, pp. 248-257 8. Wendi Heinzelman, J.Kulik and H.Balakrishna, “Adaptive Protocols for information dissemination in Wireless Sensor Networks”, In Proceedings of ACM MobiCom ’99, pp.174-85 9. Marco Dorigo “Ant Algorithms Solve Difficult Optimization Problems”, In Proceedings of the 6th European Conference on Advanced Artificial Life, pp 11-22, 2001 10. Jun Ouyang, Gui_Rong Yan “A Multi-Group Ant Colony System Algorithm For TSP”, In proceedings of the Third International Conference on Machine Learning and Cyberncdcs, Shanghai, 26-29 August 2004 11. Rajani Muraleedharan and Lisa Ann Osadciw “A Predictive Sensor Network Using Ant System”, In SPIE Defence and Security, Orlando, April 12-17, 2004 12. Walter J. Gutjahr “Mathematical Runtime Analysis of ACO Algorithms:Survey on an Emerging Issue”, In Journal of Swarm Intelligenc, Vol 1, No.1, pp-59-79 , June 2007 13.Luca Maria Gamberdella and Marco Dorigo ‘Solving Symmetric and Asymmetric TSPs by Ant Colonies”, In Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC'96), page 622-627, IEEE Press. 14. F.Ye, A.Chan, S.Lu and L.Zhang, “A Scalable Solution to Minimum Cost Forwarding in Large Sensor Networks”, In Proceedings of IEEE ICCCN 2001, pp. 304-309, October 2001. 15. Chandrakasan, Amirtharaja, Cho, Goodman, Konduri, Kulik, Rabiner and Wang, “Design Considerations for Distributed Microsensor Systems”, In IEEE 1999 Custom Integrated Circuit Conference (CICC), pp. 279-286, May 1999. 16. Q.Gao, K.J.Blow, D.J.Holding, I.W.Marshall and X.H.Peng, “Radio Range Adjustment for Energy Efficient Wireless Sensor Networks”, Ad-hoc Networks Journal, Elsevier Science, January 2006, vol. 4, issue 1, pp.75-82. 17. Qi Xue and Aura Ganz, “On the Lifetime of Large Scale Sensor Networks”, Computer Communications, Elsevier Science, February 2006, vol. 29, issue 4, pp. 502-510 18. Zach Shelby, Carlos Pomalaza-Raez, Heikki Karvonen and Jussi Haapola, “Energy Optimization in Multihop Wireless Embedded and Sensor Networks”, International Journal of Wireless Information Networks, Springer Netherlands, January 2005, vol .12, no. 1, pp. 11-21. 19. I. F. Akyildiz, W. Su, Y. Sankarasubhramanium and E.Cayirci, “Wireless Sensor Networks : A Survey”, Computer Networks Journal, Elsevier Science, March 2002, vol. 38, pp. 393-422. 20.Manish Bharadwaj, Timothy Garnett and Anantha P. Chandrakasan, “Upper Bounds on the Lifetime of Sensor Networks”, in the Proceedings of the International Conference on Communications (ICC ’01), Helsinki, Finland, June 2001, vol. 3, pp. 785-790. |
| Back to the journal content | |
