Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 2017, Article ID 2504604, 10 pages
Research Article

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

1School of Electrical & Electronic Engineering, Chung-Ang University, Seoul, Republic of Korea
2Agency for Defense Development, Daejeon, Republic of Korea

Correspondence should be addressed to Jung-Ryun Lee;

Received 8 December 2016; Revised 21 March 2017; Accepted 29 March 2017; Published 13 April 2017

Academic Editor: Hideyuki Takahashi

Copyright © 2017 Ui-Seong Yu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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 in multihop environments and enables fair resource allocation among nearby (up to two hops) neighbors. Based on MH-DESYNC, we newly propose weighted-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. Proposed W-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.