scholarly journals Uncertain Data Clustering-Based Distance Estimation in Wireless Sensor Networks

Sensors ◽  
2014 ◽  
Vol 14 (4) ◽  
pp. 6584-6605 ◽  
Author(s):  
Qinghua Luo ◽  
Yu Peng ◽  
Xiyuan Peng ◽  
Abdulmotaleb Saddik
2017 ◽  
Vol 13 (2) ◽  
pp. 155014771668968 ◽  
Author(s):  
Sunyong Kim ◽  
Sun Young Park ◽  
Daehoon Kwon ◽  
Jaehyun Ham ◽  
Young-Bae Ko ◽  
...  

In wireless sensor networks, the accurate estimation of distances between sensor nodes is essential. In addition to the distance information available for immediate neighbors within a sensing range, the distance estimation of two-hop neighbors can be exploited in various wireless sensor network applications such as sensor localization, robust data transfer against hidden terminals, and geographic greedy routing. In this article, we propose a two-hop distance estimation method, which first obtains the region in which the two-hop neighbor nodes possibly exist and then takes the average of the distances to the points in that region. The improvement in the estimation accuracy achieved by the proposed method is analyzed in comparison with a simple summation method that adds two single-hop distances as an estimate of a two-hop distance. Numerical simulation results show that in comparison with other existing distance estimation methods, the proposed method significantly reduces the distance estimation error over a wide range of node densities.


Sensors ◽  
2019 ◽  
Vol 20 (1) ◽  
pp. 23 ◽  
Author(s):  
Hao Fu ◽  
Yinghong Liu ◽  
Zhe Dong ◽  
Yuanming Wu

In cluster-based wireless sensor networks, cluster heads (CHs) gather and fuse data packets from sensor nodes; then, they forward fused packets to the sink node (SN). This helps wireless sensor networks balance energy effectively and efficiently to prolong their lifetime. However, cluster-based WSNs are vulnerable to selective forwarding attacks. Compromised CHs would become malicious and launch selective forwarding attacks in which they drop part of or all the packets from other nodes. In this paper, a data clustering algorithm (DCA) for detecting a selective forwarding attack (DCA-SF) is proposed. It can capture and isolate malicious CHs that have launched selective forwarding attacks by clustering their cumulative forwarding rates (CFRs). The DCA-SF algorithm has been strengthened by changing the DCA parameters (Eps, Minpts) adaptively. The simulation results show that the DCA-SF has a low missed detection rate of 1.04% and a false detection rate of 0.42% respectively with low energy consumption.


Sign in / Sign up

Export Citation Format

Share Document