Call for Paper - December 2020 Edition
IJCA solicits original research papers for the December 2020 Edition. Last date of manuscript submission is November 20, 2020. Read More

Energy Efficient Hierarchical Stable Election Protocol

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2019
Authors:
L. Jagadeesh Naik, K. V. Ramanaiah, K. Soundara Rajan
10.5120/ijca2019918711

Jagadeesh L Naik, K V Ramanaiah and Soundara K Rajan. Energy Efficient Hierarchical Stable Election Protocol. International Journal of Computer Applications 182(47):28-33, April 2019. BibTeX

@article{10.5120/ijca2019918711,
	author = {L. Jagadeesh Naik and K. V. Ramanaiah and K. Soundara Rajan},
	title = {Energy Efficient Hierarchical Stable Election Protocol},
	journal = {International Journal of Computer Applications},
	issue_date = {April 2019},
	volume = {182},
	number = {47},
	month = {Apr},
	year = {2019},
	issn = {0975-8887},
	pages = {28-33},
	numpages = {6},
	url = {http://www.ijcaonline.org/archives/volume182/number47/30510-2019918711},
	doi = {10.5120/ijca2019918711},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

In the energy efficient routing protocols clustering is done as uniformly and select as cluster head (CH) based on remaining energy and distance of the nodes. This protocol is modification of SEP protocol. The election of Cluster Head (CH) in EEHSEP protocol is based on remaining energy and best node with respect to distance between other nodes and sink node. The energy consumption of sensor nodes is based on the distance traveled by packet, if node transmits loner distance it consume more energy than shorter distance. In this protocol obtains distance between nodes is using distance equation formula. It is calculate distance between node and obtained average distance from the cluster head, based on best average distance of nodes select cluster head.

References

  1. K. Cohen and A. Leshem, “Density-based multiple access for detection in wireless sensor networks,” in IEEE International Symposium on Information Theory (ISIT), pp. 776–780, June 2018
  2. T. Sujithra, N. S. Kumar, K. K. Kumar, and V. Vinayagam, “Survey on data gathering approaches in wireless sensor networks,” Indian Journal of Science and Technology, vol. 10, no. 25, 2017.
  3. K. Cohen and Q. Zhao, “Active hypothesis testing for anomaly detection,” IEEE Transactions on Information Theory, vol. 61, no. 3, pp. 1432–1450, 2015.
  4. K. Cohen and Q. Zhao, “Asymptotically optimal anomaly detection via sequential testing,” IEEE Transactions on Signal Processing, vol. 63, no. 11, pp. 2929–2941, 2015. [3] S. Faisal, N. Javaid, A. Javaid, M. A. Khan, S. H. Bouk and Z. A. Khan, "Z-SEP: Zonal-Stable Election Protocol for Wireless Sensor Networks" Journal of Basic and Applied Scientific Research (JBASR), 2013. 
  5. H. Kour and A. K. Sharma, “Hybrid Energy Efficient Distributed Protocol for Heterogeneous Wireless Sensor Network,” International Journal of Computer Applications Vol. 4, No.6, July 2010.
  6. Laveena Mahajan, Narinder Shanna “Improving the Stable Period of WSN using Dynamic Stable Leach Election Protocol” 2014 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT), pp. 393-401, 2014
  7. Arafat Abu Malluh, Khaled M. Elleithy, Zakariya Qawaqneh, Ramadhan J. Mstafa, Adwan Alanazi “EM-SEP: An Efficient Modified Stable Election Protocol”, Proceedings of 2014 Zone 1 Conference of the American Society for Engineering Education (ASEE Zone1). 2014
  8. Dahlila P. Dahnil, Yaswant P. Singh, Chin Kuan Ho “Energy-Efficient Cluster Formation in Heterogeneous Wireless Sensor Networks: A Comparative Study” ICACT2011, pp no. 746-751, Feb. 13-16, 2011.
  9. O. Rehman, N. Javaid, B. Manzoor, A. Hafeez, A. Iqbal, M. Ishfaq “Energy Consumption Rate based Stable Election Protocol (ECRSEP) for WSNs” Procedia Computer Science 19 ( 2013 ) 932 – 937.
  10. Mritunjay Rai,Shekhar Verma,Shashikala Tapaswi.A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks.Journal of networks, VOL. 4, NO. 6, AUGUST 2009.
  11. Weili Wua,Hongwei Dub,Xiaohua Jia, Yingshu Li, Scott C.-H. Huang.Minimum connected dominating sets and maximal independent sets in unit disk graphs.Theoretical Computer Science 352 (2006) 1 7.
  12. Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.Discrete mobile centers.17th Annual Symposium on Computational 196. ACM Press, New York (2001)
  13. Luby, M.A simple parallel algorithm for the maximal independent set problem.17th Annual ACM Symposium on Theory of 10. ACM Press, New York (1985).
  14. Amitabha Bagchi, Sparse power-efficient topologies for wireless ad hoc sensor networks, IEEE International Symposium on Parallel and Distributed Systems, 19-23 April, 2010,
  15. Sohrabi, K., Gao, J., Ailawadhi, V., Pottie, G., “Protocols for Self-Organization of a Wireless Sensor Network,” IEEE Personal Communications Mag., Vol.7, No.5, pp.16-27, Oct. 2000.
  16. Estrin, D., Govindan, R., “Next Century Challenges: Scalable Coordination in Sensor Networks,” MobiCom’99, Seattle, WA, pp.263-270, Aug. 1999. [3] Rabiner, W., Chandrakasan, A., Balakrishnan, H., “Energy-Efficient Communication Protocol for Wireless Microsensor Networks,” Hawaii International Conference on System Sciences, Maui, HI, pp.10-19, Jan. 2000.

Keywords

WSN, SEP, Routing