The Deployment in the Wireless Sensor Networks: Methodologies, Recent Works and Applications

International audienceThe wireless sensor networks (WSN) is a research area in continuous evolution with a variety of application contexts. Wireless sensor networks pose many optimization problems, particularly because sensors have limited capacity in terms of energy, processing and memory. The deployment of sensor nodes is a critical phase that significantly affects the functioning and performance of the network. Often, the sensors constituting the network cannot be accurately positioned, and are scattered erratically. To compensate the randomness character of their placement, a large number of sensors is typically deployed, which also helps to increase the fault tolerance of the network. In this paper, we are interested in studying the positioning and placement of sensor nodes in a WSN. First, we introduce the problem of deployment and then we present the latest research works about the different proposed methods to solve this problem. Finally, we mention some similar issues related to the deployment and some of its interesting applications

Assisted Navigation Algorithm for Wireless Sensor Actuator and Robot Networks

Wireless Sensor, Actuator and Robot Networks (WSARNs) are made of mobile and static sensor nodes that interact in order to collaboratively perform specific tasks, such as supporting assisted navigation for mobile robotic nodes that carry out requested operations in hostile environments, where the human presence is impracticable. In this regard, it is worth noting that assisted navigation algorithms have a highly dynamic nature, and are implemented by sensor nodes that are characterized by limited transmission power and lean autonomy in terms of computing and memory capacity. This paper presents an improved version of the assisted navigation algorithm based on the concept of “credit field”. The main aim of the proposed algorithm is to reduce and balance the energy consumption among the static sensor nodes when running the algorithm to manage the presence of obstacles and adversary areas, thus extending the lifetime of WSARNs. The algorithm has been tested on a hybrid sensor network that employs Mica2 Motes as static sensor nodes and Lego Mindstorms robots integrated with a Stargate board developed by Crossbow as mobile nodes

A Survey on Rapidly Deployable Solutions for Post-disaster Networks

International audienceIn post-disaster scenarios, for example, after earthquakes or floods, the traditional communication infrastructure may be unavailable or seriously disrupted and overloaded. Therefore, rapidly deployable network solutions are needed to restore connectivity and provide assistance to users and first responders in the incident area. This work surveys the solutions proposed to address the deployment of a network without any a priori knowledge about the communication environment for critical communications. The design of such a network should also allow for quick, flexible, scalable, and resilient deployment with minimal human intervention

Survey of Deployment Algorithms in Wireless Sensor Networks: Coverage and Connectivity Issues and Challenges

International audienceWireless Sensor Networks (WSNs) have many fields of application, including industrial, environmental, military, health and home domains. Monitoring a given zone is one of the main goals of this technology. This consists in deploying sensor nodes in order to detect any event occurring in the zone of interest considered and report this event to the sink. The monitoring task can vary depending on the application domain concerned. In the industrial domain, the fast and easy deployment of wireless sensor nodes allows a better monitoring of the area of interest in temporary worksites. This deployment must be able to cope with obstacles and be energy efficient in order to maximize the network lifetime. If the deployment is made after a disaster, it will operate in an unfriendly environment that is discovered dynamically. We present a survey that focuses on two major issues in WSNs: coverage and connectivity. We motivate our study by giving different use cases corresponding to different coverage, connectivity, latency and robustness requirements of the applications considered. We present a general and detailed analysis of deployment problems, while highlighting the impacting factors, the common assumptions and models adopted in the literature, as well as performance criteria for evaluation purposes. Different deployment algorithms for area, barrier, and points of interest are studied and classified according to their characteristics and properties. Several recapitulative tables illustrate and summarize our study. The designer in charge of setting up such a network will find some useful recommendations, as well as some pitfalls to avoid. Before concluding, we look at current trends and discuss some open issues

On attack-resilient wireless sensor networks with novel recovery strategies

proceedings of the IEEE Wireless Communications and Networking Conference, 2009, p. 1-6In a wireless sensor network (WSN), when an adversary physically captures one or more sensor nodes, all the information stored on these nodes may be exposed completely. Consequently, the adversary can use the information to attack the remaining part of the network. In this paper, we investigate the effects of different node capture attack patterns on state-ofthe-art key management schemes. We find that a compromised WSN can be made resilient to such attacks by introducing new resources, such as new nodes and new keys. Based on this observation, we propose two recovering strategies, namely, link replacement strategy and node replenishment strategy, to replace the compromised links and the functions of the compromised region, respectively. Simulation results indicate that our proposed strategies can improve the network resilience of a compromised WSN significantly with a small amount of additional resources. ©2009 IEEE.published_or_final_versio

Novel Approach using Robust Routing Protocol in Underwater Acoustic Wireless Sensor Network with Network Simulator 2: A Review

In recent year wireless sensor network has been an emerging technology and promising technology in unveiling the riddle of the marine life and other underwater applications. As it is a permutation of computation, sensing and communication. In the 70% of the earth a huge amount of unexploited resources lies covered by oceans. To coordinate interact and share information among themselves to carry out sensing and monitoring function underwater sensor network consists number of various sensors and autonomous underwater vehicles deployed underwater. The two most fundamental problems in underwater sensor network are sensing coverage and network connectivity. The coverage problem reflects how well a sensor network is tracked or monitored by sensors. An underwater wireless sensor networks is the emerging field that is having the challenges in each field such as the deployment of nodes, routing, floating movement of sensors etc. This paper is concerned about the underwater acoustic wireless sensor network of routing protocol applications and UW-ASNs deployments for monitoring and control of underwater domains

Uneven key predistribution scheme for multiphase wireless sensor networks

In multiphase Wireless Sensor Networks (WSNs), sensor nodes are redeployed periodically to replace nodes with depleted batteries. In order to keep the network resilient against node capture attacks across different deployment epochs, called generations, it is necessary to refresh the key pools from which cryptographic keys are distributed. In this thesis, we propose Uneven Key Predistribution (UKP) scheme that uses multiple different key pools at each generation. Keys are drawn unevenly from these key pools and loaded to sensor nodes prior to deployment. Nodes are loaded with keys not only from their current generation, but also from future generations. We conduct simulation based performance evaluation in mobile environments using three different mobility models. One of them, Circular Move Mobility model, is first proposed in this thesis. Our UKP scheme provides self healing that improves the resiliency of the network up to 50% under heavy attack as compared to an existing scheme in the literature. Moreover, our scheme provides almost perfect local and global connectivity