On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Authors:
- 1 July 2006
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 66 (7) , 947-958
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Energy-Efficient Connected Coverage of Discrete Targets in Wireless Sensor Networks2005
- An extended localized algorithm for connected dominating set formation in ad hoc wireless networksIEEE Transactions on Parallel and Distributed Systems, 2004
- A generic distributed broadcast scheme in ad hoc wireless networksIEEE Transactions on Computers, 2004
- Movement control algorithms for realization of fault-tolerant ad hoc robot networksIEEE Network, 2004
- k-tuple domination in graphsInformation Processing Letters, 2003
- Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networksIEEE Transactions on Parallel and Distributed Systems, 2002
- Distributed heuristics for connected dominating sets in wireless ad hoc networksJournal of Communications and Networks, 2002
- Adaptive clustering for mobile wireless networksIEEE Journal on Selected Areas in Communications, 1997
- Unit disk graphsDiscrete Mathematics, 1990
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965