Abstract

In this paper, an energy-efficient localization algorithm is proposed for precise localization in wireless sensor networks (WSNs) and the process is accomplished in three steps. Firstly, the beacon nodes discover their one-hop neighbor nodes with additional tone requests and reply packets over the media access control (MAC) layer to avoid collision of packets. Secondly, the discovered one-hop unknown nodes are divided into two sets, i.e. unknown nodes with direct communication, and with indirect communication for energy efficiency. In direct communication, source beacon nodes forward the information directly to the unknown nodes, but a common beacon node is selected for communication which reduces overall energy consumption during transmission in indirect communication. Finally, a correction factor is also introduced, and localized unknown nodes are upgraded into helper nodes for reducing the localization error. To analyze the efficiency and effectiveness of the proposed algorithm, various simulations are conducted and compared with the existing algorithms.

Highlights

  • With the rapid development of microelectromechanical systems (MEMS), very-large-scale integration (VLSI) and wireless communication technology have led to the growth of multifunctional small sensor nodes [1,2,3]

  • We proposed an energy-efficient novel Distance Vector-Hop (DV-Hop) algorithm for better localization with the least energy consumption

  • DV-Hop algorithm is completed in three phases: Firstly, the beacon nodes forward their location to the Proposed one-hop Algorithm neighbor sensor nodes; secondly, hop-size distance of each beacon node is computed; and the positions of unknown nodes an are energy-efficient discovered in thenovel last phase

Read more

Summary

Introduction

With the rapid development of microelectromechanical systems (MEMS), very-large-scale integration (VLSI) and wireless communication technology have led to the growth of multifunctional small sensor nodes [1,2,3]. The deployment of sensor nodes manually is a simple and easy method for localization, but not feasible for remote areas and large scale deployments Another simple method of localization is to install sensor nodes with global positioning system (GPS) receivers, but that adds size, cost, complexity, and energy consumption [13,14,15]. In range-based approaches, the positions of sensor nodes are computed using distance or angle information while range-free approaches compute the locations using connectivity and hop-count information. In these approaches, some sensor nodes are installed with GPS, known as beacon nodes (BN), and remaining sensor nodes, labelled unknown nodes (UN), determine their position with the help of beacon nodes [16,17,18]. The localization errors are reduced using a correction factor and localized unknown nodes are upgraded into helper nodes for accurate localization

Present State of Research and Research Gaps
Proposed Network Model
Anisotropic Network Model
Proposed Algorithm
Neighbored and Nearest
Unknown
Performance Evaluation
Simulated Results
Impact
Conclusions
Full Text
Paper version not known

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