Share This Article:

BSDCH: New Chain Routing Protocol with Best Selection Double Cluster Head in Wireless Sensor Networks

Abstract Full-Text HTML XML Download Download as PDF (Size:1810KB) PP. 9-13
DOI: 10.4236/wsn.2013.52002    6,051 Downloads   10,638 Views   Citations

ABSTRACT

The Optimum use of energy is one of the significant needs in wireless sensor networks, because sensor devices would usually use the battery power. In this article, we give the suggested routing algorithm (BSDCH) with determining an optimum routine due to the energy use and the number of passed hobs. To transfer date from nodes’ sensor to BS (Base Station), data sending has been utilized in chains. In BSDCH algorithm, the nodes’ space is divided into several regions. In this article, each part is called a cluster. In each cluster, a node which is the best due to energy and distance comparison with other cluster nodes it is continuously selected with a given Formula (4) which is called main CH (Cluster Head) and forms a chain in that cluster and in each node cluster, it is selected by Formula (5) as secondary CH with the least distance and the best situation to BS and main CH. the secondary CH task is to receive data from the main CH and send data to the BS. As far as the main cluster head would waste too much energy to send data to BS, so to send data through secondary CH, we can keep main CH energy for more time. In the time of sending data from nodes to main CH, a multi chain is utilized. In the time of making nodes’ chain, nods are connected straight into its main CH radius and other nodes are connected in their sending radius which would have the least distance to main CH. Finally, also, BSDCH has been compared with PEGASIS [1] and PDCH [2]. The simulation results are shown which are indicator of a better BSDCH performance.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

M. Noori and A. Khoshtarash, "BSDCH: New Chain Routing Protocol with Best Selection Double Cluster Head in Wireless Sensor Networks," Wireless Sensor Network, Vol. 5 No. 2, 2013, pp. 9-13. doi: 10.4236/wsn.2013.52002.

References

[1] S. Lindsey and C. Raghavendra, “PEGASIS: Power-Efficient Gathering in Sensor Information Systems,” IEEE Aerospace Conference Proceedings, Vol. 3, 2002, pp. 1125-1130. doi:10.1109/AERO.2002.1035242
[2] L. P. Wang and Z. Cai, “Improved Algorithm of PEGASIS Protocol Introducing Double Cluster Heads,” International Conference on Computer, Mechatronics, Control and Electronic Engineering, Changchun, 24-26 August 2010.
[3] F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, “A Survey on Sensor Networks,” IEEE Communications Magazine, Vol. 40, No. 8, 2002, pp. 102-116. doi:10.1109/MCOM.2002.1024422
[4] D. Estrin, R. Govindan, J. Heidemann and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” Proceedings of 5th Annual ACM International Conference Mobile Computing Networking, Seattle, 15-19 August 1999, pp. 263-270. doi:10.1145/313451.313556
[5] K. Akkaya and M. Younis, “A Survey of Routing Protocols in Wireless Sensor Networks,” Elsevier Ad Hoc Network Journal, Vol. 3/3, 2005, pp. 325-349. doi:10.1016/j.adhoc.2003.09.010
[6] J. N. Al-Karak and A. E.Kamal, “Routing Techniques in Wireless Sensor Network: A Survey,” IEEE Wireless Communications, Vol. 11, No. 6, 2004, pp. 6-28. doi:10.1109/MWC.2004.1368893
[7] W. Heinzelman, A. Chandrakasan and H. Balakrishnan, “An Application-Specific Protocol Architecture for Wireless Microsensor Networks,” IEEE Transactions on Wireless Communications, Vol. 1, No. 4, 2002, pp. 660-670. doi:10.1109/TWC.2002.804190

  
comments powered by Disqus

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.