skip to main content
10.1145/1288107.1288123acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
Article

Cross-layer latency minimization in wireless networks with SINR constraints

Published:09 September 2007Publication History

ABSTRACT

Recently, there has been substantial interest in the design of cross-layer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g. latency, energy, rate) by jointly optimizing the performance of multiple layers of the protocol stack. Algorithm designers often use geometric-graph-theoretic models for radio interference to design such cross-layer protocols. In this paper we study the problem of designing cross-layer protocols for multi-hop wireless networks using a more realistic Signal to Interference plus Noise Ratio (SINR) model for radio interference. The following cross-layer latency minimization problem is studied: Given a set V of transceivers, and a set of source-destination pairs, (i) choose power levels for all the transceivers, (ii) choose routes for all connections, and (iii) construct an end-to-end schedule such that the SINR constraints are satisfied at each time step so as to minimize the make-span of the schedule (the time by which all packets have reached their respective destinations). We present a polynomial-time algorithm with provable worst-case performance guarantee for this cross-layer latency minimization problem. As corollaries of the algorithmic technique we show that a number of variants of the cross-layer latency minimization problem can also be approximated efficiently in polynomial time. Our work extends the results of Kumar et al. (Proc. SODA, 2004) and Moscibroda et al. (Proc. MOBIHOC, 2006). Although our algorithm considers multiple layers of the protocol stack, it can naturally be viewed as compositions of tasks specific to each layer --- this allows us to improve the overall performance while preserving the modularity of the layered structure.

References

  1. P. Bjorklund, P. Varbrand, and D. Yuan, A Column Generation Method for Spatial TDMA Scheduling in Ad Hoc Networks, Ad Hoc Networks, vol. 2, Issue 4, pp. 405--418, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  2. R. Bhatia, and M. Kodialam, On Power Efficient Communication over Multi--hop Wireless Networks: Joint Routing, Scheduling and Power Control, IEEE INFOCOM, vol. 2, pp. 1457--1466, March 2004.Google ScholarGoogle ScholarCross RefCross Ref
  3. G. Brar, D. Blough, and P. Santi, Computationally Efficient Scheduling with the Physical Interference Model for Throughput Improvement in Wireless Mesh Networks, ACM MOBICOM, pp. 2--13, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. L. Chen, S. Low, M. Chiang, and J. Doyle, Cross-layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks, IEEE INFOCOM , pp. 1--13, April 2006.Google ScholarGoogle ScholarCross RefCross Ref
  5. L. Chen, S. Low, M. Chiang, and J. Doyle, Jointly Optimal Congestion Control, Routing, and Scheduling for Wireless Ad Hoc Networks, IEEE INFOCOM April 2006.Google ScholarGoogle Scholar
  6. M. Chiang, S. H. Low, A. R. Calderbank, and J. C. Doyle, Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures, To appear Proceedings of IEEE, vol. 95, Issue 1, pp. 255--312, January 2007.Google ScholarGoogle Scholar
  7. H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations. Annals of Mathematical Statistics, vol. 23, Number 4, pp. 493--509, 1952.Google ScholarGoogle Scholar
  8. R. L. Cruz, and A. V. Santhanam, Optimal Routing, Link Scheduling and Power Control in Multi-hop Wireless Networks, IEEE INFOCOM, pp. 702--711, March 2003.Google ScholarGoogle ScholarCross RefCross Ref
  9. T. ElBatt, and A. Ephremides, Joint Scheduling and Power Control for Wireless Ad-hoc Networks, IEEE INFOCOM, vol. 2, pp. 976--985, June 2002.Google ScholarGoogle ScholarCross RefCross Ref
  10. P. Gupta, and P. Kumar, The Capacity of Wireless Networks, IEEE Transactions on Information Theory, vol. 46, Issue 2, pp. 388--404, March 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. D. Knuth, The Art of Computer Programming, Vol. 3 -- Sorting and Searching, Addison-Wesley (1973).Google ScholarGoogle Scholar
  12. M. Kodialam, and T. Nandagopal, Characterizing Achievable Rates in Multi-hop Wireless Networks: The Joint Routing and Scheduling problem, ACM MOBICOM, pp. 42 -- 54, September 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. G. Kulkarni, V. Raghunathan, and M Srivastava, Joint End-to-End Scheduling, Power Control and Rate Control in Multi-hop Wireless Networks, IEEE GLOBECOM, pp. 3357--3362, December 2004.Google ScholarGoogle Scholar
  14. V.S. Anil Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan, End-to-end Packet-Scheduling in Wireless Ad-Hoc Networks, SODA, pp. 1021--1030, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. F. Kuhn, T. Moscibroda, and R. Wattenhofer, Unit Disk Graph Approximation, ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), October 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. T. Leighton, B. Maggs, and S.Rao, Packet Routing and Job Shop Scheduling in O(Congestion+Dilation) steps, Combinatorica, vol. 14, Issue 2, pp. 167--180, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  17. X. Lin, and N. Shroff, Joint Rate Control and Scheduling in Multihop Wireless Networks, 43rd IEEE Conference on Decision and Control, Paradise Island, vol. 2, pp. 1484--1489, December 2004.Google ScholarGoogle Scholar
  18. X. Lin, and N. Shroff, The Impact of Imperfect Scheduling on Cross-layer Rate Control in Multihop Wireless Networks, In IEEE INFOCOM, vol. 3, pp. 1804--1814, March 2005.Google ScholarGoogle Scholar
  19. X. Lin, N. Shroff, and R. Srikant, A Tutorial on Cross-Layer Optimization in Wireless Networks, IEEE Journal on Selected Areas in Communications on Non-Linear Optimization of Communication Systems, vol. 24, Issue 8, pp. 1452--1463, June 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. T. Moscibroda, R. Wattenhofer and Y. Weber, Protocol Design Beyond Graph-Based Models, 5th Workshop on Hot Topics in Networks (HotNets), November 2006.Google ScholarGoogle Scholar
  21. T. Moscibroda, and R. Wattenhofer, The Complexity of Connectivity in Wireless Networks, IEEE INFOCOM , pp. 1--13, April 2006.Google ScholarGoogle ScholarCross RefCross Ref
  22. T. Moscibroda, R. Wattenhofer, and A. Zollinger, Topology Control Meets SINR: The Scheduling Complexity of Arbitrary Topologies, ACM MOBIHOC , pp. 310--321, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. M. Neely, Optimal Energy and Delay Tradeoffs for Multi-User Wireless Downlinks, IEEE INFOCOM, pp. 1--13, April 2006.Google ScholarGoogle Scholar
  24. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs, Journal of Computer and System Sciences, vol. 37, Issue 2, pp. 130--143, October 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. P. Raghavan, and S. Thompson. Randomized rounding:a technique for provable good algorithms and algorithmic proofs, Combinatorica, vol.7, pp. 365--374, 1987 Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. S. Ramanathan, A Unified Framework and Algorithm for (T/F/C) DMA Channel Assignment in Wireless Networks, Proc. IEEE INFOCOM , pp. 900--907, April 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. S. Ramanathan, and E. Lloyd, Scheduling Algorithms for Multi-Hop Radio Networks, IEEE/ACM Transactions on Networking, vol. 1, pp. 166--172, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. A. Srinivasan, and C. Teo, A Constant Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global criteria, SIAM Journal on Computing, vol. 30, pp. 2051--2068, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. V. Vazirani, Approximation Algorithms, Springer-Verlag, Berlin, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. L. Xiao, M. Johansson, and S. Boyd. Simultaneous Routing and Resource Allocation via Dual Decomposition. IEEE Transactions on Communications, vol. 52, Issue 7, pp. 1136--1144, July 2004.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Cross-layer latency minimization in wireless networks with SINR constraints

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
      September 2007
      276 pages
      ISBN:9781595936844
      DOI:10.1145/1288107

      Copyright © 2007 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 9 September 2007

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate296of1,843submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader