• DocumentCode
    2797474
  • Title

    Incentive Problem for Ad Hoc Networks Scalability

  • Author

    Costa-Requena, Jose ; Kantola, Raimo ; Beijar, Nicklas

  • Author_Institution
    Networkink Lab., Helsinki Univ. of Technol., Espoo
  • fYear
    2005
  • fDate
    23-28 Oct. 2005
  • Firstpage
    70
  • Lastpage
    70
  • Abstract
    Ad hoc networks still have unsolved fundamental problems such as scalability, security and QoS. Ad hoc networks have to compete with existing wireless technologies that already provide networking capabilities with low cost. The main driver for ad hoc networks is to have a zero-cost and self-created IP network. We consider scalability as the main inconvenience for future deployment of ad hoc networks. In this paper we analyse the scalability in a real testbed and we propose a simple and novel solution based on relay nodes. The relay nodes require consuming additional resources that users may not be willing to support. We use game theory to demonstrate that users will cooperate if a rewarding mechanism is implemented. Therefore, the proposed solution for scalable ad hoc networks requires a tight interaction between routing and MAC layer to enforce the rewarding mechanism. A new node architecture different from the OSI layering structure is required
  • Keywords
    IP networks; access protocols; ad hoc networks; game theory; open systems; routing protocols; MAC layer; OSI layer; ad hoc network; game theory; medium access control; rewarding mechanism; routing protocol; scalability analysis; self-created IP network; wireless technology; Ad hoc networks; Communication system security; Costs; Game theory; IP networks; Open systems; Relays; Routing; Scalability; Testing; Ad Hoc; Game theory; Scalability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Autonomic and Autonomous Systems and International Conference on Networking and Services, 2005. ICAS-ICNS 2005. Joint International Conference on
  • Conference_Location
    Papeete, Tahiti
  • Print_ISBN
    0-7695-2450-8
  • Type

    conf

  • DOI
    10.1109/ICAS-ICNS.2005.57
  • Filename
    1559922