This document summarizes a research paper that proposes a distributed and cooperative solution for mobile nodes in an ad hoc network to discover and verify the positions of their neighbors. The solution aims to be robust against independent or colluding adversarial nodes by thwarting over 99% of attacks while keeping false positive rates minimal, without relying on any pre-trusted nodes.
Discovery and verification of neighbor positions in mobile ad hoc networks
Android discovery and verification of neighbor positions in mobile ad hoc networks
1. ECWAY TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
OUR OFFICES @ CHENNAI / TRICHY / KARUR / ERODE / MADURAI / SALEM / COIMBATORE
CELL: +91 98949 17187, +91 875487 2111 / 3111 / 4111 / 5111 / 6111
VISIT: www.ecwayprojects.com MAIL TO: ecwaytechnologies@gmail.com
DISCOVERY AND VERIFICATION OF NEIGHBOR POSITIONS
IN MOBILE AD HOC NETWORKS
ABSTRACT:
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.
