Pages that link to "Item:Q1775042"
From MaRDI portal
The following pages link to Distributed routing algorithms for multi-hop ad hoc networks using \(d\)-hop connected \(d\)-dominating sets (Q1775042):
Displaying 12 items.
- An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks (Q635294) (← links)
- An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata (Q975050) (← links)
- A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs (Q1958631) (← links)
- (Q3016718) (← links)
- (Q3071143) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q4471362) (← links)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)
- Distributed Computing - IWDC 2003 (Q5191451) (← links)
- DMT of Multihop Networks: End Points and Computational Tools (Q5272107) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465876) (← links)
- A dominating-set-based routing scheme in ad hoc wireless networks (Q5955435) (← links)
- Edge-vertex domination on interval graphs (Q6551198) (← links)