Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/69651
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, Y.-
dc.contributor.authorLim, C.-
dc.date.issued2011-
dc.identifier.citationProceedings of the International Conference on Opto-Electronics Engineering and Information Science (ICOEIS 2011), 2011: pp.1422-1426-
dc.identifier.urihttp://hdl.handle.net/2440/69651-
dc.description.abstractWe 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.-
dc.description.statementofresponsibilityYuexian Wang and Cheng Chew Lim-
dc.language.isoen-
dc.publisherAJETR-
dc.rightsCopyright status unknown-
dc.source.urihttp://www.ajetr.org/ICOEIS2011/TOC.htm-
dc.subjectSensor networks-
dc.subjectdata aggregation-
dc.subjectparticle swarm optimisation-
dc.subjectcorrelation coefficient-
dc.subjectenergy consumption-
dc.titleGathering correlated data in wireless sensor networks using a heuristic algorithm-
dc.typeConference paper-
dc.contributor.conferenceInternational Conference on Opto-Electronics Engineering and Information Science (2011 : China)-
dc.publisher.placeUSA-
pubs.publication-statusPublished-
Appears in Collections:Aurora harvest
Electrical and Electronic Engineering publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.