Convergence and continuity criteria for discrete approximations of the continuous planar skeleton
CVGIP: Image Understanding
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
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
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Shape Description By Medial Surface Construction
IEEE Transactions on Visualization and Computer Graphics
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
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
On the effect of localization errors on geographic face routing in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Localization and routing in sensor networks by local angle information
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On the pitfalls of geographic face routing
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Topological hole detection in wireless sensor networks and its applications
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Beacon vector routing: scalable point-to-point routing in wireless sensornets
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
The power crust, unions of balls, and the medial axis transform
Computational Geometry: Theory and Applications
Routing in Distributed Cognitive Radio Networks: A Survey
Wireless Personal Communications: An International Journal
Distributed and compact routing using spatial distributions in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consideration includes scalability, routing complexity, quality of communication paths and the load sharing of the routes. In this paper, we show that a compact and expressive abstraction of network connectivity by the medial axis enables efficient and localized routing. We propose MAP, a Medial Axis based naming and routing Protocol that does not require geographical locations, makes routing decisions locally, and achieves good load balancing. In its preprocessing phase, MAP constructs the medial axis of the sensor field, defined as the set of nodes with at least two closest boundary nodes. The medial axis of the network captures both the complex geometry and non-trivial topology of the sensor field. It can be represented succinctly by a graph whose size is in the order of the complexity of the geometric features (e.g., the number of holes). Each node is then given a name related to its position with respect to the medial axis. The routing scheme is derived through local decisions based on the names of the source and destination nodes and guarantees delivery with reasonable and natural routes. We show by both theoretical analysis and simulations that our medial axis based geometric routing scheme is scalable, produces short routes, achieves excellent load balancing, and is very robust to variations in the network model.