scholarly journals IMPROVING LOCALIZATION ACCURACY IN WIRELESS SENSOR NETWORKS

2013 ◽  
pp. 152-156
Author(s):  
VINOD KUMAR ◽  
SATYENDRA YADAV ◽  
ASHUTOSH KUMAR SINGH
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Sequential Monte Carlo ◽  
Fundamental Problem ◽  
Geographical Location ◽  
Wireless Sensor ◽  
Localization Accuracy ◽  
Localization Algorithms ◽  
Direction Of Movement

The most fundamental problem of wireless sensor networks is localization (finding the geographical location of the sensors). Most of the localization algorithms proposed for sensor networks are based on Sequential Monte Carlo (SMC) method. To achieve high accuracy in localization it requires high seed node density and it also suffers from low sampling efficiency. There are some papers which solves this problems but they are not energy efficient. Another approach The Bounding Box method was used to reduce the scope of searching the candidate samples and thus reduces the time for finding the set of valid samples. In this paper we propose an energy efficient approach which will further reduce the scope of searching the candidate samples, so now we can remove the invalid samples from the sample space and we can introduce more valid samples to improve the localization accuracy. We will consider the direction of movement of the valid samples, so that we can predict the next position of the samples more accurately, hence we can achieve high localization accuracy.

scholarly journals An Enhanced Hybrid 3D Localization Algorithm Based on APIT and DV-Hop

2017 ◽  
Vol 13 (09) ◽  
pp. 69 ◽  
Author(s):  
Lianjun Yi ◽  
Miaochao Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Hybrid Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
3D Localization ◽  
Localization Algorithms ◽  
Wide Range

<p>Wireless sensor networks (WSN), as a new method of information collection and processing, has a wide range of applications. Since the acquired data must be bound with the location information of sensor nodes, the sensor localization is one of the supporting technologies of wireless sensor networks. However, the common localization algorithms, such as APIT algorithm and DV-Hop algorithm, have the following problems: 1) the localization accuracy of beacon nodes is not high; 2) low coverage rate in sparse environment. In this paper, an enhanced hybrid 3D localization algorithm is designed with combining the advantages of APIT algorithm and DV-Hop algorithm. The proposed hybrid algorithm can improve the localization accuracy of the beacon nodes in dense environments by reducing the triangles in the triangle interior point test (PIT) and selecting good triangles. In addition, the algorithm can combine the advantages of APIT algorithm and DV-Hop algorithm localization algorithm to calculate the unknown node coordinates, and also improve the location coverage of the beacon nodes in sparse environment. Simulation results show that the proposed hybrid algorithm can effectively improve the localization accuracy of beacon nodes in the dense environment and the location coverage of beacon nodes in sparse environment.</p>

scholarly journals Improved Recursive DV-Hop Localization Algorithm with RSSI Measurement for Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 4152
Author(s):  
Sana Messous ◽  
Hend Liouane ◽  
Omar Cheikhrouhou ◽  
Habib Hamam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Position Estimation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Algorithms ◽  
Recursive Computation

As localization represents the main backbone of several wireless sensor networks applications, several localization algorithms have been proposed in the literature. There is a growing interest in the multi-hop localization algorithms as they permit the localization of sensor nodes even if they are several hops away from anchor nodes. One of the most famous localization algorithms is the Distance Vector Hop (DV-Hop). Aiming to minimize the large localization error in the original DV-Hop algorithm, we propose an improved DV-Hop algorithm in this paper. The distance between unknown nodes and anchors is estimated using the received signal strength indication (RSSI) and the polynomial approximation. Moreover, the proposed algorithm uses a recursive computation of the localization process to improve the accuracy of position estimation. Experimental results show that the proposed localization technique minimizes the localization error and improves the localization accuracy.

scholarly journals Localization of Sensor Nodes using Flooding in Wireless Sensor Networks

2013 ◽  
Vol 9 (3) ◽  
pp. 1153-1161
Author(s):  
Basavaraj K Madagouda ◽  
Varsha M Patil ◽  
Pradnya Godse
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Real Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Algorithms ◽  
Anchor Nodes

The accuracy of localization is a significant criterion to evaluate the practical utility of localization algorithm in wireless sensor networks (WSN). In mostly localization algorithms, one of the main methods to improve localization accuracy is to increase the number of anchor nodes. But the number of anchor nodes is always limited because of the hardware restrict, such as cost, energy consumption and so on. In this paper, we propose a novel which uses forwarding a query message in flooding technique for localization using anchor nodes and once a node localized it acts as virtual anchor node and it helps to localize remaining sensor nodes. It is scheme to increase and upgrade the virtual anchor nodes, while the real number of physical anchors is the same as before.

A New Energy-Efficient Hybrid and Clustering Routing for Wireless Sensor Networks

2017 ◽  
Vol 7 (3) ◽  
pp. 176
Author(s):  
Muneer Bani Yassein ◽  
Yaser Khamayseh ◽  
Ismail Hmeidi ◽  
Ahmed Al-Dubai ◽  
Mohammed Al-Maolegi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Wireless Sensor ◽  
New Energy

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Sign in / Sign up

Export Citation Format

Share Document