Path planning and localization for mobile anchor based wireless sensor networks

Download

index.pdf

Date

2017

Author

Erdemir, Ecenaz

Metadata

Show full item record

Item Usage Stats

361
views

171
downloads

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 the mobile anchor is an important problem in this context. The mobile anchor stops on the trajectory to generate anchor nodes which are used in the position estimation of the unknown sensors. Various path planning methods for mobile anchors are proposed to localize as many sensors as possible by following the shortest path with minimum number of anchors. In this thesis, path planning and localization for mobile anchor based wireless sensor networks are investigated. Two novel path planning algorithms are proposed for static and dynamic schemes. These approaches use mobile anchors to cover the monitoring area with minimum path length and by stopping at minimum number of nodes. Moreover, alternating minimization algorithm is proposed for localizing the unknown sensor nodes non-cooperatively. The non-convex, NP-hard node localization problem is converted into a biconvex form and solved iteratively. The performances of the proposed path planning algorithms are compared with alternative approaches through simulations. The results show that more sensors are localized with less anchors in a shorter path and time for both schemes. Furthermore, alternating minimization algorithm provides an effective solution for the sensor localization problem. The simulation results show that the proposed localization approach is less prone to error accumulation than the alternative methods.

Subject Keywords

Sensor networks., Wireless sensor networks., Wireless communication systems.

URI

http://etd.lib.metu.edu.tr/upload/12621305/index.pdf
https://hdl.handle.net/11511/26727

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

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...
Immune system based distributed node and rate selection in wireless sensor networks Atakan, Baris; Akan, Ozguer B. (2006-12-13) Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of dense deployed sensor nodes. Due to the dense deployment, since sensor observations are spatially correlated with respect to spatial location of sensor nodes, it may not be necessary for every sensor node to transmit its data. Therefore, due to the resource constraints of sensor nodes it is needed to select the minimum number of sensor nodes to transmit the data to the sink. Furthermore, to achieve the application-...
Rule-based in-network processing for event-driven applications in wireless sensor networks Şanlı, Özgür; Yazıcı, Adnan; Körpeoğlu, İbrahim; Department of Computer Engineering (2011) Wireless sensor networks are application-specific networks that necessitate the development of specific network and information processing architectures that can meet the requirements of the applications involved. The most important challenge related to wireless sensor networks is the limited energy and computational resources of the battery powered sensor nodes. Although the central processing of information produces the most accurate results, it is not an energy-efficient method because it requires a cont...
Immune system-based energy efficient and reliable communication in wireless sensor networks Atakan, Baris; Akan, Oezguer B. (2006-12-01) Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of densely deployed sensor nodes. Due to the dense deployment, since sensor observations are spatially correlated with respect to location of sensor nodes, it may not be necessary for every sensor node to transmit its data. Therefore, due to the resource constraints of sensor nodes, it is imperative to select the minimum number of sensor nodes to transmit the data to the sink. Furthermore, to achieve the application-s...
Implementation of the heed clustering protocol with sleep scheduling in tinyos 2 on a wireless sensor network testbed Özkan, Canay; Uysal Bıyıkoğlu, Elif; Department of Electrical and Electronics Engineering (2013) Energy efficient operation is often critical for wireless sensor networks (WSN), because network nodes operate on limited batteries. The aim of this thesis is to realize an implementation of an energy-efficient, scalable and competitive clustering protocol, HEED on MICAz motes using TinyOS 2 with further energy-efficiency enhancements. A working testbed is constructed, on which the network organizes itself to send periodic sensor measurements to a central station. In order to control overall energy consumpt...

Citation Formats

E. Erdemir, “Path planning and localization for mobile anchor based wireless sensor networks,” M.S. - Master of Science, Middle East Technical University, 2017.