Connected Dominating Set and its Induced Position-less Sparse Spanner For Mobile Ad Hoc Networks

Authors:
Khaled M. Alzoubi
Affiliations:
-
Venue:
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Year:
2003

Citing 0
Cited 8

Maintaining a quality of service routing tree for mobile ad hoc networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Preemptive quality of service infrastructure for wireless mobile ad hoc networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
A simple improved distributed algorithm for minimum CDS in unit disk graphs

ACM Transactions on Sensor Networks (TOSN)
Distributed algorithms for connected domination in wireless networks

Journal of Parallel and Distributed Computing
Bootstrapping a hop-optimal network in the weak sensor model

ACM Transactions on Algorithms (TALG)
A faster distributed approximation scheme for the connected dominating set problem for growth-bounded graphs

ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
QoSRT: a quality of service routing tree for wireless ad hoc networks

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Distributed algorithms for coloring and domination in wireless ad hoc networks

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set S is a dominating set (DS) if each node in the graphis either in S or a neighbor to at least one of the nodes in S.A connected dominating set (CDS) is a DS that induces aconnected subgraph. A t-spanner of a graph G = (V,E) isa spanning subgraph G' = (V, E'), such that the shortest-hoppath between any two nodes in G', is at most t timestheir shortest path in G. A sparse spanner (spanner withlinear edges) is of fundamental importance to distributednetworking operations.In this paper, we present a new algorithm for constructingand maintaining a CDS-Based sparse spanner for mobilead hoc networks without using geographic positions.This CDS has a constant approximation factor. Consequently,the number of nodes responsible for routing is alsowithin a constant factor of the minimum. Our distributed algorithmruns in linear time and uses linear messages. Furthermore,the spanner has a constant topological and geometricdilation.