Node Degree based Clustering for WSN
|
10.5120/5486-7072 |
Sanjeev Kumar Gupta, Neeraj Jain and Poonam Sinha. Article: Node Degree based Clustering for WSN. International Journal of Computer Applications 40(16):49-55, February 2012. Full text available. BibTeX
@article{key:article,
author = {Sanjeev Kumar Gupta and Neeraj Jain and Poonam Sinha},
title = {Article: Node Degree based Clustering for WSN},
journal = {International Journal of Computer Applications},
year = {2012},
volume = {40},
number = {16},
pages = {49-55},
month = {February},
note = {Full text available}
}
Abstract
Wireless Sensor Network (WSN) is widely used for monitoring and gathering data in an autonomous fashion. Since sensors are small and power constrained devices, it is the most important to minimize the energy consumption. We propose Node Degree Based Clustering (NDBC) for enhancing life time of heterogeneous wireless networks. In this paper, two types of sensor nodes, i.e., advanced and normal nodes are used. Advance nodes are having more energy than normal nodes. The advanced nodes are selected as cluster head based on its energy and node degree in the network. Normal nodes are used for sensing and data forwarding. Using NDBC we have reduced communication cost among sensor nodes used for transmitting and receiving the messages for cluster head selection. Simulation results show that by selecting the optimum position of cluster head on the basis of density, the consumption of energy for communication is minimized. It also increases the overall lifetime compared with the existing schemes.
References
- I. F. Akyildiz, W. Su, Y.Sankarasubramaniam, and E.Cayirci, “Wireless sensor networks: a survey”, Computer Networks, vol. 38, no. 4, March 2002, pp. 393–422.
- J.N. Al-Karaki and A.E. Kamal, “Routing techniques in wireless sensor networks: a survey,” IEEE Wireless Communications, vol. 11, no. 6, Dec 2004, pp. 6–28.
- E. Hansen, M. Nolin, M. Bjorkman, “A Study of Maximum Lifetime Routing in Sparse Sensor Networks”, in Proceedings of International Conference on Complex, Intelligent and Software Intensive Systems (CISIC), Spain, Mar 2008, pp. 449-454.
- S. M. Guru, M. Steinbrecher, S. Halgamuge, and R. Kruse, “Multiple Cluster Merging and Multihop Transmission”, LNCS 4459: AGPC, Springer, 2007, pp. 89-99.
- M. Kochhal, L. Schwiebert, and S. Gupta, “Self-organizing of wireless sensor networks,” in Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to- Peer Networks, J. Wu, Ed. Auerbach Publications, 2006, pp. 369–392.
- A. P. Chandrakasan, A. C. Smith and W. B. Heinzelman, “An Application Speci?c Protocol Architecture for Wireless Microsensor Networks,” IEEE Transactions on Wireless Communication, vol. 1, no. 4, 2004, pp. 660- 669.
- S.Lindsey and C. S.Raghavendra, “PEGASIS: power-ef?cient gathering in sensor information systems,” In Proc. of the IEEE Aerospace Conference, 2002, pp. 1125–1130.
- O. Younis and S. Fahmy, “HEED: A hybrid, energy-ef?cient, distributed clustering approach for ad hoc sensor networks,” IEEE Trans. on Mobile Computing, vol. 3, no. 4, 2004, pp. 366–379.
- M. Gerla and J.T.-C. Tsai, “Multicluster, mobile, multimedia radio network,” Wireless Networks, vol. 1, no. 3, 1995, pp. 255-265.
- Qingchao Zheng, Z. Liu, Liang Xue, Yusong Tan, Dan Chen, and Xinping Guan, “An Energy Efficient Clustering Scheme with Self-organized ID Assignment for Wireless Sensor Networks”. 2010 16th IEEE International Conference on Parallel and Distributed Systems, 2010.
- C. Schurgers, G. Kulkarni and M. B. Srivastava, “Distributed On-Demand Address Assignment in Wireless Sensor Networks,” IEEE Trans. Parallel Distributed System, vol. 13, no. 10, 2002, pp. 1056–1065.
- H. B. Zhou, M. W. Mutka and L. M. Ni, “Reactive ID Assignment vfor Sensor Networks,” Proceedings of IEEE MASS 2005: 2nd IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, 2005.
- O. A. V. ELMoustapha, “Distributed unique global ID assignment for sensor networks”, Ad Hoc Networks, vol. 7, no. 6, 2005, pp. 2051-2055.