Gathering Correlated Data in Wireless Sensor Networks Using a Heuristic Algorithm

Publications

Share / Export Citation / Email / Print / Text size:

International Journal of Advanced Network, Monitoring and Controls

Xi'an Technological University

Subject: Computer Science , Software Engineering

GET ALERTS

eISSN: 2470-8038

DESCRIPTION

3
Reader(s)
11
Visit(s)
0
Comment(s)
0
Share(s)

SEARCH WITHIN CONTENT

FIND ARTICLE

Volume / Issue / page

Related articles

VOLUME 1 , ISSUE 1 (June 2016) > List of articles

Gathering Correlated Data in Wireless Sensor Networks Using a Heuristic Algorithm

Yuexian Wang / Cheng Chew Lim

Keywords : Sensor networks, data aggregation, particle swarm optimisation, correlation coefficient, energy consumption

Citation Information : International Journal of Advanced Network, Monitoring and Controls. Volume 1, Issue 1, Pages 0-0, DOI: https://doi.org/10.21307/ijanmc-2016-002

License : (CC BY-NC-ND 4.0)

Published Online: 01-April-2018

ARTICLE

ABSTRACT

We propose a routing scheme for data gathering and aggregation in wireless sensor networks. The scheme aims to optimise an aggregation tree in order to minimise the energy dissipation of data aggregation and transmission. A modified particle swarm optimisation algorithm is developed in the proposed scheme. In addition, the routing scheme uses a generic data aggregation model which accommodates different correlation conditions. The performance of the proposed scheme is evaluated and compared with three other existing data gathering algorithms. Simulation results show that the proposed scheme outperforms existing algorithms in terms of energy consumption and that the scheme can adapt to the change of network connectivity and data correlation conditions.

Content not available PDF Share

FIGURES & TABLES

REFERENCES

W. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive protocols for information dissemination in wireless sensor networks,” in Proc. ACM MobiCom, Aug. 1999, pp. 174-185.

 

R. C. Prim, “Shortest connection networks and some generalization,” Bell System Technical, vol. 36, no. 6, pp. 1389-1401, 1957.

 

A. Goel and K. Munagala, “Balancing steiner trees and shortest path trees online,” in Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, Jan. 2000, pp. 562-563.

 

R.Cristescu, B. Beferull-Lozano, and M. Vetterli, “On network correlated data gathering,” in Proc. IEEE INFOCOM, vol. 4, Mar. 2004, pp. 2571-2582.

 

M. R. Garey and D. Johnson, Computers and intractability: A guide to the theory of NP-Completeness. W. H. Freeman, 1979.

 

J. Kennedy and R. C. Eberhart, “Particle Swarm Optimization,” in the IEEE Conf. on Neural Networks, IV, 1995, pp. 1942-1948.

 

H. Xia, H. L. Bertoni, and L. R. Maciel, “Radio propagation characteristics for line-of-sight microcellular and personal communications,” Antenna and Propagation, vol. 41, no. 10, pp. 1439-1447, Oct. 1993.

 

Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed., Springer-Verlag, 1996.

 

J. E. Baker, “Adaptive selection methods for genetic algorithms,” in Proc. the 1st International Conference on Genetic Algorithms, 1985, pp. 101-111.

 

W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “An application-specific protocol architecture for wireless microsensor networks,” Wireless Communications, vol. 1, no. 4, pp. 660-670, October 2002.

 

EXTRA FILES

COMMENTS