Welcome to the InfoSci Platform
Reference Hub3
Swarm Intelligent Data Aggregation in Wireless Sensor Network

Swarm Intelligent Data Aggregation in Wireless Sensor Network

Jinil Persis Devarajan, T. Paul Robert
Copyright: © 2020 |Volume: 11 |Issue: 2 |Pages: 18
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781799806707|DOI: 10.4018/IJSIR.2020040101
Cite Article Cite Article

MLA

Devarajan, Jinil Persis, and T. Paul Robert. "Swarm Intelligent Data Aggregation in Wireless Sensor Network." IJSIR vol.11, no.2 2020: pp.1-18. http://doi.org/10.4018/IJSIR.2020040101

APA

Devarajan, J. P. & Robert, T. P. (2020). Swarm Intelligent Data Aggregation in Wireless Sensor Network. International Journal of Swarm Intelligence Research (IJSIR), 11(2), 1-18. http://doi.org/10.4018/IJSIR.2020040101

Chicago

Devarajan, Jinil Persis, and T. Paul Robert. "Swarm Intelligent Data Aggregation in Wireless Sensor Network," International Journal of Swarm Intelligence Research (IJSIR) 11, no.2: 1-18. http://doi.org/10.4018/IJSIR.2020040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Data aggregation in WSNs is an interesting problem wherein data sensed by the sensors is routed to an aggregation node in an efficient way. Since the sensors are battery operated, it is very important for a routing protocol to conserve energy and also ensure load balancing and faster delivery. In this study, a multi-objective linear programming model is developed for this problem and solved using an exact algorithm applying dominance principle. In order to ensure faster convergence, routing algorithms incorporating strategies of swarms in nature such as Ants, Bees and Fireflies are adapted. In the simulation study, it is quite evident from the convergence characteristics, swarm intelligent algorithms could converge earlier than the exact algorithm with convergence time lesser by 90%. Moreover, when exact algorithm could solve smaller networks, the swarm intelligent algorithms could solve even larger network instances. Firefly algorithm is able to yield approximated pareto – optimal routes which outperforms ant colony optimization and bee colony optimization algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.