✦ LIBER ✦

Minimum cost localization problem in wireless sensor networks

✍ Scribed by Minsu Huang; Siyuan Chen; Yu Wang

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 877 KB
Volume: 9
Category: Article
ISSN: 1570-8705
DOI: 10.1016/j.adhoc.2010.08.013

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Monte Carlo localization for mobile wire

Monte Carlo localization for mobile wireless sensor networks

✍ Aline Baggio; Koen Langendoen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 686 KB

Localization is crucial to many applications in wireless sensor networks. In this article, we propose a range-free anchorbased localization algorithm for mobile wireless sensor networks that builds upon the Monte Carlo localization algorithm. We concentrate on improving the localization accuracy and

Minimum latency joint scheduling and rou

Minimum latency joint scheduling and routing in wireless sensor networks

✍ Gang Lu; Bhaskar Krishnamachari 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 654 KB

Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient communication; however, latency remains an important concern for many applications that require fast response. In this pap

Performance of some metaheuristic algori

Performance of some metaheuristic algorithms for localization in wireless sensor networks

✍ Aloor Gopakumar; Lillykutty Jacob 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 441 KB

Minimum-cost flows in convex-cost networ

Minimum-cost flows in convex-cost networks

✍ T. C. Hu 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 369 KB

Trust management in wireless sensor netw

Trust management in wireless sensor networks

✍ Zahariadis, Theodore ;Leligou, Helen C. ;Trakadas, Panagiotis ;Voliotis, Stamati 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 2 views

## Abstract The range of applications of wireless sensor networks is so wide that it tends to invade our every day life. In the future, a sensor network will survey our health, our home, the roads we follow, the office or the industry we work in or even the aircrafts we use, in an attempt to enhanc

Access control in wireless sensor networ

Access control in wireless sensor networks

✍ Yun Zhou; Yanchao Zhang; Yuguang Fang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 294 KB

Nodes in a sensor network may be lost due to power exhaustion or malicious attacks. To extend the lifetime of the sensor network, new node deployment is necessary. In military scenarios, adversaries may directly deploy malicious nodes or manipulate existing nodes to introduce malicious ''new'' nodes