Probabilistic Dynamic Deployment of Wireless Sensor Networks by Artificial Bee Colony Algorithm

As the usage and development of wireless sensor networks are increasing, the problems related to these networks are being realized. Dynamic deployment is one of the main topics that directly affect the performance of the wireless sensor networks. In this paper, the artificial bee colony algorithm is applied to the dynamic deployment of stationary and mobile sensor networks to achieve better performance by trying to increase the coverage area of the network. A probabilistic detection model is considered to obtain more realistic results while computing the effectively covered area. Performance of the algorithm is compared with that of the particle swarm optimization algorithm, which is also a swarm based optimization technique and formerly used in wireless sensor network deployment. Results show artificial bee colony algorithm can be preferable in the dynamic deployment of wireless sensor networks

OFRD:Obstacle-Free Robot Deployment Algorithms for Wireless Sensor Networks

[[abstract]]Node deployment is an important issue in wireless sensor networks (WSNs). Sensor nodes should be efficiently deployed in a predetermined region in a low cost and high coverage quality manner. Random deployment is the simplest way for deploying sensor nodes but may cause the unbalanced deployment and therefore increase the hardware cost. This paper presents an efficient obstacle-free robot deployment algorithm, called OFRD which involves the design of node placement policy, snake-like movement policy, and obstacle handling rules. By applying the proposed OFRD, the robot rapidly deploys near-minimal number of sensor nodes to achieve full sensing coverage even though there exist unpredicted obstacles. Performance results reveal that OFRD outperforms the existing robot deployment mechanism in terms of power conservation and obstacle resistance, and, therefore achieves a better deployment performance.[[incitationindex]]Y[[conferencetype]]國際[[conferencedate]]20070311~20070315[[conferencelocation]]Kowloon, Hong Kon

Relocating sensor nodes to maximize cumulative connected coverage in wireless sensor networks

PubMed ID: 27879850In order to extend the availability of the wireless sensor network and to extract maximum possible information from the surveillance area, proper usage of the power capacity of the sensor nodes is important. Our work describes a dynamic relocation algorithm called MaxNetLife, which is mainly based on utilizing the remaining power of individual sensor nodes as well as properly relocating sensor nodes so that all sensor nodes can transmit the data they sense to the sink. Hence, the algorithm maximizes total collected information from the surveillance area before the possible death of the sensor network by increasing cumulative connected coverage parameter of the network. A deterministic approach is used to deploy sensor nodes into the sensor field where Hexagonal Grid positioning is used to address and locate each sensor node. Sensor nodes those are not planned to be actively used in the close future in a specific cell are preemptively relocated to the cells those will be in need of additional sensor nodes to improve cumulative connected coverage of the network. MaxNetLife algorithm also includes the details of the relocation activities, which include preemptive migration of the redundant nodes to the cells before any coverage hole occurs because of death of a sensor node. Relocation Model, Data Aggregation Model, and Energy model of the algorithm are studied in detail. MaxNetLife algorithm is proved to be effective, scalable, and applicable through simulations.Publisher's Versio

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

Optimal sensor placement for sewer capacity risk management

2019 Spring.Includes bibliographical references.Complex linear assets, such as those found in transportation and utilities, are vital to economies, and in some cases, to public health. Wastewater collection systems in the United States are vital to both. Yet effective approaches to remediating failures in these systems remains an unresolved shortfall for system operators. This shortfall is evident in the estimated 850 billion gallons of untreated sewage that escapes combined sewer pipes each year (US EPA 2004a) and the estimated 40,000 sanitary sewer overflows and 400,000 backups of untreated sewage into basements (US EPA 2001). Failures in wastewater collection systems can be prevented if they can be detected in time to apply intervention strategies such as pipe maintenance, repair, or rehabilitation. This is the essence of a risk management process. The International Council on Systems Engineering recommends that risks be prioritized as a function of severity and occurrence and that criteria be established for acceptable and unacceptable risks (INCOSE 2007). A significant impediment to applying generally accepted risk models to wastewater collection systems is the difficulty of quantifying risk likelihoods. These difficulties stem from the size and complexity of the systems, the lack of data and statistics characterizing the distribution of risk, the high cost of evaluating even a small number of components, and the lack of methods to quantify risk. This research investigates new methods to assess risk likelihood of failure through a novel approach to placement of sensors in wastewater collection systems. The hypothesis is that iterative movement of water level sensors, directed by a specialized metaheuristic search technique, can improve the efficiency of discovering locations of unacceptable risk. An agent-based simulation is constructed to validate the performance of this technique along with testing its sensitivity to varying environments. The results demonstrated that a multi-phase search strategy, with a varying number of sensors deployed in each phase, could efficiently discover locations of unacceptable risk that could be managed via a perpetual monitoring, analysis, and remediation process. A number of promising well-defined future research opportunities also emerged from the performance of this research

Self-organization and management of wireless sensor networks

Wireless sensor networks (WSNs) are a newly deployed networking technology consisting of multifunctional sensor nodes that are small in size and communicate over short distances. These sensor nodes are mainly in large numbers and are densely deployed either inside the phenomenon or very close to it. They can be used for various application areas (e.g. health, military, home). WSNs provide several advantages over traditional networks, such as large-scale deployment, highresolution sensed data, and application adaptive mechanisms. However, due to their unique characteristics (having dynamic topology, ad-hoc and unattended deployment, huge amount of data generation and traffic flow, limited bandwidth and energy), WSNs pose considerable challenges for network management and make application development nontrivial. Management of wireless sensor networks is extremely important in order to keep the whole network and application work properly and continuously. Despite the importance of sensor network management, there is no generalize solution available for managing and controlling these resource constrained WSNs. In network management of WSNs, energy-efficient network selforganization is one of the main challenging issues. Self-organization is the property which the sensor nodes must have to organize themselves to form the network. Selforganization of WSNs is challenging because of the tight constraints on the bandwidth and energy resources available in these networks. A self organized sensor network can be clustered or grouped into an easily manageable network. However, existing clustering schemes offer various limitations. For example, existing clustering schemes consume too much energy in cluster formation and re-formation. This thesis presents a novel cellular self-organizing hierarchical architecture for wireless sensor networks. The cellular architecture extends the network life time by efficiently utilizing nodes energy and support the scalability of the system. We have analyzed the performance of the architecture analytically and by simulations. The results obtained from simulation have shown that our cellular architecture is more energy efficient and achieves better energy consumption distribution. The cellular architecture is then mapped into a management framework to support the network management system for resource constraints WSNs. The management framework is self-managing and robust to changes in the network. It is application-co-operative and optimizes itself to support the unique requirements of each application. The management framework consists of three core functional areas i.e., configuration management, fault management, and mobility management. For configuration management, we have developed a re-configuration algorithm to support sensor networks to energy-efficiently re-form the network topology due to network dynamics i.e. node dying, node power on and off, new node joining the network and cells merging. In the area of fault management we have developed a new fault management mechanism to detect failing nodes and recover the connectivity in WSNs. For mobility management, we have developed a two phase sensor relocation solution: redundant mobile sensors are first identified and then relocated to the target location to deal with coverage holes. All the three functional areas have been evaluated and compared against existing solutions. Evaluation results show a significant improvement in terms of re-configuration, failure detection and recovery, and sensors relocation