Efficient Multi-Path Data Aggregation Scheduling in Wireless Sensor Networks

Simple item page
dc.contributor.authorBagaa, Miloud
dc.contributor.authorBadache, Nadjib
dc.contributor.authorOuadjaout, Abdelraouf
dc.contributor.authorYounis, Mohamed
dc.date.accessioned2013-11-18T13:42:41Z
dc.date.available2013-11-18T13:42:41Z
dc.date.issued2013
dc.description.abstractIn wireless sensor networks, in-network data aggregation filters out redundant sensor readings in order to reduce the energy and bandwidth consumed in disseminating the data to the base-station. In this paper, we investigate the problem of reliable collection of aggregated data with minimal latency. The aim is to form an aggregation tree such that there are k disjoint paths from each node to the basestation and find a collision-free schedule for node transmissions so that the aggregated data reaches the base-station in minimal time. We propose a novel algorithm for Reliable and Timely dissemination of Aggregated Data (RTAD). RTAD intertwines the formation of the aggregation tree and the allocation of time slots to nodes, and assigns parents to the individual nodes in order to maximize time slot reuse. The simulation results show that RTAD outperforms competing algorithms in the literature.fr_FR
dc.identifier.isrnCERIST-DTISI/RR--13-000000003--dzfr_FR
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/218
dc.publisherCERIST
dc.relation.ispartofRapports de recherche internes
dc.relation.ispartofseriesRapports de recherche internes
dc.relation.placeAlger
dc.structureRéseaux de Capteurs et Applicationsfr_FR
dc.subjectwireless sensor networkfr_FR
dc.subjectData aggregationfr_FR
dc.subjectScheduling media accessfr_FR
dc.subjectMulti-pathsfr_FR
dc.titleEfficient Multi-Path Data Aggregation Scheduling in Wireless Sensor Networksfr_FR
dc.typeTechnical Report
Files
Collections
Research Reports