Routing in Multi-Hop Networks

Abstract

Wireless network is a collection of number of nodes. There is a single source and a single destination or number of destinations connected by the number of ways. Nodes communicate to each other by sending signals that transmits message through single source to single destination. Signals send by source are in the encoded form. When receiver receives it, process of decoding/encoding with information received from previous nodes is done. In the wireless network there is a problem of finding path which is optimal and requires less energy. In proposed system we find the optimal routing path in signal transmission from source to destination in multi-hop network. We use the rate-less code which is used to collect the data in the transmission process. This will be decrease the total energy and reduce delays in transmission. Proposed system increases significant performance of system by finding the shortest path using Floyd-Warshall algorithm. Floyd Warshall's algorithm is finds shortest path between all nodes and we have to run only once. And which is faster than those algorithms because it runs only once to find shortest path. So we are using Floyd Warshall's algorithm in multi graph system to improve performance and chances of average path loss is very low we have compared existing and proposed system based on path loss.