The week's pick
Reseach Article
A Democratic Head Election Strategy for Clustering in Wireless Sensor Network
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 54 - Number 16 |
| Year of Publication: 2012 |
| Authors: Sudakshina Dasgupta, Paramartha Dutta |
10.5120/8652-2529
|
Sudakshina Dasgupta, Paramartha Dutta . A Democratic Head Election Strategy for Clustering in Wireless Sensor Network. International Journal of Computer Applications. 54, 16 ( September 2012), 32-36. DOI=10.5120/8652-2529
Abstract
In recent years a lot of work has been done on Wireless Sensor Network (WSN) as it find its application in many applications including environmental monitoring and military field surveillance. In these applications tiny sensor nodes are deployed across the application regions. Data gathered by the sensor nodes are periodically collected by the base stations. As the nodes are deployed and left unattended for a long time it becomes quite difficult to recharge the node batteries. Several WSN applications require only an aggregate value to be reported to the base station. In this case sensors in different regions of the field can collaborate to aggregate their data and provide more accurate reports about their local regions. This type of data aggregation can reduce the communication overhead in the network and can increase the network life time. In order to support data aggregation through efficient network organization, nodes can be partitioned into a number of small groups called clusters. Each cluster has a coordinator, referred to as cluster head and a number of member nodes. The member nodes report their data to the respective Cluster Heads (CHs). The CHs aggregate the data and send them to the central base station through other CHs. This process improves the network lifetime which is an important metric to evaluate the network performance. In this type of system the challenging issue is to selection of CHs in each cluster along with the cluster head rotation to increase network life time and to reduce the communication overhead among the nodes in a WSN. In our work we have proposed an election algorithm to select the CHs in a democratic fashion by the nodes in the network. The performance of the proposed algorithm has been successfully demonstrated by the simulation of the proposed system.
References
- I. F. Akyildiz,W. Su, Y. Sankarasubramaniam, and E. Cayirci Aug 2002. A Survey on Sensor Netowrks. IEEE Communications Magazine, vol. 40, no. 8, pp. 102 114.
- W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan Jan 2000. Energy Efficient Communication Protocol for Wireless Micro Sensor Networks. Proceedings of IEEE HICSS. Jan 2000.
- C. F. Chiasserini, I. Chlamtac, P. Monti, and A. Nucci Feb 2002. Energy Efficient Design of Wireless Ad Hoc Networks. Proceedings of European Wireless.
- S. Bandyopadhyay and E. J. Coyle April 2003. An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks. IEEE INFOCOM.
- A. Mainwaring et al. 2002. Wireless Sensor Networks for Habitat Monitoring. Proceedings of the 1st ACM International Workshop on WSN.
- C. Intanagonwiwat et al. Feb. 2003. Directed Diffusion for Wireless Sensor Networking. IEEE/ACM Transaction on Networking, vol. 11, no. 1.
- K. Ramesh and Dr K. Somasundaram November 2011 . A Comparative Study Of Clusterhead Selection Algorithm In Wireless Sensor Networks. International Journal of Computer Science & Engineering Survey (IJCSES) Vol. 2, No. 4.
- Kiran Maraiya, Kamal Kant, Nitin Gupta June 2011. Efficient Cluster Head Selection Scheme for Data Aggregation in Wireless Sensor Network. International Journal of Computer Applications (0975 – 8887) Volume 23– No. 9,
- Yaoyao Yin, Juwei Shi, Yinong Li , Ping Zhang. Cluster Head Selection Using Analytical Hierarchy Process For Wireless Sensor Networks.
- Quan Zhou, Xiaowei Li, Yongjun Xu Mean Shift Based Collaborative Localization with Dynamically Clustering for Wireless Sensor Networks volume: 2 ,Page(s): 66-70 .
- S. Bandyopadhyay , E. Coyle April 2003. An energy efficient hierarchical clustering algorithm for wireless sensor networks. Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Francisco, California.
- O. Younis, S. Fahmy 2004. HEED: A Hybrid, Energy-Efficient, Distributed clustering approach for Ad Hoc sensor networks. IEEE Transactions on Mobile Computing 3 (4) 366-379.
- W. B. Heinzelman, A. P. Chandrakasan, H. Balakrishnan 2002. Application specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Networking.
- Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan, . 2000 Energy-Efficient Communication Protocol forWireless Microsensor Networks. Proceedings of the 33rd Hawaii International Conference on System Sciences.
- Deng Zhixiang, Qi Bensheng 2007 Three-layered routing protocol for WSN based on LEACH algorithm. Wireless Mobile and Sensor Networks,. Page(s):72-75.
- Yizong Chen . August 1995 Mean Shift, Mode Seeking, and Clustering. IEEE Transactions on pattern analysis and machine intelligence, Vol. 17, No, 8 .
- Vivek Katiyar, Narottam Chand, Surender Soni ,2011. A Survey on Clustering Algorithms for Heterogeneous Wireless Sensor Networks. . Int. J. Advanced Networking and Applications Volume: 02, Issue: 04, Pages: 745-754.
- Kiran Maraiya, Kamal Kant, Nitin Gupta,2011. Efficient Cluster Head Selection Scheme for Data Aggregation in Wireless Sensor Network. International Journal of Computer Applications (0975 – 8887) Volume 23– No. 9, June 2011.
- Ankita Joshi , Lakshmi Priya. M. A Survey of Hierarchical Routing Protocols in Wireless Sensor Network , MES Journal of Technology and Management
Index Terms
Keywords