Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen:
http://dx.doi.org/10.18419/opus-2484
Autor(en): | Tian, Jing Stepanov, Illya Rothermel, Kurt |
Titel: | Spatial aware geographic Forwarding for mobile ad hoc networks |
Erscheinungsdatum: | 2002 |
Dokumentart: | Arbeitspapier |
Serie/Report Nr.: | Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2002,1 |
URI: | http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-11602 http://elib.uni-stuttgart.de/handle/11682/2501 http://dx.doi.org/10.18419/opus-2484 |
Zusammenfassung: | Stateless greedy forwarding based on physical positions of nodes is considered to be more scalable than conventional topology-based routing. However, the stateless nature of geographic forwarding also prevents it from predicting holes in node distribution. Thus, frequent topology holes can significantly degrade the performance of geographic forwarding. So far the approaches mostly depend on excessive state maintenance at nodes to avoid forwarding failures at topology holes. In this paper, we propose and analyse spatial aware geographic forwarding (SAGF), a new approach that proactively avoids constant topology holes caused by spatial constraints while still preserving the advantage of stateless forwarding. Geographic source routes (GSR) based on intermediate locations are selected to bypass topology holes. Proactive route selection based on the spatial knowledge is a general approach, and thus can be used with any geographic forwarding algorithms. We evaluate our approach by extending greedy forwarding with spatial knowledge. Simulation results comparing with GPSR show that even simple spatial information can effectively improve the performance of geographic forwarding. |
Enthalten in den Sammlungen: | 05 Fakultät Informatik, Elektrotechnik und Informationstechnik |
Dateien zu dieser Ressource:
Datei | Beschreibung | Größe | Format | |
---|---|---|---|---|
TR-2002-01.pdf | 114,72 kB | Adobe PDF | Öffnen/Anzeigen |
Alle Ressourcen in diesem Repositorium sind urheberrechtlich geschützt.