Discrete Mathematics - Topics on domination
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Kinetic data structures
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
An energy efficient and self-healing 3-dimensional sensor cover
International Journal of Ad Hoc and Ubiquitous Computing
Maximizing the number of obnoxious facilities to locate within a bounded region
Computers and Operations Research
Efficient computation of minimum exposure paths in a sensor network field
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Approximation algorithms for computing minimum exposure paths in a sensor field
ACM Transactions on Sensor Networks (TOSN)
Prediction-based clustering algorithm for mobile wireless sensor networks
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
The euclidean bottleneck steiner path problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
| Hi-index | 0.00 |
Ad-hoc networks of sensor nodes are in general semi-permanentlydeployed. However, the topology of such networks continuouslychanges over time, due to the power of some sensors wearing out, tonew sensors being inserted into the network, or even due todesigners moving sensors around during a network re-design phase(for example, in response to a change in the requirements of thenetwork). In this paper, we address the problem of how todynamically maintain two important measures on the quality of thecoverage of a sensor network: the best-case coverage and worst-casecoverage distances. We assume that the ratio between upper andlower transmission power of sensors is bounded by a polynomial ofn, where n is the number of sensors, and that themotion of mobile sensors can be described as a low-degreepolynomial function of time. We maintain a (1 +Ã)-approximation on the best-case coverage distance and a(ã2 + Ã)-approximation on the worst-case coveragedistance of the network, for any fixed à 0. Ouralgorithms have amortized or worst-case poly-logarithmic updatecosts. We are able to efficiently maintain the connectivity of theregions on the plane with respect to the sensor network, byextending the concatenable queue data structure to also serve as apriority queue. In addition, we present an algorithm that finds theshortest maximum support path in time O(n log n).