JOURNAL BROWSE
Search
Advanced SearchSearch Tips
An Analysis of Effective Throughput in Distributed Wireless Scheduling
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
An Analysis of Effective Throughput in Distributed Wireless Scheduling
Radwan, Amr;
  PDF(new window)
 Abstract
Several distributed scheduling policies have been proposed with the objective of attaining the maximum throughput region or a guaranteed fraction throughput region. These policies consider only the theoretical throughput and do not account the lost in throughput due to the time complexity of implementing an algorithm in practice. Therefore, we propose a novel concept called effective throughput to characterize the actual throughput by taking into account the time complexity. Effective throughput can be viewed as the actual transmitted data without including the control message overhead. Numerical results demonstrate that in practical scheduling, time complexity significantly affects throughput. The performance of throughput degrades when the time complexity is high.
 Keywords
Wireless Scheduling;Effective Throughput;Complexity;Random Pick-Compare;
 Language
English
 Cited by
 References
1.
L. Tassiulas and A. Ephremides, “Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks,” IEEE Transactions on Automatic Control, Vol. 37, No. 12, pp. 1936-1948, 1992. crossref(new window)

2.
K. P.Chaporkar, K. Sarkar and S. Sarkar, "Throughput Guarantees through Maximal Scheduling in Multihop Wireless Networks," Proceedings of 43rd Annual Allerton Conference on Communication, Control and Computing, pp. 28-30, 2005.

3.
C. Joo, X. Lin, and N. Shroff, "Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks," Proceedings of The 27th Conference on Computer Communications, pp. 1103-1111, 2008.

4.
A. Eryilmaz, O. Asuman, and E. Modiano, "Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks," Proceedings of The 26th IEEE International Conference on Computer Communications, pp. 499-507, 2007.

5.
C. Joo and N. Shroff, “Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks,” IEEE/ACM Transactions on Networking, Vol. 17, No. 5, pp. 1481-1493, 2009. crossref(new window)

6.
A. Proutiere, Y. Yi, and M. Chiang, "Throughput of Random Access Without Message Passing," Proceedings of The 2nd Annual Conference on Information Sciencesand Systems, pp. 509-514, 2008.

7.
S. Sanghavi, L. Bui, and R. Srikant, "Distributed Link Schedul-ing with Constant Overhead," Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 313-324, 2007.

8.
L. Tassiulas, "Linear Complexity Algorithms for Maximum Throughput in Radio Networks and Input Queued Switches," Proceedings of The Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Vol. 2, pp. 533-539, 1998.

9.
Y. Yi, A. Prouti` ere, and M. Chiang, "Complexity in Wireless Scheduling: Impact and Tradeoffs," Proceedings of the 9th ACM International Symposium on Mobile Ad hoc Networking and Computing, pp. 33-42, 2008.

10.
O. Z. Amir Dembo, Large Deviations Techniques and Applications, 2nd ed. Springer Verlag Berlin Heidelberg, 1998.(Berlin Heidelberg)

11.
S. Sarkar and S. Ray, “Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning,” IEEE Transactions on Automatic Control, Vol. 53, No. 10, pp. 2307-2323, 2008. crossref(new window)