A local algorithm to compute multiple connected dominating sets in wireless sensor networks

International Journal of Parallel, Emergent and Distributed Systems

Volumn 26, Issue 5, 2011, Pages 369-380

  Islam, Kamrul ^a   Akll, Selim G ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Local algorithms; Maximum clique; Multiple connected dominating sets; Wireless sensor networks

Indexed keywords

APPROXIMATION FACTOR; CONNECTED DOMINATING SET; LOCAL ALGORITHM; MAXIMUM CLIQUE; NETWORK GRAPH; NETWORK LIFETIME; NON-TRIVIAL; OPTIMAL SOLUTIONS; UNIT DISK GRAPHS; UPPER BOUND; WIRELESS SENSOR;

APPROXIMATION ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; SENSORS;

WIRELESS SENSOR NETWORKS;

EID: 81255177035     PISSN: 17445760     EISSN: 17445779     Source Type: Journal    
DOI: 10.1080/17445760.2010.537277     Document Type: Article

References (17)

1. K. Alzoubi, P. Wan, and O. Frieder, New distributed algorithm for connected dominating set in wireless ad hoc networks, in Proceedings of the IEEE HICSS35, 2002.
2. K. Alzoubi, P. Wan, and O. Frieder, Distributed heuristics for connected dominating set in sireless ad hoc networks, IEEE ComSoc/KICS J. Commun. Netw. 4(1) (2002), pp. 22-29.
3. X. Cheng, X. Huang, D. Li, and D. Du, Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks, Networks 42(4) (2003), pp. 202-208. (Pubitemid 38552247)
4. B.Clark,C.Colborn,andD.Johnson, Unit disk graphs,Discrete Math.86(1990),pp. 165-177.
5. U. Feige, M. Halldorsson, G. Kortsarz, and A. Srinivasan, Approximating the domatic number, SIAM J. Comput. 32(1) (2003), pp. 172-195.
6. S. Funke, A. Kesselman, U. Meyer, and M. Segal, A simple improved distributed algorithmfor minimum connected dominating set in unit disk graphs, ACM Trans. Sensor Netw. 2(3) (2006), pp. 444-453. (Pubitemid 44631531)
7. S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20 (1998), pp. 374-387. (Pubitemid 128664048)
8. R. Gupta, J. Walrand, and O. Goldschmidt, Maximal cliques in unit disk graphs: Polynomial approximation, in Proceedings of the INOC, 2005.
9. X. Li, P. Wan, and O. Frieder, Coverage problems in wireless ad-hoc sensor networks, IEEE Trans. Comput. 52(6) (2005), pp. 753-763.
10. N. Linial, Locality in distributedgraph algorithms, SIAM J. Comput. 21 (1992), pp. 193-201.
11. M. Marathe, H. Breu, H. Hunt, S. Ravi, and D. Rosenkrantz, Simple heuristics for unit disk graphs, Networks 25 (1995), pp. 59-68.
12. T. Moscibroda, Locality, scheduling, and selfishness: Algorithmic foundations of highly decentralized networks, Ph.D. Thesis, ETH Zurich, Diss. ETH, No. 16740 (2006).
13. T. Moscibroda and R. Wattenhofer, Maximizing the lifetime ofdominating sets, in Proceedings of the WMASN, 2005.
14. D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, Philadelphia, PA, 2000.
15. S. Pemmaraju and I. Pirwani, Energy conservation in wireless sensor networks via domatic partitions, in Proceedings of the Mobi Hoc, 2006.
16. S. Slijepcevic and M. Potkonjak, Power efficient organization ofwireless sensor networks, in Proceedings of the ICC, 2001.
17. I. Stojmenovic, M. Seddigh, and J. Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, IEEE Trans. Parallel Distrib. Syst. 13(1) (2002), pp. 14-25. (Pubitemid 35037238)