A Water Flow Algorithm Based Link Optimization in Common-Hop for Congestion Control in Wireless Mesh Networks

Abstract

One of the famous and popular networks is Wireless Mesh Networks (WMN), in which any node can communicate with any other node. Nodes in the WMN are called as mesh nodes, including multi-radios changed to non-overlapping channels for improving their capacities. Since mesh connection, data transmission between any two nodes is confused with selecting a link and bandwidth among pair of nodes dynamically. In the mesh network, any single node becomes a common-hop, can have multiple links from various sources nodes. When a greater number of data packet arrives into the common-hop, understanding and forwarding them is a critical issue and congestion occurs. In mesh network, obtaining a potential bandwidth route is also a critical task. The common-hop meets difficult in selecting a next hop based on the potential bandwidth, and forward the appropriate data packet. Due to the variations in packet arrival, common-hop meets congestion, flooding and jamming. To avoid this kind of problems in mesh network, this paper proposed Water Flow Algorithm (WFA) for optimizing the link and avoid congestion in mesh networks. The data packet flow from the source nodes is forward in the optimized links eliminates congestion. The proposed WFA optimization is simulated in MATLAB software and the results are compared with the existing algorithms for performance evaluation.