Distributed construction of connected dominating set in wireless ad hoc networks
Citations
533 citations
420 citations
335 citations
295 citations
282 citations
References
2,645 citations
1,695 citations
"Distributed construction of connect..." refers methods in this paper
...Three rankings are used: the ID only [8, 9 ], an ordered pair of degree and ID [3], and an order pair of degree and location [11]....
[...]
1,610 citations
"Distributed construction of connect..." refers methods in this paper
...Three rankings are used: the ID only [ 8 ,9], an ordered pair of degree and ID [3], and an order pair of degree and location [11]....
[...]
[...]
1,525 citations
"Distributed construction of connect..." refers background in this paper
...However, finding an MCDS in unit-disk graphs is NP-hard [ 6 ], and thus only distributed approximation algorithms in polynomial time are practical for wireless ad hoc networks....
[...]
...The topology of such wireless ad hoc network can be modeled as a unit-disk graph [ 6 ], a geometric graph in which there is an edge between two nodes if and only if their distance is at most one (see figure 1)....
[...]
1,198 citations