Minimum cost localization problem in wireless sensor networks

Authors:
Minsu Huang;Siyuan Chen;Yu Wang
Affiliations:
Department of Computer Science, University of North Carolina at Charlotte, Charlotte, NC 28223, USA;Department of Computer Science, University of North Carolina at Charlotte, Charlotte, NC 28223, USA;Department of Computer Science, University of North Carolina at Charlotte, Charlotte, NC 28223, USA
Venue:
Ad Hoc Networks
Year:
2011

Citing 12
Cited 1

Dynamic fine-grained localization in Ad-Hoc networks of sensors

Proceedings of the 7th annual international conference on Mobile computing and networking
The bits and flops of the n-hop multilateration primitive for node localization problems

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Robust distributed network localization with noisy range measurements

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Connected rigidity matroids and unique realizations of graphs

Journal of Combinatorial Theory Series B
GPS-Free node localization in mobile wireless sensor networks

MobiDE '06 Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile access
Localization in sparse networks using sweeps

Proceedings of the 12th annual international conference on Mobile computing and networking
A Theory of Network Localization

IEEE Transactions on Mobile Computing
Localization with Dive'N'Rise (DNR) beacons for underwater acoustic sensor networks

Proceedings of the second workshop on Underwater networks
AUV-Aided Localization for Underwater Sensor Networks

WASA '07 Proceedings of the International Conference on Wireless Algorithms,Systems and Applications
Connectivity-based localization of large-scale sensor networks with complex shape

ACM Transactions on Sensor Networks (TOSN)
Distributed sensor localization in random environments using minimal number of anchor nodes

IEEE Transactions on Signal Processing

Cooperative localization in mobile networks using nonparametric variants of belief propagation

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Localization is a fundamental problem in wireless sensor networks. Current localization algorithms mainly focus on checking the localizability of a network and/or how to localize as many nodes as possible given a static set of anchor nodes and distance measurements. In this paper, we study a new optimization problem, minimum cost localization problem, which aims to localize all sensors in a network using the minimum number (or total cost) of anchor nodes given the distance measurements. We show this problem is very challenging and then present a set of greedy algorithms using both trilateration and local sweep operations to address the problem. Extensive simulations have been conducted and demonstrate the efficiency of our algorithms.