The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2010 vol.9)
pp: 553-565
Mahmoud Al-Ayyoub , State University of New York, Stony Brook
Himanshu Gupta , State University of New York, Stony Brook
ABSTRACT
Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of source-destination pairs), optimization of throughput entails design of “efficient” routes between the given source-destination pairs, in conjunction with 1) assignment of channels to interfaces and communication links and 2) scheduling of noninterfering links for simultaneous transmission. Prior work has looked at restricted versions of the above problem. In this paper, we design approximation algorithms for the joint routing, channel assignment, and link scheduling problem in wireless networks with general interference models. The unique contributions of our work include addressing the above joint problem in the context of physical interference model and single-path routing (wherein, traffic between a source-destination pair is restricted to a single path). To the best of our knowledge, ours is the first work to address the throughput maximization problem in such general contexts. For each setting, we design approximation algorithms with provable performance guarantees. We demonstrate the effectiveness of our algorithms in general contexts through simulations.
INDEX TERMS
Network protocols, analysis of algorithms and problem complexity.
CITATION
Mahmoud Al-Ayyoub, Himanshu Gupta, "Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models", IEEE Transactions on Mobile Computing, vol.9, no. 4, pp. 553-565, April 2010, doi:10.1109/TMC.2009.144
REFERENCES
[1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
[2] M. Alicherry, R. Bhatia, and L. Li, "Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks," Proc. ACM MobiCom, 2005.
[3] H. Balakrishnan, C. Barrett, V.S.A. Kumar, M. Marathe, and S. Thite, "The Distance-2 Matching Problem and Its Relationship to the MAC-Layer Capacity of Ad Hoc Networks," IEEE J. Selected Areas in Comm. vol. 22, no. 6, pp. 1069-1079, Aug. 2004.
[4] R. Bhatia and M. Kodialam, "On Power Efficient Communication over Multi-Hop Wireless Networks: Joint Routing, Scheduling and Power Control," Proc. IEEE INFOCOM, 2004.
[5] G.S. 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, 2006.
[6] A. Brzezinski, G. Zussman, and E. Modiano, "Enabling Distributed Throughput Maximization in Wireless Mesh Networks—A Partitioning Approach," Proc. ACM MobiCom, 2006.
[7] C. Buragohain, S. Suri, C. Tóth, and Y. Zhou, "Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks," Computing and Combinatorics, vol. 4598, pp. 210-221, Springer, 2007.
[8] D. Chafekar, V.S.A. Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan, "Cross-Layer Latency Minimization in Wireless Networks with SINR Constraints," Proc. ACM MobiHoc, 2007.
[9] D. Chafekar, V.S.A. Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan, "Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints," Proc. IEEE INFOCOM, 2008.
[10] P. Chaporkar, K. Kar, and S. Sarkar, "Throughput Guarantees through Maximal Scheduling in Wireless Networks," Proc. Allerton Conf. Comm., Control, and Computing, 2005.
[11] L. Chen, S.H. Low, M. Chiang, and J.C. Doyle, "Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks," Proc. IEEE INFOCOM, 2006.
[12] H. Chernoff, "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations," Annals of Math. Statistics, vol. 23, no. 4, Dec. 1952.
[13] A. Eryilmaz and R. Srikant, "Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control," Proc. IEEE INFOCOM, 2005.
[14] O. Goussevskaia, Y. Oswald, and R. Wattenhofer, "Complexity in Geometric SINR," Proc. ACM MobiHoc, 2007.
[15] P. Gupta and P.R. Kumar, "The Capacity of Wireless Networks," IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[16] K. Jain, J. Padhye, V. Padmanabhan, and L. Qiu, "Impact of Interference on Multi-Hop Wireless Network Performance," Proc. ACM MobiCom, 2003.
[17] C. Joo, X. Lin, and N.B. Shroff, "Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks," Proc. IEEE INFOCOM, 2008.
[18] M. Kodialam and T. Nandagopal, "Characterizing Achievable Rates in Multi-Hop Wireless Networks: The Joint Routing and Scheduling Problem," Proc. ACM MobiCom, 2003.
[19] M. Kodialam and T. Nandagopal, "Characterizing the Capacity Region in Multi-Radio and Multi-Channel Mesh Networks," Proc. ACM MobiCom, 2005.
[20] N.P. Kumar, A.D. Gore, and A. Karandikar, "Link Scheduling in STDMA Wireless Networks: A Line Graph Approach," Proc. Nat'l Conf. Comm. (NCC), 2008.
[21] V.S.A. Kumar, Personal Communication, 2007.
[22] V.S.A. Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan, "Algorithmic Aspects of Capacity in Wireless Networks," Proc. ACM SIGMETRICS, 2005.
[23] X. Lin and S. Rasool, "A Distributed Joint Channel-Assignment, Scheduling and Routing Algorithm for Multi-Channel Ad Hoc Wireless Networks," Proc. IEEE INFOCOM, 2007.
[24] X. Lin and N.B. Shroff, "Joint Rate Control and Scheduling in Multihop Wireless Networks," Proc. IEEE Conf. Decision and Control (CDC), 2004.
[25] X. Lin and N.B. Shroff, "The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Wireless Networks," Proc. IEEE INFOCOM, 2005.
[26] M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge Univ. Press, 2005.
[27] T. Moscibroda, R. Wattenhofer, and A. Zollinger, "Topology Control Meets SINR: The Scheduling Complexity of Arbitrary Topologies," Proc. ACM MobiHoc, 2006.
[28] M.J. Neely, E. Modiano, and C.E. Rohrs, "Dynamic Power Allocation and Routing for Time Varying Wireless Networks," Proc. IEEE INFOCOM, 2003.
[29] P. Raghavan and C.D. Tompson, "Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs," Combinatorica, vol. 7, no. 4, pp. 365-374, 1987.
[30] S. Sanghavi, L. Bui, and R. Srikant, "Distributed Link Scheduling with Constant Overhead," Proc. ACM SIGMETRICS, 2007.
[31] S. Sarkar, P. Chaporkar, and K. Kar, "Fairness and Throughput Guarantees with Maximal Scheduling in Multihop Wireless Networks," Proc. Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2006.
[32] S. Suri, Personal Communication (for Confirmation), 2007.
[33] 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.
[34] W. Wang, Y. Wang, X. Li, W. Song, and O. Frieder, "Efficient Interference-Aware TDMA Link Scheduling for Static Wireless Networks," Proc. ACM MobiCom, 2006.
[35] S. Yi, Y. Pei, and S. Kalyanaraman, "On the Capacity Improvement of Ad Hoc Wireless Networks Using Directional Antennas," Proc. ACM MobiHoc, 2003.
47 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool