Performance routing with shortest path exploration in wireless mesh networks
Keyword(s):
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 manytechniques 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.
2012 ◽
Vol 2
(3)
◽
pp. 134-141
Keyword(s):
Keyword(s):
2019 ◽
Vol 01
(02)
◽
pp. 103-115
2010 ◽
pp. 331-347
◽
Keyword(s):