The Community for Technology Leaders
RSS Icon
Issue No.06 - June (2013 vol.12)
pp: 1120-1132
Jiho Ryu , Seoul National University, Seoul
Changhee Joo , UNIST, Ulsan
Ted "Taekyoung” Kwon , Seoul National University, Seoul
Ness B. Shroff , The Ohio State University, Columbus
Yanghee Choi , Seoul National University, Seoul
The problem of developing distributed scheduling algorithms for high throughput in multihop wireless networks has been extensively studied in recent years. The design of a distributed low-complexity scheduling algorithm becomes even more challenging when taking into account a physical interference model, which requires the SINR at a receiver to be checked when making scheduling decisions. To do so, we need to check whether a transmission failure is caused by interference due to simultaneous transmissions from distant nodes. In this paper, we propose a scheduling algorithm under a physical interference model, which is amenable to distributed implementation with 802.11 CSMA technologies. The proposed scheduling algorithm is shown to achieve throughput optimality. We present two variations of the algorithm to enhance the delay performance and to reduce the control overhead, respectively, while retaining throughput optimality.
Interference, Signal to noise ratio, Receivers, Throughput, Schedules, Scheduling algorithms, Vectors, discrete time Markov chain, Wireless scheduling, SINR, CSMA
Jiho Ryu, Changhee Joo, Ted "Taekyoung” Kwon, Ness B. Shroff, Yanghee Choi, "DSS: Distributed SINR-Based Scheduling Algorithm for Multihop Wireless Networks", IEEE Transactions on Mobile Computing, vol.12, no. 6, pp. 1120-1132, June 2013, doi:10.1109/TMC.2012.81
[1] J. Ryu, C. Joo, T.T. Kwon, N.B. Shroff, and Y. Choi, "Distributed SINR Based Scheduling Algorithm for Multi-Hop Wireless Networks," Proc. ACM Int'l Conf. Modeling, Analysis, and Simulation of Wireless and Mobile Systems (MSWiM), 2010.
[2] L. Tassiulas and A. Ephremides, "Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks," IEEE Trans. Automatic Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
[3] X. Lin and N.B. Shroff, "The Impact of Imperfect Scheduling on Cross-Layer Congestion Control in Wireless Networks," IEEE/ACM Trans. Networking, vol. 14, no. 2, pp. 302-315, Apr. 2006.
[4] E. Leonardi, M. Mellia, F. Neri, and M.A. Marsan, "On the Stability of Input-Queued Switches with Speed-Up," IEEE/ACM Trans. Networking, vol. 9, no. 1, pp. 104-118, Feb. 2001.
[5] N. McKeown, "Scheduling Algorithms for Input-Queued Cell Switches," PhD dissertation, Univ. of California, Berkeley, 1995.
[6] A. Dimakis and J. Walrand, "Sufficient Conditions for Stability of Longest-Queue-First Scheduling: Second-Order Properties Using Fluid Limits," Advances in Applied Probability, vol. 38, no. 2, pp. 505-521, 2006.
[7] J.-H. Hoepman, "Simple Distributed Weighted Matchings,", Oct. 2004.
[8] C. Joo, "A Local Greedy Scheduling Scheme with Provable Performance Guarantee," Proc. ACM MobiHoc, 2008.
[9] L. Jiang and J. Walrand, "A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks," Proc. Allerton Conf., 2008.
[10] P. Marbach and A. Eryilmaz, "A Backlog-Based CSMA Mechanism to Achieve Fairness and Throughput-Optimality in Wireless Networks," Proc. Allerton Conf., 2008.
[11] J. Ni and R. Srikant, "Distributed CSMA/CA Algorithms for Achieving Maximum Throughput in Wireless Networks," Proc. Information Theory and Applications Workshop (ITA), 2009.
[12] J. Ni, B. Tan, and R. Srikant, "Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks," Proc. IEEE INFOCOM, 2010.
[13] J. Ghaderi and R. Srikant, "On the Design of Efficient CSMA Algorithms for Wireless Networks," Proc. IEEE Conf. Design and Control (CDC), 2010.
[14] Q. Li and R. Negi, "Distributed Throughput-Optimal Scheduling in Ad Hoc Wireless Networks," Proc. IEEE Int'l Conf. Comm., 2011.
[15] M. Dinitz, "Distributed Algorithms for Approximating Wireless Network Capacity," Proc. IEEE INFOCOM, 2010.
[16] E.I. Ásgeirsso and P. Mitra, "On a Game Theoretic Approach to Capacity Maximization in Wireless Networks," Proc. IEEE INFOCOM, 2011.
[17] G. Pei and V.S.A. Kumar, "Distributed Link Scheduling Under the Physical Interference Model," Proc. IEEE INFOCOM, 2012.
[18] C. Joo and N.B. Shroff, "Performance of Random Access Scheduling Schemes in Multi-hop Wireless Networks," IEEE/ACM Trans. Networking, vol. 17, no. 5, pp. 1481-1493, Oct. 2009.
[19] N. Ehsan and R. Cruz, "On the Optimal SINR in Random Access Networks with Spatial Reuse," Proc. IEEE Conf. Information Sciences and Systems (CISS), 2006.
[20] A. Eryilaz, R. Srikant, and J.R. Perkins, "Stable Scheduling Policies for Fading Wireless Channels," IEEE/ACM Trans. Networking, vol. 13, no. 2, pp. 411-424, Apr. 2005.
[21] L. Qiu, Y. Zhang, F. Wang, M.K. Han, and R. Mahajan, "A General Model of Wireless Interference," Proc. ACM MobiCom, 2007.
[22] S.S. Rizvi, "Algorithm for Improving the Computing Power of Next Generation Wireless Receivers," J. Computing Science and Eng., vol. 6, no. 4, pp. 310-319, Dec. 2012.
[23] D. Shah, D. Tse, and J.N. Tsitsiklis, "Hardness of Low Delay Network Scheduling," IEEE Trans. Information Theory, vol. 57, no. 12, pp. 7810-7817, Dec. 2011.
[24] T. Rappaport, Wireless Communications: Principles and Practice, pp. 120-125. Prentice Hall, 2001.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool