Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Path Planning and Localization for Mobile Anchor Based Wireless Sensor Networks
Date
2017-09-02
Author
Erdemir, Ecenaz
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
206
views
0
downloads
Cite This
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 perpendicular bisector and the virtual repulsive strategies, is improved by developing virtual attractive force strategy. The surveillance area is divided into grids and a virtual attractive force is applied to the MA in sparsely and densely populated areas. For localization, the non-convex optimization problem is converted into a bi-convex form and solved by alternating minimization algorithm leading to a shorter MA path. The simulation results show that introducing the virtual attractive strategy increases the path planning accuracy and cover more surveillance region using less energy. Furthermore, compared to the linear localization method, the localization accuracy increases when the alternating minimization is used.
Subject Keywords
Dynamic path planning
,
Mobility model
,
Mobile-anchor
,
Sensor network localization
,
Alternating minimization
URI
https://hdl.handle.net/11511/55477
Conference Name
25th European Signal Processing Conference (EUSIPCO)
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
An Adaptive Path Planning Algorithm for Mobile-Anchor Based Wireless Sensor Networks
Erdemir, Ece Naz; Tuncer, Temel Engin (2017-01-01)
In wireless sensor networks, anchor positions play an important role for high localization accuracy. Planning an efficient path for mobile anchor nodes (MN) is critical for required anchor positions. In this work, an adaptive path planning algorithm is proposed for mobile anchors based on Gauss-Markov mobility model. The approach, which the velocity adjustment, the perpendicular bisector and the virtual repulsive strategies are combined based on Gauss-Markov mobility, is improved by developing a grid based ...
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...
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 ...
Information-centric sensor networks for cognitive IoT: an overview
Al-Turjman, Fadi M. (2017-02-01)
Information-centric sensor networks (ICSNs) are a paradigm of wireless sensor networks that focus on delivering information from the network based on user requirements, rather than serving as a point-to-point data communication network. Introducing learning in such networks can help to dynamically identify good data delivery paths by correlating past actions and results, make intelligent adaptations to improve the network lifetime, and also improve the quality of information delivered by the network to the ...
Exploiting energy-aware spatial correlation in wireless sensor networks
Shah, Ghalib A.; Bozyigit, Muslim (2007-01-12)
Wireless sensor networks (WSNs) promise fine-grain monitoring in a wide variety of applications, which require dense sensor nodes deployment. Due to high density of nodes, spatially redundant or correlated data is generated. Redundancy increases the reliability level of information delivery but increases the energy consumption of the nodes too. Since energy conservation is a key issue for WSNs, therefore, spatial correlation can be exploited to deactivate some of the nodes generating redundant information. ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Erdemir and T. E. Tuncer, “Path Planning and Localization for Mobile Anchor Based Wireless Sensor Networks,” presented at the 25th European Signal Processing Conference (EUSIPCO), GREECE, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55477.