Depth First Search-based and power-aware geo-routing in ad hoc and sensor wireless networks
by Bosko Vukojevic, Nishith Goel, Kalai Kalaichevlan, Amiya Nayak, Ivan Stojmenovic
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 1, No. 1, 2008

Abstract: Depth First Search (DFS) and position-based routing algorithms were proposed in literature. These are localised algorithms that guarantee the delivery for connected ad hoc and sensor wireless networks modelled by arbitrary graphs, including inaccurate location information for a destination node. This article first optimises an existing DFS-based routing scheme by eliminating from the candidate list neighbours whose messages to other nodes were overheard. We then introduce a new set of localised routing algorithms. The new DFS routing protocol is integrated with power metrics minimise total power for routing of a message. These DFS Power Progress-based algorithms are combinations of known greedy power and DFS routing algorithms. All algorithms are further enhanced by applying the concept of connected dominating sets, which greatly reduced the search path without impacting significantly the length of effectively constructed path for real traffic. Experiments confirm the efficiency of the new enhanced DFS, power-aware and connected dominating set-based routing algorithms and ability to guarantee the delivery in arbitrary model due to the DFS routing framework.

Online publication date: Wed, 02-Jul-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com