Chung-Ming Huang, Shih-Yang Lin, Yi-Chun Lin, L. Tu
{"title":"车联网带宽共享的最优合作范围分析","authors":"Chung-Ming Huang, Shih-Yang Lin, Yi-Chun Lin, L. Tu","doi":"10.1109/ITST.2013.6685522","DOIUrl":null,"url":null,"abstract":"This paper investigates the Optimal Cooperation Scope (OCS) for Cooperative Bandwidth Sharing (CBS) in vehicular networks. Three relay schemes based on optimal single path relay and opportunistic relay for multihop CBS are proposed and studied. The OCS is solved as the maximum physical distance or hops between the bandwidth requester and bandwidth helper in the optimal solution to maximize the CBS benefit. OCSs for different environments and with different relay schemes are given in the paper. The results indicate that the OCS is sensitive to the cost weight and may also be larger when using a proper opportunistic relay based scheme than using the optimal single path based one.","PeriodicalId":117087,"journal":{"name":"2013 13th International Conference on ITS Telecommunications (ITST)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of the Optimal Cooperation Scope of Bandwidth Sharing in vehicular networks\",\"authors\":\"Chung-Ming Huang, Shih-Yang Lin, Yi-Chun Lin, L. Tu\",\"doi\":\"10.1109/ITST.2013.6685522\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates the Optimal Cooperation Scope (OCS) for Cooperative Bandwidth Sharing (CBS) in vehicular networks. Three relay schemes based on optimal single path relay and opportunistic relay for multihop CBS are proposed and studied. The OCS is solved as the maximum physical distance or hops between the bandwidth requester and bandwidth helper in the optimal solution to maximize the CBS benefit. OCSs for different environments and with different relay schemes are given in the paper. The results indicate that the OCS is sensitive to the cost weight and may also be larger when using a proper opportunistic relay based scheme than using the optimal single path based one.\",\"PeriodicalId\":117087,\"journal\":{\"name\":\"2013 13th International Conference on ITS Telecommunications (ITST)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 13th International Conference on ITS Telecommunications (ITST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITST.2013.6685522\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 13th International Conference on ITS Telecommunications (ITST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITST.2013.6685522","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of the Optimal Cooperation Scope of Bandwidth Sharing in vehicular networks
This paper investigates the Optimal Cooperation Scope (OCS) for Cooperative Bandwidth Sharing (CBS) in vehicular networks. Three relay schemes based on optimal single path relay and opportunistic relay for multihop CBS are proposed and studied. The OCS is solved as the maximum physical distance or hops between the bandwidth requester and bandwidth helper in the optimal solution to maximize the CBS benefit. OCSs for different environments and with different relay schemes are given in the paper. The results indicate that the OCS is sensitive to the cost weight and may also be larger when using a proper opportunistic relay based scheme than using the optimal single path based one.