Home // UBICOMM 2012, The Sixth International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies // View article

A new Strategy to Improve the Pathfinding in Wireless ad-hoc Networks

Authors:
Andreas Redmer
Andreas Heuer

Keywords: Wireless mesh networks, Ad hoc networks, Wi-Fi, Shortest path problem

Abstract:
In link-state computer networks it is usual that every node knows the topology of the entire network and can make the routing decisions based on that. One of the protocols in use is OLSR. The OLSR routing protocol implements the algorithm of Dijkstra to find the shortest paths from the nodes to the gateways of the network. For that purpose, Dijkstra's algorithm has to be executed k times, while k is the number of gateways. In this paper, we present a strategy that generalizes all gateways to one gateway. We call this the General Gateway Strategy. Using this, the Algorithm of Dijkstra has to be executed only one time, which significantly increases the performance of the overall algorithm to find the shortest paths to the gateways.

Pages: 175 to 178

Copyright: Copyright (c) IARIA, 2012

Publication date: September 23, 2012

Published in: conference

ISSN: 2308-4278

ISBN: 978-1-61208-236-3

Location: Barcelona, Spain

Dates: from September 23, 2012 to September 28, 2012