An Energy Efficient Self-healing Mechanism for Long Life Wireless Sensor Networks

In this paper, we provide an energy efficient self- healing mechanism for Wireless Sensor Networks. The proposed solution is based on our probabilistic sentinel scheme. To reduce energy consumption while maintaining good connectivity between sentinel nodes, we compose our solution on two main concepts, node adaptation and link adaptation. The first algorithm uses node adaptation technique and permits to distributively schedule nodes activities and select a minimum subset of active nodes (sentry) to monitor the interest region. And secondly, we in- troduce a link control algorithm to ensure better connectiv- ity between sentinel nodes while avoiding outliers appearance. Without increasing control messages overhead, performances evaluations show that our solution is scalable with a steady energy consumption. Simulations carried out also show that the proposed mechanism ensures good connectivity between sentry nodes while considerably reducing the total energy spent.Comment: 6 pages, 8 figures. arXiv admin note: text overlap with arXiv:1309.600

Application of Wireless Sensor Networks for Indoor Temperature Regulation

International audienceWireless sensor networks take a major part in our everyday lives by enhancing systems for home automation, healthcare, temperature control, energy consumption monitoring, and so forth. In this paper we focus on a system used for temperature regulation for residential, educational, industrial, and commercial premises, and so forth. We propose a framework for indoor temperature regulation and optimization using wireless sensor networks based on ZigBee platform. This paper considers architectural design of the system, as well as implementation guidelines. The proposed system favors methods that provide energy savings by reducing the amount of data transmissions through the network. Furthermore, the framework explores techniques for localization, such that the location of the nodes can be used by algorithms that regulate temperature settings

Modeling induction and routing to monitor hospitalized patients in multi-hop mobility-aware body area sensor networks

In wireless body area sensor networks (WBASNs), energy efficiency is an area of extreme significance. At first, we present a mathematical model for a non-invasive inductive link which is used to recharge the battery of an implanted biomedical device (pacemaker). Afterwards, we propose a distance-aware relaying energy-efficient (DARE) and mutual information-based DARE (MI-DARE) routing protocols for multihop mobility-aware body area sensor networks (MM-BASNs). Both the routing protocols and the non-invasive inductive link model are tested with the consideration of eight patients in a hospital unit under different topologies, where the vital signs of each patient are monitored through seven on-body sensors and an implanted pacemaker. To reduce energy consumption of the network, the sensors communicate with a sink via an on-body relay which is fixed on the chest of each patient. The behavior (static/mobile) and position of the sink are changed in each topology, and the impact of mobility due to postural changes of the patient(s) arms, legs, and head is also investigated. The MI-DARE protocol further prolongs the network lifetime by minimizing the number of transmissions. Simulation results show that the proposed techniques outperform contemporary schemes in terms of the selected performance metrics. © 2016, Javaid et al

Self-Stabilizing Distributed Cooperative Reset

Self-stabilization is a versatile fault-tolerance approach that characterizes the ability of a system to eventually resume a correct behavior after any finite number of transient faults. In this paper, we propose a self-stabilizing reset algorithm working in anonymous networks. This algorithm resets the network in a distributed non-centralized manner, i.e., it is multi-initiator, as each process detecting an inconsistency may initiate a reset. It is also cooperative in the sense that it coordinates concurrent reset executions in order to gain efficiency. Our approach is general since our reset algorithm allows to build self-stabilizing solutions for various problems and settings. As a matter of facts, we show that it applies to both static and dynamic specifications since we propose efficient self-stabilizing reset-based algorithms for the (1-minimal) (f, g)-alliance (a generalization of the dominating set problem) in identified networks and the unison problem in anonymous networks. Notice that these two latter instantiations enhance the state of the art. Indeed, in the former case, our solution is more general than the previous ones, while in the latter case, the complexity of our unison algorithm is better than that of previous solutions of the literature