Academic & Scientific Articles
Permanent URI for this communityhttp://dl.cerist.dz/handle/CERIST/3
Browse
2 results
Search Results
Item Intertwined path formation and MAC scheduling for fast delivery of aggregated data in WSN(Elsevier, 2014-12-24) Bagaa, Miloud; Younis, Mohamed; Derhab, Abdelouahid; Badache, NadjibThis paper studies the problem of data aggregation scheduling in wireless sensor networks (WSNs) to minimize time latency. In prior work on this problem, a node is assigned a parent from the set of unscheduled nodes in order to prevent the creation of cycles. However, using such a strategy reduces the time-slot reuse and consequently has a negative impact on the time latency. To address these shortcomings, we propose IPS (Interwined Path formation and MAC Scheduling) , a novel cross-layer scheme for data aggregation scheduling that allows selecting a parent from all the node’s neighbors including the scheduled ones. IPS achieves reduced data delivery latency through three key design features, namely, (1) intertwining aggregation tree formation and scheduling, (2) for each node, a parent can be selected from already scheduled nodes so that the time latency is reduced and the cycles are prevented and (3) applying parent selection criteria that maximize the time slot reuse. We prove that the data delivery latency for IPS is upper-bounded by , where R is the network radius, Δ is the maximum node degree, and 0.05<∊⩽1. The simulation results show that IPS outperforms seven competing state-of-the-art aggregation scheduling algorithms in terms of latency and network lifetimeItem Semi-Structured and Unstructured Data Aggregation Scheduling in Wireless Sensor Networks(CERIST, 2011-09) Bagaa, Miloud; Derhab, Abdelouahid; Badache, Nadjib; Lasla, Noureddine; Ouadjaout, AbdelraoufThis 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+