Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science |
| Editors | X. Lu, W. Zhao |
| Pages | 334-343 |
| Number of pages | 10 |
| Volume | 3619 |
| Publication status | Published - 2005 |
| Externally published | Yes |
| Event | Third International Conference on Computer Network and Mobile Computing, ICCNMC 2005 - Zhangjiajie, China Duration: 2005 Aug 2 → 2005 Aug 4 |
Other
| Other | Third International Conference on Computer Network and Mobile Computing, ICCNMC 2005 |
|---|---|
| Country | China |
| City | Zhangjiajie |
| Period | 05/8/2 → 05/8/4 |
Fingerprint
Keywords
- Ad Hoc Networks
- Nash Equilibrium(NE)
- Non-cooperative Game
ASJC Scopus subject areas
- Computer Science (miscellaneous)
Cite this
Efficient node forwarding strategies via non-cooperative game for wireless ad hoc networks. / Li, Mingmei; Kamioka, Eiji; Yamada, Shigeki; Cui, Yang.
Lecture Notes in Computer Science. ed. / X. Lu; W. Zhao. Vol. 3619 2005. p. 334-343.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
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
M3 - Conference contribution
AN - SCOPUS:26444562383
VL - 3619
SP - 334
EP - 343
BT - Lecture Notes in Computer Science
A2 - Lu, X.
A2 - Zhao, W.
ER -