Taichi Miya, Kohta Ohshima, Yoshiaki Kitaguchi, K. Yamaoka
{"title":"HANETs中允许延迟约束下的流量调节上限","authors":"Taichi Miya, Kohta Ohshima, Yoshiaki Kitaguchi, K. Yamaoka","doi":"10.1109/CCNC.2019.8651741","DOIUrl":null,"url":null,"abstract":"For HANETs, it is important to integrate independent MANETs and operate them as one system. Moreover, communications with a time restriction have recently been increasing, so it is necessary to discuss about delay reduction in the field of HANETs. In this paper, we discuss the upper limit of flow accommodation under an allowable delay constraint. We suggest using the result as a performance evaluation index for routing algorithms for HANETs.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Upper Limit of Flow Accommodation under Allowable Delay Constraint in HANETs\",\"authors\":\"Taichi Miya, Kohta Ohshima, Yoshiaki Kitaguchi, K. Yamaoka\",\"doi\":\"10.1109/CCNC.2019.8651741\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For HANETs, it is important to integrate independent MANETs and operate them as one system. Moreover, communications with a time restriction have recently been increasing, so it is necessary to discuss about delay reduction in the field of HANETs. In this paper, we discuss the upper limit of flow accommodation under an allowable delay constraint. We suggest using the result as a performance evaluation index for routing algorithms for HANETs.\",\"PeriodicalId\":285899,\"journal\":{\"name\":\"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC.2019.8651741\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC.2019.8651741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Upper Limit of Flow Accommodation under Allowable Delay Constraint in HANETs
For HANETs, it is important to integrate independent MANETs and operate them as one system. Moreover, communications with a time restriction have recently been increasing, so it is necessary to discuss about delay reduction in the field of HANETs. In this paper, we discuss the upper limit of flow accommodation under an allowable delay constraint. We suggest using the result as a performance evaluation index for routing algorithms for HANETs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
