Weighted-DESYNC and Its Application to End-to-End Throughput Fairness in Wireless Multihop Network

Abstract

The end-to-end throughput of a routing path in wireless multihop network is restricted by a bottleneck node that has the smallest bandwidth among the nodes on the routing path. In this study, we propose a method for resolving the bottleneck-node problem in multihop networks, which is based on multihop DESYNC (MH-DESYNC) algorithm that is a bioinspired resource allocation method developed for use inmultihop environments and enables fair resource allocation among nearby (up to two hops) neighbors. Based onMH-DESYNC, we newly proposeweighted-DESYNC (W-DESYNC) as a tool artificially to control the amount of resource allocated to the specific user and thus to achieve throughput fairness over a routing path. ProposedW-DESYNC employs the weight factor of a link to determine the amount of bandwidth allocated to a node. By letting the weight factor be the link quality of a routing path and making it the same across a routing path via Cucker-Smale flocking model, we can obtain throughput fairness over a routing path. The simulation results show that the proposed algorithm achieves throughput fairness over a routing path and can increase total end-to-end throughput in wireless multihop networks.