移动自组织网络的容量扩展

2010 IEEE International Conference on Communications Pub Date : 2010-05-23 DOI:10.1109/ICC.2010.5502352

Bo Su, Changxing Pei, Kuang Xu, Honggang Wang, Bin Wang

{"title":"移动自组织网络的容量扩展","authors":"Bo Su, Changxing Pei, Kuang Xu, Honggang Wang, Bin Wang","doi":"10.1109/ICC.2010.5502352","DOIUrl":null,"url":null,"abstract":"In this paper, we derive the general expressions of the throughput capacity scaling of mobile ad hoc networks (MANETs), and find that the strategy of an individual node determines the throughput of an MANET. We show that optimal strategies that maximize the throughput of the network can exist. Based on a game theoretic approach, we further show that the optimal strategies constitute Nash equilibria.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"25 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Capacity Scaling of Mobile Ad Hoc Networks\",\"authors\":\"Bo Su, Changxing Pei, Kuang Xu, Honggang Wang, Bin Wang\",\"doi\":\"10.1109/ICC.2010.5502352\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we derive the general expressions of the throughput capacity scaling of mobile ad hoc networks (MANETs), and find that the strategy of an individual node determines the throughput of an MANET. We show that optimal strategies that maximize the throughput of the network can exist. Based on a game theoretic approach, we further show that the optimal strategies constitute Nash equilibria.\",\"PeriodicalId\":6405,\"journal\":{\"name\":\"2010 IEEE International Conference on Communications\",\"volume\":\"25 1\",\"pages\":\"1-4\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2010.5502352\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2010.5502352","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文推导了移动自组织网络(MANET)吞吐量容量扩展的一般表达式，并发现单个节点的策略决定了MANET的吞吐量。我们证明了网络吞吐量最大化的最优策略是存在的。基于博弈论的方法，我们进一步证明了最优策略构成纳什均衡。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Capacity Scaling of Mobile Ad Hoc Networks

In this paper, we derive the general expressions of the throughput capacity scaling of mobile ad hoc networks (MANETs), and find that the strategy of an individual node determines the throughput of an MANET. We show that optimal strategies that maximize the throughput of the network can exist. Based on a game theoretic approach, we further show that the optimal strategies constitute Nash equilibria.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 IEEE International Conference on Communications

自引率

0.00%

发文量