S. Bhuvaneswari, P. Sivakamasundari, M.E
The 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 priority trusted nodes, the discovery and verification of neighbor positions presents challenges that have been scarcely investigated in the literature. Identifying a trusted neighbor location is one of the major tasks in the mobile ad hoc network. This can be done by the signal passed by the nearby node. An issue is the signal get by the nearer node is a trusted one or not. In this paper is creating a secure protocol for finding the nearby node in an ad-hoc network. Finally the result gives with verification and robust whether the neighbor node position is a valid one or not.