Author/Authors :
Sharifi Hamid Reza نويسنده Department of Computer Engineering - Science and Research branch, Islamic Azad University, Tehran , Daneshjoo Parisa نويسنده Computer Engineering Department - West Tehran Branch, Islamic Azad University , Haj Seyed Javadi H. نويسنده Department of Mathematics and Computer Science - Shahed University
Abstract :
Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Query) and SLA (Sink Location Announcement) routes in at least one point. In the proposed solution, a compound Fano plane has been created in which both SLQ and SLA paths have a point of intersection. Source and destination nodes send data packets to nearby routes and the sensor node at the intersection announces the location of the destination node to the source. Simulation is used to evaluate the proposed algorithm. The results revealed reduction in communication overhead.
