Issue No. 02 - Feb. (2013 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2011.258
M. Fiore , CITI Lab., INSA Lyon, Villeurbanne, France
Claudio Ettore Casetti , Dipt. di Elettron., Politec. di Torino, Turin, Italy
C. Chiasserini , Dipt. di Elettron., Politec. di Torino, Turin, Italy
P. Papadimitratos , Sch. of Electr. Eng., KTH, Stockholm, Sweden
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.
vehicular ad hoc networks, mobility management (mobile radio), routing protocols, telecommunication services, routing protocol, neighbor position verification, mobile ad hoc networks, ad hoc networking protocols, location-aware services, mobile nodes, Protocols, Mobile computing, Timing, Robustness, Mobile communication, Public key, vehicular networks, Neighbor position verification, mobile ad hoc networks
C. Ettore Casetti, C. Chiasserini, P. Papadimitratos and M. Fiore, "Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks," in IEEE Transactions on Mobile Computing, vol. 12, no. , pp. 289-303, 2013.