Distributed computing: models and methods
Handbook of theoretical computer science (vol. B)
Parallel Architectures and Algorithms for Image Component Labeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Supporting Topographic Queries in a Class of Networked Sensor Systems
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
State-Centric Programming for Sensor-Actuator Network Systems
IEEE Pervasive Computing
Vineyard Computing: Sensor Networks in Agricultural Production
IEEE Pervasive Computing
Beyond average: toward sophisticated sensing with queries
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Boundary estimation in sensor networks: theory and methods
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Efficient and fault-tolerant feature extraction in wireless sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
| Hi-index | 0.00 |
This paper focuses on energy-efficient and fault-tolerant resolution of topographic queries in dense, uniformly deployed, two-dimensional sensor systems. Our approach is based on construction of the topographic map of userdefined features in the network. Once constructed, the map is used to resolve a large number of topographic queries efficiently. We present a distributed algorithm for construction and maintenance of the topographic map in presence of node failures and discuss resolution of topographic queries using the map. Our results show that our algorithm incurs 90% lesser time and 50% lower energy overheads on the average, and recovers more reliably from node failures in the network than the state-of-the-art.