TY - GEN
T1 - Pricing for enabling forwarding in self-configuring ad hoc networks
AU - Ileri, Omer
AU - Mau, Siun Chuon
AU - Mandayam, Narayan B.
PY - 2004
Y1 - 2004
N2 - Using a microeconomic framework based on game theory, we design and analyze a pricing algorithm that encourages forwarding among autonomous (selfish) nodes by reimbursing forwarding. Taking a joint network-centric and user-centric approach, the revenue maximizing network and utility 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 bring higher network efficiency. For other geometries, the network converges to architectures that do not favor forwarding. We characterize the Nash equilibria for each geometry and design specific game implementations to achieve the most Pareto superior Nash equilibrium. In a general multi-node network, our results indicate that the nodes' willingness to forward decrease for large values of the ratio of the average internodal distance to the average distance between the access point and nodes with direct connections to it.
AB - Using a microeconomic framework based on game theory, we design and analyze a pricing algorithm that encourages forwarding among autonomous (selfish) nodes by reimbursing forwarding. Taking a joint network-centric and user-centric approach, the revenue maximizing network and utility 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 bring higher network efficiency. For other geometries, the network converges to architectures that do not favor forwarding. We characterize the Nash equilibria for each geometry and design specific game implementations to achieve the most Pareto superior Nash equilibrium. In a general multi-node network, our results indicate that the nodes' willingness to forward decrease for large values of the ratio of the average internodal distance to the average distance between the access point and nodes with direct connections to it.
KW - Cooperation
KW - Incentive for forwarding
KW - Non-cooperative game
KW - Pricing
KW - Revenue maximization
KW - Stackelberg game
KW - Utility
UR - http://www.scopus.com/inward/record.url?scp=4544233277&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=4544233277&partnerID=8YFLogxK
U2 - 10.1109/wcnc.2004.1311330
DO - 10.1109/wcnc.2004.1311330
M3 - Conference contribution
AN - SCOPUS:4544233277
SN - 0780383443
SN - 9780780383449
T3 - 2004 IEEE Wireless Communications and Networking Conference, WCNC 2004
SP - 1034
EP - 1039
BT - 2004 IEEE Wireless Communications and Networking Conference, WCNC 2004
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2004 IEEE Wireless Communications and Networking Conference, WCNC 2004
Y2 - 21 March 2004 through 25 March 2004
ER -