Distributed construction of connected dominating set in wireless ad hoc networks

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2002, Pages 1597-1604

  Wan, Peng Jun ^a   Alzoubi, Khaled M ^a   Frieder, Ophir ^a  

^a Illinois State of Technology ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; MATHEMATICAL MODELS;

CONNECTED DOMINATING SET; MESSAGE COMPLEXITIES; WIRELESS AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0036346466     PISSN: 0743166X     EISSN: None     Source Type: Journal    
DOI: 10.1109/INFCOM.2002.1019411     Document Type: Article

References (12)

1. Routing in ad hoc networks using minimum connected dominating sets
2. A formal model for message passing systems
3. Clustering and routing in wireless ad hoc networks
4. A greedy heuristic for the set-covering problem
5. Propagation and leader election in multihop broadcast environment
6. Unit Disk Graphs
7. Routing in ad-hoc networks using a spine
8. Multicluster, mobile, multimedia radio network
9. Adaptive clustering for mobile wireless networks
10. An improved spine-based infrastructure for routing in ad hoc networks
11. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks
12. On calculating connected dominating set for efficient routing in ad hoc wireless networks