Advertisement

Throughput Maximization in CSMA Networks with Collisions and Hidden Terminals

  • Sankrith Subramanian
  • Eduardo L. Pasiliao
  • John M. Shea
  • Jess W. Curtis
  • Warren E. Dixon
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 20)

Abstract

The throughput at the medium-access control (MAC) layer in a wireless network, that uses the carrier-sense multiple-access (CSMA) protocol, is degraded by collisions caused by failures of the carrier-sensing mechanism. Two sources of failure in the carrier-sensing mechanism are delays in the carrier sensing mechanism and hidden terminals, in which an ongoing transmission cannot be detected at a terminal that wishes to transmit because the path loss from the active transmitter is large. In this chapter, the effect of these carrier-sensing failures is modeled using a continuous-time Markov model. The throughput of the network is determined using the stationary distribution of the Markov model. The throughput is maximized by finding optimal mean transmission rates for the terminals in the network subject to constraints on successfully transmitting packets at a rate that is at least as great as the packet arrival rate.

Keywords

Medium access control Carrier-sense multiple access CSMA Markov chain Throughput Convex optimization 

Notes

Acknowledgements

This research is supported by a grant from AFRL Collaborative System Control STT.

References

  1. 1.
    Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming—Theory and Algorithms (2nd edn.). Wiley, Hoboken (1993)MATHGoogle Scholar
  2. 2.
    Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)MATHGoogle Scholar
  3. 3.
    Bianchi, G.: IEEE 802.11—Saturation throughput analysis. IEEE Commun. Lett. 2(12), 318–320 (1998)Google Scholar
  4. 4.
    Bianchi, G.: Performance analysis of the IEEE 802.11 distributed coordination function. IEEE J. Select. Commun. 18(3), 535–547 (2000)Google Scholar
  5. 5.
    Boorstyn, R., Kershenbaum, A., Maglaris, B., Sahin, V.: Throughput analysis in multihop CSMA packet radio networks. IEEE Trans. Commun. 35(3), 267–274 (1987)CrossRefGoogle Scholar
  6. 6.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)MATHGoogle Scholar
  7. 7.
    Byrd, R.H., Gilbert, J.C.: A trust region method based on interior point techniques for nonlinear programming. Math. Progr. 89, 149–185 (1996)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Byrd, R.H., Hribar, M.E., Jorge Nocedal, Z.: An interior point algorithm for large scale nonlinear programming. SIAM J. Optim. 9, 877–900 (1999)Google Scholar
  9. 9.
    Jiang, L., Walrand, J.: Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions. IEEE/ACM Trans. Netw. 19(3), 816–829 (2011)CrossRefGoogle Scholar
  10. 10.
    Jiang, L., Walrand, J.: A distributed CSMA algorithm for throughput and utility maximization in wireless networks. IEEE/ACM Trans. Netw. 18(3), 960–972 (2010)CrossRefGoogle Scholar
  11. 11.
    Kelly, K.P.: Reversibility and Stochastic Networks. Wiley, Chichester (1979)MATHGoogle Scholar
  12. 12.
    Luenberger, D.G.: Introduction to Linear and Nonlinear Programming. Addison-Wesley, Reading (1973)MATHGoogle Scholar
  13. 13.
    Marbach, P., Eryilmaz, A., Ozdaglar, A.: Achievable rate region of CSMA schedulers in wireless networks with primary interference constraints. In: Proceedings of the IEEE Conference on Decision and Control, pp. 1156–1161 (2007)Google Scholar
  14. 14.
    Wang, X., Kar, K.: Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks. In: Proceedings of the IEEE Annual Joint Conference IEEE Computation and Communication Societies INFOCOM 2005, vol. 1, pp. 23–34 (2005)Google Scholar

Copyright information

© Springer Science+Business Media New York 2012

Authors and Affiliations

  • Sankrith Subramanian
    • 1
  • Eduardo L. Pasiliao
    • 2
  • John M. Shea
    • 1
  • Jess W. Curtis
    • 2
  • Warren E. Dixon
    • 1
  1. 1.Department of Electrical and Computer EngineeringUniversity of FloridaGainesvilleUSA
  2. 2.Munitions DirectorateAir Force Research LaboratoryEglin AFBUSA

Personalised recommendations