skip to main content
10.1145/2387027.2387047acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
poster

A channel busy rate-aware congestion avoidance mechanism for the wireless ad hoc network: channel busy rate-aware congestion avoidance mechanism

Published:21 October 2012Publication History

ABSTRACT

This paper presents a Channel Busy Rate-Aware congestion avoidance (CBRA) mechanism for wireless ad hoc network. In the proposed CBRA mechanism, busy rate and utility rate of each node's wireless channel in a wireless ad hoc connection are used for helping the sender to adjust its transmission rate for congestion avoidance. According to the simulation results that compared CBRA and TCP Reno, the proposed CBRA mechanism can improve performance and fairness in wireless ad hoc network.

References

  1. Z. Fu, P. Zerfos, H. Luo, S. Lu, L. Zhang, and M. Gerla. 2003. The Impact of Multihop Wireless Channel on TCP Throughput and Loss. In proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM)(Sun Francisco, USA, March 30 - April 3, 2003). DOI=10.1109/INFCOM.2003.1209197.Google ScholarGoogle Scholar
  2. K. Xu, M. Gerla, L. Qi, and Y. Shu. 2005. TCP Unfairness in Ad Hoc Wireless Networks and a Neighborhood RED Solution. Wireless Networks. 11, 4, 383--399. DOI=10.1007/s11276-005-1764-1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Floyd and V. Jacobson. 1993. Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking. 1, 4, 397--413. DOI=10.1109/90.251892. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. de M. Cordeiro, S. R. Das, and D. P. Agrawal. 2002. COPAS: Dynamic Contention-Balancing to Enhance the Performance of TCP over Multi-hop Wireless Networks. In proceedings of the 11th IEEE International Conference on Computer Communication and Networks (Miami, FL, USA, Oct. 2002). DOI=10.1109/ICCCN.2002.1043095.Google ScholarGoogle Scholar
  5. Z. Ye, S. Krishnamurthy, and S. Tripathi. 2004. Use of Congestion-Aware Routing to Spatially Separate TCP Connections in Wireless Ad Hoc Networks. In proceedings of the 1st International Conference on Mobile Ad Hoc and Sensor Systems (MASS)(Fort Lauderdale, Florida, Oct. 25-27, 2004). DOI=10.1109/MAHSS.2004.1392178.Google ScholarGoogle Scholar
  6. S. Kopparty, S. Krishnamurthy, M. Faloutsos, and S. Tripathi. 2002. Split-TCP for Mobile Ad Hoc Networks. In proceedings of the IEEE Global Telecommunications Conference (GLOBECOM)(Taipei, Taiwan, R.O.C., Nov. 17-21, 2002).DOI=10.1109/GLOCOM.2002.1188057.Google ScholarGoogle Scholar
  7. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE Stsndard 802.11, 1999.Google ScholarGoogle Scholar
  8. Transmission Control Protocol, IETF RFC 793, 1981Google ScholarGoogle Scholar
  9. Patrick-Benjamin Bök, Stephanie Dunhaupt, Luis Blazquez, York Tuchelmann. 2011. A Distributed Fair Congestion Avoidance Protocol. In procdeding of the 3rd IEEE International Workshop on Management of Emerging Networks and Services (Houston, TX, Dec. 2011).DOI=10.1109/GLOCOMW.2011.6162535.Google ScholarGoogle Scholar
  10. Daowen Hua, Xuehui Du, Lifeng Cao, Guoyu Xu, Yanbin Qian. 2010. Daowen Hua, Xuehui Du, Lifeng Cao, Guoyu Xu, Yanbin Qian. In procdeding of 2nd International Conference on Future Computer and Communication (Wuhan, May, 2010). DOI=10.1109/ICFCC.2010.5497306.Google ScholarGoogle Scholar

Index Terms

  1. A channel busy rate-aware congestion avoidance mechanism for the wireless ad hoc network: channel busy rate-aware congestion avoidance mechanism

    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
      PE-WASUN '12: Proceedings of the 9th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
      October 2012
      130 pages
      ISBN:9781450316217
      DOI:10.1145/2387027

      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: 21 October 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      Overall Acceptance Rate70of240submissions,29%
    • Article Metrics

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

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader