|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks
Feb. 2013 (vol. 12 no. 2)
pp. 289-303
| ASCII Text | x | ||
| M. Fiore, Claudio Ettore Casetti, C. Chiasserini, P. Papadimitratos, "Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 12, no. 2, pp. 289-303, Feb., 2013. | |||
| BibTex | x | ||
| @article{ 10.1109/TMC.2011.258, author = {M. Fiore and Claudio Ettore Casetti and C. Chiasserini and P. Papadimitratos}, title = {Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {12}, number = {2}, issn = {1536-1233}, year = {2013}, pages = {289-303}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2011.258}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Mobile Computing TI - Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks IS - 2 SN - 1536-1233 SP289 EP303 EPD - 289-303 A1 - M. Fiore, A1 - Claudio Ettore Casetti, A1 - C. Chiasserini, A1 - P. Papadimitratos, PY - 2013 KW - vehicular ad hoc networks KW - mobility management (mobile radio) KW - routing protocols KW - telecommunication services KW - routing protocol KW - neighbor position verification KW - mobile ad hoc networks KW - ad hoc networking protocols KW - location-aware services KW - mobile nodes KW - Protocols KW - Mobile computing KW - Timing KW - Robustness KW - Mobile communication KW - Public key KW - vehicular networks KW - Neighbor position verification KW - mobile ad hoc networks VL - 12 JA - IEEE Transactions on Mobile Computing ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2011.258
Web Extra: View Supplemental Material(PDF)
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.
Index Terms:
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
Citation:
M. Fiore, Claudio Ettore Casetti, C. Chiasserini, P. Papadimitratos, "Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 12, no. 2, pp. 289-303, Feb. 2013, doi:10.1109/TMC.2011.258
Usage of this product signifies your acceptance of the Terms of Use.

