Pricing for enabling forwarding in self-configuring ad hoc networks

被引:94
作者
Ileri, O [1 ]
Mau, SC [1 ]
Mandayam, NB [1 ]
机构
[1] Rutgers State Univ, Dept Elect & Comp Engn, WINLAB, Piscataway, NJ 08854 USA
关键词
cooperation; incentive for forwarding; noncooperative game; pricing; revenue maximization; Stackelberg game; utility;
D O I
10.1109/JSAC.2004.837356
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:151 / 162
页数:12
相关论文
共 21 条
[1]  
[Anonymous], P ACM INT S MOB AD H
[2]   Enforcing service availability in mobile ad-hoc WANs [J].
Buttyán, L ;
Hubaux, JP .
MOBIHOC: 2000 FIRST ANNUAL WORKSHOP ON MOBILE AND AD HOC NETWORKING AND COMPUTING, 2000, :87-96
[4]   Modelling incentives for collaboration in mobile ad hoc networks [J].
Crowcroft, J ;
Gibbens, R ;
Kelly, F ;
Östring, S .
PERFORMANCE EVALUATION, 2004, 57 (04) :427-439
[5]  
FENG N, 2001, P ANN ALL C COMM CON, P202
[6]  
FUDENBERY D, 1991, GAME THEORY
[7]   Power control for wireless data [J].
Goodman, D ;
Mandayam, N .
IEEE PERSONAL COMMUNICATIONS, 2000, 7 (02) :48-54
[8]   Mobility increases the capacity of ad hoc wireless networks [J].
Grossglauser, M ;
Tse, DNC .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (04) :477-486
[9]   The capacity of wireless networks [J].
Gupta, P ;
Kumar, PR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :388-404
[10]   Cooperation diversity through coding [J].
Hunter, TE ;
Nosratinia, A .
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, :220-220