An energy-efficient heterogeneous dual routing scheme for mobile ad hoc and sensor networks

Authors:
Subhankar Dhar;Michael Q. Rieck
Affiliations:
Department of Management Information Systems, San Jose State University, One Washington Square, San Jose, CA 95192, USA.;Department of Mathematics and Computer Science, Drake University, Des Moines, IA 50311, USA
Venue:
International Journal of Mobile Network Design and Innovation
Year:
2007

Citing 8
Cited 1

Fast distributed construction of small k-dominating sets and applications

Journal of Algorithms
Span: An energy-efficient coordination algorithm for topology maintenance in Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A two-tier data dissemination model for large-scale wireless sensor networks

Proceedings of the 8th annual international conference on Mobile computing and networking
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links

IEEE Transactions on Parallel and Distributed Systems
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Hierarchical routing in sensor networks using k-dominating sets

IWDC'05 Proceedings of the 7th international conference on Distributed Computing

Constructing special k-dominating sets using variations on the greedy algorithm

Pervasive and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

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.