Performance routing with shortest path exploration in wireless mesh networks
- Wireless mesh networks shortest path, packet loss, delay in packets, average end to end delay
In wireless mesh network the nodes are dynamically self-organized and self- configured networks create a changing topology and keep a mesh connectivity to offer Internet access to the users. The shortest path problem is one of the most fundamental problems in networking. This problem can be solved by many
techniques and algorithm. In this paper we find the shortest path by using the fittest nodes in the network. By using the fittest node we can send the packets to the destination without packet loss, delay in packets.Average end to end delay is decreased by increasing bandwidth and the results are shown.