Secure Neighbor Discovery in Mobile Ad Hoc Networks through Local Topology Visualization Conference Paper uri icon

abstract

  • © 2016 IEEE. Neighbor discovery is a crucial building block required by important protocols in wireless ad hoc and sensor networks. Routing protocols usually rely on exchanging messages between neighboring nodes and many localization protocols determine nodes' locations based on their neighborhood relationships to other nodes or anchors. In hostile environments an adversary may launch subtle attacks against neighbor discovery by relaying neighbor discovery messages between far away areas in the network to make distant nodes believe to be neighbors. Relay attacks, also known as wormhole attacks, can not be prevented using cryptography because encrypted messages can also be relayed by the adversary. In this paper, we propose an efficient approach to detect and localize wormhole attacks by embedding the network graph in a higher dimensionality space, to identify the inconsistencies among the ranging information as the inherent effect of such attacks. We show the effectiveness of our approach in terms of accuracy and not being sensitive to ranging error, by performing simulations.

author list (cited authors)

  • Taheri, S., Stolerut, R., & Hogrefe, D.

citation count

  • 0

editor list (cited editors)

  • Barolli, L., Takizawa, M., Enokido, T., Jara, A. J., & Bocchi, Y.

publication date

  • March 2016

publisher