Determining Relative Localization for 1-D Wireless Sensor Networks Based on Round-Trip Time

Author(s):  
Chuangeng Tian ◽  
Lei Chen
2018 ◽  
Vol 14 (8) ◽  
pp. 155014771879385
Author(s):  
Tianbo Lu ◽  
Yifei Su ◽  
Youwen Wang ◽  
Xiaoyan Zhang ◽  
Hao Meng

With the rapid popularization and development of Internet, global researchers are increasingly paying more and more attention to anonymity and privacy security. Anonymous communication technology has gradually become people’s focus. Attacks against sensors may appear in different layers, so anonymity at network layer should therefore be envisioned. Tor, as one of the anonymous communication systems which implements multi-hop to protect user’s identity privacy on the Internet, is currently the most popular anonymous privacy solution, but the concept of Tor has not applied to wireless sensor networks. Therefore, in this article, we think the mix structure of Tor which is crucial to its anonymity can be applied to wireless sensor networks; what’s more, an improved path selecting algorithm according to round trip time we propose can boost some degree of performance. First, we make a summary of current typical path selection algorithms and analyze the performance and anonymity problems of these algorithms in network congestion. Then, in order to improve the performance of the algorithm in congestion, a routing improvement scheme based on round trip time is proposed.


2016 ◽  
Vol 2016 ◽  
pp. 1-15 ◽  
Author(s):  
Saswati Mukherjee ◽  
Matangini Chattopadhyay ◽  
Samiran Chattopadhyay ◽  
Pragma Kar

In wireless communication, wormhole attack is a crucial threat that deteriorates the normal functionality of the network. Invasion of wormholes destroys the network topology completely. However, most of the existing solutions require special hardware or synchronized clock or long processing time to defend against long path wormhole attacks. In this work, we propose a wormhole detection method using range-based topology comparison that exploits the local neighbourhood subgraph. The Round Trip Time (RTT) for each node pair is gathered to generate neighbour information. Then, the network is reconstructed by ordinal Multidimensional Scaling (MDS) followed by a suspicion phase that enlists the suspected wormholes based on the spatial reconstruction. Iterative computation of MDS helps to visualize the topology changes and can localize the potential wormholes. Finally, a verification phase is used to remove falsely accused nodes and identify real adversaries. The novelty of our algorithm is that it can detect both short path and long path wormhole links. Extensive simulations are executed to demonstrate the efficacy of our approach compared to existing ones.


Sign in / Sign up

Export Citation Format

Share Document