# Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks

@article{Alzoubi2003ConnectedDS, title={Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks}, author={Khaled M. Alzoubi}, journal={Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003}, year={2003}, pages={209-216 vol.1} }

A set S is a dominating set (DS) if each node in the graph is 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 a connected subgraph. A t-spanner of a graph G = (V,E) is a spanning subgraph G' = (V,E'), such that the shortest hop path between any two nodes in G', is at most t times their shortest path in G. A sparse spanner (spanner with linear edges) is of fundamental importance to distributed networking operations. In this paper… CONTINUE READING

17 Citations

Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks

- Computer Science
- 2004

43 Highly Influenced

A simple improved distributed algorithm for minimum CDS in unit disk graphs

- Computer Science, Mathematics
- WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005.
- 2005

167- PDF

A simple improved distributed algorithm for minimum CDS in unit disk graphs

- Computer Science
- WiMob
- 2005

7- PDF

A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs

- Computer Science
- Ad Hoc Sens. Wirel. Networks
- 2008

28- PDF

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

- Computer Science
- IWCMC '06
- 2006

5

QoSRT: a Quality of Service Routing Tree for Wireless Ad Hoc Networks

- Computer Science
- MILCOM 2006 - 2006 IEEE Military Communications conference
- 2006

Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks

- Mathematics, Computer Science
- FSTTCS
- 2004

52 Highly Influenced- PDF

Distributed algorithms for connected domination in wireless networks

- Computer Science
- J. Parallel Distributed Comput.
- 2007

31 Highly Influenced- PDF

Bootstrapping a hop-optimal network in the weak sensor model

- Mathematics, Computer Science
- TALG
- 2009

12- PDF

#### References

SHOWING 1-10 OF 21 REFERENCES

Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks

- Computer Science
- 23rd International Conference on Distributed Computing Systems, 2003. Proceedings.
- 2003

32- PDF

Message-optimal connected dominating sets in mobile ad hoc networks

- Computer Science
- MobiHoc '02
- 2002

415- PDF

Distributed heuristics for connected dominating sets in wireless ad hoc networks

- Computer Science
- Journal of Communications and Networks
- 2002

258- PDF

Distributed construction of a planar spanner and routing for ad hoc wireless networks

- Computer Science
- Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
- 2002

308- PDF

RNG and internal node based broadcasting algorithms for wireless one-to-one networks

- Computer Science
- MOCO
- 2001

92- PDF

Power efficient and sparse spanner for wireless ad hoc networks

- Computer Science
- Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495)
- 2001

190- PDF

New distributed algorithm for connected dominating set in wireless ad hoc networks

- Computer Science
- Proceedings of the 35th Annual Hawaii International Conference on System Sciences
- 2002

338- PDF

Distributed construction of connected dominating set in wireless ad hoc networks

- Computer Science
- Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
- 2002

881- PDF

Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

- Computer Science
- IEEE Trans. Parallel Distributed Syst.
- 2002

924 Highly Influential- PDF