skip to main content
10.1145/2248326.2248330acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article

Backoff mechanisms in narrow band and spread spectrum aloha networks

Published:11 June 2012Publication History

ABSTRACT

There exist several wireless networks that employ some form of Aloha for sharing the medium. The primary feature of Aloha is the random backoff mechanism, which chooses a random interval of time before transmitting the next packet. This mechanism allows a graceful degradation in per-user throughput as more users are added to the network. The optimal design of the backoff mechansim is well known for a narrow band network in which all users are within range. In this paper, we set up and solve a simple optimization problem to calculate the backoff interval for any network topology, for narrow band or spread spectrum. We then provide a few practical protocol designs based on the optimization and discuss the tradeoffs between them. Finally, we present the results of some preliminary simulations showing the performance of these protocols.

References

  1. D. Bertsekas and R. Gallager. Data networks, 2nd ed. New Jersey: Prentice-Hall, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. Wang, D. Ripplinger, A. Rai, S. Warnick, and D. Zappala. A convex optimization approach to decentralized rate control in wireless networks with partial interference. CDC 2010: IEEE Conference on Decision and Control, December 2010, pp. 639--646.Google ScholarGoogle ScholarCross RefCross Ref
  3. D. Ripplinger, S. Warnick, and D. Zappala. First-principles modeling of wireless networks for rate control. CDC-ECC 2011: IEEE Conference on Decision and Control and European Control Conference, December 2011, pp. 3794--3799.Google ScholarGoogle Scholar
  4. B. Bensaou and Z. Fang. A fair MAC protocol for IEEE 802.11-based ad hoc networks: Design and implementation. IEEE Transactions on Wireless Communications, vol. 6, no. 8, pp. 2934--2941, August 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. L. Chen, S. Low, and J. Doyle. Joint congestion control and media access control design for ad hoc wireless networks. INFOCOM 2005: IEEE International Conference on Computer Communications, March 2005, pp. 2212--2222.Google ScholarGoogle Scholar
  6. L. Chen, S. Low, M. Chiang, and J. Doyle. Cross-layer congestion control, routing and scheduling design in ad hoc wireless networks. INFOCOM 2006: IEEE International Conference on Computer Communications, April 2006, pp. 1--13.Google ScholarGoogle ScholarCross RefCross Ref
  7. A. Dimakis and J. Walrand. Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using uid limits. Adv. Appl. Probab., vol. 38, no. 2, pp. 505--521, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  8. C. Joo, X. Lin, and N. Shroff. Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks. INFOCOM 2008: IEEE International Conference on Computer Communications, April 2008, pp. 1139--1147.Google ScholarGoogle ScholarCross RefCross Ref
  9. G. Zussman, A. Brzezinski, and E. Modiano. Multihop local pooling for distributed throughput maximization in wireless networks. INFOCOM 2008: IEEE International Conference on Computer Communications, April 2008, pp. 1139--1147.Google ScholarGoogle ScholarCross RefCross Ref
  10. M. Leconte, J. Ni, and R. Srikant. Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks. MobiHoc 2009: ACM International Symposium on Mobile Ad Hoc Networking and Computing, May 2009, pp. 165--174. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. L. Jiang and J. Walrand. Distributed CSMA algorithm for throughput and utility maximization in wireless networks. IEEE/ACM Transactions on Networking, vol. 18, no. 3, pp. 960--972, June 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. L. Jiang, D. Shah, J. Shin, and J. Walrand. Distributed random access algorithm: Scheduling and congestion control. IEEE Transactions on Information Theory, vol. 56, no. 12, pp. 6182--6207, December 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. Shah and J. Shin. Randomized scheduling algorithm for queueing networks. Online at: http://arxiv.org/pdf/0908.3670v2.pdfGoogle ScholarGoogle Scholar
  14. H. Abuzanat, B. Trouillet, and A. Toguyeni. Routing fairness model for QoS optimization in wireless network. SENSORCOMM 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. Cloud, L. Zeger, and M. Mã'ldard. MAC centered cooperation|Synergistic design of network coding, multi-packet reception, and improved fairness to increase network throughput. IEEE Journal on Selected Areas in Communications, vol. 30, no. 2, pp. 1--8, February 2012.Google ScholarGoogle Scholar
  16. J. Liu, A. Stolyar, M. Chiang, and H. Poor. Queue back-pressure random access in multihop wireless networks: Optimality and stability. IEEE Transactions on Information Theory, vol. 55, no. 9, pp. 4087--4098, September 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. P. Gupta and A. Stolyar. Optimal throughput allocation in general random-access networks. CISS 2006: Conference on Information Sciences and Systems, March 2006, pp. 1254--1259.Google ScholarGoogle ScholarCross RefCross Ref
  18. C. Joo and N. Shroff. Performance of random access scheduling schemes in multihop wireless networks. Asilomar 2006: Asilomar Conference on Signals, Systems and Computers, October 2006.Google ScholarGoogle Scholar
  19. X. Lin and S. Rasool. Constant-time distributed scheduling policies for ad hoc wireless networks. CDC 2006: IEEE Conference on Decision and Control, 2006, pp. 1258--1263.Google ScholarGoogle ScholarCross RefCross Ref
  20. A. Stolyar. Dynamic distributed scheduling in random access network. J. Appl. Probab., vol. 45, no. 2, pp. 297--313, June 2008.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Backoff mechanisms in narrow band and spread spectrum aloha networks

      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
        Airborne '12: Proceedings of the first ACM MobiHoc workshop on Airborne Networks and Communications
        June 2012
        66 pages
        ISBN:9781450312905
        DOI:10.1145/2248326

        Copyright © 2012 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: 11 June 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate7of8submissions,88%
      • Article Metrics

        • Downloads (Last 12 months)3
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader