Hierarchical routing in ad hoc networks using k-dominating sets

Authors:
Michael Q. Rieck;Subhankar Dhar
Affiliations:
Drake University, Des Moines, IA, USA;San José State University, San José CA, USA
Venue:
ACM SIGMOBILE Mobile Computing and Communications Review
Year:
2008

Citing 29
Cited 3

A trade-off between space and efficiency for routing tables

Journal of the ACM (JACM)
A survey of routing techniques for mobile communications networks

Mobile Networks and Applications - Special issue: routing in mobile communications networks
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support

Mobile Networks and Applications - Special issue: mobile multimedia communications
Fast distributed construction of small k-dominating sets and applications

Journal of Algorithms
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

SIAM Journal on Computing
On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Adaptive protocols for information dissemination in wireless sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Multicast operation of the ad-hoc on-demand distance vector routing protocol

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Wireless integrated network sensors

Communications of the ACM
Directed diffusion: a scalable and robust communication paradigm for sensor networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Multicast tree construction and flooding in wireless ad hoc networks

Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
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
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
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
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Smart Dust: Communicating with a Cubic-Millimeter Computer

Computer
On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Data Gathering in SEnsor Networks using the Energy Delay Metric

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
An efficient distributed algorithm for constructing small dominating sets

Distributed Computing - Special issue: Selected papers from PODC '01
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
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
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets

Computer Networks and ISDN Systems
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Guest Editors' Introduction: Ad Hoc Networks

Computer
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications

Power aware management middleware for multiple radio interfaces

Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
Power aware management middleware for multiple radio interfaces

Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
Efficient transformation of distance-2 self-stabilizing algorithms

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, the notion of a k-SPR set from previous work is extended to the context of an edge-weighted graph. Under a reasonable assumption, such a set is still k-dominating, and k-hop connected. When a decreasing sequence of such sets is used, together with a hybrid route discovery strategy (partly proactive, partly reactive), the result is a highly scalable and efficient, minimal path routing protocol.