Self organization of sensor networks for energy-efficient border coverage

Abstract

Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.Index Terms: Ad-hoc and sensor networks, border coverage, energy savings, intrusion detection, optimal deployment, self organization, surveillance, three dimensional (3D) modeling.

A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application

“…Mobile robots were brought into WSNs to provide a wide range of value-added services during the operational lifetime of the networks [17]. In the WSRN, a robot, or a group of robots, is designed to maintain, assist, or optimize the sensor network.…”

A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application

“…Mobile robots were brought into WSNs to provide a wide range of value-added services during the operational lifetime of the networks [17]. In the WSRN, a robot, or a group of robots, is designed to maintain, assist, or optimize the sensor network.…”

A Sampling-Based Approach for Achieving Desired Patterns of Probabilistic Coverage with Distributed Sensor Networks

“…To maintain performance along the line, regular motion of the sensors in order to reconfigure the locations is a desired feature. Such motion patterns have been developed as moving from the interior of a domain to the barrier [23], as a control problem along the line [24], and as a self-organizing principle for independent agents [25]. These various motion approaches all revolve around the same goal of reconfiguration to handle changes in either the sensors or the environment.…”

A Mobile Anchor Node Positioning Algorithm for WSN in Three-dimensional Space

“…WSN usually demands a large amount of distributed computing while nodes are relatively simple. For node's performance is limited by energy [4][5] ,volume and the network cost, WSN is only equipped with GPS equipment on a smart part of nodes to obtain their positional coordinates which called anchor nodes. Most nodes must obtain their locational information through special positioning algorithm.…”

A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application

“…Mobile robots were brought into WSNs to provide a wide range of value-added services during the operational lifetime of the networks [17]. In the WSRN, a robot, or a group of robots, is designed to maintain, assist, or optimize the sensor network.…”

A Sampling-Based Approach for Achieving Desired Patterns of Probabilistic Coverage with Distributed Sensor Networks

“…To maintain performance along the line, regular motion of the sensors in order to reconfigure the locations is a desired feature. Such motion patterns have been developed as moving from the interior of a domain to the barrier [23], as a control problem along the line [24], and as a self-organizing principle for independent agents [25]. These various motion approaches all revolve around the same goal of reconfiguration to handle changes in either the sensors or the environment.…”

A Mobile Anchor Node Positioning Algorithm for WSN in Three-dimensional Space

“…WSN usually demands a large amount of distributed computing while nodes are relatively simple. For node's performance is limited by energy [4][5] ,volume and the network cost, WSN is only equipped with GPS equipment on a smart part of nodes to obtain their positional coordinates which called anchor nodes. Most nodes must obtain their locational information through special positioning algorithm.…”

A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application

“…Mobile robots were brought into WSNs to provide a wide range of value-added services during the operational lifetime of the networks [17]. In the WSRN, a robot, or a group of robots, is designed to maintain, assist, or optimize the sensor network.…”

A Sampling-Based Approach for Achieving Desired Patterns of Probabilistic Coverage with Distributed Sensor Networks

“…To maintain performance along the line, regular motion of the sensors in order to reconfigure the locations is a desired feature. Such motion patterns have been developed as moving from the interior of a domain to the barrier [23], as a control problem along the line [24], and as a self-organizing principle for independent agents [25]. These various motion approaches all revolve around the same goal of reconfiguration to handle changes in either the sensors or the environment.…”

A Mobile Anchor Node Positioning Algorithm for WSN in Three-dimensional Space

“…WSN usually demands a large amount of distributed computing while nodes are relatively simple. For node's performance is limited by energy [4][5] ,volume and the network cost, WSN is only equipped with GPS equipment on a smart part of nodes to obtain their positional coordinates which called anchor nodes. Most nodes must obtain their locational information through special positioning algorithm.…”