Academic & Scientific Articles

Permanent URI for this communityhttp://dl.cerist.dz/handle/CERIST/3

Browse

Subject: search.filters.subject.Scheduling media access

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    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, Nadjib
    This 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 lifetime
  • Thumbnail Image
    Item
    Multi-Path Multi-Channel Data Aggregation Scheduling in Wireless Sensor Networks
    (Wireless Days, 2013-11-13) Bagaa, Miloud; Younis, Mohamed; Ksentini, Adlen; Badache, Nadjib
    In-network aggregation is employed to cut on re-dundancy and conserve the network resources. To meet the criticality and responsiveness goals, the aggregated data are to be disseminated to the base-station reliably while reducing the delivery latency. In this paper, a novel approach is proposed fo Reliable Multi-channel Scheduling for timely dissemination of Aggregated data (RMSA). RMSA strives to form an aggregation tree such that there are k disjoint paths from each node to the base-station and finds a collision free schedule for node transmissions so that the aggregated data reaches the base-station in minimal time. RMSA is a cross-layer scheme that intertwines the formation of the multi-path structure and the assignment of transmission slots to the individual node with the objective of increasing the simultaneity of transmissions and reducing the buffering delay. The availability of multiple radio channels is further exploited in order to prevent colliding transmissions and boost the overall network throughput. RMSA is validated through simulation and is shown to outperform previously published schemes.
  • Thumbnail Image
    Item
    Efficient Multi-Path Data Aggregation Scheduling in Wireless Sensor Networks
    (CERIST, 2013) Bagaa, Miloud; Badache, Nadjib; Ouadjaout, Abdelraouf; Younis, Mohamed
    In 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.