OD2AS: Optimal Distributed Data Aggregation Scheduling in wireless sensor network

Simple item page
dc.contributor.authorBagaa, Miloud
dc.contributor.authorDerhab, Abdelouahid
dc.contributor.authorBadache, Nadjib
dc.contributor.authorLasla, Noureddine
dc.contributor.authorOuadjaout, Abdelraouf
dc.date.accessioned2013-11-25T13:07:03Z
dc.date.available2013-11-25T13:07:03Z
dc.date.issued2011-09
dc.description.abstractIn this paper, we investigate the minimum data aggregation scheduling problem in wireless sensor networks (WSNs), aiming to nd the free-collision schedule that routes and aggregates the data on all the sensor nodes to the sink node in minimal time. To address this problem, we propose a new algorithm, named Optimal Distributed Data Aggregation Scheduling (OD2AS). OD2AS is based on three key design features that can ensure e cient and optimal aggregation scheduling, which are : (1) simultaneous execution of aggregation tree construction and scheduling, (2) parent selection criteria that maximize the choices of parents for each node and maximize time slot reuse, and (3) distributed execution of the algorithm. Simulations results show that OD2AS outperforms four competitive state-of-the-art aggregation scheduling algorithms in terms of latency and network lifetime. It also incurs lower message overhead than the sole existing distributed algorithm.fr_FR
dc.identifier.isrnCERIST-DTISI/RR--11-000000027--dzfr_FR
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/351
dc.publisherCERIST
dc.relation.ispartofRapports de recherche internes
dc.relation.ispartofseriesRapports de recherche internes
dc.relation.placeAlger
dc.subjectWireless sensor networkfr_FR
dc.subjectData aggregationfr_FR
dc.subjectSchedulingfr_FR
dc.titleOD2AS: Optimal Distributed Data Aggregation Scheduling in wireless sensor networkfr_FR
dc.typeTechnical Report
Files
Collections
Research Reports