International Conference Papers

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

Browse

Start date: 2010Subject: search.filters.subject.Wireless sensor networks

Search Results

Now showing 1 - 9 of 9
  • Thumbnail Image
    Item
    Congestion Detection Strategies in Wireless Sensor Networks: A Comparative Study with Testbed Experiments
    (Elsevier, 2014-09) Kafi, Mohamed Amine; Djenouri, Djamel; Ouadjaout, Abdelraouf; Badache, Nadjib
    Event based applications of Wireless Sensor Networks (WSNs) are prone to traffic congestion, where unpredicted event detection yields simultaneous generation of traffic at spatially co-related nodes, and its propagation towards the sink. This results in loss of information and waste energy. Early congestion detection is thus of high importance in such WSN applications to avoid the propagation of such a problem and to reduce its consequences. Different detection metrics are used in the congestion control literature. However, a comparative study that investigates the different metrics in real sensor motes environment is missing. This paper focuses on this issue and compares some detection metrics in a testbed network with MICAz motes. Results show the effectiveness of each method in different scenarios and concludes that the combination of buffer length and channel load constitute the better candidate for early and fictive detection.
  • Thumbnail Image
    Item
    Interference-aware Congestion Control Protocol for Wireless Sensor Networks
    (Elsevier, 2014-09) Kafi, Mohamed Amine; Djenouri, Djamel; Ben Othman, Jalel; Ouadjaout, Abdelraouf; Bagaa, Miloud; Lasla, Noureddine; Badache, Nadjib
    This paper deals with congestion and interference control in wireless sensor networks (WSN), which is essential for improving the throughput and saving the scarce energy in networks where nodes have different capacities and traffic patterns. A scheme called IACC (Interference-Aware Congestion Control) is proposed. It allows maximizing link capacity utilization for each node by controlling congestion and interference. This is achieved through fair maximum rate control of interfering nodes in inter and intra paths of hot spots. The proposed protocol has been evaluated by simulation, where the results rival the effectiveness of our scheme in terms of energy saving and throughput. In particular, the results demonstrate the protocol scalability and considerable reduction of packet loss that allow to achieve as high packet delivery ratio as 80% for large networks.
  • Thumbnail Image
    Item
    Improved coverage through area-based localization in wireless sensor networks
    (IEEE, 2013-10) Lasla, Noureddine; Younis, Mohamed; Badache, Nadjib
    Ensuring area coverage is one of the key requirements of wireless sensor networks (WSNs). When nodes are randomly placed in the area of interest, redundancy is often provisioned in order to lower the probability of having voids, where part of the area is not within the detection range of any sensor. To extend the lifetime of the network, a duty cycle mechanism is often applied in which only a subset of the nodes are activated at a certain time while the other nodes switch to low-power mode. The set of active nodes are changed over time in order to balance the load on the individual sensors. The selection of active nodes is subject to meeting the coverage requirement. Assessing the coverage of a sensor is based on knowing its position. However, localization schemes usually yield a margin of errors which diminishes the coverage fidelity. Conservative approaches for mitigating the position inaccuracy assume the worst-case error across the network and end up activating excessive number of nodes and reduces the network lifetime. In this paper, we present an approach for estimating a bound on the maximum error for the position of each sensor and propose a distributed algorithm for achieving high fidelity coverage while engaging only a subset of the sensors. The simulation results confirm the performance advantages of our approach.
  • Thumbnail Image
    Item
    Congestion Detection Strategies in Wireless Sensor Networks: A Comparative Study with Testbed Experiments
    (Elsevier, 2014) Kafi, Mohamed Amine; Djenouri, Djamel; Ben Othman, Jalel; Ouadjaout, Abdelraouf; Badache, Nadjib
    Event based applications of Wireless Sensor Networks (WSNs) are prone to traffic congestion, where unpredicted event detection yields simultaneous generation of traffic at spatially co-related nodes, and its propagation towards the sink. This results in loss of information and waste energy. Early congestion detection is thus of high importance in such WSN applications to avoid the propagation of such a problem and to reduce its consequences. Different detection metrics are used in the congestion control literature. However, a comparative study that investigates the different metrics in real sensor motes environment is missing. This paper focuses on this issue and compares some detection metrics in a testbed network with MICAz motes. Results show the effectiveness of each method in different scenarios and concludes that the combination of buffer length and channel load constitute the better candidate for early and fictive detection.
  • Thumbnail Image
    Item
    DZ50: Energy-efficient Wireless Sensor Mote Platform for Low Data Rate Applications
    (Elsevier, 2014) Ouadjaout, Abdelraouf; Lasla, Noureddine; Bagaa, Miloud; Doudou, Messaoud; Zizoua, Cherif; Kafi, Mohamed Amine; Derhab, Abdelouahid; Djenouri, Djamel; Badache, Nadjib
    A low cost and energy e_cient wireless sensor mote platform for low data rate monitoring applications is presented. The new platform, named DZ50, is based on the ATmega328P micro-controller and the RFM12b transceiver, which consume very low energy in low-power mode. Considerable energy saving can be achieved by reducing the power consumption during inactive (sleep) mode, notably in low data rate applications featured by long inactive periods. Without loss of generality, spot monitoring in a Smart Parking System (SPS) and soil moisture in a Precision Irrigation System (PIS) are selected as typical representative of low data rate applications. The performance of the new platform is investigated for typical scenarios of the selected applications and compared with that of MicaZ and TelosB. Energy measurements have been carried out for di_erent network operation states and settings, where the results reveal that the proposed platform allows to multiply the battery lifetime up to 7 times compared to MicaZ and TelosB motes in 10s sampling period scenarios.
  • Thumbnail Image
    Item
    Power-Aware QoS Geographical Routing for Wireless Sensor Networks - Implementation using Contiki
    (IEEE, 2010-06) Djenouri, Djamel; Balasingham, Ilangko
    This paper presents the design and implementation of a new geographical quality of service (QoS) routing for wireless sensor networks. The protocol is based on traffic differentiation and provides customized QoS according to the traffic requirement. For each packet, the protocol attempts to fulfill the required data-related QoS metric(s) while considering power-efficiency. The data related metrics include packet latency and reliability, while power-efficiency has been considered for both power transmission minimization and residual energy maximization (load balancing). The protocol has been implemented in real sensor motes using Contiki operating system, which offers many modules and has many features that facilitate efficient communication protocol implementation. The protocol was then evaluated in a testbed. The experimental results show good QoS performance, and particularly, traffic-differentiation QoS as expected, i.e., QoS-sensitive packets were routed with better performances than regular packets. The protocol is generic and applies to any application with traffic requiring different QoS, such as in biomedical and vehicular applications.
  • Thumbnail Image
    Item
    Distributed Receiver/Receiver Synchronization in Wireless Sensor Networks: New Solution and Joint Offset/Skew Estimators for Gaussian Delays
    (Spinger, 2011-08) Djenouri, Djamel
    This paper proposes a new synchronization protocol for wireless sensor networks (WSN). The proposed protocols is based on the receive/reieve approach, which was introduced by the Reference Broadcast Synchronization (RBS). This approach has been chosen for its lower time-critical path compared to the sender/receiver approach. Contrary to RBS upon which rely all current receiver/receiver solutions, the proposed one is totally distributed and does not depend on any fixed reference. The reference’s function is balanced among all sensors, which eliminates the single point of failure shortcomings. RBS needs additional steps for exchanging reception timestamps. On the other hand, the proposed protocol allow these timestamps to be piggybacked to the regular beacons, reducing thus the overhead and energy consumption. The protocol deals with local synchronization and allows neighboring nodes to relatively synchronize with each other by estimating relative skews/offsets. Maximum Likelihood estimators (MLEs) are derived for channels with Gaussian (normal) distributed delays, and for both offset-only and joint offset/skew models. The Cramer-Rao Lower Bounds (CRLBs) are derived for each model and numerically compared with the MLE. Results show quick convergence of the proposed estimators’ precision to CRLB. To our knowledge, this is the first distributed receiver/receiver solution that eliminates the need of a fixed reference while taking advantage of the receiver/receiver synchronization’s precision.
  • Thumbnail Image
    Item
    Cluster-Based Fast Broadcast in Duty-Cycled Wireless Sensor Networks
    (IEEE, 2012-08) Khiati, Mustapha; Djenouri, Djamel
    This paper proposes a cluster-based broadcast protocol to disseminate delay-sensitive information throughout a wireless sensor network (WSN). The protocol considers the use of duty-cycling at the MAC layer, which is essential to reduce energy dissipation. LEACH's energy-efficiency approach is used for cluster construction. The proposed protocol adds new common static and dynamic broadcast periods to support and accelerate broadcasting. The dynamic periods are scheduled following the past arrivals of messages, and using a Markov-chain model. To our knowledge, this work is the first that proposes the use of clustering to reduce broadcast latency. The clustering mechanism allows for simultaneous local broadcasts at several clusters in the WSN, and it also ensures scalability with the increase of the network size. The protocol has been simulated, numerically analyzed, and compared with LEACH. The results show clear improvement over LEACH with regard to the latency.
  • Thumbnail Image
    Item
    FDAP: Fast Data Aggregation Protocol in Wireless Sensor Networks
    (IEEE/Springer, 2012-08) Boulkaboul, Sahar; Djenouri, Djamel; Badache, Nadjib
    This paper focuses on data aggregation latency in wireless sensors networks. A distributed algorithm to generate a collision-free schedule for data aggregation in wireless sensor networks is proposed. The proposed algorithm is based on maximal independent sets. It modifies DAS scheme and proposes criteria for node selection amongst available competitors. The selection objective function captures the node degree (number of neighbors) and the level (number of hops) contrary to DAS that simply uses node ID. The proposed solution augments parallel transmissions, which reduces the latency. The time latency of the aggregation schedule generated by the proposed algorithm is also minimized. The latency upper-bound of the schedule is 17R+6Δ+8 time-slots, where R is the network radius and Δ is the maximum node degree. This clearly outperforms the state-of-the-art distributed data aggregation algorithms, whose latency upper-bound is not less than 48R+6Δ+16 time-slots. The proposed protocol is analyzed through a comparative simulation study, where the obtained results confirm the improvement over the existing solutions.