Event-driven sensor deployment using self-organizing maps
Coverage is an important optimization objective in pre and post-deployment stage of a Wireless Sensor Network (WSN). In this paper, we address the issue of placing a finite set of sensors to cover an area of arbitrary geometry. Unlike many existing ...
Coverage and latency aware actor placement mechanisms in WSANs
In Wireless Sensor and Actor Networks (WSANs), responsiveness to serious events is of utmost importance and thus, minimal latency should be experienced. In addition, since these actions can be taken at any spot within the monitored area, the actors ...
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them at selected sites. We want to find a sensor arrangement to achieve the ...
Improved n 1-cover discovery using perimeter coverage information
Over-deploying sensors into a coverage region allows for coverage guarantees in the face of random deployments. Extending the lifetime of these deployments by only turning on a handful of sensors that cover the entire region is a viable means of ...
Coverage problems in wireless sensor networks: designs and analysis
One fundamental problem in wireless sensor networks is the coverage problem, which reflects the quality of service that can be provided by a particular sensor network. The coverage problem is defined from several points of view due to a variety of ...
Energy-efficient connected-coverage in wireless sensor networks
This paper addresses the target coverage problem inWireless Sensor Networks (WSNs). Communication and sensing consume energy, therefore, efficient power management can extend network lifetime. In this paper, we consider a large number of sensors ...