scholarly journals Path Planning for Mobile-Anchor Based Wireless Sensor Networks Localization: Obstacle-Presence Schemes

Sensors ◽  
2021 ◽  
Vol 21 (11) ◽  
pp. 3697
Author(s):  
Dogan Yildiz ◽  
Serap Karagol

In many Wireless Sensor Network (WSN) applications, the location of the nodes in the network is required. A logical method to find Unknown Nodes (UNNs) in the network is to use one or several mobile anchors (MAs) equipped with GPS units moving between UNNs and periodically broadcast their current location. The main challenge at this stage is to design an optimum path to estimate the locations of UNNs as accurately as possible, reach all nodes in the network, and complete the localization process as quickly as possible. This article proposes a new path planning approach for MA-based localization called Nested Hexagon Curves (NHexCurves). The proposed model’s performance is compared with the performance of five existing static path planning models using Weighted Centroid Localization (WCL) and Accuracy Priority Trilateration (APT) localization techniques in the obstacle-presence scenario. With the obstacle-handling trajectories used for the models, the negative impact of the obstacle on the localization is reduced. The proposed model provides full coverage and high localization accuracy in the obstacle-presence scenario. The simulation results show the advantages of the proposed path planning model with the H-curve model over existing schemes.

Author(s):  
Sitanshu Kumar ◽  
Dr. Sunil Rathod

In Wireless Sensor Network (WSN), localization process is considered as a major challenge which is intended to maximize with minimized traveling distance of the beacon node. Further, the important issue is to improve coverage area of the anchor-based node and accuracy in calculation of the location of nodes. This paper mainly focuses on an enhanced path planning model using beacon node based upon their location. The proposed model focuses to improve coverage of the network topology by moving in zig-zag path fashion so that it will enhance the reachability of message in almost every possible corner of the deployed area. The proposed model is simulated extensively in a self-simulator with different scenarios and compared with SCAN and anchor-based model. The tested performance of the model is presented along with its analytical model. The simulation result shows that the proposed model gives the better performance as compared to all others existing model in terms of percentage of nodes settled and energy consumption.


Author(s):  
Medhav Kumar Goonjur ◽  
◽  
Irfan Dwiguna Sumitra ◽  
Sri Supatmi ◽  
◽  
...  

A challenging problem that arises in the Wireless Sensor Network (WSN) is localization. It is essential for applications that need information about target positions, are inside an indoor environment. The Localization scheme presented in this experiment consists of four anchor nodes that change their position coordinates and one target node that is used to control the distance. The Localization algorithm designed in this paper makes use of the combination of two algorithms; the Received Strength Signal Indication (RSSI) and Weight Centroid Localization Algorithm (WCLA), called the RSSI-WCLA algorithm. The laboratory results show that the fusion between the RSSI-WCLA algorithm is outstanding than RSSI and WCLA algorithms itself in terms of localization accuracy. However, our proposed algorithm shows that the maximum error distance is less than 0.096m.


2017 ◽  
Vol 2017 ◽  
pp. 1-17 ◽  
Author(s):  
Umma Hany ◽  
Lutfa Akter

We propose scattered path loss based weighted centroid localization (WCL) algorithm for wireless video capsule endoscope (VCE). The main challenge in this approach is the random deviation in the measured received signal strength indicator (RSSI) caused by multipath propagation and shadowing effects of human body channel which in turn increases the localization error. To address this issue, we propose local parameter dependent path loss representation in the training phase and apply adaptive least square error (LSE) method to extract the parameters. Then, in the test phase, we estimate distance using the extracted parameters and the randomly scattered path loss. The position of capsule is estimated using non-degree based WCL followed by a calibration process. We propose suboptimal method of estimating the calibration coefficient and also compute the optimal value of coefficient analytically to set the benchmark. We develop a simulation platform using MATLAB to present the results and to verify the performance. We gradually increase the number of sensors and place them in different topologies using different dimensions. The obtained accuracy by our proposed suboptimal method of WCL is very close to the optimal benchmark for all cases. Our proposed approach also outperforms existing works in terms of localization accuracy.


2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Xihai Zhang ◽  
Junlong Fang ◽  
Fanfeng Meng

An efficient path planning approach in mobile beacon localization for the randomly deployed wireless sensor nodes is proposed in this paper. Firstly, in order to improve localization accuracy, the weighting function based on the distance between nodes is constructed. Moreover, an iterative multilateration algorithm is also presented to avoid decreasing the localization accuracy. Furthermore, a path planning algorithm based on grid scan which can traverse entirely in sensor field is described. At the same time, the start conditions of localization algorithm are also proposed to improve localization accuracy. To evaluate the proposed path planning algorithm, the localization results of beacon nodes randomly deployed in sensor field are also provided. The proposed approach can provide the deployment uniformly of virtual beacon nodes among the sensor fields and the lower computational complexity of path planning compared with method which utilizes only mobile beacons on the basis of a random movement. The performance evaluation shows that the proposed approach can reduce the beacon movement distance and the number of virtual mobile beacon nodes by comparison with other methods.


Author(s):  
Abdelhady M. Naguib ◽  
Shahzad Ali

Background: Many applications of Wireless Sensor Networks (WSNs) require awareness of sensor node’s location but not every sensor node can be equipped with a GPS receiver for localization, due to cost and energy constraints especially for large-scale networks. For localization, many algorithms have been proposed to enable a sensor node to be able to determine its location by utilizing a small number of special nodes called anchors that are equipped with GPS receivers. In recent years a promising method that significantly reduces the cost is to replace the set of statically deployed GPS anchors with one mobile anchor node equipped with a GPS unit that moves to cover the entire network. Objectives: This paper proposes a novel static path planning mechanism that enables a single anchor node to follow a predefined static path while periodically broadcasting its current location coordinates to the nearby sensors. This new path type is called SQUARE_SPIRAL and it is specifically designed to reduce the collinearity during localization. Results: Simulation results show that the performance of SQUARE_SPIRAL mechanism is better than other static path planning methods with respect to multiple performance metrics. Conclusion: This work includes an extensive comparative study of the existing static path planning methods then presents a comparison of the proposed mechanism with existing solutions by doing extensive simulations in NS-2.


Author(s):  
Satya Ranjan Biswal ◽  
Santosh Kumar Swain

: Security is one of the important concern in both types of the network. The network may be wired or wireless. In case of wireless network security provisioning is more difficult in comparison to wired network. Wireless Sensor Network (WSN) is also a type of wireless network. And due to resource constraints WSN is vulnerable against malware attacks. Initially, the malware (virus, worm, malicious code, etc.) targets a single node of WSN for attack. When a node of WSN gets infected then automatically start to spread in the network. If nodes are strongly correlated the malware spreads quickly in the network. On the other hand, if nodes are weakly correlated the speed of malware spread is slow. A mathematical model is proposed for the study of malware propagation dynamics in WSN with combination of spatial correlation and epidemic theory. This model is based on epidemic theory with spatial correlation. The proposed model is Susceptible-Exposed-Infectious-Recover-Dead (SEIRD) with spatial correlation. We deduced the expression of basic reproduction number. It helps in the study of malware propagation dynamics in WSN. The stability analysis of the network has been investigated through proposed model. This model also helps in reduction of redundant information and saving of sensor nodes’ energy in WSN. The theoretical investigation verified by simulation results. A spatial correlation based epidemic model has been formulated for the study of dynamic behaviour of malware attacks in WSN.


2020 ◽  
pp. 1-16
Author(s):  
Monali Prajapati ◽  
Dr. Jay Joshi

In the wireless sensor network (WSN), wireless communication is said to be the dominant power-consuming operation and it is a challenging one. Virtual Multiple-Input–Multiple-Output (V-MIMO) technology is considered to be the energy-saving method in the WSN. In this paper, a novel multihop virtual MIMO communication protocol is designed in the WSN via cross-layer design to enhance the energy efficiency, reliability, and end-to-end (ETE) and Quality of Service (QoS) provisioning. On the basis of the proposed protocol, the optimal set of parameters concerning the transmission and the overall consumed energy by each of the packets is found. Furthermore, the modeling of ETE latency and throughput of the protocol takes place with respect to the bit-error-rate (BER). A novel hybrid optimization algorithm referred as Flight Straight Moth Updated Particle Swarm Optimization (FS-MUP) is introduced to find the optimal BER that meets the QoS, ETE requirements of each link with lower power consumption. Finally, the performance of the proposed model is evaluated over the extant models in terms of Energy Consumption and BER as well.


2014 ◽  
Vol 15 (2) ◽  
pp. 121-128
Author(s):  
Jorge Hans Alayo

Abstract Existing transmission planning models consider basic aspects of the problem. In practice, a transmission utility needs to model other important details such as operation cost of the power system. In this article, a least cost transmission expansion model is proposed considering the operation cost in order to model the trade-off between building new transmission capacity and increasing the power system’s operation cost. The proposed model is transformed into a mixed integer linear programming problem using linearization techniques and solved with CPLEX. Finally, results of the model for the Garver test system and IEEE 24-bus test system are shown.


Sign in / Sign up

Export Citation Format

Share Document