Wireless Sensor Network Localization Using Alternating Minimization Algorithm

Date

2015-05-19

Author

Erdemir, Ece Naz
Tuncer, Temel Engin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

37
views

0
downloads

In this work, wireless sensor network localization problem is considered. Finding the three dimensional locations of randomly distributed sensors with limited power and communication ability is a hard problem. When the distances between sensors and anchored nodes are known, problem can be solved by using a linear set of equations for each sensor node. When the number of anchors is less than four, the problem is nonconvex and NP hard and can be solved with an optimization approach. In this work, alternating minimization algorithm is proposed. This structure converges to the optimum solution iteratively. Different problem scenarios are considered and relative sensor locations are obtained without using anchor locations. Effectiveness of the proposed approach is shown by considering several experiments.

Subject Keywords

Wireless sensor network localization, Alternating minimization, Nonconvex optimization

URI

https://hdl.handle.net/11511/55352

Conference Name

23nd Signal Processing and Communications Applications Conference (SIU)

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Cooperative Localization In One-Hop And Multi-Hop Wireless Sensor Networks Using Alternating Minimization Algorithm Erdemir, Ece Naz; Tuncer, Temel Engin (2016-05-19) In this work, a new approach is proposed to solve cooperative localization problems in wireless sensor networks for both one-hop and multi-hop cases. To find the unknown positions of randomly distributed sensors with limited power and communication ability, noisy inter-sensor distances and anchor node positions are used. In a plane, when the distances between a sensor and at least three neighbor anchors are known, it is possible to find the sensor position by solving a linear set of equations. However, for ...
Rule-Based In-Network Processing in Wireless Sensor Networks Sanli, Ozgur; KÖRPEOĞLU, İBRAHİM; Yazıcı, Adnan (2009-07-10) Wireless sensor networks are application-specific networks, and usually a new network design is required for a new application. In event-driven wireless sensor network applications, the sink node of the network is generally concerned with the higher level information describing the events happening in the network, not the raw sensor data of individual sensor nodes. As the communication is a costly operation in wireless sensor networks, it is important to process the raw data triggering the events inside the...
Life time sensitive weighted clustering on wireless sensor networks Alizadeh Jarchlo, Elnaz; Bazlamaçcı, Cüneyt Fehmi; Department of Information Systems (2013) Wireless Sensor Networks typically include wireless sensor nodes with limited energy. Network lifetime and scalability are considered as two significant requirements for sensor network applications. In order to decrease energy consumption and increase network lifetime one can apply an efficient clustering method. The application of the clustering method proposed in this thesis (LTS-WCA) leads to reducing the energy cost and the transmission distance of each node by grouping the nodes in several clusters and...
Path Planning and Localization for Mobile Anchor Based Wireless Sensor Networks Erdemir, Ecenaz; Tuncer, Temel Engin (2017-09-02) In wireless sensor networks, anchor positions play an important role for accurate localization. For mobile anchor ( MA) based scenarios, both the efficiency of the path planning algorithm and the accuracy of the localization mechanism are critical for the best performance. In this work, an adaptive path planning algorithm is proposed based on Gauss-Markov mobility model, while the sensors are localized using alternating minimization approach. Path planning, which combines the velocity adjustment, the perpen...
Path planning and localization for mobile anchor based wireless sensor networks Erdemir, Ecenaz; Tuncer, Temel Engin; Department of Electrical and Electronics Engineering (2017) In wireless sensor networks, sensors with limited resources are distributed in a wide area. Localizing the sensors is an important problem. Anchor nodes with known positions are used for sensor localization. A simple and efficient way of generating anchor nodes is to use mobile anchors which have built-in GPS units. In this thesis, a single mobile anchor is used to traverse the region of interest to communicate with the sensor nodes and identify their positions. Therefore planning the best trajectory for th...

Citation Formats

E. N. Erdemir and T. E. Tuncer, “Wireless Sensor Network Localization Using Alternating Minimization Algorithm,” presented at the 23nd Signal Processing and Communications Applications Conference (SIU), Inonu Univ, Malatya, TURKEY, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55352.