• DocumentCode
    2525396
  • Title

    Game Theoretic Access Probability based Bandwidth Request mechanism for WiMAX Point to Multipoint network

  • Author

    Pudasaini, Subodh ; Shin, Seokjoo

  • Author_Institution
    Dept. of Comput. Eng., Chosun Univ., Gwangju
  • fYear
    2008
  • fDate
    19-21 Nov. 2008
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    In this paper, GTAP-BRM (game theoretic access probability based bandwidth request mechanism) is proposed for WiMAX PMP (point to multipoint) network. In the reference standard, IEEE 802.16, connections belonging to QoS (quality of service) class rtPS (real time polling service) are provisioned to issue BW-REQ (bandwidth request) in contention free way while nrtPS (nonreal time polling service) can issue in both contention based and contention free way. This proposed GTAP-BRM, however, offers feasibility to make BW-REQs for both these classes in contention based way. Connections belonging to QoS classes with stringent delay requirement always desire very high average success probability and very low average access delay for the BW-REQs made, if contention based BW-REQs are to be made. This proposed GTAP-BRM caters these requirements for rtPS conncetions with almost 100% average success probability yielding average access delay of around 1 frame-length time. The price paid for that achievement is lower average success probability with longer access delay for delay intolerant nrtPS connections.
  • Keywords
    WiMax; game theory; quality of service; IEEE 802.16; QoS; bandwidth request mechanism; game theoretic access probability; nonreal time polling service; point to multipoint network; quality of service; real time polling service; Access protocols; Bandwidth; Broadcasting; Computer networks; Delay effects; Game theory; Portable media players; Quality of service; Unicast; WiMAX;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    TENCON 2008 - 2008 IEEE Region 10 Conference
  • Conference_Location
    Hyderabad
  • Print_ISBN
    978-1-4244-2408-5
  • Electronic_ISBN
    978-1-4244-2409-2
  • Type

    conf

  • DOI
    10.1109/TENCON.2008.4766448
  • Filename
    4766448