This document discusses using wireless mesh networks to interconnect nodes outside an access point's coverage area. It proposes using location information in packets to identify shortest paths and balance traffic across multiple paths to improve quality of service. A contour guided dissemination approach is presented to effectively utilize all available shortest paths through a wireless mesh topology. Bellman-Ford and Dijkstra's algorithms are used for shortest path analysis and routing tables are updated as nodes join and leave the mesh network.

1. QoS & Routing in Regular Wireless Mesh Topologies Presented by S. SyedNizamudeen, (M.B.A.), Jamal Institute of Management Trichy On Behalf of A.MohamedAzhar Ali, (M.E.), M.I.E.T. Engg College Trichy

3. To utilize all paths, each node must receive messages from a set of upstream neighbors and forward these messages to a set of downstream neighbors.

4. To utilize the results in practical applications, it is assumed that each message packet contains the location of both the source and the destination.

5. As the messages propagate through the network, every intermediate node could easily compute which of its immediate neighbors are on a shortest path to the destination.

6. In addition, the results of this section allow the intermediate node to know its relative position in the contour.

7. We show how this location information can be used to effectively exploit all the available shortest paths in a contour.

9. An alternate model with shortest path routing

11. So that it communicates directly only with its set of immediate neighbors, such an arrangement of nodes is referred to as a mesh topology.

12. Several techniques, called dissemination methods, were developed at the network layer to regulate the flow of messages between nonadjacent nodes without relying on unique node identifiers or constructing routing tables using these identifiers.

13. We focus on methods for effectively utilizing all the shortest paths available between a pair of nodes and present results to show that effective utilization of all the available paths significantly improves the Quality of Service (QoS).

15. Dijkstra's algorithm solves the same problem with a lower running time, but requires edge weights to be non-negative. Thus, Bellman–Ford is usually used only when there are negative edge weights.

17. Interconnect mesh node to form the Grid, using this gird a node connected in the range of one mesh node can communicate to other node which is present in the some other mesh node range.

18. Analyzing Shortest path

19. Identify the shortest path to send the packet to the destination

20. Routing table updating

21. Each mesh node monitor the join and leave the mesh nodes

22. Each mesh node maintain the routing table and , all mesh nodes in the grid exchange the routing table.

23. CGD module

24. CGD Module spreading messages to neighboring nodes that effectively exploits the available shortest paths and show that our rules for spreading the messages result in a balanced loading of all the available shortest paths.