ACM Home Page
Please provide us with feedback. Feedback
On the effect of localization errors on geographic face routing in sensor networks
Full text PdfPdf (432 KB)
Source Information Processing In Sensor Networks archive
Proceedings of the 3rd international symposium on Information processing in sensor networks table of contents
Berkeley, California, USA
POSTER SESSION: Group A: localization table of contents
Pages: 71 - 80  
Year of Publication: 2004
ISBN:1-58113-846-6
Authors
Karim Seada  University of Southern California
Ahmed Helmy  University of Southern California
Ramesh Govindan  University of Southern California
Sponsor
SIGBED: ACM Special Interest Group on Embedded Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 71,   Citation Count: 17
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

In the absence of location errors, geographic routing - using a combination of greedy forwarding and face routing - has been shown to work correctly and efficiently. The effects of location errors on geographic routing have not been studied before. In this work we provide a detailed analysis of the effects of location errors on the correctness and performance of geographic routing in static sensor networks. First, we perform a micro-level behavioral analysis to identify the possible protocol error scenarios and their conditions and bounds. Then, we present results from an extensive simulation study of GPSR and GHT to quantify the performance degradation due to location errors. Our results show that even small location errors (of 10% of the radio range or less) can in fact lead to incorrect (non-recoverable) geographic routing with noticeable performance degradation. We then introduce a simple modification for face routing that eliminates probable errors and leads to near perfect performance.


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
3
4
 
5
G. G. Finn. "Routing and Addressing Problems in Large Metropolitan-Scale Internetworks". Tech. Rep. ISI/RR-87-180, Information Sciences Institute, Mar. 1987.
 
6
K. Gabriel and R. Sokal. "A New Statistical Approach to Geographic Variation Analysis". Systematic Zoology, 1969.
 
7
B. Greenstein, D. Estrin, R. Govindan, S. Ratnasamy, and S. Shenker. "DIFS: A Distributed Index for Features in Sensor Networks". IEEE SNPA 2003.
8
 
9
 
10
B. Karp. "Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning". Slides presented at the DIMACS workshop on Pervasive Networking, May 2001. (www.icir.org/bkarp/gpsr/gpsr.html)
11
 
12
E. Kranakis, H. Singh, and J. Urrutia. "Compass Routing on Geometric Networks". In Proc. 11th Canadian Conference on Computational Geometry, August 1999.
13
14
15
16
17
18
 
19
G. Toussaint. "The Relative Neighborhood Graph of a Finite Planar Set". Pattern Recognition 12, 4 (1980), 261--268.
 
20
A. Ward, A. Jones, and A. Hopper. "A New Location Technique for the Active Office". IEEE Personal Communications, October 1997.
21

CITED BY  17

Collaborative Colleagues:
Karim Seada: colleagues
Ahmed Helmy: colleagues
Ramesh Govindan: colleagues