Sensor Location Verification Scheme Based on Range-Free Localizations in WSNs

2019 ◽  
pp. 89-98
Author(s):  
Keji Mao ◽  
Xiannian Zhou ◽  
Zhikai Yang ◽  
Weiyuan Shi
Keyword(s):  
Sensor Location ◽  
Verification Scheme ◽  
Location Verification ◽  
Range Free

A Novel Verification Scheme for Watermarking Based Image Content Authentication Systems

2008 ◽  
Vol 67 (19) ◽  
pp. 1777-1790 ◽  
Author(s):  
C. Cruz-Ramos ◽  
R. Reyes-Reyes ◽  
J. Mendoza-Noriega ◽  
Mariko Nakano-Miyatake ◽  
Hector Manuel Perez-Meana
Keyword(s):  
Content Authentication ◽  
Image Content ◽  
Verification Scheme

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.

A range‐free localization algorithm for IoT networks

2021 ◽  
Author(s):  
Saeid Barshandeh ◽  
Mohammad Masdari ◽  
Gaurav Dhiman ◽  
Vahid Hosseini ◽  
Krishna K. Singh
Keyword(s):  
Localization Algorithm ◽  
Range Free
Sign in / Sign up

Export Citation Format

Share Document