Page 1 |
Save page Remove page | Previous | 1 of 136 | Next |
|
small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
|
ROBUST AND EFFICIENT GEOGRAPHIC ROUTING
FOR WIRELESS NETWORKS
by
Young Jin Kim
A Dissertation Presented to the
FACULTY OF THE GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Ful llment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(COMPUTER SCIENCE)
MAY 2009
Copyright 2009 Young Jin Kim
Object Description
| Title | Robust and efficient geographic routing for wireless networks |
| Author | Kim, Young Jin |
| Author email | youngjki@usc.edu; yjkim_2@hotmail.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Computer Science |
| School | Viterbi School of Engineering |
| Date defended/completed | 2006-12-07 |
| Date submitted | 2009 |
| Restricted until | Unrestricted |
| Date published | 2009-04-20 |
| Advisor (committee chair) | Govindan, Ramesh |
| Advisor (committee member) |
Kempe, David Krishnamachari, Bhaskar Karp, Brad |
| Abstract | Geographic routing is a scalable any-to-any routing algorithm in which node state scales as the number of neighbors. It uses greedy routing when possible, and uses face routing to recover when greedy progress reaches a local minimum node that has no neighbor closer to the destination. Face routing is guaranteed to work correctly only on planar graphs that have no cross-link.; All currently proposed techniques for face routing and for constructing planar graphs (planarization) have relied on common underlying assumptions: circular radio range and precise localization. However, our experimental evaluations demonstrate that these assumptions are violated by real radios and that these violations can result in persistent routing failures. Motivated by this, we have investigated how well geographic face routing works under general conditions such as irregular radio range and imprecise location information.; In this thesis, we have extensively examined the correctness of geographic routing algorithms in real wireless graphs. Our initial research identified and classified failures in planarization and face routing. To x these failures, we have proposed the Cross-Link Detection Protocol (CLDP) and enhanced face routing algorithms. CLDP is the distributed planarization technique that enables provably correct geographic face routing on arbitrary connectivity graphs.; Next, we have examined the performance of geographic routing algorithms in arbitrary graphs. Existing algorithms have high message cost and high stretch. To improve performance, we have devised Lazy Cross-Link Removal (LCR) and Intelligent Face Routing (IFR): LCR correctly and reactively planarizes graphs with extremely low message cost; IFR is a new approach for face routing which exhibits the best average stretch performance among existing face routing families. |
| Keyword | geographic routing; correctness; planar graph |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m2096 |
| Contributing entity | University of Southern California |
| Rights | Kim, Young Jin |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | cisadmin@dots.usc.edu |
| Filename | etd-Kim-2585 |
| Archival file | uscthesesreloadpub_Volume14/etd-Kim-2585.pdf |
Description
| Title | Page 1 |
| Contributing entity | University of Southern California |
| Repository email | cisadmin@dots.usc.edu |
| Full text | ROBUST AND EFFICIENT GEOGRAPHIC ROUTING FOR WIRELESS NETWORKS by Young Jin Kim A Dissertation Presented to the FACULTY OF THE GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Ful llment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER SCIENCE) MAY 2009 Copyright 2009 Young Jin Kim |
