Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks
2013 (English)In: IEEE Transactions on Mobile Computing, ISSN 1536-1233, E-ISSN 1558-0660, Vol. 12, no 2, 289-303 p.Article in journal (Refereed) Published
A growing number of ad hoc networking protocols and location-aware services require that mobile nodes learn the position of their neighbors. However, such a process can be easily abused or disrupted by adversarial nodes. In absence of a priori trusted nodes, the discovery and verification of neighbor positions presents challenges that have been scarcely investigated in the literature. In this paper, we address this open issue by proposing a fully distributed cooperative solution that is robust against independent and colluding adversaries, and can be impaired only by an overwhelming presence of adversaries. Results show that our protocol can thwart more than 99 percent of the attacks under the best possible conditions for the adversaries, with minimal false positive rates.
Place, publisher, year, edition, pages
2013. Vol. 12, no 2, 289-303 p.
Neighbor position verification, mobile ad hoc networks, vehicular networks
IdentifiersURN: urn:nbn:se:kth:diva-116412DOI: 10.1109/TMC.2011.258ISI: 000312558900008ScopusID: 2-s2.0-84871741917OAI: oai:DiVA.org:kth-116412DiVA: diva2:589912
QC 201301212013-01-212013-01-182013-01-21Bibliographically approved