• Title/Summary/Keyword: network localization

Search Result 449, Processing Time 0.036 seconds

Localization using Centroid in Wireless Sensor Networks (무선 센서 네트워크에서 위치 측정을 위한 중점 기 법)

  • Kim Sook-Yeon;Kwon Oh-Heum
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.5
    • /
    • pp.574-582
    • /
    • 2005
  • Localization in wireless sensor networks is essential to important network functions such as event detection, geographic routing, and information tracking. Localization is to determine the locations of nodes when node connectivities are given. In this paper, centroid approach known as a distributed algorithm is extended to a centralized algorithm. The centralized algorithm has the advantage of simplicity. but does not have the disadvantage that each unknown node should be in transmission ranges of three fixed nodes at least. The algorithm shows that localization can be formulated to a linear system of equations. We mathematically show that the linear system have a unique solution. The unique solution indicates the locations of unknown nodes are capable of being uniquely determined.

Incremental Strategy-based Residual Regression Networks for Node Localization in Wireless Sensor Networks

  • Zou, Dongyao;Sun, Guohao;Li, Zhigang;Xi, Guangyong;Wang, Liping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2627-2647
    • /
    • 2022
  • The easy scalability and low cost of range-free localization algorithms have led to their wide attention and application in node localization of wireless sensor networks. However, the existing range-free localization algorithms still have problems, such as large cumulative errors and poor localization performance. To solve these problems, an incremental strategy-based residual regression network is proposed for node localization in wireless sensor networks. The algorithm predicts the coordinates of the nodes to be solved by building a deep learning model and fine-tunes the prediction results by regression based on the intersection of the communication range between the predicted and real coordinates and the loss function, which improves the localization performance of the algorithm. Moreover, a correction scheme is proposed to correct the augmented data in the incremental strategy, which reduces the cumulative error generated during the algorithm localization. The analysis through simulation experiments demonstrates that our proposed algorithm has strong robustness and has obvious advantages in localization performance compared with other algorithms.

Constructing a Support Vector Machine for Localization on a Low-End Cluster Sensor Network (로우엔드 클러스터 센서 네트워크에서 위치 측정을 위한 지지 벡터 머신)

  • Moon, Sangook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.12
    • /
    • pp.2885-2890
    • /
    • 2014
  • Localization of a sensor network node using machine learning has been recently studied. It is easy for Support vector machines algorithm to implement in high level language enabling parallelism. Raspberrypi is a linux system which can be used as a sensor node. Pi can be used to construct IP based Hadoop clusters. In this paper, we realized Support vector machine using python language and built a sensor network cluster with 5 Pi's. We also established a Hadoop software framework to employ MapReduce mechanism. In our experiment, we implemented the test sensor network with a variety of parameters and examined based on proficiency, resource evaluation, and processing time. The experimentation showed that with more execution power and memory volume, Pi could be appropriate for a member node of the cluster, accomplishing precise classification for sensor localization using machine learning.

A Fine-grained Localization Scheme Using A Mobile Beacon Node for Wireless Sensor Networks

  • Liu, Kezhong;Xiong, Ji
    • Journal of Information Processing Systems
    • /
    • v.6 no.2
    • /
    • pp.147-162
    • /
    • 2010
  • In this paper, we present a fine-grained localization algorithm for wireless sensor networks using a mobile beacon node. The algorithm is based on distance measurement using RSSI. The beacon node is equipped with a GPS sender and RF (radio frequency) transmitter. Each stationary sensor node is equipped with a RF. The beacon node periodically broadcasts its location information, and stationary sensor nodes perceive their positions as beacon points. A sensor node's location is computed by measuring the distance to the beacon point using RSSI. Our proposed localization scheme is evaluated using OPNET 8.1 and compared with Ssu's and Yu's localization schemes. The results show that our localization scheme outperforms the other two schemes in terms of energy efficiency (overhead) and accuracy.

A WLAN/GPS Hybrid Localization Algorithm for Indoor/Outdoor Transit Area (실내외 천이영역 적용을 위한 WLAN/GPS 복합 측위 알고리즘)

  • Lee, Young-Jun;Kim, Hee-Sung;Lee, Hyung-Keun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.6
    • /
    • pp.610-618
    • /
    • 2011
  • For improved localization around the indoor/outdoor transit area of buildings, this paper proposes an efficient algorithm combining the measurements from the WLAN (Wireless Local Area Network) and the GPS (Global Positioning System) for. The proposed hybrid localization algorithm considers both multipath errors and NLOS (Non-Line-of-Sight) errors, which occur in most wireless localization systems. To detect and isolate multipath errors occurring in GPS measurements, the propose algorithm utilizes conventional multipath test statistics. To convert WLAN signal strength measurements to range estimates in the presence of NLOS errors, a simple and effective calibration algorithm is designed to compute conversion parameters. By selecting and combining the reliable GPS and WLAN measurements, the proposed hybrid localization algorithm provides more accurate location estimates. An experiment result demonstrates the performance of the proposed algorithm.

Probabilistic Support Vector Machine Localization in Wireless Sensor Networks

  • Samadian, Reza;Noorhosseini, Seyed Majid
    • ETRI Journal
    • /
    • v.33 no.6
    • /
    • pp.924-934
    • /
    • 2011
  • Sensor networks play an important role in making the dream of ubiquitous computing a reality. With a variety of applications, sensor networks have the potential to influence everyone's life in the near future. However, there are a number of issues in deployment and exploitation of these networks that must be dealt with for sensor network applications to realize such potential. Localization of the sensor nodes, which is the subject of this paper, is one of the basic problems that must be solved for sensor networks to be effectively used. This paper proposes a probabilistic support vector machine (SVM)-based method to gain a fairly accurate localization of sensor nodes. As opposed to many existing methods, our method assumes almost no extra equipment on the sensor nodes. Our experiments demonstrate that the probabilistic SVM method (PSVM) provides a significant improvement over existing localization methods, particularly in sparse networks and rough environments. In addition, a post processing step for PSVM, called attractive/repulsive potential field localization, is proposed, which provides even more improvement on the accuracy of the sensor node locations.

NLOS Signal Effect Cancellation Algorithm for TDOA Localization in Wireless Sensor Network

  • Kang, Chul-Gyu;Lee, Hyun-Jae;Oh, Chang-Heon
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.2
    • /
    • pp.228-233
    • /
    • 2010
  • In this paper, the iteration localization algorithm that NLOS signal is iteratively removed to get the exact location in the wireless sensor network is proposed. To evaluate the performance of the proposed algorithm, TDOA location estimation method is used, and readers are located on every 150m intervals with rectangular shape in $300m{\times}300m$ searching field. In that searching field, the error distance is analyzed according to increasing the number of iteration, sub-blink and the estimated sensor node locations which are located in the iteration range. From simulation results, the error distance is diminished according to increasing the number of the sub-blink and iteration with the proposed location estimation algorithm in NLOS environment. Therefore, to get more accurate location information in wireless sensor network in NLOS environments, the proposed location estimation algorithm removing NLOS signal effects through iteration scheme is suitable.

Indoor Localization based on Multiple Neural Networks (다중 인공신경망 기반의 실내 위치 추정 기법)

  • Sohn, Insoo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.4
    • /
    • pp.378-384
    • /
    • 2015
  • Indoor localization is becoming one of the most important technologies for smart mobile applications with different requirements from conventional outdoor location estimation algorithms. Fingerprinting location estimation techniques based on neural networks have gained increasing attention from academia due to their good generalization properties. In this paper, we propose a novel location estimation algorithm based on an ensemble of multiple neural networks. The neural network ensemble has drawn much attention in various areas where one neural network fails to resolve and classify the given data due to its' inaccuracy, incompleteness, and ambiguity. To the best of our knowledge, this work is the first to enhance the location estimation accuracy in indoor wireless environments based on a neural network ensemble using fingerprinting training data. To evaluate the effectiveness of our proposed location estimation method, we conduct the numerical experiments using the TGn channel model that was developed by the 802.11n task group for evaluating high capacity WLAN technologies in indoor environments with multiple transmit and multiple receive antennas. The numerical results show that the proposed method based on the NNE technique outperforms the conventional methods and achieves very accurate estimation results even in environments with a low number of APs.

Comparison of High Frequency Detailed Generator Models for Partial Discharge Localization

  • Hassan Hosseini, S.M.;Hosseini Bafghi, S.M.
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.4
    • /
    • pp.1752-1758
    • /
    • 2015
  • This paper presents partial discharge localization in stator winding of generators using multi-conductor transmission line (MTL) and RLC ladder network models. The high-voltage (HV) winding of a 6kV/250kW generator has been modeled by MATLAB software. The simulation results of the MTL and the RLC ladder network models have been evaluated with the measurements results in the frequency domain by applying of the Pearson’s correlation coefficients. Two PD generated calibrator signals in kHz and MHz frequency range were injected into different points of generator winding and the signals simulated/measured at the both ends of the winding. For partial discharge localization in stator winding of generators is necessary to calculate the frequency spectrum of the PD current signals and then estimate the poles of the system from the calculated frequency spectrum. Finally, the location of PD can be estimated. This theory applied for the above generator and the simulation/measured results show the good correlation for PD Location for RLC ladder network and MTL models in the frequency range of kHz (10kHz<f<1MHz) and MHz (1MHz<f<5MHz) respectively.

Weighted Centroid Localization Algorithm Based on Mobile Anchor Node for Wireless Sensor Networks

  • Ma, Jun-Ling;Lee, Jung-Hyun;Rim, Kee-Wook;Han, Seung-Jin
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.1-6
    • /
    • 2009
  • Localization of nodes is a key technology for application of wireless sensor network. Having a GPS receiver on every sensor node is costly. In the past, several approaches, including range-based and range-free, have been proposed to calculate positions for randomly deployed sensor nodes. Most of them use some special nodes, called anchor nodes, which are assumed to know their own locations. Other sensors compute their locations based on the information provided by these anchor nodes. This paper uses a single mobile anchor node to move in the sensing field and broadcast its current position periodically. We provide a weighted centroid localization algorithm that uses coefficients, which are decided by the influence of mobile anchor node to unknown nodes, to prompt localization accuracy. We also suggest a criterion which is used to select mobile anchor node which involve in computing the position of nodes for improving localization accuracy. Weighted centroid localization algorithm is simple, and no communication is needed while locating. The localization accuracy of weighted centroid localization algorithm is better than maximum likelihood estimation which is used very often. It can be applied to many applications.

  • PDF