Academic & Scientific Articles

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

Browse

Has files: YesSubject: search.filters.subject.Data aggregation

Search Results

Now showing 1 - 7 of 7
  • 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 data aggregation with in-network integrity control for WSN
    (Elsevier, 2012-10) Bagaa, Miloud; Challal, Yacine; Ouadjaout, Abdelraouf; Lasla, Noureddine; Badache, Nadjib
    Energy is a scarce resource in Wireless Sensor Networks (WSN). Some studies show that more than 70% of energy is consumed in data transmission in WSN. Since most of the time, the sensed information is redundant due to geographically collocated sensors, most of this energy can be saved through data aggregation. Furthermore, data aggregation improves bandwidth usage and reduces collisions due to interference. Unfortunately, while aggregation eliminates redundancy, it makes data integrity verification more complicated since the received data is unique. In this paper, we present a new protocol that provides control integrity for aggregation in wireless sensor networks. Our protocol is based on a two-hop verification mechanism of data integrity. Our solution is essentially different from existing solutions in that it does not require referring to the base station for verifying and detecting faulty aggregated readings, thus providing a totally distributed scheme to guarantee data integrity. We carried out numerical analysis and simulations using the TinyOS environment. Results show that the proposed protocol yields significant savings in energy consumption while preserving data integrity, and outperforms comparable solutions with respect to some important performance criteria.
  • 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 data aggregation scheduling in wireless sensor networks with multi-channel links
    (ACM, 2013) Bagaa, Miloud; Younis, Mohamed; Badache, Nadjib
    In-network data aggregation is often pursued to remove redundancy and correlate the data en-route to the base-station in order to save energy in wireless sensor networks (WSNs). In this paper, we present a novel cross-layer approach for reducing the latency in disseminating aggregated data to the base-station over multi-frequency radio links. Our approach forms the aggregation tree with the objective of increasing the simultaneity of transmissions and reducing buffering delay. Aggregation nodes are picked and time-slots are allocated to the individual sensors so that the most number of ready nodes can transmit their data without delay. Colliding transmissions are avoided by the use of different radio channels. Our approach 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.