Academic & Scientific Articles

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

Browse

Subject: search.filters.subject.Wireless Sensor Networks

Search Results

Now showing 1 - 10 of 28
  • Thumbnail Image
    Item
    Revisiting Directed Diffusion In The Era Of IoT-WSNs : Power Control For Adaptation to High Density
    (IEEE Xplore, 2017-08-28) Khelladi, Lyes
    Wireless Sensor Networks (WSNs) have been recognized as a crucial and enabling technology in the world of Internet of Things (IoT). However, their integration with IoT arises new design challenges, compared to conventional WSNs applications. This paper addresses the challenge of high node density and its impact on the design of IoT-WSNs routing protocols. We propose a power-aware topology control mechanism built upon the prominent routing scheme, Directed Diffusion. Moreover, we take benefit from the power-awareness feature of the topology control mechanism in order to compute an energy consumption metric, allowing the selection of energy-efficient routes. The simulation results demonstrate an improvement by the proposed protocol in terms of energy efficiency, data reporting delays and delivery success rate.
  • 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
    Efficient QoS-aware Heterogeneous Architecture for Energy-Delay Constrained Connected Objects
    (IFIP, 2016-07-11) Doudou, Messaoud; Rault, Tifenn; Bouabdallah, Abdelmadjid
    Connected objects such as smart phones and wireless sensors becomes very attractive for our assisted daily life applications, because it offers continuous monitoring capability of both personal and environmental parameters. However, these systems still face a major energy issue that prevent their wide adoption. Indeed, continuous sampling and communication tasks quickly deplete sensors and gateways battery reserves, and frequent battery replacement are not convenient. One solution to address such a challenge consists in minimizing the activation of radio interfaces and switching between them in order to achieve very low duty-cycle. In this paper, we propose a new efficient communication architecture for patient supervision in the context of healthcare application making use of dual radio. At runtime, our solution determines the optimal interval parameters of switching on/off each radio interfaces in order to minimize the energy consumption of both sensors and mobile phones while satisfying the QoS requirements. The proposed solution is adequately analyzed and numerically compared against a solution without QoS. The results show that our proposed architecture exhibits better duty-cycle reduction while satisfying the delay constraints.
  • Thumbnail Image
    Item
    Energy-Delay Constrained Minimal Relay Placement in Low Duty-Cycled Sensor Networks Under Anycast Forwarding
    (IEEE, 2016-09-04) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Garcia-Vidal, Jorge
    A constrained relay placement problem satisfying application requirements in terms of network lifetime and end-to-end (e2e) delay in Wireless Sensor Networks (WSN) is investigated in this paper. The network and the traffic are adequately modeled considering uniform node deployment and low data rate periodic traffic generation. An optimization problem is defined to obtain the minimum number of relays to be deployed, at each level of the network, in order to fulfil network duty-cycle and e2e delay constraints under anycast forwarding based on the wakeup period parameter of the duty-cycle MAC protocol. Since the optimization problem is non-convex, an alternative and efficient algorithm for relay node placement called EDC-RP (Energy-Delay Constrained Relay Placement) is introduced. The comparison of the proposed node deployment strategy with state-of-the-art relay placement methods demonstrates the gain of the heuristic in terms of deployment cost (number of relays) over other solutions while fulfilling the application constraints.
  • 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
  • Thumbnail Image
    Item
    Game Theory Framework for MAC Parameter Optimization in Energy-Delay Constrained Sensor Networks
    (ACM, 2016-05-15) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Djenouri, Djamel; Garcia-Vidal, Jorge; Bouabdallah, Abdelmadjid; Badache, Nadjib
    Optimizing energy consumption and end-to-end (e2e) packet delay in energy-constrained, delay-sensitive wireless sensor networks is a conflicting multi-objective optimization problem. We investigate the problem from a game theory perspective, where the two optimization objectives are considered as game players. The cost model of each player is mapped through a generalized optimization framework onto protocol specific MAC parameters. From the optimization framework, a game is first defined by the Nash Bargaining Solution (NBS) to assure energy-consumption and e2e delay balancing. Secondly, the Kalai-Smorodinsky Bargaining Solution (KSBS) is used to find equal proportion of gain between players. Both methods offer a bargaining solution to the duty-cycle MAC protocol under different axioms. As a result, given the two performance requirements, i.e., the maximum latency tolerated by the application and the initial energy budget of nodes, the proposed framework allows to set tunable system parameters to reach a fair equilibrium point which dually minimizes the system latency and energy consumption. For illustration, this formulation is applied to six state-of-the-art Wireless Sensor Network (WSN) MAC protocols; B-MAC, X-MAC, RI-MAC, SMAC, DMAC, and LMAC. The paper shows the effectiveness and scalability of such framework in optimizing protocol parameters that achieve a fair energy-delay performance trade-off under the application requirements.
  • Thumbnail Image
    Item
    Energy-Delay Constrained Minimal Relay Placement in Low Duty-Cycled Sensor Networks Under Anycast Forwarding
    (CERIST, 2016-06) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Garcia-Vidal, Jorge
    A constrained relay placement problem satisfying application requirements in terms of network lifetime and end-to-end (e2e) delay in Wireless Sensor Networks (WSN) is investigated in this paper. The network and the traffic are adequately modeled considering uniform node deployment and low data rate periodic traffic generation. An optimization problem is defined to obtain the minimum number of relays to be deployed, at each level of the network, in order to fulfil network duty-cycle and e2e delay constraints under anycast forwarding based on the wake-up period parameter of the duty-cycle MAC protocol. Since the optimization problem is non-convex, an alternative and efficient algorithm for relay node placement called EDC-RP (Energy-Delay Constrained Relay Placement) is introduced. The comparison of the proposed node deployment strategy with state-of-the-art relay placement methods demonstrates the gain of the heuristic in terms of deployment cost (number of relays) over other solutions while fulfilling the application constraints.
  • Thumbnail Image
    Item
    Modified Elastic Routing to support Sink Mobility Characteristics in Wireless Sensor Networks
    (CERIST, 2015-04-12) Benkhelifa, Imane; Belmouloud, Nassim; Moussaoui, Tabia
    This paper presents improvements for the geographic routing protocol Elastic so to support the different sink mobility characteristics. We have proposed a strategy to support multiple mobile sinks; tested Elastic under high speeds of the mobile sink; proposed two strategies in case of the sink temporary absence and finally proposed to predict the sink location by the source node and then by all the nodes. Simulation results show that our propositions improve much the delivery ratio and reduce the delivery delay.
  • Thumbnail Image
    Item
    Performance Analysis of Sinks Mobility in Geographic Routing for Wireless Sensor Networks
    (CERIST, 2015-04-12) Benkhelifa, Imane; Belmouloud, Nassim; Tabia, Yasmina; Moussaoui, Samira
    This paper presents a performance analysis of sinks mobility in geographic routing based on performance evaluation of two geographic routing protocols namely GPSR with static sinks and Elastic with mobile sinks. Among the scenarios, we observe also the impact of using multi-mobile-sinks, in addition to the effect of mobility model through changing the sink’s trajectory and speed. We analyze the performance results by calculating the delivery ratio of the transmitted packets, as well as the average delay of transmission and the number of hops necessary to transmit successfully a packet from the source to the sink. We show that mobile sinks can play a major role in prolonging the network lifetime and the efficiency of a geographic routing protocol.