• DocumentCode
    1560690
  • Title

    A bandwidth-reservation mechanism for on-demand ad hoc path finding

  • Author

    Gerasimov, Irina ; Simon, Robert

  • Author_Institution
    Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA
  • fYear
    2002
  • Firstpage
    27
  • Lastpage
    34
  • Abstract
    One of the major challenges faced by designers of ad hoc network systems is the deployment of end-to-end quality-of-service support mechanisms. This paper describes QoS-AODV, an integrated route discovery and bandwidth reservation protocol. QoS-AODV is designed to operate within a TDMA network. Unlike other path finding and route discovery protocols that ignore the impact of the data link layer, QoS-AODV incorporates slot scheduling information to ensure that end-to-end bandwidth is actually reserved. Further, QoS-AODV is an enhanced version of the Ad hoc On-demand Distance Vector routing protocol, and is therefore compatible with proposed route discovery and maintenance techniques. In order to test the effectiveness of our protocol we implemented a version of QoS-AODV, along with two similar protocols, in the ns-2 simulator. Our experiments showed the QoS-AODV significantly improved the probability of being able to find an end-to-end QoS path.
  • Keywords
    bandwidth allocation; mobile computing; quality of service; telecommunication network routing; time division multiple access; transport protocols; wireless LAN; Ad hoc On-demand Distance Vector routing protocol; QoS-AODV TDMA network; ad hoc network systems; bandwidth-reservation mechanism; end-to-end quality-of-service support mechanisms; integrated route discovery and bandwidth reservation protocol; on-demand ad hoc path finding; route discovery; slot scheduling information; Ad hoc networks; Bandwidth; Computational modeling; Computer science; Image analysis; Operating systems; Quality of service; Routing protocols; Testing; Time division multiple access;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Simulation Symposium, 2002. Proceedings. 35th Annual
  • ISSN
    1082-241X
  • Print_ISBN
    0-7695-1552-5
  • Type

    conf

  • DOI
    10.1109/SIMSYM.2002.1000079
  • Filename
    1000079