Energy constraint clustering algorithms for wireless sensor networks

Ad Hoc Networks

Volumn 11, Issue 8, 2013, Pages 2512-2525

  Albath, Julia ^a   Thakur, Mayur ^b   Madria, Sanjay ^a  

^a MISSOURI UNIVERSITY OF SCIENCE AND TECHNOLOGY   (United States)

^b GOOGLE INC   (United States)

Author keywords

Clustering; Dominating set; Routing protocols; Sensor networks

Indexed keywords

APPROXIMATION RATIOS; CLUSTERING; COMMUNICATION RANGE; DOMINATING SETS; ENERGY-CONSTRAINED; MINIMUM DOMINATING SET; RANDOMIZED DISTRIBUTED ALGORITHMS; REMAINING ENERGIES;

APPROXIMATION ALGORITHMS; CLUSTERING ALGORITHMS; COMMUNICATION; ELECTROCHROMIC DEVICES; HARMONIC FUNCTIONS; INFORMATION MANAGEMENT; ROUTING PROTOCOLS; SENSOR NETWORKS;

SENSOR NODES;

EID: 84885304744     PISSN: 15708705     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.adhoc.2013.05.016     Document Type: Article

References (31)

1. W.B. Heinzelman, A.P. Chandrakasan, and H. Balakrishnan An application-specific protocol architecture for wireless microsensor networks IEEE Transactions on Wireless Communications 1 4 2002 660 670 10.1109/TWC.2002.804190
2. T. Anker, D. Bickson, D. Dolev, and B. Hod Efficient clustering for improving network performance in wireless sensor networks Proceedings of the 5th European Conference on Wireless Sensor Networks, EWSN'08 2008 Springer-Verlag Berlin, Heidelberg 221 236
3. I. Eyal, I. Keidar, and R. Rom Distributed data clustering in sensor networks Distributed Computing 24 2011 207 222 10.1007/s00446-011-0143-7
4. M. Xiang, Z. Luo, and P. Wang Energy-efficient intra-cluster data gathering of wireless sensor networks Journal of Networks 5 3 2010 383 390
5. C. Duan, H. Fan, A distributed energy balance clustering protocol for heterogeneous wireless sensor networks, in: WiCom 2007. International Conference on Wireless Communications, Networking and Mobile Computing, 2007, pp. 2469-2473, doi: 10.1109/WICOM.2007.615.
6. J. Wu, H. Li, Domination and its applications in ad hoc wireless networks with unidirectional links, in: Proceedings. 2000 International Conference on Parallel Processing, 2000, pp. 189-197, doi: 10.1109/ICPP.2000.876117.
7. D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons Journal of Computer and System Sciences 71 4 2005 467 479 10.1016/j.jcss.2005.04.002
8. A. Youssef, M. Younis, M. Youssef, and A. Agrawala Wsn16-5: Distributed formation of overlapping multi-hop clusters in wireless sensor networks Global Telecommunications Conference, 2006. GLOBECOM '06 2006 IEEE 1 6 10.1109/GLOCOM.2006.986
9. P. Levis, N. Lee, M. Welsh, and D. Culler Tossim: accurate and scalable simulation of entire tinyos applications SenSys '03: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems 2003 ACM Press New York, NY, USA 126 137
10. O. Younis, S. Fahmy, An experimental study of routing and data aggregation in sensor networks, IEEE International Conference on IEEE Mobile Adhoc and Sensor Systems Conference, Washington, DC, (2005) 8+, doi: 10.1109/MAHSS.2005.1542773.
11. F. Kuhn, and R. Wattenhofer Constant-time distributed dominating set approximation Distributed Computing 17 4 2005 303 310 10.1007/s00446-004-0112-5
12. R.M. Karp Reducibility among combinatorial problems R.E. Miller, J.W. Thatcher, Complexity of Computer Computations 1972 Plenum Press 85 103
13. F. Kuhn, T. Moscibroda, and R. Wattenhofer Unit disk graph approximation DIALM-POMC '04: Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing 2004 ACM New York, NY, USA 17 23 10.1145/1022630.1022634
14. Harry, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, and R.E. Stearns Nc-approximation schemes for np- and pspace-hard problems for geometric graphs Journal of Algorithms 26 2 1998 238 274
15. S. Banerjee, and S. Khuller A clustering scheme for hierarchical control in multi-hop wireless networks INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. vol. 2 2001 IEEE 1028 1037 10.1109/INFCOM.2001.916296
16. W. Cheng, K. Xing, X. Cheng, X. Lu, Z. Lu, J. Su, B. Wang, and Y. Liu Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks MobiHoc '08: Proceedings of the 9th ACM International Symposium on Mobile Ad hoc Networking and Computing 2008 ACM New York, NY, USA 209 220 10.1145/1374618.1374648
17. L. Jia, R. Rajaraman, and T. Suel An efficient distributed algorithm for constructing small dominating sets Distributed Computing 15 4 2002 193 205 10.1017/s00446-002-0078-0
18. D.S. Johnson Approximation algorithms for combinatorial problems STOC '73: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing 1973 ACM New York, NY, USA 38 49 10.1145/800125.804034
19. L. Lovasz On the ratio of optimal integral and fractional covers Discrete Mathematics 13 4 1975 383 390
20. O. Younis, and S. Fahmy Heed: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks IEEE Transactions on Mobile Computing 3 4 2004 366 379 10.1109/TMC.2004.41
21. A. Boukerche, X. Fei, and R.B. Araujo An optimal coverage-preserving scheme for wireless sensor networks based on local information exchange Computer Communications 30 14-15 2007 2708 2720 10.1016/j.comcom.2007.05.018
22. M. Ye, C. Li, G. Chen, J. Wu, Eecs: an energy efficient clustering scheme in wireless sensor networks, in: IPCCC 2005. 24th IEEE International on Performance, Computing, and Communications Conference, 2005, pp. 535-540, doi: 10.1109/PCCC.2005.1460630.
23. Y. Jin, L. Wang, Y. Kim, and X. Yang Eemc: an energy-efficient multi-level clustering algorithm for large-scale wireless sensor networks Computer Networks 52 3 2008 542 562 10.1016/j.comnet.2007.10.005
24. F. Grandoni, J. Könemann, A. Panconesi, and M. Sozio Primal-dual based distributed algorithms for vertex cover with semi-hard capacities PODC '05: Proceedings of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing 2005 ACM New York, NY, USA 118 125 10.1145/1073814.1073835
25. A.D. Amis, R. Prakash, T.H.P. Vuong, D.T. Huynh, Max-min d-cluster formation in wireless ad hoc networks, in: Proceedings of IEEE INFOCOM, 2000. 1 (2000) 32-41.
26. S. Kutten, and D. Peleg Fast distributed construction of k-dominating sets and applications PODC '95: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing 1995 ACM New York, NY, USA 238 251 10.1145/224964.224990
27. Y. Fernandess, and D. Malkhi K-clustering in wireless ad hoc networks POMC '02: Proceedings of the Second ACM International Workshop on Principles of Mobile Computing 2002 ACM New York, NY, USA 31 37 10.1145/584490.584497
28. Y.P. Chen, and A.L. Liestman Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks MobiHoc '02: Proceedings of the 3rd ACM International Symposium on Mobile Ad hoc Networking and Computing 2002 ACM New York, NY, USA 165 172 10.1145/513800.513821
29. B. Das, V. Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets, in: ICC 97 Montreal, 'Towards the Knowledge Millennium'. 1997 IEEE International Conference on Communications, vol. 1, 1997, pp. 376-380, doi: 10.1109/ICC.1997.605303.
30. S. Guha, and S. Khuller Approximation algorithms for connected dominating sets Algorithmica 20 4 1998 374 387 10.1007/PL00009201
31. M.T. Julia Albath, and S. Madria Energy constrained dominating set for clustering in wireless sensor networks AINA '10: IEEE Proceedings of the Advances Information Networking and Applications 2010 IEEE New York, NY, USA 812 819