Colony algorithm for wireless sensor networks adaptive data aggregation routing schema

  • Authors:

  • Ning Ye;Jie Shao;Ruchuan Wang;Zhili Wang

  • Affiliations:

  • Dept .of Information Science, Nanjing College for Population Programme Management, Nanjing, China;College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China;Department of Computer Science and Technology, NJUPT, Nanjing, China and State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China;Dept .of Information Science, Nanjing College for Population Programme Management, Nanjing, China

  • Venue:
  • LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.02

Visualization

Abstract

Wireless sensor network should decrease the power costs of redundancy information and delay time. The technology of data aggregation can be adopted. A routing algorithm for data aggregation based on ant colony algorithm (ACAR) is presented. The main idea of this algorithm is optimization of data aggregation route by some cooperation agents called ants using the three heuristic factors about energy, distant and aggregation gain. For realizing data aggregation by positive feedback of the ants, the nodes of wireless sensor networks should not maintain the global information. The algorithm is a distributed routing algorithm and realizes data aggregation trade-off in energy and delay. The analysis and the experimental results show that the algorithm is efficient.