TY - JOUR
T1 - Efficient node forwarding strategies via non-cooperative game for wireless ad hoc networks
AU - Li, Mingmei
AU - Kamioka, Eiji
AU - Yamada, Shigeki
AU - Cui, Yang
PY - 2005
Y1 - 2005
N2 - In multi-hop ad hoc networks, communications rely heavily on cooperation of each node. Albeit a good teamwork will run the wireless networks well, some selfish behaviors could definitely break them down. This paper examines the theoretical aspect of selfish nodes through a non-cooperative game framework. Depending on the tradeoff between the nodes packet generating requirements and forwarding preferences, we introduce a unique "cost and compensation" scheme: the nodes first select their initial packet generating rates, in order to attain their desired values, they adjust the rates according to the associated cost reflected by network status; and they are also compensated once they forward packets for other nodes. We then propose a distributed algorithm to achieve optimal point for individual node-Nash Equilibrium(NE). Finally, simulation results show that proposed scheme is effective to enforce the potentially selfish nodes to co-operate.
AB - In multi-hop ad hoc networks, communications rely heavily on cooperation of each node. Albeit a good teamwork will run the wireless networks well, some selfish behaviors could definitely break them down. This paper examines the theoretical aspect of selfish nodes through a non-cooperative game framework. Depending on the tradeoff between the nodes packet generating requirements and forwarding preferences, we introduce a unique "cost and compensation" scheme: the nodes first select their initial packet generating rates, in order to attain their desired values, they adjust the rates according to the associated cost reflected by network status; and they are also compensated once they forward packets for other nodes. We then propose a distributed algorithm to achieve optimal point for individual node-Nash Equilibrium(NE). Finally, simulation results show that proposed scheme is effective to enforce the potentially selfish nodes to co-operate.
KW - Ad Hoc Networks
KW - Nash Equilibrium(NE)
KW - Non-cooperative Game
UR - http://www.scopus.com/inward/record.url?scp=26444562383&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=26444562383&partnerID=8YFLogxK
U2 - 10.1007/11534310_37
DO - 10.1007/11534310_37
M3 - Conference article
AN - SCOPUS:26444562383
VL - 3619
SP - 334
EP - 343
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
T2 - Third International Conference on Computer Network and Mobile Computing, ICCNMC 2005
Y2 - 2 August 2005 through 4 August 2005
ER -