A localization algorithm in wireless sensor networks based on PSO

Authors:
Hui Li;Shengwu Xiong;Yi Liu;Jialiang Kou;Pengfei Duan
Affiliations:
School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China;School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China;School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China;School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China;School of Computer Science and Technology, Wuhan University of Technology, Wuhan, China
Venue:
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part II
Year:
2011

Citing 5
Cited 1

GPS-Free Positioning in Mobile ad-hoc Networks

HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Range-free localization schemes for large scale sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Protocols and model for sink mobility in wireless sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review
A novel localization scheme based on RSS data for wireless sensor networks

APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
A survey on sensor networks

IEEE Communications Magazine

A small world approach for scalable and resilient position estimation algorithms for wireless sensor networks

Proceedings of the 10th ACM international symposium on Mobility management and wireless access

Quantified Score

Hi-index	0.00

Visualization

Abstract

Node localization is a fundamental and important technology in wireless sensor networks. In this paper, a localization algorithm in wireless sensor networks based on PSO is proposed. Unlike most of the existing location algorithm, the proposed algorithm figures out the rectangular estimation range of unknown node by bounding box algorithm and takes one value as the estimated coordinates of this node, then it has been optimized by PSO, so got the more precise location of unknown nodes. Simulation results show that this optimized algorithm outperforms traditional bounding box on the positioning accuracy and localization error.