Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651771
Cong Pu
Low power and lossy networks (LLNs) are undeniably vulnerable to various Denial-of-Service (DoS) attacks due to the shared wireless medium, the lack of physical protection, and instinctive resource constraints. In this paper, we propose a misbehavior-aware threshold detection scheme, called MAD, against energy depletion attack in RPL-based LLNs, where a malicious node intentionally generates and sends a large number of packets to legitimate nodes to excessively consume the energy resource of intermediate nodes located along the forwarding paths, and finally makes the resource-constrained network suffer from denial of service. In the MAD, each node maintains a count of the number of received packets from its child node within a specific time window, and then compares the count with a dynamically calculated threshold to detect potential malicious node. We conduct extensive simulation experiments for performance evaluation and comparison with the original RPL with and without adversary, respectively. The simulation results show that the proposed scheme is a viable approach against energy depletion attack in RPL-based LLNs.
{"title":"Energy Depletion Attack Against Routing Protocol in the Internet of Things","authors":"Cong Pu","doi":"10.1109/CCNC.2019.8651771","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651771","url":null,"abstract":"Low power and lossy networks (LLNs) are undeniably vulnerable to various Denial-of-Service (DoS) attacks due to the shared wireless medium, the lack of physical protection, and instinctive resource constraints. In this paper, we propose a misbehavior-aware threshold detection scheme, called MAD, against energy depletion attack in RPL-based LLNs, where a malicious node intentionally generates and sends a large number of packets to legitimate nodes to excessively consume the energy resource of intermediate nodes located along the forwarding paths, and finally makes the resource-constrained network suffer from denial of service. In the MAD, each node maintains a count of the number of received packets from its child node within a specific time window, and then compares the count with a dynamically calculated threshold to detect potential malicious node. We conduct extensive simulation experiments for performance evaluation and comparison with the original RPL with and without adversary, respectively. The simulation results show that the proposed scheme is a viable approach against energy depletion attack in RPL-based LLNs.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115248494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651856
Maxime Labonne, Alexis Olivereau, Baptiste Polvé, D. Zeghlache
An ensemble learning approach for classification in intrusion detection is proposed. Its application to the KDD Cup 99 and NSL-KDD datasets consistently increases the classification accuracy compared to previous techniques. The cascade-structured meta-specialists architecture is based on a three-step optimization method: data augmentation, hyperparameters optimization and ensemble learning. Classifiers are first created with a strong specialization in each specific class. These specialists are then combined to form meta-specialists, more accurate than the best classifiers that compose them. Finally, meta-specialists are arranged in a cascading architecture where each classifier is successively given the opportunity to recognize its own class. This method is particularly useful for datasets where training and test sets differ greatly, as in this case. The cascade-structured meta-specialists approach achieved a very high classification accuracy (94.44% on KDD Cup 99 test set and 88.39% on NSL-KDD test set) with a low false positive rate (0.33% and 1.94% respectively).
提出了一种集成学习的入侵检测分类方法。与以前的技术相比，它在KDD Cup 99和NSL-KDD数据集上的应用不断提高了分类精度。级联结构的元专家体系结构基于三步优化方法:数据增强、超参数优化和集成学习。首先在每个特定类中使用强专门化创建分类器。然后将这些专家组合成元专家，比组成它们的最佳分类器更准确。最后，元专家被安排在级联体系结构中，其中每个分类器依次有机会识别自己的类。这种方法对于训练集和测试集差异很大的数据集特别有用，就像在这种情况下一样。级联结构元专家方法的分类准确率非常高(KDD Cup 99测试集为94.44%，NSL-KDD测试集为88.39%)，假阳性率较低(分别为0.33%和1.94%)。
{"title":"A Cascade-structured Meta-Specialists Approach for Neural Network-based Intrusion Detection","authors":"Maxime Labonne, Alexis Olivereau, Baptiste Polvé, D. Zeghlache","doi":"10.1109/CCNC.2019.8651856","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651856","url":null,"abstract":"An ensemble learning approach for classification in intrusion detection is proposed. Its application to the KDD Cup 99 and NSL-KDD datasets consistently increases the classification accuracy compared to previous techniques. The cascade-structured meta-specialists architecture is based on a three-step optimization method: data augmentation, hyperparameters optimization and ensemble learning. Classifiers are first created with a strong specialization in each specific class. These specialists are then combined to form meta-specialists, more accurate than the best classifiers that compose them. Finally, meta-specialists are arranged in a cascading architecture where each classifier is successively given the opportunity to recognize its own class. This method is particularly useful for datasets where training and test sets differ greatly, as in this case. The cascade-structured meta-specialists approach achieved a very high classification accuracy (94.44% on KDD Cup 99 test set and 88.39% on NSL-KDD test set) with a low false positive rate (0.33% and 1.94% respectively).","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129781304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651832
C. DeepakG., Alexandros Ladas, C. Politis
The wireless communication is an integral part of the society, however, wireless network infrastructure may not fully function during post-disaster wireless network scenario in which we need wireless services even more than normal circumstances. In such post-disaster scenarios, the base stations (BS) could possibly be dysfunctional or overloaded by an excessive number of user calls or data, whereas user terminals are likely to be partially connected to or fully isolated from the BS radio signals. In this paper, we study the network behavior during the post-disaster when BSs undergo the thinning process due to the damage to the network infrastructure. During network recovery phase, we also study the network performance when new temporary BSs are distributed which will bring the network into BS superposition phase. Furthermore, Device-to-Device (D2D) assisted cellular communication helps to increase the link level network connectivity which is highly appreciated during post- disaster network scenario because the network coverage is more desirable than the network throughout in such cases. We also present the analytical study of D2D and cellular communication and show that it will effectively increase the network coverage which may ultimately save many lives during the golden hours of post-disaster phase.
{"title":"Robust Device-to-Device 5G Cellular Communication in the Post-Disaster Scenario","authors":"C. DeepakG., Alexandros Ladas, C. Politis","doi":"10.1109/CCNC.2019.8651832","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651832","url":null,"abstract":"The wireless communication is an integral part of the society, however, wireless network infrastructure may not fully function during post-disaster wireless network scenario in which we need wireless services even more than normal circumstances. In such post-disaster scenarios, the base stations (BS) could possibly be dysfunctional or overloaded by an excessive number of user calls or data, whereas user terminals are likely to be partially connected to or fully isolated from the BS radio signals. In this paper, we study the network behavior during the post-disaster when BSs undergo the thinning process due to the damage to the network infrastructure. During network recovery phase, we also study the network performance when new temporary BSs are distributed which will bring the network into BS superposition phase. Furthermore, Device-to-Device (D2D) assisted cellular communication helps to increase the link level network connectivity which is highly appreciated during post- disaster network scenario because the network coverage is more desirable than the network throughout in such cases. We also present the analytical study of D2D and cellular communication and show that it will effectively increase the network coverage which may ultimately save many lives during the golden hours of post-disaster phase.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128335089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651826
H. Kurdi, Ghada A. K. Al-Hudhud, M. Al-Dawod, Wafa Al-Shaikh, Lina Altoaimy
Service sharing is an important problem in distributed systems, where it affects wait time and allows for the equal use of services by a group of nodes. Mutual exclusion provides an appropriate sharing technique of a critical section (CS) among nodes by the priority order. The primary condition of mutual exclusion is that one node can only use one CS at any given time. In real life, queues and cashier services have long wait times that do not consider the priority of each node. The work presented in this paper proposed a token-based approach, which is a type of mutual exclusion that is suitable for smart cashier systems. In addition, a Fairness algorithm for priority process (FAPP) is implemented for minimizing wait time, decreasing queue length, and promoting fair CS use. The system performance evaluation based on the experiments performed proves the superiority of the proposed algorithm over the first-in-first-out (FIFO) approach in terms of reducing the waiting time.
{"title":"Service-Sharing Approach Using a Mutual Exclusion Algorithm for Smart Cashier Systems","authors":"H. Kurdi, Ghada A. K. Al-Hudhud, M. Al-Dawod, Wafa Al-Shaikh, Lina Altoaimy","doi":"10.1109/CCNC.2019.8651826","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651826","url":null,"abstract":"Service sharing is an important problem in distributed systems, where it affects wait time and allows for the equal use of services by a group of nodes. Mutual exclusion provides an appropriate sharing technique of a critical section (CS) among nodes by the priority order. The primary condition of mutual exclusion is that one node can only use one CS at any given time. In real life, queues and cashier services have long wait times that do not consider the priority of each node. The work presented in this paper proposed a token-based approach, which is a type of mutual exclusion that is suitable for smart cashier systems. In addition, a Fairness algorithm for priority process (FAPP) is implemented for minimizing wait time, decreasing queue length, and promoting fair CS use. The system performance evaluation based on the experiments performed proves the superiority of the proposed algorithm over the first-in-first-out (FIFO) approach in terms of reducing the waiting time.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127622844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651688
R. Milocco, P. Mühlethaler, S. Boumerdassi
In this work, we use the energy consumed by one bit of information per meter toward the destination as a local metric to be minimized in channels affected by shadow fading. Given a fixed amount of energy available for transmitting information, the proposed strategy consists in maximizing the amount of information delivered within a given time interval by optimizing both the transmission rate and power.
{"title":"Energy-efficient relay selection over fading channels","authors":"R. Milocco, P. Mühlethaler, S. Boumerdassi","doi":"10.1109/CCNC.2019.8651688","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651688","url":null,"abstract":"In this work, we use the energy consumed by one bit of information per meter toward the destination as a local metric to be minimized in channels affected by shadow fading. Given a fixed amount of energy available for transmitting information, the proposed strategy consists in maximizing the amount of information delivered within a given time interval by optimizing both the transmission rate and power.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122009222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651879
Boutheina Dab, N. Aitsaadi, R. Langar
Recently Mobile Edge Computing (MEC) promises a great latency reduction by pushing mobile computing and storage to the network edge. MEC solutions allows the intensive applications to be computed in nearby servers at the edge. In this work, we envision a multi-user WiFi-based MEC architecture. We tackle the problem of joint task assignment and resource allocation. The main objective of our scheme is to minimize the energy consumption on the mobile terminal side under the application latency constraint. Based on extensive simulations conducted in NS3 while considering real input traces, we show that our approach outperforms the related prominent strategies in terms of: i) energy consumption and ii) completion delay.
{"title":"A Novel Joint Offloading and Resource Allocation Scheme for Mobile Edge Computing","authors":"Boutheina Dab, N. Aitsaadi, R. Langar","doi":"10.1109/CCNC.2019.8651879","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651879","url":null,"abstract":"Recently Mobile Edge Computing (MEC) promises a great latency reduction by pushing mobile computing and storage to the network edge. MEC solutions allows the intensive applications to be computed in nearby servers at the edge. In this work, we envision a multi-user WiFi-based MEC architecture. We tackle the problem of joint task assignment and resource allocation. The main objective of our scheme is to minimize the energy consumption on the mobile terminal side under the application latency constraint. Based on extensive simulations conducted in NS3 while considering real input traces, we show that our approach outperforms the related prominent strategies in terms of: i) energy consumption and ii) completion delay.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130292167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651777
Thidarut Junjalearnvong, Ryota Okumura, K. Mizutani, H. Harada
Wireless Smart Utility Network Field Area Network (Wi-SUN FAN) is one of the Wi-SUN profiles that is expected to be adopted by many smart devices in advanced smart city infrastructures to provide Machine-to-Machine (M2M) communication in Low power and Lossy Networks (LLNs). The physical and data link layer of Wi-SUN FAN systems is complied with IEEE 802.15.4-2015 to perform multi-hop data transmission. Currently, the implementation of Wi-SUN FAN devices has been initiated. However, the Wi-SUN FAN devices face a serious problem of very slow network configuration. In this paper, the multi-hop network configuration time of the current Wi-SUN FAN devices is measured by the experiment to analyze the factors that cause the slow configuration. The optimization scheme to accelerate the configuration process is discussed and the instant response configuration scheme that further reduces the configuration time is proposed. In addition, the computer simulation is performed to study the trade-off relationship between the configuration time and the percentage of time used in the configuration process. Finally, the appropriate values of the configuration parameters that can complete the configuration process in each hop within 1 minute while minimally deteriorate the transmission performance in both conventional and proposed configuration schemes are determined.
{"title":"Performance Evaluation of Multi-hop Network Configuration for Wi-SUN FAN Systems","authors":"Thidarut Junjalearnvong, Ryota Okumura, K. Mizutani, H. Harada","doi":"10.1109/CCNC.2019.8651777","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651777","url":null,"abstract":"Wireless Smart Utility Network Field Area Network (Wi-SUN FAN) is one of the Wi-SUN profiles that is expected to be adopted by many smart devices in advanced smart city infrastructures to provide Machine-to-Machine (M2M) communication in Low power and Lossy Networks (LLNs). The physical and data link layer of Wi-SUN FAN systems is complied with IEEE 802.15.4-2015 to perform multi-hop data transmission. Currently, the implementation of Wi-SUN FAN devices has been initiated. However, the Wi-SUN FAN devices face a serious problem of very slow network configuration. In this paper, the multi-hop network configuration time of the current Wi-SUN FAN devices is measured by the experiment to analyze the factors that cause the slow configuration. The optimization scheme to accelerate the configuration process is discussed and the instant response configuration scheme that further reduces the configuration time is proposed. In addition, the computer simulation is performed to study the trade-off relationship between the configuration time and the percentage of time used in the configuration process. Finally, the appropriate values of the configuration parameters that can complete the configuration process in each hop within 1 minute while minimally deteriorate the transmission performance in both conventional and proposed configuration schemes are determined.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130467716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651852
Bruno Donassolo, Ilhem Fajjari, Arnaud Legrand, P. Mertikopoulos
In recent years, Fog computing paradigm has received the attention of academic and industrial communities. By offering nearby computational, storage and network resources, this new architecture deals with the explosion of IoT (Internet of Things) traffic while responding to the stringent requirements of new applications. Unfortunately, as of today, there is a lack of practical solutions to enable the exploitation of this novel paradigm. To deal with this shortcoming, this demo gives an insight into FITOR, our proposed orchestration system for IoT applications in Fog. Our solution makes use of both Grid5000 [1] and FIT/IoT-LAB [2] to build a realistic fog environment. FITOR is responsible for the orchestration of micro-service based IoT applications while making use of a holistic monitoring of the fog infrastructure.
{"title":"Demo: Fog Based Framework for IoT Service Orchestration","authors":"Bruno Donassolo, Ilhem Fajjari, Arnaud Legrand, P. Mertikopoulos","doi":"10.1109/CCNC.2019.8651852","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651852","url":null,"abstract":"In recent years, Fog computing paradigm has received the attention of academic and industrial communities. By offering nearby computational, storage and network resources, this new architecture deals with the explosion of IoT (Internet of Things) traffic while responding to the stringent requirements of new applications. Unfortunately, as of today, there is a lack of practical solutions to enable the exploitation of this novel paradigm. To deal with this shortcoming, this demo gives an insight into FITOR, our proposed orchestration system for IoT applications in Fog. Our solution makes use of both Grid5000 [1] and FIT/IoT-LAB [2] to build a realistic fog environment. FITOR is responsible for the orchestration of micro-service based IoT applications while making use of a holistic monitoring of the fog infrastructure.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130977154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651668
John A. Hodgkiss, S. Djahel, Y. H. Aoul
In this paper we will explore novel ways of utilizing inter-vehicle and vehicle to infrastructure communication technology to achieve a safe and efficient lane change manoeuvre for Connected and Autonomous Vehicles (CAVs). The need for such new protocols is due to the risk that every lane change manoeuvre brings to drivers and passengers lives in addition to its negative impact on congestion level and resulting air pollution, if not performed at the right time and using the appropriate speed. To avoid this risk, we design two new protocols, one is built upon and extends an existing protocol, and it aims to ensure safe and efficient lane change manoeuvre, while the second is an original lane change permission management solution inspired from mutual exclusion concept used in operating systems. This latter complements the former by exclusively granting lane change permissions in a way that avoids any risk of collision. Both protocols are being implemented using computer simulation and the results will be reported in a future work.
{"title":"An Advanced Coordination Protocol for Safer and more Efficient Lane Change for Connected and Autonomous Vehicles","authors":"John A. Hodgkiss, S. Djahel, Y. H. Aoul","doi":"10.1109/CCNC.2019.8651668","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651668","url":null,"abstract":"In this paper we will explore novel ways of utilizing inter-vehicle and vehicle to infrastructure communication technology to achieve a safe and efficient lane change manoeuvre for Connected and Autonomous Vehicles (CAVs). The need for such new protocols is due to the risk that every lane change manoeuvre brings to drivers and passengers lives in addition to its negative impact on congestion level and resulting air pollution, if not performed at the right time and using the appropriate speed. To avoid this risk, we design two new protocols, one is built upon and extends an existing protocol, and it aims to ensure safe and efficient lane change manoeuvre, while the second is an original lane change permission management solution inspired from mutual exclusion concept used in operating systems. This latter complements the former by exclusively granting lane change permissions in a way that avoids any risk of collision. Both protocols are being implemented using computer simulation and the results will be reported in a future work.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124285168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651741
Taichi Miya, Kohta Ohshima, Yoshiaki Kitaguchi, K. Yamaoka
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.
{"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":"https://doi.org/10.1109/CCNC.2019.8651741","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.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115057484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：