GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Distributed Techniques for Area Computation in Sensor Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
On the pitfalls of geographic face routing
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Monitoring dynamic spatial fields using responsive geosensor networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
ACM Transactions on Sensor Networks (TOSN)
Gradient Boundary Detection for Time Series Snapshot Construction in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Qualitative change to 3-valued regions
GIScience'10 Proceedings of the 6th international conference on Geographic information science
| Hi-index | 0.00 |
This paper addresses the analysis and design of a decentralized algorithm for computing the area of spatial regions, like regions of high temperature or environmental pollution. The algorithm is suitable for application to distributed spatial monitoring systems, like geosensor networks. In such systems, conventional algorithms that rely on centralized control are acknowledged to present substantial constraints to network scalability. The algorithm presented in this paper requires no global knowledge, relying instead purely on a local knowledge about a node and its immediate one-hop neighbors. The paper then indicates avenues for further research, including relaxing strong assumptions about connectivity and region shape (e.g., simple region boundaries), and the application of the algorithm to related problems, such as computing region centroids.