Modification of Floyd-Warshall´s algorithm for Shortest Path routing in wireless sensor networks

Wireless sensor networks consist of nodes among which beaconing of data occurs through routing. There are a number of routing protocols and algorithms existing based on different criteria. There are a number of shortest path algorithms available, some of which are applicable in case of shortest path routing in wireless sensor networks. Shortest path routing algorithms aim at consumption of minimum amount of energy in a WSN. Generally, Dijkstra´s Algorithm is followed for routing through shortest path in a WSN. The Floyd-Warshall´s Algorithm is again used for computing shortest paths between different nodes in an ordinary graph but this algorithm is not exactly applicable for routing in wireless networks because of the absence of handshaking mode. In this work, the Floyd-Warshall´s Shortest Path Algorithm has been modified and a new algorithm has been proposed for routing in the wireless sensor networks. The proposed algorithm computes the shortest path available taking into consideration a directed graph and presence of acknowledgement path of every traversed path. Code has been developed to simulate the algorithm in Turbo C. This algorithm helps to obtain all the available shortest paths from every node to the other at a time.