Abstract

Energy efficiency and balancing is one of the primary challenges for wireless sensor networks (WSNs) since the tiny sensor nodes cannot be easily recharged once they are deployed. Up to now, many energy efficient routing algorithms or protocols have been proposed with techniques like clustering, data aggregation and location tracking etc. However, many of them aim to minimize parameters like total energy consumption, latency etc., which cause hotspot nodes and partitioned network due to the overuse of certain nodes. In this paper, a Distance-based Energy Aware Routing (DEAR) algorithm is proposed to ensure energy efficiency and energy balancing based on theoretical analysis of different energy and traffic models. During the routing process, we consider individual distance as the primary parameter in order to adjust and equalize the energy consumption among involved sensors. The residual energy is also considered as a secondary factor. In this way, all the intermediate nodes will consume their energy at similar rate, which maximizes network lifetime. Simulation results show that the DEAR algorithm can reduce and balance the energy consumption for all sensor nodes so network lifetime is greatly prolonged compared to other routing algorithms.

Highlights

  • Wireless sensor networks (WSNs) have received lots of attention in recently years due to their wide applications like military and disaster surveillance, industrial product line monitoring, agricultural and wildlife observation, healthcare, smart homes, etc. [1]

  • We propose a Distance-based Energy Aware Routing (DEAR) algorithm which can effectively alleviate the hotspot problem based on the theoretical deduction and analysis of relevant models

  • The objective in this paper is to find a set of optimal or sub-optimal individual distances during routing process so that the energy is consumed at similar rate for all involved sensors

Read more

Summary

Introduction

Wireless sensor networks (WSNs) have received lots of attention in recently years due to their wide applications like military and disaster surveillance, industrial product line monitoring, agricultural and wildlife observation, healthcare, smart homes, etc. [1]. Wireless sensor networks (WSNs) have received lots of attention in recently years due to their wide applications like military and disaster surveillance, industrial product line monitoring, agricultural and wildlife observation, healthcare, smart homes, etc. Cheap and tiny sensor nodes are usually randomly deployed in a physical environment to be monitored and they will transmit their collected data to certain remote sink node (or base station) in an autonomous and unattended manner. Energy efficiency and balancing is one of the primary challenges to the successful application of WSNs since the sensor nodes are powered with limited batteries and they cannot be recharged once deployed. Many energy efficient routing algorithms or protocols have been proposed with techniques like clustering, data aggregation, multi-path and location tracking, etc., as can be seen from related work. Since the network lifetime is usually defined as the time when the first node dies from lack of energy, huge amounts of energy will be wasted by the remaining sensor nodes

Objectives
Findings
Discussion
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call