An energy-efficient heterogeneous dual routing scheme for mobile ad hoc and sensor networks
by Subhankar Dhar, Michael Q. Rieck
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 2, No. 2, 2007

Abstract: New energy-efficient routing algorithms are introduced, based on a generalisation of the k-SPR sets from earlier work by the authors. This generalisation provides a means for the automatic avoidance of certain nodes and links when messages are routed. Sensor networks are modelled as connected graphs with vertex costs and edge costs. In addition, a two-tiered routing system in introduced. The low level routing is used for local routing within k hops, and is essentially (local) link-state routing. The high level routing depends on the routers from a k-SPR set, to manage this global routing.

Online publication date: Thu, 06-Sep-2007

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 Mobile Network Design and Innovation (IJMNDI):
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