DMODL — Distributed Multi-hop On-Demand Localization using virtual anchor nodes in Wireless Sensor Networks

2012 ◽  
Author(s):  
C. M. Roopa ◽  
R. Sumathi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
On Demand ◽  
Anchor Nodes

Real-Time Routing Based on On-Demand Multi-Hop Lookahead in Wireless Sensor Networks

2011 ◽  
Vol E94-B (2) ◽  
pp. 569-572
Author(s):  
Soochang PARK ◽  
Euisin LEE ◽  
Juhyun JUNG ◽  
Sang-Ha KIM
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Wireless Sensor ◽  
On Demand

An Efficient Anchor Nodes Distribution For Accurate Lo-calization (EDAL) In Mobile Wireless Sensor Networks

2020 ◽  
pp. 9
Author(s):  
عمار محمد أبو زنيد ◽  
عين الدين واحد عبدالوهاب ◽  
محمد إدريس اليمني ◽  
عمر عادل مهدي ◽  
ليانا خميس قباجة
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Mobile Wireless ◽  
Mobile Wireless Sensor Networks ◽  
Anchor Nodes ◽  
Mobile Wireless Sensor

Improved DV-Hop Localization Scheme for Randomly Deployed WSNs

2020 ◽  
Vol 10 (1) ◽  
pp. 94-109 ◽  
Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Research Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Anchor Nodes ◽  
Least Energy ◽  
Range Free

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.

scholarly journals Intelligent On-Demand Connectivity Restoration for Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Khalid Mahmood ◽  
Muhammad Amir Khan ◽  
Mahmood ul Hassan ◽  
Ansar Munir Shah ◽  
Shahzad Ali ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Connectivity ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
On Demand ◽  
Connectivity Restoration ◽  
Restoration Technique ◽  
Near Future

Wireless sensor networks are envisioned to play a very important role in the Internet of Things in near future and therefore the challenges associated with wireless sensor networks have attracted researchers from all around the globe. A common issue which is well studied is how to restore network connectivity in case of failure of single or multiple nodes. Energy being a scarce resource in sensor networks drives all the proposed solutions to connectivity restoration to be energy efficient. In this paper we introduce an intelligent on-demand connectivity restoration technique for wireless sensor networks to address the connectivity restoration problem, where nodes utilize their transmission range to ensure the connectivity and the replacement of failed nodes with their redundant nodes. The proposed technique helps us to keep track of system topology and can respond to node failures effectively. Thus our system can better handle the issue of node failure by introducing less overhead on sensor node, more efficient energy utilization, better coverage, and connectivity without moving the sensor nodes.

scholarly journals Localization Algorithm Based on Iterative Centroid Estimation for Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Rui Jiang ◽  
Xin Wang ◽  
Li Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Anchor Node ◽  
Centroid Estimation ◽  
Anchor Nodes ◽  
Localization Precision ◽  
Unknown Node ◽  
Received Signal Strength Indication

According to the application of range-free localization technology for wireless sensor networks (WSNs), an improved localization algorithm based on iterative centroid estimation is proposed in this paper. With this methodology, the centroid coordinate of the space enclosed by connected anchor nodes and the received signal strength indication (RSSI) between the unknown node and the centroid are calculated. Then, the centroid is used as a virtual anchor node. It is proven that there is at least one connected anchor node whose distance from the unknown node must be farther than the virtual anchor node. Hence, in order to reduce the space enclosed by connected anchor nodes and improve the location precision, the anchor node with the weakest RSSI is replaced by this virtual anchor node. By applying this procedure repeatedly, the localization algorithm can achieve a good accuracy. Observing from the simulation results, the proposed algorithm has strong robustness and can achieve an ideal performance of localization precision and coverage.

scholarly journals An Adaptive Acknowledgement On-demand Protocol for Wireless Sensor Networks

2017 ◽  
Author(s):  
Cung Lian Sang ◽  
Marc Hesse ◽  
Sebastian Zehe ◽  
Michael Adams ◽  
Timm Hörmann ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
On Demand
Sign in / Sign up

Export Citation Format

Share Document