GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Topology matching for fully automatic similarity estimation of 3D shapes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Any open bounded subset of Rn has the same homotopy type than its medial axis
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Shock Graphs and Shape Matching
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Timing-sync protocol for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Time synchronization in wireless sensor networks
Time synchronization in wireless sensor networks
Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Approximately uniform random sampling in sensor networks
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Topological hole detection in wireless sensor networks and its applications
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
MAP: medial axis based geometric routing in sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Geographic gossip: efficient aggregation for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Sweeps over wireless sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Hole detection or: "how much geometry hides in connectivity?"
Proceedings of the twenty-second annual symposium on Computational geometry
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II"
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Hi-index | 0.00 |
The diversity of the deployment settings of sensor networks is naturally inherited from the diversity of geographical features of the embedded environment, and greatly influences network design. Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed inside a simple geometric region, without considering possible obstacles and holes in the deployment environment. When the real deployment setting deviates from that, we often observe degraded performance. Thus, it is highly desirable to have a generic approach to handle sensor fields with complex shapes. In this article, we propose a segmentation algorithm that partitions an irregular sensor field into nicely shaped pieces such that algorithms and protocols that assume a nice sensor field can be applied inside each piece. Across the segments, problem dependent structures specify how the segments and data collected in these segments are integrated. Our segmentation algorithm does not require any extra knowledge (e.g., sensor locations) and only uses network connectivity information. This unified spatial-partitioning approach makes the protocol design become flexible and independent of deployment specifics. Existing protocols are still reusable with segmentation, and the development of new topology-adaptive protocols becomes much easier. We verified the correctness of the algorithm on various topologies and evaluated the performance improvements by integrating shape segmentation with several fundamental problems in network design.