Research Reports

Permanent URI for this collectionhttp://dl.cerist.dz/handle/CERIST/34

Browse

Author: search.filters.author.Badache, NadjibSubject: search.filters.subject.Data aggregation

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Intertwined Medium Access Scheduling of Upstream and Downstream Traffic in Wireless Sensor Networks
    (CERIST, 2013-12-25) Bagaa, Miloud; Younis, Mohamed; Djenouri, Djamel; Badache, Nadjib
    In wireless sensor networks, the sensor data are often aggregated en-route to the base-station in order to eliminate redundancy and conserve the network resources. The base-station not only acts as a destination for the upstream data traffic, but it also configures the network by transmit- ting commands downstream to nodes. The data delivery latency is a critical performance metric in time-sensitive applications and is considered by a number of data aggregation schemes in the literature. However, to the best of our knowledge, no solution has considered the scheduling of downstream packets, originated from the base-station, in conjunction with upstream traffic. This paper fills such a gap and proposes MASAUD, which intertwines the medium access schedule of upstream and downstream traffic in order to reuse time slots in a non-conflicting manner and reduce delay. MASAUD can be integrated with any scheme for data aggregation scheduling. The simulation confirms the effectiveness of MASAUD.
  • Thumbnail Image
    Item
    Semi-Structured and Unstructured Data Aggregation Scheduling in Wireless Sensor Networks
    (CERIST, 2011-09) Bagaa, Miloud; Derhab, Abdelouahid; Badache, Nadjib; Lasla, Noureddine; Ouadjaout, Abdelraouf
    This 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+
  • 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.