Chung-wei Lee, Jonathan C. L. Liu, Kun Chen, Y. Tseng, Sheng-Po Kuo
{"title":"Supporting Multimedia Communication within an 802.11g Ad-hoc Network","authors":"Chung-wei Lee, Jonathan C. L. Liu, Kun Chen, Y. Tseng, Sheng-Po Kuo","doi":"10.1109/FGCN.2007.208","DOIUrl":null,"url":null,"abstract":"By investigating the experimental results of the average throughput with the 802.11g ad-hoc mode, we have collected the different performance characteristics among the indoor, the wall-penetration and the outdoor environment. Given the solid evidences from the baseline experiments, we have embedded the heuristic algorithms into the routing decisions. We have thus simulated a large area of 300 meters by 300 meters with hundreds of routing nodes. After investigating over 100 topology scenarios, the performance results indicate that our proposed scheme produces the higher-bandwidth paths for most of the cases. Even in the less-dense cases, our proposed schemes still can find the better paths with bandwidth about 30% higher than the conventional methods.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Communication and Networking (FGCN 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FGCN.2007.208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
By investigating the experimental results of the average throughput with the 802.11g ad-hoc mode, we have collected the different performance characteristics among the indoor, the wall-penetration and the outdoor environment. Given the solid evidences from the baseline experiments, we have embedded the heuristic algorithms into the routing decisions. We have thus simulated a large area of 300 meters by 300 meters with hundreds of routing nodes. After investigating over 100 topology scenarios, the performance results indicate that our proposed scheme produces the higher-bandwidth paths for most of the cases. Even in the less-dense cases, our proposed schemes still can find the better paths with bandwidth about 30% higher than the conventional methods.