Wireless sensor network node localization based on error bound DV-Hop algorithm

DV-Hop algorithm is proposed based on the error bound (EBDV-Hop) for the problems of DV-Hop that node localization algorithm caused by estimating large distance, and the problem of particle swarm optimization algorithm to search a large space and solve the problems slowly: Firstly EBDV-Hop model is...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhou Gong-qian, Yang Lu-jing, Liu Zhong
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Clustering algorithms
Conferences
DV-Hop
EBDV-Hop
Electronics
Error analysis
Localization
Mathematical model
Particle swarm optimization
Particle swarm optimization clustering
Position (location)
Remote sensors
Sociology
Statistics
Swarm intelligence
wireless sensor network
Wireless sensor networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:DV-Hop algorithm is proposed based on the error bound (EBDV-Hop) for the problems of DV-Hop that node localization algorithm caused by estimating large distance, and the problem of particle swarm optimization algorithm to search a large space and solve the problems slowly: Firstly EBDV-Hop model is set up based on the analysis algorithm error of DV-Hop; Then the positioning results are optimized by improved particle swarm optimization clustering which is proposed based on model; EBDV-Hop and DV-Hop are simulated in situation in following situations including in different anchors, different communication radius and different iteration number. The results show that EBDV-Hop can improve the positioning accuracy and positioning speed effectively.
ISSN:1948-9447
DOI:10.1109/CCDC.2016.7531385