Energy efficient algorithms for hot spot problem in wireless sensor networks

5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The major bottleneck in the operation of a wireless sensor network (WSNs) is the limited power sources of the sensor nodes. Therefore, effective use of sensors’ energy is the most challenging issue for improving network lifetime. In general, the sensor nodes near to the sink have huge traffic load as they relay data from other nodes to reach the sink. Thus, their energy is exhausted quickly and it results in network segmentation. This problem is generally known as hot spot problem. In this paper, we deal with the hot spot problem and present energy efficient clustering and routing algorithms. The simulated results demonstrate that the proposed algorithms perform better compared to the existing algorithms in terms of various performance metrics.

Cite

CITATION STYLE

APA

Jannu, S., & Jana, P. K. (2016). Energy efficient algorithms for hot spot problem in wireless sensor networks. In Advances in Intelligent Systems and Computing (Vol. 379, pp. 509–517). Springer Verlag. https://doi.org/10.1007/978-81-322-2517-1_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free