|
ABSTRACT
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, the length of the 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 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 compactly by a graph whose size is comparable with 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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
N. Amenta, S. Choi, and R. K. Kolluri. The power crust, unions of balls, and the medial axis transform. Comput. Geom. Theory Appl., 19:127--153, 2001.
|
| |
3
|
D. Attali, J.-D. Boissonnat, and H. Edelsbrunner. Stability and computation of the medial axis --- a state-of-the-art report. In Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration. Springer-Verlag, 2004.
|
| |
4
|
M. Bernstein, V. de Silva, J. Langford, and J. Tenenbaum. Graph approximations to geodesics on embedded manifolds. Technical report, Department of Psychology, Stanford University, 2000.
|
| |
5
|
H. Blum. A transformation for extracting new descriptors of shape. In W. Wathen-Dunn, editor, Models for the Perception of Speech and Visual Form, pages 362--380. MIT Press, 1967.
|
 |
6
|
Prosenjit Bose , Pat Morin , Ivan Stojmenović , Jorge Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications, p.48-55, August 20-20, 1999, Seattle, Washington, United States
[doi> 10.1145/313239.313282]
|
| |
7
|
|
 |
8
|
|
| |
9
|
A. Caruso, A. Urpi, S. Chessa, and S. De. GPS free coordinate assignment and routing in wireless sensor networks. In Proc. of the 24th Conference of the IEEE Communication Society (INFOCOM), March 2005.
|
| |
10
|
H. I. Choi, S. W. Choi, and H. P. Moon. Mathematical theory of medial axis transform. Pacific Journal of Mathematics, 181(1):57--88, 1997.
|
| |
11
|
|
| |
12
|
Q. Fang, J. Gao, L. Guibas, V. de Silva, and L. Zhang. GLIDER: Gradient landmark-based distributed routing for sensor networks. In Proc. of the 24th Conference of the IEEE Communication Society (INFOCOM), March 2005.
|
| |
13
|
S. P. Fekete, A. Kroeller, D. Pfisterer, S. Fischer, and C. Buschmann. Neighborhood-based topology recognition in sensor networks. In Algorithmic Aspects of Wireless Sensor Networks: First International Workshop (ALGOSENSOR), pages 123--136, 2004.
|
| |
14
|
R. Fonesca, S. Ratnasamy, J. Zhao, C. T. Ee, D. Culler, S. Shenker, and I. Stoica. Beacon vector routing: Scalable point-to-point routing in wireless sensornets, 2005.
|
| |
15
|
S. Funke. Topological hole detection and its applications. manuscript, 2005.
|
| |
16
|
D. Ganesan, D. Estrin, and J. Heidemann. DIMENSIONS: Why do we need a new data handling architecture for sensor networks. In Proc. ACM SIGCOMM Workshop on Hot Topics in Networks, 2002.
|
| |
17
|
D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker. Complex behavior at scale: An experimental study of low-power wireless sensor networks. Technical Report UCLA/CSD-TR 02-0013, UCLA, 2002.
|
 |
18
|
Jie Gao , Leonidas J. Guibas , John Hershberger , Li Zhang , An Zhu, Geometric spanner for routing in mobile networks, Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, October 04-05, 2001, Long Beach, CA, USA
[doi> 10.1145/501422.501424]
|
| |
19
|
L. Guibas, C. Holleman, and L. E. Kavraki. A probabilistic roadmap planner for flexible objects with a workspace medial-axis based sampling approach. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 254--260, Kyongju, Korea, 1999. IEEE Press.
|
 |
20
|
|
 |
21
|
Fabian Kuhn , Roger Wattenhofer , Yan Zhang , Aaron Zollinger, Geometric ad-hoc routing: of theory and practice, Proceedings of the twenty-second annual symposium on Principles of distributed computing, p.63-72, July 13-16, 2003, Boston, Massachusetts
[doi> 10.1145/872035.872044]
|
 |
22
|
|
 |
23
|
|
 |
24
|
Jinyang Li , John Jannotti , Douglas S. J. De Couto , David R. Karger , Robert Morris, A scalable location service for geographic ad hoc routing, Proceedings of the 6th annual international conference on Mobile computing and networking, p.120-130, August 06-11, 2000, Boston, Massachusetts, United States
[doi> 10.1145/345910.345931]
|
| |
25
|
M. A. Paskin and C. E. Guestrin. A robust architecture for distributed inference in sensor networks. Technical Report IRB-TR-03-039, Intel Research, 2004.
|
 |
26
|
Ananth Rao , Christos Papadimitriou , Scott Shenker , Ion Stoica, Geographic routing without location information, Proceedings of the 9th annual international conference on Mobile computing and networking, September 14-19, 2003, San Diego, CA, USA
[doi> 10.1145/938985.938996]
|
 |
27
|
Sylvia Ratnasamy , Brad Karp , Li Yin , Fang Yu , Deborah Estrin , Ramesh Govindan , Scott Shenker, GHT: a geographic hash table for data-centric storage, Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications, September 28-28, 2002, Atlanta, Georgia, USA
[doi> 10.1145/570738.570750]
|
 |
28
|
|
| |
29
|
|
| |
30
|
F. Zhao, J. Shin, and J. Reich. Information-driven dynamic sensor collaboration. IEEE Signal Processing Magazine, 19(2):61--72, 2002.
|
CITED BY 12
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Paolo Baronti , Prashant Pillai , Vince W. C. Chook , Stefano Chessa , Alberto Gotta , Y. Fun Hu, Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards, Computer Communications, v.30 n.7, p.1655-1695, May, 2007
|
|
|
|
|
|
Lucian Popa , Afshin Rostamizadeh , Richard Karp , Christos Papadimitriou , Ion Stoica, Balancing traffic load in wireless networks with curveball routing, Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, September 09-14, 2007, Montreal, Quebec, Canada
|
|
|
|
|
|
Mo Li , Jiliang Wang , Zheng Yang , Jingyao Dai, Sensor network navigation without locations, Proceedings of the 6th ACM conference on Embedded network sensor systems, November 05-07, 2008, Raleigh, NC, USA
|
|
|
|
|
|
|
|