Semi-Structured and Unstructured Data Aggregation Scheduling in Wireless Sensor Networks

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:13:20Z
dc.date.available2013-11-25T13:13:20Z
dc.date.issued2011-09
dc.description.abstractThis paper focuses on data aggregation scheduling problem in wireless sensor networks (WSNs), to minimize time latency. Prior works on this problem have adopted a structured approach, in which a tree-based structure is used as an input for the scheduling algorithm. As the scheduling performance mainly depends on the supplied aggregation tree, such an approach cannot guarantee optimal performance. To address this problem, we propose approaches based on Semi-structured Topology (DAS-ST) and Unstructured Topology (DAS-UT). The approaches are based on two key design features, which are : (1) simultaneous execution of aggregation tree construction and scheduling, and (2) parent selection criteria that maximize the choices of parents for each node and maximize time slot reuse. We prove that the latency of DAS-ST is upper-bounded by (b 2 arccos( 1 1+ ) c+4)R+fr_FR
dc.identifier.isrnCERIST-DTISI/RR--11-000000028--dzfr_FR
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/352
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.titleSemi-Structured and Unstructured Data Aggregation Scheduling in Wireless Sensor Networksfr_FR
dc.typeTechnical Report
Files
Collections
Research Reports