ACM Home Page
Please provide us with feedback. Feedback
MAP: medial axis based geometric routing in sensor networks
Full text PdfPdf (1.68 MB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 11th annual international conference on Mobile computing and networking table of contents
Cologne, Germany
SESSION: Routing protocols table of contents
Pages: 88 - 102  
Year of Publication: 2005
ISBN:1-59593-020-5
Authors
Jehoshua Bruck  California Institute of Technology, Pasadena, CA
Jie Gao  California Institute of Technology, Pasadena, CA
Anxiao (Andrew) Jiang  California Institute of Technology, Pasadena, CA
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 47,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1080829.1080839
What is a DOI?

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
 
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
 
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
22
23
24
 
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
27
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

Collaborative Colleagues:
Jehoshua Bruck: colleagues
Jie Gao: colleagues
Anxiao (Andrew) Jiang: colleagues