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

Re-evaluating coverage metrics for wireless sensor network border security applications

Wireless sensor networks are an emerging technology used to monitor an environment over time. One specific application of the wireless sensor network is the border security application. Researchers have adapted coverage metrics from general wireless sensor network literature to fit the border security application. While some of the adapted metrics count the number of sensors detecting a potential target, others measure the distance between a potential target and its nearest sensor. No existing metric accounts for both of these factors. To take advantage of this gap and to attempt to increase the accuracy to which coverage is measured in this application, we created the total intersected length metric. To test the adapted metrics in comparison to our new metric, we created a MATLAB program to simulate a wireless sensor network over time as its sensors fail and its coverage degrades. Through experimentation with this model on a notional data set, we can conclude that the total intersected length metric used for measuring network coverage for border security WSN applications has both advantages and disadvantages when compared to traditional coverage metrics. The new metric was found to be advantageous for effectively capturing the initial coverage of a network and for determining when a network is no longer sufficiently covered while it was found to be disadvantageous for conservatively capturing network degradation and for producing quick computation times

Enabling Cyber Physical Systems with Wireless Sensor Networking Technologies

[[abstract]]Over the last few years, we have witnessed a growing interest in Cyber Physical Systems (CPSs) that rely on a strong synergy between computational and physical components. CPSs are expected to have a tremendous impact on many critical sectors (such as energy, manufacturing, healthcare, transportation, aerospace, etc) of the economy. CPSs have the ability to transform the way human-to-human, human-toobject, and object-to-object interactions take place in the physical and virtual worlds. The increasing pervasiveness of Wireless Sensor Networking (WSN) technologies in many applications make them an important component of emerging CPS designs. We present some of the most important design requirements of CPS architectures. We discuss key sensor network characteristics that can be leveraged in CPS designs. In addition, we also review a few well-known CPS application domains that depend on WSNs in their design architectures and implementations. Finally, we present some of the challenges that still need to be addressed to enable seamless integration of WSN with CPS designs.[[incitationindex]]SCI[[booktype]]紙

Wireless Sensor Network Deployment

Wireless Sensor Networks (WSNs) are widely used for various civilian and military applications, and thus have attracted significant interest in recent years. This work investigates the important problem of optimal deployment of WSNs in terms of coverage and energy consumption. Five deployment algorithms are developed for maximal sensing range and minimal energy consumption in order to provide optimal sensing coverage and maximum lifetime. Also, all developed algorithms include self-healing capabilities in order to restore the operation of WSNs after a number of nodes have become inoperative. Two centralized optimization algorithms are developed, one based on Genetic Algorithms (GAs) and one based on Particle Swarm Optimization (PSO). Both optimization algorithms use powerful central nodes to calculate and obtain the global optimum outcomes. The GA is used to determine the optimal tradeoff between network coverage and overall distance travelled by fixed range sensors. The PSO algorithm is used to ensure 100% network coverage and minimize the energy consumed by mobile and range-adjustable sensors. Up to 30% - 90% energy savings can be provided in different scenarios by using the developed optimization algorithms thereby extending the lifetime of the sensor by 1.4 to 10 times. Three distributed optimization algorithms are also developed to relocate the sensors and optimize the coverage of networks with more stringent design and cost constraints. Each algorithm is cooperatively executed by all sensors to achieve better coverage. Two of our algorithms use the relative positions between sensors to optimize the coverage and energy savings. They provide 20% to 25% more energy savings than existing solutions. Our third algorithm is developed for networks without self-localization capabilities and supports the optimal deployment of such networks without requiring the use of expensive geolocation hardware or energy consuming localization algorithms. This is important for indoor monitoring applications since current localization algorithms cannot provide good accuracy for sensor relocation algorithms in such indoor environments. Also, no sensor redeployment algorithms, which can operate without self-localization systems, developed before our work

Deployment Policies to Reliably Maintain and Maximize Expected Coverage in a Wireless Sensor Network

The long-term operation of a wireless sensor network (WSN) requires the deployment of new sensors over time to restore any loss in network coverage and communication ability resulting from sensor failures. Over the course of several deployment actions it is important to consider the cost of maintaining the WSN in addition to any desired performance measures such as coverage, connectivity, or reliability. The resulting problem formulation is approached first through a time-based deployment model in which the network is restored to a fixed size at periodic time intervals. The network destruction spectrum (D-spectrum) has been introduced to estimate reliability and is more commonly applied to a static network, rather than a dynamic network where new sensors are deployed over time. We discuss how the D-spectrum can be incorporated to estimate reliability of a time-based deployment policy and the features that allow a wide range of deployment policies to be evaluated in an efficient manner. We next focus on a myopic condition-based deployment model where the network is observed at periodic time intervals and a fixed budget is available to deploy new sensors with each observation. With a limited budget available the model must address the complexity present in a dynamic network size in addition to a dynamic network topology, and the dependence of network reliability on the deployment action. We discuss how the D-spectrum can be applied to the myopic condition-based deployment problem, illustrating the value of the D-spectrum in a variety of maintenance settings beyond the traditional static network reliability problem. From the insight of the time-based and myopic condition-based deployment models, we present a Markov decision process (MDP) model for the condition-based deployment problem that captures the benefit of an action beyond the current time period. Methodology related to approximate dynamic programming (ADP) and approximate value iteration algorithms is presented to search for high quality deployment policies. In addition to the time-based and myopic condition-based deployment models, the MDP model is one of the few addressing the repeated deployment of new sensors as well as an emphasis on network reliability. For each model we discuss the relevant problem formulation, methodology to estimate network reliability, and demonstrate the performance in a range of test instances, comparing to alternative policies or models as appropriate. We conclude with a stochastic optimization model focused on a slightly different objective to maximize expected coverage with uncertainty in where a sensor lands in the network. We discuss a heuristic solution method that seeks to determine an optimal deployment of sensors, present results for a wide range of network sizes and explore the impact of sensor failures on both the model formulation and resulting deployment policy

Surveillance of sensitive fenced areas using duty-cycled wireless sensor networks with asymmetrical links

© 2018 Elsevier Ltd. This paper presents a cross-layer communication protocol for Wireless Sensor Network (WSN) enabled surveillance system for sensitive fenced areas, e.g., nuclear/oil site. Initially, the proposed protocol identifies the boundary nodes of the deployed WSN to be used as sentinel nodes, i.e., nodes that are always in active state. The remaining nodes are used as duty-cycled relay nodes during the data communication phase. The boundary nodes identification process and data routing are both performed using an enhanced version of the Greedy Perimeter Stateless Routing (GPSR) protocol, which relies on a Non Unit Disk Graph (N-UDG) and referred to as GPSR over Symmetrical Links (GPSR-SL). Both greedy and perimeter modes of GPSR-SL forward data through symmetrical links only. Moreover, we apply the Mutual Witness (MW) fix to the Gabriel Graph (GG) planarization, to enable a correct perimeter routing on a N-UDG. Simulation results show that the proposed protocol achieves higher packet delive ry ratio by up to 3.63%, energy efficiency and satisfactory latency when compared to the same protocol based on the original GPSR

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks

Abstract-Network lifetime is a crucial performance metric to evaluate data-gathering wireless sensor networks (WSNs) where battery-powered sensor nodes periodically sense the environment and forward collected samples to a sink node. In this paper, we propose an analytic model to estimate the entire network lifetime from network initialization until it is completely disabled, and determine the boundary of energy hole in a data-gathering WSN. Specifically, we theoretically estimate the traffic load, energy consumption, and lifetime of sensor nodes during the entire network lifetime. Furthermore, we investigate the temporal and spatial evolution of energy hole, and apply our analytical results to WSN routing in order to balance the energy consumption and improve the network lifetime. Extensive simulation results are provided to demonstrate the validity of the proposed analytic model in estimating the network lifetime and energy hole evolution process. Index Terms-wireless sensor network, network lifetime, energy hole, energy efficiency, routing