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 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.

Adaptive Strategy to Change Firing Phases of Collided Nodes in Extended-Desync TDMA-Based MANETs

“…These show better throughput than existing MAC protocols. Weighted-Desync TDMA [30] is an ex-tension of [29] that provides weighted slot scheduling. However, due to the fixed frame structure, [27,29,30,34] require an additional global slot synchronization scheme to use in MANET.…”

“…By referring to firing messages from other nodes, all nodes can know their two-hop neighbors and their relative firing times, which can solve the hidden terminal problem in multi-hop wireless networking. There have been also numerous studies to enhance multi-hop wireless networking performances based on Desync-TDMA or Ext-Desync [26][27][28][29][30][31][32][33][34].…”

Group Connectivity-Based UAV Positioning and Data Slot Allocation for Tactical MANET

“…In [16], Kuramoto-Desynchronization (K-Desync) was proposed for a rapid convergence of desynchronization. In [17], weight desynchronization (W-Desync) was proposed, and QoS was considered by assigning weight factors. In [1], a QoS-attaining scheme considering energy efficiency was proposed.…”

“…(17), we have ∇D(π) = c − As(π), and thereforeH(D(π)) = −A ∂s ∂π (π) = AB(π)A . (25)RecallC,R, andρ defined in (13)-(15), and we have the following lemma.…”