Competition, Cooperation, and Optimization in Multi-Hop CSMA Networks with Correlated Traffic

##plugins.themes.academic_pro.article.main##

Zhefu Shi
Cory Beard
Ken Mitchell

Abstract

The purpose of this paper is to present a new method for the study of the competition and co- operation relationships among nodes in a network us- ing a CSMA (Carrier Sense Multiple Access) proto- col implemented with an exponential backoff process. Self-organized behavior is proposed. Standard topolo- gies, such as tandem, traffic splitting and merging, are studied with variables: 1) backoff rate, 2) topology po- sition, 3) traffic splitting. Several interesting phenom- ena are reported. We propose a "Channel Utilization Model" with a new derived variable "channel access rate" which can be used for all traffic loads. These mod- els are applied with different optimization methods. Special strategies, for example "MAC Friendliness", are also presented for serving special traffic like emergency traffic.

##plugins.themes.academic_pro.article.details##

How to Cite
Shi, Z. ., Beard, C., & Mitchell, K. . (2012). Competition, Cooperation, and Optimization in Multi-Hop CSMA Networks with Correlated Traffic. International Journal of Next-Generation Computing, 3(3), 228–246. https://doi.org/10.47164/ijngc.v3i3.36

References

  1. Ashraf, U., Abdellatif, S., and Juanole, G. 2011. Route selection in ieee 802.11 wireless mesh networks. Telecommunication Systems.
  2. Bianchi, G. 2000. Performance analysis of the IEEE 802.11 distributed coordination function. IEEE JSAC 18, 535547.
  3. Bianchi, G. and Tinnirello, I. 2003. Kalman filter estimation of the number of competing terminals in an ieee 802.11 network. INFOCOM.
  4. Boorstyn, R. R., Kershenbaum, A., Maglaris, B., and Sahin, V. 1987. Throughput analysis in multihop CSMA packet radio networks. IEEE Transactions on Communications 35, 3 (March), 267–274.
  5. Brahma, M., Kim, K. W., Abouaissa, A., and Lorenz, P. 2005. A load-balancing and push-out scheme for supporting qos in manets. Telecommunication Systems 30, 1-3, 161–175.
  6. Clerc, M. and Kennedy, J. 2002. The particle swarm - explosion, stability, and convergence in amultidimensional complex space. Evolutionary Computation, IEEE Transactions on 6, 1 (Feb), 58–73.
  7. Felegyhazi, M. and Hubaux, J.-P. 2006. Game theory in wireless networks: A tutorial. EPFL Technical report.
  8. Kennedy, J. and Eberhart, R. 1995. Particle swarm optimization. Neural Networks, 1995. Proceedings., IEEE International Conference on 4, 1942–1948.
  9. Kleinrock, L. and Tobagi, F. 1975. Packet switching in radio channels: Part i–carrier sense multiple-access modes and their throughput-delay characteristics. IEEE Transactions on Communications 23, 12 (December), 1400–1416.
  10. Lauwens, B., Scheers, B., and de Capelle, A. V. 2010. Performance analysis of unslotted csma/ca in wireless networks. Telecommunication Systems 44, 1-2, 109–123.
  11. Li, J., Blake, C., De Couto, D. S. J., Lee, H. I., and Morris, R. 2001. Capacity of ad hoc wireless networks. Proceedings of the 7th ACM International Conference on Mobile Computing and Networking, 61–69.
  12. Luo, H., Lu, S., and Bharghavan, V. 2000. A new model for packet scheduling in multihop wireless networks. Proceedings of ACM MOBICOM, 76–86.
  13. M. Cagalj, S. Ganeriwal, I. A. and Hubaux, J. P. 2005. On selfish behavior in CSMA/CA networks. INFOCOM 2005 4, 2513–2524.
  14. Medepalli, K. and Tobagi, F. A. 2006. Towards performance modeling of IEEE 802.11 based wireless networks: A unified framework and its applications. INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, 1–12.
  15. Michele Garetto, T. S. and Knightly, E. W., Eds. 2006. Modeling Per-Flow Throughput and Capturing Starvation in CSMA Multi-Hop Wireless Networks. Proceedings of IEEE INFOCOM, Barcelona, Spain.
  16. Nandagopal, T., eun Kim, T., Gao, X., and Bharghavan, V. 2000. Achieving mac layer fairness in wireless packet networks. MOBICOM, 87–98.
  17. Rajagopalan, S., Shah, D., and Shin, J. 2009. Network adiabatic theorem: an efficient randomized protocol for contention resolution. SIGMETRICS ’09 Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems.
  18. Shi, J., Gurewitz, O., Mancuso, V., Camp, J., and Knightly, E. W. 2008. Measurement and modeling of the origins of starvation in congestion controlled mesh networks. INFOCOM, 1633–1641.
  19. Shi, Z. 2010. Stochastic modeling, correlation, competition, and cooperation in a csma wireless network. Ph.D. thesis, University of Missouri-Kansas City, Kansas City, Missouri.
  20. Shi, Z., Beard, C., and Mitchell, K. 2007. Misbehavior and MAC friendliness in CSMA networks. IEEE Wireless Communications and Networking Conference WCNC., 355–360.
  21. Shi, Z., Beard, C., and Mitchell, K. 2008. Tunable traffic control for multihop csma networks. Military Communications Conference (MILCOM ’08), 1–7.
  22. Shi, Z., Beard, C., and Mitchell, K. 2009. Analytical models for understanding misbehavior and mac friendliness in csma networks. Performance Evaluation 66, 469–487.
  23. Shi, Z., Beard, C., and Mitchell, K. 2011. Competition, cooperation, and optimization in multi-hop csma networks. Accepted by The Eighth ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN).
  24. Shi, Z., Beard, C., and Mitchell, K. 2012. Analytical models for understanding space, backoff, and flow correlation in csma wireless networks. doi: 10.1007/s11276-012-0474-8. Wireless Networks, Springer.
  25. Srivastava, V., Neel, J., MacKenzie, A. B., Menon, R., DaSilva, L. A., Hicks, J. E., Reed, J. H., and Gilles, R. P. 2005. Using game theory to analyze wireless ad hoc networks. IEEE Communications Surveys and Tutorials 7, 46–56.
  26. Wang, X. and Kar, K. 2005. Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks. INFOCOM 2005 1, 23–34.
  27. Xu, S. and Saadawi, T. 2001. Does the IEEE 802.11 mac protocol work well in multihop wireless adhoc networks? aCommunications Magazine, IEEE 39, 6 (June), 130–137.