Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Capacity of wireless networks under SINR interference constraints

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

A fundamental problem in wireless networks is to estimate their throughput capacity—given a set of wireless nodes and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused either on random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study the capacity estimation problem using a realistic Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks without any assumptions on node distributions. The problem becomes much more challenging for this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (IEEE INFOCOM 2006, ACM MobiHoc 2006) has shown that the throughput achieved by using SINR models can differ significantly from that obtained by using graph-based models. In this work, we develop polynomial time algorithms to provably approximate the throughput capacity of wireless network under the SINR model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. All the logarithms considered in this paper are to the base two and floor of the log functions is considered, for e.g. \(\log \Updelta \) is actually considered as \(\lfloor \log \Updelta \rfloor\).

References

  1. Gupta, P., & Kumar, P. R. (2000). The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2), 388–404.

    Article  MathSciNet  MATH  Google Scholar 

  2. Alicherry, M., Bhatia, R., & Li, E. (2005, August). Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks. In Proceedings of ACM MOBICOM (pp. 58–72).

  3. Jain, K., Padhye, J., Padmanabhan, V., & Qiu, L. (2003, September). Impact of interference on multi-hop wireless network performance. In Proceedings of ACM MOBICOM (pp. 66–80).

  4. Kodialam, M., & Nandagopal, T. (2003, September). Characterizing achievable rates in multi-hop wireless networks: The joint routing and scheduling problem. In Proceedings of ACM MOBICOM (pp. 42–54).

  5. Kodialam, M., & Nandagopal, T. (2005, August). Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. In Proceedings of ACM MOBICOM (pp. 73–87).

  6. Anil Kumar, V. S., Marathe, M., Parthasarathy, S., & Srinivasan, A. (2005, June). Algorithmic aspects of capacity in wireless networks. In Proceedings of ACM SIGMETRICS (pp. 133–144).

  7. Sharma, G., Mazumdar, R., & Shroff, N. (2006, September). On the complexity of scheduling in wireless networks. In Proceedings of ACM MOBICOM (pp. 227–238).

  8. Ramanathan, R. (1997, April). A unified framework and algorithm for (t/f/c) dma channel assignment in wireless networks. In Proceedings of IEEE INFOCOM (pp. 900–907).

  9. Moscibroda, T., Wattenhofer, R., & Zollinger, A. (2006, May). Topology control meets sinr: The scheduling complexity of arbitrary topologies. In Proceedings of ACM MOBIHOC (pp. 310–321).

  10. Moscibroda, T., & Wattenhofer, R. (2006, April). The complexity of connectivity in wireless networks. In Proceedings of IEEE INFOCOM (pp. 1–13).

  11. Moscibroda, T., Wattenhofer, R., & Zollinger, A. (2006, November). Protocol design beyond graph-based models. In Proceedings of ACM SIGCOMM Workshop on HotNets.

  12. Goussevskaia, O., Oswald, Y., & Wattenhofer, R. (2007, September). Complexity in geometric sinr. In Proceedings of ACM MOBIHOC (pp. 100–109).

  13. Agarwal, A., & Kumar, P. R. (2004). Capacity bounds for ad hoc and hybrid wireless networks. ACM SIGCOMM Computer Communication Review, 34(3), 71–81.

    Article  Google Scholar 

  14. Bhatia, R., & Kodialam, M. (2004, March). On power efficient communication over multi-hop wireless networks: Joint routing, scheduling and power control. In Proceedings of IEEE INFOCOM (Vol. 2, pp. 1457–1466).

  15. Chafekar, D., Anil Kumar, V. S., Marathe, M., Parthasarathy, S., & Srinivasan, A. (2008, April). Approximation algorithms for computing the capacity of wireless networks with SINR constraints. In Proceedings of IEEE INFOCOM (pp. 1166–1174).

  16. Chafekar, D., Anil Kumar, V. S., Marathe, M., Parthasarathy, S., & Srinivasan, A. (2007, September). Cross-layer latency minimization in wireless networks with sinr constraints. In Proceedings of ACM MOBIHOC (pp. 110–119).

  17. Bansal, N., & Liu, Z. (2003, April). Capacity, delay and mobility in wireless ad-hoc networks. In Proceedings of IEEE INFOCOM (pp. 58–72).

  18. Kozat, U., & Tassiulas, L. (2003, September). Throughput capacity in random ad-hoc networks with infrastructure support. In Proceedings of ACM MOBICOM (pp. 73–87).

  19. Buragohain, C., Suri, S., Toth, C., & Zhou, Y. (2007, July). Improved throughput bounds for interference-aware routing in wireless networks. In Proceedings of International Computing and Combinatorics Conference.

  20. Toumpis, S., & Goldsmith, A. (2001, April). Capacity regions for wireless ad hoc networks. In Proceedings of International Symposium on Communication Theory and Applications (pp. 227–238).

  21. Lin, X., & Shroff N. (2004). Joint rate control and scheduling in multihop wireless networks. 43rd IEEE Conference on Decision and Control, 2, 1484–1489.

    Google Scholar 

  22. Lin, X., & Shroff, N. (2005, March). The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks. In Proceedings of IEEE INFOCOM (Vol. 3, pp. 1804–1814).

  23. Fanghänel, A., Kesselheim, T., & Vöcking, B. (2011). Improved algorithms for latency minimization in wireless networks. Theoretical Computer Science, 412(24), 2657–2667.

    Article  MATH  Google Scholar 

  24. Awerbuch, B., Khandekar, R. (2009). Greedy distributed optimization of multi-commodity flows. Distributed Computing, 21, 317–329.

    Article  Google Scholar 

  25. Han, B., Anil Kumar, V. S., Marathe, M., Parthasarathy, S., & Srinivasan, A. (2009). Distributed strategies for channel allocation and scheduling in software-defined radio networks. In IEEE INFOCOM (pp. 1521–1529).

  26. TRANSIMS Open Source Project. http://http://www.transims-opensource.net.

  27. Neos Solvers. http://neos.mcs.anl.gov/neos/solvers/index.htm.

  28. Li, F., Li, M., Lu, R., Wu, H., Claypool, M., & Kinicki, R. (2006, April). Tools and techniques for measurement of ieee 802.11 wireless networks. In Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2006 4th International Symposium on (pp. 1–8).

Download references

Acknowledgments

We thank the referees for their helpful suggestions. The work of Deepti Chafekar (while at Virginia Tech), V.S. Anil Kumar and Madhav Marathe has been partially supported by the following grants: NSF PetaApps Grant OCI-0904844, DTRA R&D Grant HDTRA1-0901-0017, DTRA CNIMS Grant HDTRA1-07-C-0113, NSF Netse CNS-1011769, NSF SDCI OCI-1032677, NSF CNS-0845700, and DOE DE-SC0003957. A. Srinivasan was supported in part by NSF ITR Award CNS-1292 0426683, NSF Award CNS-0626964, NSF Award CNS-0626636, and NSF Award CNS 1010789; part of this work was done while he was on sabbatical at the Network Dynamics and Simulation Science Laboratory of the Virginia Bioinformatics Institute, Virginia Tech.

Author information

Authors and Affiliations

  1. Nokia Research, Palo Alto, CA, USA

    Deepti Chafekar

  2. Department of Computer Science and Virginia Bioinformatics Institute, Virginia Tech, Blacksburg, VA, USA

    V. S. Anil Kumar & Madhav V. Marathe

  3. IBM Research, Hawthorne, NY, USA

    Srinivasan Parthasarathy

  4. Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, USA

    Aravind Srinivasan

Authors
  1. Deepti Chafekar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. S. Anil Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Madhav V. Marathe
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Srinivasan Parthasarathy
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Aravind Srinivasan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Srinivasan Parthasarathy.

Additional information

A preliminary version of this paper appeared in the Proc. of INFOCOM 2008 [15].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chafekar, D., Anil Kumar, V.S., Marathe, M.V. et al. Capacity of wireless networks under SINR interference constraints. Wireless Netw 17, 1605–1624 (2011). https://doi.org/10.1007/s11276-011-0367-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-011-0367-2

Keywords

Search

Navigation