International Journal Of Engineering And Computer Science
A large number of temporary nodes consisting of set of rules and destination based services require that mobile nodes learn the nearest places. A process can be easily improper usage or interrupt by opposition nodes. In being away of fixed nodes the discover and verifying of nearest places that have been hardly inquired in the existing system. In this paper by introducing a complete distributed answer that is strong and secret against adjacent nodes and can be damaged only by a huge number of neighbor nodes.