Cooperative routing algorithm based on game theory
Cooperative virtual multiple-input multiple-output (VMIMO) transmission is an effective technique to im-prove the transmission performance of wireless network. By taking advantage of diversity gain of VMIMO, the cross-layer VMIMO routing design combining cooperative VMIMO technology of physical laye...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-08-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.z1.007/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539788094570496 |
|---|---|
| author | Kun XIE Shen-lin DUAN Ji-gang WEN Shi-ming HE |
| author_facet | Kun XIE Shen-lin DUAN Ji-gang WEN Shi-ming HE |
| author_sort | Kun XIE |
| collection | DOAJ |
| description | Cooperative virtual multiple-input multiple-output (VMIMO) transmission is an effective technique to im-prove the transmission performance of wireless network. By taking advantage of diversity gain of VMIMO, the cross-layer VMIMO routing design combining cooperative VMIMO technology of physical layer and routing scheme of network layer can reduce power consumption of wireless transmission significantly. A significant challenge is how to make the VMIMO routing protocol robust to selfish and cheating behavior of users while guaranteeing high delivery ratio and low energy consumption. In order to improve the routing performance of selfish wireless network, a VMIMO coop-erative routing algorithm based on game theory was proposed. The network was divided into groups, and data was trans-mitted through VMIMO between groups. VMIMO routing among groups was modeled as a repeated routing game. To improve the data delivery ratio, a fit function was proposed to evaluate the nodes' credit for participating in packet for-warding. Based on the fit function, a fit value based routing selection algorithm and a fit value based routing forward al-gorithm were proposed. The proposed repeated routing game can approach to pareto optimality. Simulation result shows that this algorithm is capable of promoting cooperation between selfish nodes, which results in high delivery ratio, low transmission delay and energy consumption. |
| format | Article |
| id | doaj-art-1533ebbb5dbd444782f16b39a8c2728d |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2013-08-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-1533ebbb5dbd444782f16b39a8c2728d2025-01-14T06:41:48ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2013-08-0134445759676901Cooperative routing algorithm based on game theoryKun XIEShen-lin DUANJi-gang WENShi-ming HECooperative virtual multiple-input multiple-output (VMIMO) transmission is an effective technique to im-prove the transmission performance of wireless network. By taking advantage of diversity gain of VMIMO, the cross-layer VMIMO routing design combining cooperative VMIMO technology of physical layer and routing scheme of network layer can reduce power consumption of wireless transmission significantly. A significant challenge is how to make the VMIMO routing protocol robust to selfish and cheating behavior of users while guaranteeing high delivery ratio and low energy consumption. In order to improve the routing performance of selfish wireless network, a VMIMO coop-erative routing algorithm based on game theory was proposed. The network was divided into groups, and data was trans-mitted through VMIMO between groups. VMIMO routing among groups was modeled as a repeated routing game. To improve the data delivery ratio, a fit function was proposed to evaluate the nodes' credit for participating in packet for-warding. Based on the fit function, a fit value based routing selection algorithm and a fit value based routing forward al-gorithm were proposed. The proposed repeated routing game can approach to pareto optimality. Simulation result shows that this algorithm is capable of promoting cooperation between selfish nodes, which results in high delivery ratio, low transmission delay and energy consumption.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.z1.007/VMIMOcooperative routingrepeated gamereputation |
| spellingShingle | Kun XIE Shen-lin DUAN Ji-gang WEN Shi-ming HE Cooperative routing algorithm based on game theory Tongxin xuebao VMIMO cooperative routing repeated game reputation |
| title | Cooperative routing algorithm based on game theory |
| title_full | Cooperative routing algorithm based on game theory |
| title_fullStr | Cooperative routing algorithm based on game theory |
| title_full_unstemmed | Cooperative routing algorithm based on game theory |
| title_short | Cooperative routing algorithm based on game theory |
| title_sort | cooperative routing algorithm based on game theory |
| topic | VMIMO cooperative routing repeated game reputation |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.z1.007/ |
| work_keys_str_mv | AT kunxie cooperativeroutingalgorithmbasedongametheory AT shenlinduan cooperativeroutingalgorithmbasedongametheory AT jigangwen cooperativeroutingalgorithmbasedongametheory AT shiminghe cooperativeroutingalgorithmbasedongametheory |