Distributed algorithms for connected domination in wireless networks
From MaRDI portal
Publication:2373893
Recommendations
- Distributed algorithms for coloring and domination in wireless ad hoc networks
- A distributed approximation algorithm for strongly connected dominating-absorbent sets in asymmetric wireless ad-hoc networks
- Distributed connectivity of wireless networks
- Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks
- On distributed algorithms in a broadcast domain
Cited in
(10)- Construction of strongly connected dominating sets in asymmetric multihop wireless networks
- Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets
- Distributed connectivity of wireless networks
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
- Distributed maintenance of resource efficient wireless network topologies
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- Distributed algorithms for coloring and domination in wireless ad hoc networks
- An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
- A near optimal periodic transmission schedule in bounded degree wireless sensor network
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs
This page was built for publication: Distributed algorithms for connected domination in wireless networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373893)