Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
By Yuanzhu Peter Chen, Arthur L. Liestman. ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2002
300 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/02b8508448599eec4177097eb5387faa658b21ec
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Samir R Das
- Quinyi Gu
- Himanshu Gupta
- Bang Wang
- Mahesh K. Marina
- Sajal K. Das
- Christian Bettstetter
- Jennifer C. Hou
Citations in the corpus
- Connected sensor cover: self-organization of sensor networks for efficient query execution (2003, background): “The work in wireless network research community [9, 18, 26, 1, 7] has primarily focussed on developing energy-efficient distributed algorithms to construct a nearoptimal dominating connected set.”