liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Non-Euclidian Geographic Routing in Wireless Networks
University of Saskatchewan.
University of Saskatchewan.
2007 (English)In: Ad hoc networks, ISSN 1570-8705, ISSN 1570-8705, Vol. 5, no 7, 1173-1193 p.Article in journal (Refereed) Published
Abstract [en]

Greedy geographic routing is attractive for large multi-hop wireless networks because of its simple and distributed operation. However, it may easily result in dead ends or hotspots when routing in a network with obstacles (regions without sufficient connectivity to forward messages). In this paper we propose a distributed routing algorithm that combines greedy geographic routing with two non-Euclidean distance metrics, chosen so as to provide load balanced routing around obstacles and hotspots. The first metric, Local Shortest Path, is used to achieve high probability of progress, while the second metric, Weighted Distance Gain, is used to select a desirable node among those that provide progress. The proposed Load Balanced Local Shortest Path (LBLSP) routing algorithm provides loop freedom, guarantees delivery when a path exists, is able to efficiently route around obstacles, and provides good load balancing.

Place, publisher, year, edition, pages
Elsevier Science Publishers B. V. , 2007. Vol. 5, no 7, 1173-1193 p.
Keyword [en]
Geographic routing, Load balancing, Non-Euclidian distance metrics, Wireless networks
URN: urn:nbn:se:liu:diva-64633DOI: diva2:393199
Available from: 2011-01-29 Created: 2011-01-29 Last updated: 2011-02-01

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Carlsson, Niklas
In the same journal
Ad hoc networks

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 34 hits
ReferencesLink to record
Permanent link

Direct link