System architecture directions for networked sensors
ACM SIGPLAN Notices
Approximation algorithms
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Greedy Fair Queueing: A Goal-Oriented Strategy for Fair Real-Time Packet Scheduling
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
On achieving software diversity for improved network security using distributed coloring algorithms
Proceedings of the 11th ACM conference on Computer and communications security
Distributed self-stabilizing placement of replicated resources in emerging networks
IEEE/ACM Transactions on Networking (TON)
Localized topology control algorithms for heterogeneous wireless networks
IEEE/ACM Transactions on Networking (TON)
Near-optimal sensor placements: maximizing information while minimizing communication cost
Proceedings of the 5th international conference on Information processing in sensor networks
Redundancy and coverage detection in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Decentralized energy-conserving and coverage-preserving protocols for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
The coverage problem in a wireless sensor network
Mobile Networks and Applications
Coverage and connectivity in three-dimensional networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Exact distributed Voronoi cell computation in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Censor networks: a critique of "sensor networks" from a systems perspective
ACM SIGCOMM Computer Communication Review
Localized Sensor Area Coverage with Low Communication Overhead
IEEE Transactions on Mobile Computing
Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage
IEEE Transactions on Parallel and Distributed Systems
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
Object replication strategies in content distribution networks
Computer Communications
IEEE Communications Magazine
Hi-index | 0.00 |
This paper considers the class of applications of sensor networks in which each sensor node makes measurements, such as temperature or humidity, at the precise location of the node. Such spot-sensing applications approximate the physical condition of the entire region of interest by the measurements made at only the points where the sensor nodes are located. Given a certain density of nodes in a region, a more spatially uniform distribution of the nodes leads to a better approximation of the physical condition of the region in the sensed data. This paper considers the error in this approximation and seeks to improve the quality of representation of the physical condition of the points in the region in the data collected by the sensor network. We develop two essential metrics which together allow a rigorous quantitative assessment of the quality of representation achieved: the average representation error and the unevenness of representation error, the latter based on a well-accepted measure of inequality used in economics. We present the rationale behind the use of these metrics and derive relevant theoretical bounds on them in the common scenario of a planar region of arbitrary shape covered by a sensor network deployment. A simple new heuristic algorithm is presented for each node to determine if and when it should sense or sleep to conserve energy while also preserving the quality of representation. Simulation results show that it achieves a significant improvement in the quality of representation compared to other related distributed algorithms. Interestingly, our results also show that improved and consistent spatial uniformity has the welcome side-effect of a significant increase in the network lifetime.