Distributed adaptive scheduling for finite horizon in wireless ad hoc networks

被引：0

作者：

Khalid, Murad ^{[1
]}

Wang, Yufeng ^{[1
]}

Le, Xuan Hung ^{[1
]}

Ra, In-Ho ^{[2
]}

Sankar, Ravi ^{[1
]}

机构：

[1] Department of Electrical Engineering, University of South Florida, Tampa, United States

[2] Dept. of Information and Telecommunication Engineering, Kunsan National University, Korea, Republic of

来源：

Journal of Communications | 2012年 / 7卷 / 02期

关键词：

Throughput;

D O I：

10.4304/jcm.7.2.155-164

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A cooperative ratio-based scheduling scheme with minimal signaling that enhances network throughput and fairness in a wireless ad hoc network is presented in this paper. Throughput maximization problem under fairness constraint in a finite horizon is formulated as a novel multi-window optimization problem. Through analysis users' thresholds are shown to be time variant for throughput maximization with fairness in each time window. Simulation results clearly show that compared with non decision-based strategy, simple ratio-based scheme (SR) achieves within 1.6% of the global optimal value in terms of throughput and is scalable in terms of the number of nodes. Fairness index performance is marginally better than non decision-based strategy. Next, we show throughput degradation of SR scheme for asymmetric channels, and introduce general ratio-based scheme (GR) that adapts to provide higher throughput than fairness in a fully distributed manner for asymmetric channel conditions. © 2012 Academy Publisher.

引用

页码：155 / 164