Abstracto

An Iterative Greedy Approach Using Geographical Destination Routing In WSN

S.K.Kiruthiga, S.Kavipriya , Dr.T.Revathi

Despite the good perspectives of wireless sensor networks, there are still lots of design challenges, as sensor nodes are usually low-power devices with short transmission ranges . In wireless sensor network distributed storage systems have been proposed to distribute the data to various sink nodes. However such distributed access cannot be fully supported by available routing protocols. So efficiently routing is required to route data from source sensor to all sink nodes. Normally sensors spend most of its energy for data transmission, so designing energy efficient data transmission schemes is one of the most important issue. In this project work we proposed GKAR (Geographic KAnycast Routing Protocol) to efficiently route data from a source sensor node to any K-destinations sink nodes, GKAR has adopted an iterative approach to guarantee K-delivery to all sink nodes. In each iteration, GKAR determined next hops and a set of potential destinations for every next hops to reach k-destinations .At each intermediate node an ENSDA algorithm have been designed to determine the selection of next hops and destination set division. The result shows that, compared to k 1- anycast, controlled flooding and k-anycast by GKAR protocol reduces energy consumption and communication overhead for forwarding the message.