Абстрактный

Neighbor Position Verification in Mobile Ad Hoc Network

C. LOURDU RAJA

In a mobile ad hoc network without knowing neighbor node position which make a chance to attackers to easily enter into the network. 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. Neighbor position verification to avoid attackers in a network .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.