• DocumentCode
    1198961
  • Title

    Pricing for enabling forwarding in self-configuring ad hoc networks

  • Author

    Ileri, O. ; Siun-Chuon Mau ; Mandayam, N.B.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA
  • Volume
    23
  • Issue
    1
  • fYear
    2005
  • Firstpage
    151
  • Lastpage
    162
  • Abstract
    The assumption that all nodes cooperate to relay packets for each other may not be realistic for commercial wireless ad hoc networks. An autonomous (selfish) node in a wireless network has two disincentives for forwarding for others: energy expenditure (real cost) and possible delays for its own data (opportunity cost). We introduce a mechanism that "fosters cooperation through bribery" in the context of forwarding in ad hoc networks. Using a microeconomic framework based on game theory, we design and analyze a pricing algorithm that encourages forwarding among autonomous nodes by reimbursing forwarding. Taking a joint network-centric and user-centric approach, the revenue maximizing network and utility (measured in bits-per-Joule) maximizing nodes interact through prices for channel use, reimbursements for forwarding, transmitter power control, as well as forwarding and destination preferences. In a three-node (two-sources, one-access-point) network, the network converges to an architecture that induces forwarding only when the network geometries are such that forwarding is likely to increase individual benefits (network revenue and node utilities). For other geometries, the network converges to architectures that do not favor forwarding. We then generalize to a multinode network, where it is seen that the nodes\´ willingness to forward decrease for large ratios of the average internodal distance to the smallest distance between the access point and any source node. Pricing with reimbursement generally improves the network aggregate utility (or aggregate bits-per-Joule), as well as utilities and revenue compared with the corresponding pricing algorithm without reimbursement.
  • Keywords
    ad hoc networks; convergence; game theory; optimisation; power control; pricing; Stackelberg game; autonomous node; channel use; energy expenditure; foster cooperation bribery mechanism; game theory; joint network-centric approach; network convergence; noncooperative game; pricing algorithm; relay packet; revenue maximization network; self-configuring ad hoc network; transmitter power control; user-centric approach; utility maximization node; wireless ad hoc network; Ad hoc networks; Aggregates; Algorithm design and analysis; Costs; Geometry; Microeconomics; Mobile ad hoc networks; Pricing; Relays; Wireless networks; Cooperation; Stackelberg game; incentive for forwarding; noncooperative game; pricing; revenue maximization; utility;
  • fLanguage
    English
  • Journal_Title
    Selected Areas in Communications, IEEE Journal on
  • Publisher
    ieee
  • ISSN
    0733-8716
  • Type

    jour

  • DOI
    10.1109/JSAC.2004.837356
  • Filename
    1374967