This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Approximation Algorithms for a Link Scheduling Problem in Wireless Relay Networks with QoS Guarantee
December 2010 (vol. 9 no. 12)
pp. 1732-1748
Chi-Yao Hong, National Taiwan University, Taipei
Ai-Chun Pang, National Taiwan University, Taipei
Pi-Cheng Hsiu, Academia Sinica, Taiwan
The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. We study an optimization problem for multihop link scheduling with bandwidth and delay guarantees over WRNs. Our optimization problem is investigated under a more general interference model with a generic objective. The objective can be based on various kinds of performance indexes (e.g., throughput, fairness, and capacity), which can be determined by service providers. Through our theoretical analysis, the intractability and inapproximability of the optimization problem are shown. Due to the intractable computational complexity, we present efficient algorithms to provide a reasonable small approximation factor against any optimal solution even for a worst-case input. Furthermore, some experimental results indicate that our algorithms yield near-optimal performance in the average case.

[1] P.-Y. Kong, H. Wang, Y. Ge, C.-K. Tham, and Y.-C. Liang, “PMP Tree and Hybrid PMP-Mesh for Multi-Hop Relay Networks,” IEEE 802.16's Relay Task Group, IEEE C802.16j-06/008r2, May 2006.
[2] IEEE 802.16-2004, IEEE Standard for Local and Metropolitan Area Networks, Part 16: Air Interface for Fixed Broadband Wireless Access Systems, IEEE, 2004.
[3] M. Adler, A.L. Rosenberg, R.K. Sitaraman, and W. Unger, “Scheduling Time-Constrained Communication in Linear Networks,” Theory of Computing Systems, vol. 35, no. 6, pp. 599-623, 2002.
[4] H. Räcke and A. Rosén, “Approximation Algorithms for Time-Constrained Scheduling on Line Networks,” Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 337-346, 2009.
[5] M. Adler, S. Khanna, R. Rajaraman, and A. Rosén, “Time-Constrained Scheduling of Weighted Packets on Trees and Meshes,” Algorithmica, vol. 36, no. 2, pp. 123-152, 2003.
[6] E. Arikan, “Some Complexity Results about Packet Radio Networks,” IEEE Trans. Intelligent Transportation Systems, vol. 30, pp.910-918, July 1984.
[7] H. Viswanathan and S. Mukherjee, “Throughput-Range Tradeoff of Wireless Mesh Backhaul Networks,” IEEE J. Selected Areas Comm., vol. 24, no. 3, pp. 593-602, Mar. 2006.
[8] T. Jian, X. Guoliang, C. Chandler, and Z. Weiyi, “Link Scheduling with Power Control for Throughput Enhancement in Multihop Wireless Networks,” IEEE Trans. Vehicular Technology, vol. 55, no. 3, pp. 733-742, May 2006.
[9] A. Behzad and I. Rubin, “Optimum Integrated Link Scheduling and Power Control for Multihop Wireless Networks,” IEEE Trans. Vehicular Technology, vol. 56, no. 1, pp. 194-205, Jan. 2007.
[10] X. Lin and S. Rasool, “A Distributed Joint Channel-Assignment, Scheduling and Routing Algorithm for Multi-Channel Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM, pp. 1118-1126, May 2007.
[11] G. Brar, D.M. Blough, and P. Santi, “Computationally Efficient Scheduling with the Physical Interference Model for Throughput Improvement in Wireless Mesh Networks,” Proc. ACM MobiCom, pp. 2-13, Sept. 2006.
[12] W. Wang, Y. Wang, X.-Y. Li, W.-Z. Song, and O. Frieder, “Efficient Interference-Aware TDMA Link Scheduling for Static Wireless Networks,” Proc. ACM MobiCom, pp. 262-273, Sept. 2006.
[13] M. Alicherry, R. Bhatia, and L.E. Li, “Joint Channel Assignment and Routing for Throughput Optimization in Multi-Radio Wireless Mesh Networks,” Proc. ACM MobiCom, pp. 58-72, Aug. 2005.
[14] G. Sharma, R.R. Mazumdar, and N.B. Shroff, “On the Complexity of Scheduling in Wireless Networks,” Proc. ACM MobiCom, pp.227-238, 2006.
[15] J. Tang, G. Xue, and W. Zhang, “Interference-Aware Topology Control and QoS Routing in Multi-Channel Wireless Mesh Networks,” Proc. ACM MobiHoc, pp. 68-77, May 2005.
[16] S. Sriram, T.B. Reddy, B.S. Manoj, and C.S.R. Murthy, “On the End-to-End Call Acceptance and the Possibility of Deterministic QoS Guarantees in Ad Hoc Wireless Networks,” Proc. ACM MobiHoc, pp. 169-180, May 2005.
[17] P. Djukic and S. Valaee, “Link Scheduling for Minimum Delay in Spatial Re-Use TDMA,” Proc. IEEE INFOCOM, pp. 28-36, 2007.
[18] S. Lee, G. Narlikar, M. Pal, G. Wilfong, and L. Zhang, “Admission Control for Multihop Wireless Backhaul Networks with QoS Support,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '06), pp. 92-97, Apr. 2006.
[19] IEEE 802.16e-2005, IEEE Standard for Local and Metropolitan Area Networks, Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems, IEEE, 2005.
[20] B. Han, F.P. Tso, L. Lin, and W. Jia, “Performance Evaluation of Scheduling in IEEE 802.16 Based Wireless Mesh Networks,” Proc. IEEE Int'l Conf. Mobile Adhoc and Sensor Systems, pp. 789-794, 2006.
[21] A. Ghosh, D.R. Wolter, J.G. Andrews, and R. Chen, “Broadband Wireless Access with WiMax/802.16: Current Performance Benchmarks and Future Potential,” IEEE Comm. Magazine, vol. 43, no. 2, pp. 129-136, Feb. 2005.
[22] D. Branlund, M. Webb, J. Norin, and R. Popoli, “AAS Direct Signaling Methodologies to Support High Capacity MR-BS to RS Links,” IEEE 802.16's Relay Task Group, IEEE C802.16j-07/080, Jan. 2007.
[23] A. Baek et al., “Harmonized Contribution on 802.16j (Mobile Multihop Relay) Usage Models,” IEEE 802.16's Relay Task Group, IEEE 802.16j-06/015, Sept. 2006.
[24] S. Ramanathan and E.L. Lloyd, “Scheduling Algorithms for Multi-Hop Radio Networks,” ACM SIGCOMM Computer Comm. Rev., vol. 22, pp. 211-222, Oct. 1992.
[25] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of ${\cal NP}$ -Completeness. W.H. Freeman & Co., 1990.
[26] C.H. Papadimitriou, Computational Complexity. Addison-Wesley, 1994.
[27] C. Papadimitriou and M. Yannakakis, “Optimization, Approximation, and Complexity Classes,” Proc. 20th Ann. ACM Symp. Theory of Computing (STOC '88), pp. 229-234, 1988.
[28] J. Håstad, “Clique Is Hard to Approximate within n$^{1-\epsilon }$ ,” Acta Mathematica, vol. 182, no. 1, pp. 105-142, 1999.
[29] M. Pinedo, Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 2002.
[30] I.-K. Fu, W.-H. Sheen, C.-L. Hsiao, and C.-C. Tseng, “Reverse Link Performance of Relay-Based Cellular Systems in Manhattan-Like Scenario,” IEEE 802.16's Mobile Multihop Relay (MMR) Study Group, IEEE C80216mmr-06/004r1, Jan. 2006.
[31] J. Cho, M. Lee, H. Kang, S. Lee, J. Son, P. Joo, Y. So, S. Kim, D. Hong, J. Choe, B. Shin, and H. Choi, “On the Throughput Enhancement of Fixed Relay Concept in Manhattan-Like Urban Environments,” IEEE 802.16's Mobile Multihop Relay (MMR) Study Group, IEEE C802.16mmr-06/003, Jan. 2006.
[32] I. Guvenc, M.-R. Jeong, F. Watanabe, and C.-C. Chong, “Technical Comments to P802.16j Baseline Document: 6.3.23.3—Use of ARQ in MBS,” IEEE 802.16's Relay Task Group, IEEE C802.16j-07/578r1, Nov. 2007.
[33] J.H. Anderson, Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman & Hall, 2004.
[34] M.M. Halldórsson, “Approximations of Weighted Independent Set and Hereditary Subset Problems,” J. Graph Algorithms and Applications, vol. 4, no. 1, pp. 1-16, 2000.
[35] V.V. Vazirani, Approximation Algorithms. Springer, 2001.
[36] K. Wongthavarawat and A. Ganz, “Packet Scheduling for QoS Support in IEEE 802.16 Broadband Wireless Access Systems,” Int'l J. Comm. Systems, vol. 16, pp. 81-96, Feb. 2003.
[37] J. Chen, W. Jiao, and Q. Guo, “An Integrated QoS Control Architecture for IEEE 802.16 Broadband Wireless Access Systems,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '05), pp.3330-3335, Dec. 2005.
[38] D. Tarchi, R. Fantacci, and M. Bardazzi, “Quality of Service Management in IEEE 802.16 Wireless Metropolitan Area Networks,” Proc. IEEE Int'l Conf. Comm. (ICC '05), pp. 1789-1794, June 2006.
[39] N.L. Johnson and S. Kotz, Continuous Univariate Distributions-1. John Wiley & Sons, 1970.

Index Terms:
Approximation algorithms, link scheduling, quality of service, wireless relay networks.
Citation:
Chi-Yao Hong, Ai-Chun Pang, Pi-Cheng Hsiu, "Approximation Algorithms for a Link Scheduling Problem in Wireless Relay Networks with QoS Guarantee," IEEE Transactions on Mobile Computing, vol. 9, no. 12, pp. 1732-1748, Dec. 2010, doi:10.1109/TMC.2010.142
Usage of this product signifies your acceptance of the Terms of Use.