A multi-hop PSO based localization algorithm for wireless sensor networks

نویسندگان

چکیده مقاله:

A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate due to some limitations on sensor nodes such as price and physical size. In some localization approaches, sensor nodes specify their position with the help of anchor nodes, which have pre-configured positions. Due to error, low accuracy of distance detection method, and, most importantly, and the multi-hop distance of the sensor nodes from the anchors, the obtained position may not be accurate. In this paper, a distributed Particle Swarm Optimization (PSO) algorithm is proposed to estimate the position of the sensor nodes using anchors. In the proposed approach, the average hop length and the number of hops between a sensor node and the anchors are used to determine the estimated positions. The simulation results, as well as the comparison of the proposed algorithm to others, in terms of the average localization error, indicate that our approach leads to more accurate localization. 

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Two-hop Collaborative Localization Algorithm for Wireless Sensor Networks

Localization technology is one of the key supporting technologies in wireless sensor networks. In this paper, a two-hop collaborative multilateral localization algorithm is proposed to localization issues for wireless sensor networks. The algorithm applies anchor nodes within two hops to localize unknown nodes, and uses the minimum range error estimation method to compute coordinates of the unk...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

One Anchor Distance and Angle Based Multi - Hop Adaptive Iterative Localization Algorithm for Wireless Sensor Networks

This paper presents distance and angle measurements based Multi-Hop Adaptive and Iterative Localization algorithm for localization of unknown nodes in wireless sensor networks (WSNs). The present work determines uncertainty region of unknown nodes with respect to known (anchor) nodes using noisy distance and angle measurements. This node transmits its uncertainty region to other unknown nodes t...

متن کامل

Multi-Hop Localization Algorithm Based on Grid-Scanning for Wireless Sensor Networks*

For large-scale wireless sensor networks (WSNs) with a minority of anchor nodes, multi-hop localization is a popular scheme for determining the geographical positions of the normal nodes. However, in practice existing multi-hop localization methods suffer from various kinds of problems, such as poor adaptability to irregular topology, high computational complexity, low positioning accuracy, etc...

متن کامل

An Enhanced DV-Hop Localization Algorithm for Wireless Sensor Networks

Obtaining precise location of sensor nodes at low energy consumption, less hardware requirement, and little computation is a challenging task. As one of the well-known range-free localization algorithm, DV-Hop can be simply implemented in wireless sensor networks, but it provides poor localization accuracy. Therefore, in this paper, the authors propose an enhanced DV-Hop localization algorithm ...

متن کامل

An Advanced DV-Hop Localization Algorithm for Wireless Sensor Networks

Position information is a fundamental element in WSN. As one of the range-free localization algorithm, the DV-Hop (Distance Vector-Hop) is widely applied. The DV-Hop localization algorithm employs the physical distance between the anchor nodes to estimate the average hop distance, instead of the actual transmission distance. The distance gap between the two kinds of distance undoubtedly leads t...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 8  شماره 1

صفحات  0- 0

تاریخ انتشار 2019-05

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

کلمات کلیدی برای این مقاله ارائه نشده است

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023