Game theoretical routing protocol with fairness problem in wireless mesh networks
Based on game theory,a routing protocol studied with irness problem was proposed.Each router had the same opportunities of Internet access no matter how far from the gateway.Based on the tree topology,the calculation of route could be distributed to every branches of the tree,which greatly reduced t...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-11-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2012.11.003/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Based on game theory,a routing protocol studied with irness problem was proposed.Each router had the same opportunities of Internet access no matter how far from the gateway.Based on the tree topology,the calculation of route could be distributed to every branches of the tree,which greatly reduced the load of the root and more suitable for wireless mesh networks.The simulation results show that the new protocol is more suitable for wireless mesh networks compare with AODV and HWMP,no matter in network throughput or average end-to-end delays,as far as fairness. |
|---|---|
| ISSN: | 1000-436X |