鳄鱼队

Home on the Double Bayou Pub Date : 1961-12-31 DOI:10.7560/732674-017

Biao Han, Jie Li, Yuguang Fang, Jinshu Su

{"title":"鳄鱼队","authors":"Biao Han, Jie Li, Yuguang Fang, Jinshu Su","doi":"10.7560/732674-017","DOIUrl":null,"url":null,"abstract":"Main Contributions: – Formulate the relay placement problem with the objective to maximize the overall link capacity, which seeks for the best cooperative relay location for each S-D pair. – Design a set of polynomial time algorithms to optimally solve the relay placement problems in cooperative wireless networks. – Prove the optimality of the proposed algorithms. – Proposed solution goes a step further and increase the overall capacity by 1 time comparing with existing schemes. Relay Placement for Capacity Maximization GATORs Design","PeriodicalId":322415,"journal":{"name":"Home on the Double Bayou","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1961-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Gators\",\"authors\":\"Biao Han, Jie Li, Yuguang Fang, Jinshu Su\",\"doi\":\"10.7560/732674-017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Main Contributions: – Formulate the relay placement problem with the objective to maximize the overall link capacity, which seeks for the best cooperative relay location for each S-D pair. – Design a set of polynomial time algorithms to optimally solve the relay placement problems in cooperative wireless networks. – Prove the optimality of the proposed algorithms. – Proposed solution goes a step further and increase the overall capacity by 1 time comparing with existing schemes. Relay Placement for Capacity Maximization GATORs Design\",\"PeriodicalId\":322415,\"journal\":{\"name\":\"Home on the Double Bayou\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1961-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Home on the Double Bayou\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7560/732674-017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Home on the Double Bayou","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7560/732674-017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

主要贡献:-以总链路容量最大化为目标，制定中继布局问题，为每个S-D对寻求最佳的合作中继位置。-设计一套多项式时间算法，以最优解决协作无线网络中的中继放置问题。-证明所提出算法的最优性。-建议的解决方案更进了一步，与现有方案相比，总容量增加了1倍。容量最大化鳄鱼设计的继电器安置

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

查看原文本刊更多论文

Gators

Main Contributions: – Formulate the relay placement problem with the objective to maximize the overall link capacity, which seeks for the best cooperative relay location for each S-D pair. – Design a set of polynomial time algorithms to optimally solve the relay placement problems in cooperative wireless networks. – Prove the optimality of the proposed algorithms. – Proposed solution goes a step further and increase the overall capacity by 1 time comparing with existing schemes. Relay Placement for Capacity Maximization GATORs Design

求助全文

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

来源期刊

Home on the Double Bayou

自引率

0.00%

发文量