Academic & Scientific Articles

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

Browse

Author: search.filters.author.Djenouri, DjamelEnd date: 2016

Search Results

Now showing 1 - 10 of 105
  • Thumbnail Image
    Item
    Networked Wireless Sensors, Active RFID, and Handheld Devices for Modern Car Park Management: WSN, RFID, and Mob Devs for Car Park Management
    (IGI Global, 2015-07-01) Djenouri, Djamel; Karbab, Elmouatezbillah; Boulkaboul, Sahar; Bagula, Antoine
    Networked wireless sensors, actuators, RFID, and mobile computing technologies are explored in this paper on the quest for modern car park management systems with sophisticated services over the emerging internet of things (IoT), where things such as ubiquitous handheld computers, smart ubiquitous sensors, RFID readers and tags are expected to be interconnected to virtually form networks that enable a variety of services. After an overview of the literature, the authors propose a scalable and lowcost car parking framework (CPF) based on the integration of aforementioned technologies. A preliminary prototype implementation has been performed, as well as experimentation of some modules of the proposed CPF. The results demonstrate proof of concept, and particularly reveal that the proposed approach for WSN deployment considerably reduces the cost and energy consumption compared to existing solutions.
  • Thumbnail Image
    Item
    Efficient On-Demand Multi-Node Charging Techniques for Wireless Sensor Networks
    (Elsevier, 2016-10-01) Khelladi, Lyes; Djenouri, Djamel; Rossi, Michele; Badache, Nadjib
    This paper deals with wireless charging in sensor networks and explores efficient policies to perform simultaneous multi-node power transfer through a mobile charger (MC).The proposed solution, called On-demand Multi-node Charging (OMC), features an original threshold-based tour launching (TTL) strategy, using request grouping, and a path planning algorithm based on minimizing the number of stopping points in the charging tour. Contrary to existing solutions, which focus on shortening the charging delays, OMC groups incoming charging requests and optimizes the charging tour and the mobile charger energy consumption. Although slightly increasing the waiting time before nodes are charged, this allows taking advantage of multiple simultaneous charges and also reduces node failures. At the tour planning level, a new modeling approach is used. It leverages simultaneous energy transfer to multiple nodes by maximizing the number of sensors that are charged at each stop. Given its NP-hardness, tour planning is approximated through a clique partitioning problem, which is solved using a lightweight heuristic approach. The proposed schemes are evaluated in offline and on-demand scenarios and compared against relevant state-of-the-art protocols. The results in the offline scenario show that the path planning strategy reduces the number of stops and the energy consumed by the mobile charger, compared to existing offline solutions. This is with further reduction in time complexity, due to the simple heuristics that are used. The results in the on-demand scenario confirm the effectiveness of the path planning strategy. More importantly, they show the impact of path planning, TTL and multi-node charging on the efficiency of handling the requests, in a way that reduces node failures and the mobile charger energy expenditure.
  • Thumbnail Image
    Item
    One-Step Approach for Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks
    (IEEE Communications Society, 2016-06) Cheli, Ali; Bagaa, Miloud; Djenouri, Djamel; Balasingham, Ilangko; Taleb, Tarik
    We consider in this letter the problem of constrained relay node (RN) placement where sensor nodes must be connected to base stations by using a minimum number of RNs. The latter can only be deployed at a set of predefined locations, and the two-tiered topology is considered where only RNs are responsible for traffic forwarding. We propose a one-step constrained RN placement (OSRP) algorithm which yields a network tree. The performance of OSRP in terms of the number of added RNs is investigated in a simulation study by varying the network density, the number of sensor nodes, and the number of candidate RN positions. The results show that OSRP outperforms the only algorithm in the literature for two-tiered constrained RNs placement.
  • Thumbnail Image
    Item
    An oscillation-based algorithm for reliable vehicle detection with magnetic sensors
    (IEEE, 2016-04) Djenouri, Djamel; Doudou, Messaoud; Kafi, Mohamed Amine
    Vehicle monitoring using a wireless sensor network is considered in this paper, where a new algorithm is proposed for vehicle detection with magnetic sensors. The proposed algorithm is based on processing the magnetic signal and thoroughly analyzing the number/direction of its oscillations. The main feature of the proposed algorithm over the state-of-the-art ones is its capability to detect vehicles with different shapes of signatures, while most state-of-the-art algorithms assume regular shapes of signatures. This makes the algorithm effective with all types of magnetic sensors. The proposed algorithm has been implemented on MICAz sensor motes and tested in real world scenarios. Results show reliability beyond 93% in all samples, and more than 95% in most of them.
  • Thumbnail Image
    Item
    MAC Protocols with Wake-up Radio for Wireless Sensor Networks: A Review
    (IEEE Communications Society, 2016-10) Djiroun, Fatma Zohra; Djenouri, Djamel
    The use of a low-power wake-up radio in wireless sensor networks is considered in this paper, where relevant medium access control solutions are studied. A variety of asynchronous wake-up MAC protocols have been proposed in the literature, which take advantage of integrating a second radio to the main one for waking it up. However, a complete and a comprehensive survey particularly on these protocols is missing in the literature. This paper aims at filling this gap, proposing a relevant taxonomy, and pro- viding deep analysis and discussions. From both per- spectives of energy efficiency and latency reduction, as well as their operation principles, state-of-the-art wake-up MAC protocols are grouped into three main categories: i) duty cycled wake-up MAC protocols, ii) non-cycled wake-up protocols, and iii) path reserva- tion wake-up protocols. The first category includes two subcategories, i) static wake-up protocols vs. ii) traffic adaptive wake-up protocols. Non-cycled wake- up MAC protocols are again divided into two classes i) always-on wake-up protocol, and ii) radio-triggered wake-up protocols. The latter is in turn split into two subclasses: i) passive wake-up MAC protocols, vs. ii) ultra low power active wake-up MAC protocols. Two schemes could be identified for the last category, broadcast based wake-up vs. addressing based wake- up. All these classes are discussed and analized in this paper, and canonical protocols are investigated following the proposed taxonomy.
  • 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
    Delay-efficient MAC protocol with traffic differentiation and run-time parameter adaptation for energy-constrained wireless sensor networks
    (Springer, 2016-02) Doudou, Messaoud; Djenouri, Djamel; M. Barcelo-Ordinas, Jose; Badache, Nadjib
    This paper presents an asynchronous cascading wake-up MAC protocol for heterogeneous traffic gathering in low-power wireless sensor networks. It jointly considers energy/delay optimization and switches between two modes, according to the traffic type and delay requirements. The first mode is high duty cycle, where energy is traded-off for a reduced latency in presence of realtime traffic (RT). The second mode is low duty cycle, which is used for non-realtime traffic and gives more priority to energy saving. The proposed protocol, DuoMAC, has many features. First, it quietly adjusts the wake-up of a node according to (1) its parent’s wake-up time and, (2) its estimated load. Second, it incorporates a service differentiation through an improved contention window adaptation to meet delay requirements. A comprehensive analysis is provided in the paper to investigate the effectiveness of the proposed protocol in comparison with some state-of-the-art energy-delay efficient duty-cycled MAC protocols, namely DMAC, LL-MAC, and Diff-MAC. The network lifetime and the maximum end-to-end packet latency are adequately modeled, and numerically analyzed. The results show that LL-MAC has the best performance in terms of energy saving, while DuoMAC outperforms all the protocols in terms of delay reduction. To balance the delay/energy objectives, a runtime parameter adaptation mechanism has been integrated to DuoMAC. The mechanism relies on a constrained optimization problem with energy minimization in the objective function, constrained by the delay required for RT. The proposed protocol has been implemented on real motes using MicaZ and TinyOS. Experimental results show that the protocol clearly outperforms LL-MAC in terms of latency reduction, and more importantly, that the runtime parameter adaptation provides additional reduction of the latency while further decreasing the energy cost.
  • Thumbnail Image
    Item
    BA: Game Theoretical Approach for Energy-Delay Balancing in Distributed Duty-Cycled MAC Protocols of Wireless Networks
    (ACM, 2014-07-14) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Djenouri, Djamel; Garcia-Vidal, Jorge; Badache, Nadjib
    Optimizing energy consumption and end-to-end (e2e) packet delay in energy constrained distributed wireless networks is a conflicting multi-objective optimization problem. This paper investigates this trade-off from a game-theoretic perspective, where the two optimization objectives are considered as virtual game players that attempt to optimize their utility values. The cost model of each player is mapped through a generalized optimization framework onto protocol specific MAC parameters. A cooperative game is then defined, in which the Nash Bargaining solution assures the balance between energy consumption and e2e packet delay. For illustration, this formulation is applied to three state-of-the-art wireless sensor network MAC protocols; X-MAC, DMAC, and LMAC as representatives of preamble sampling, slotted contention-based, and frame-based MAC categories, respectively. The paper shows the effectiveness of such framework in optimizing protocol parameters for achieving a fair energy-delay performance trade-off, under the application requirements in terms of initial energy budget and maximum e2e packet delay. The proposed framework is scalable with the increase in the number of nodes, as the players represent the optimization metrics instead of nodes.
  • Thumbnail Image
    Item
    Performance Optimization of Duty-Cycled MAC in Delay-Energy Constrained Sensor Network Under Uniform and Non-Uniform Traffic Generation
    (interscience.wiley, 2016) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Djenouri, Djamel; Badache, Nadjib; Garcia-Vidal, Jorge
    Duty-Cycle at the MAC layer plays a key role in energy savings and network lifetime extension. It consists in putting a node’s radio in the sleep state as soon as it has no communication activity. Traditional WSN MAC protocols are designed with short duty cycles at the cost of long delays. Careful design is required for joint energy-delay constrained applications, where the optimal parameters should be thoroughly derived. The present paper deals with this issue and mathematically derives optimal values of key MAC parameters under low data rate applications for three well known duty-cycled MAC protocols, WiseMAC, SCP-MAC, and LMAC as representatives of three MAC protocol categories, respectively preamble-sampling, slotted contention-based and frame-based. The analysis provides also the optimum traffic sampling rate that guarantees the minimum energy consumption. It shows the role of these parameters in achieving the targeted e2e (end-to-end) delay constraints under network models with uniform traffic generation, for ring and grid topologies. As a second contribution, the model is extended to non-uniform traffic scenarios, where a certain percentage of deployed nodes are relays whose role is to balance traffic forwarding and save the overall network energy. The results reveal that different optimal internal MAC parameters and traffic generation rates can be found for different configurations of relay nodes deployment, which achieve minimal network energy consumption while satisfying the application required e2e delay threshold