Computer Science – Information Theory
Scientific paper
2010-01-13
Computer Science
Information Theory
8 pages, 2 figures, submitted to Allerton 2010. The title and abstract are updated compared to version 1
Scientific paper
This paper proposes a dynamic primal-dual type algorithm to solve the optimal scheduling problem in wireless networks subject to uncertain parameters, which are generated by stochastic network processes such as random packet arrivals, channel fading, and node mobilities. The algorithm is a generalization of the well-known max-weight scheduling algorithm proposed by Tassiulas et al., where only queue length information is used for computing the schedules when the arrival rates are uncertain. Using the technique of fluid limits, sample path convergence of the algorithm to an arbitrarily close to optimal solution is proved, under the assumption that the Strong Law of Large Numbers (SLLN) applies to the random processes which generate the uncertain parameters. The performance of the algorithm is further verified by simulation results. The method may potentially be applied to other applications where dynamic algorithms for convex problems with uncertain parameters are needed.
Li Qiao
Negi Rohit
No associations
LandOfFree
Scheduling in Wireless Networks under Uncertainties: A Greedy Primal-Dual Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Scheduling in Wireless Networks under Uncertainties: A Greedy Primal-Dual Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling in Wireless Networks under Uncertainties: A Greedy Primal-Dual Approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-524379