Research Article
Defending Wormhole Attack in APS DV-hop
@INPROCEEDINGS{10.1109/CHINACOM.2008.4685007, author={ZHU Bin and Liao Jun`guo and ZHANG Huifu}, title={Defending Wormhole Attack in APS DV-hop}, proceedings={ChinaCom2008-Network and Information Security Symposium}, publisher={IEEE}, proceedings_a={CHINACOM2008-NIS}, year={2008}, month={11}, keywords={}, doi={10.1109/CHINACOM.2008.4685007} }- ZHU Bin
Liao Jun`guo
ZHANG Huifu
Year: 2008
Defending Wormhole Attack in APS DV-hop
CHINACOM2008-NIS
IEEE
DOI: 10.1109/CHINACOM.2008.4685007
Abstract
DV-hop is one position algorithm of APS, which uses hop count to estimate the distances to the special nodes with known position. DV-hop is very cheap and convenience to the network with limited resource. But its security is not taken into account in the original design. Wormhole attack is simple and easy to implement in known types of attacks, which makes two far nodes directly communicate and in which the attacker does not need modify the packets. Lunching wormhole attack in DV-hop can cause the algorithm invalid. In this paper, wormhole attack in DV-hop is discussed, and a new scheme named DWDV, is proposed to defend wormhole attack. DWDV is simulated on positif2.0 based on OMNET++ and the experimental result show that DWDV can effectively defend wormhole attack and make more nodes get valid position.
