Computational geometry: an introduction
Computational geometry: an introduction
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
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 for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
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
Event-based topology for dynamic planar areal objects
International Journal of Geographical Information Science
Infrastructure-establishment from scratch in wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
Decentralized querying of topological relations between regions without using localization
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Detecting change in snapshot sequences
GIScience'10 Proceedings of the 6th international conference on Geographic information science
Estimating the density of brown plant hoppers from a light-traps network based on unit disk graph
AMT'11 Proceedings of the 7th international conference on Active media technology
Get me out of here: collaborative evacuation based on local knowledge
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness
| Hi-index | 0.00 |
Wireless sensor networks are growing from a few hand-placed devices to more large-scale networks in terms of coverage and node density. For various concerns, such as scalability, larger network sizes require some management of the large volume of data that a sensor network delivers. One way to manage this data is processing information in the network. This paper investigates how a sensor network's network architecture (specifically, the neighborhood structure) can influence the conclusions that a sensor network makes from its measurements. The results demonstrate that non-planar structures are infeasible for routing and some in-network processing applications. Structures with low average edge lengths give better quantitative results, while those with high edge densities give better qualitative results.