Pub Date : 2021-06-01DOI: 10.1109/ICCWorkshops50388.2021.9473558
Jingsong Li, Junhua Tang, Jianhua Li, Futai Zou
Driven by the development of communication and computing technologies, the intelligent Internet of Vehicles (IoV) has attracted much attention in recent years. Specifically, integration of communication, computing, caching, and AI at the network edge has become a key to realizing various exciting IoV applications. However, the dynamic nature of IoV imposes great challenges on the successful realization of integrated edge services. In this paper, we first propose an Information-Centric Networking (ICN)-based framework to accommodate both computing and content service requests in IoV. Next, considering the fact that making use of the popularity of the service requests and the caching of computing results may greatly improve the efficiency of the edge service, we propose an innovative algorithm based on deep Q-learning to learn the popularity of service requests and make joint computing and caching decisions accordingly. Simulation results show that the pro-posed algorithm can improve the satisfied request ratio by environment learning and data reuse.
{"title":"Deep Reinforcement Learning for Intelligent Computing and Content Edge Service in ICN-based IoV","authors":"Jingsong Li, Junhua Tang, Jianhua Li, Futai Zou","doi":"10.1109/ICCWorkshops50388.2021.9473558","DOIUrl":"https://doi.org/10.1109/ICCWorkshops50388.2021.9473558","url":null,"abstract":"Driven by the development of communication and computing technologies, the intelligent Internet of Vehicles (IoV) has attracted much attention in recent years. Specifically, integration of communication, computing, caching, and AI at the network edge has become a key to realizing various exciting IoV applications. However, the dynamic nature of IoV imposes great challenges on the successful realization of integrated edge services. In this paper, we first propose an Information-Centric Networking (ICN)-based framework to accommodate both computing and content service requests in IoV. Next, considering the fact that making use of the popularity of the service requests and the caching of computing results may greatly improve the efficiency of the edge service, we propose an innovative algorithm based on deep Q-learning to learn the popularity of service requests and make joint computing and caching decisions accordingly. Simulation results show that the pro-posed algorithm can improve the satisfied request ratio by environment learning and data reuse.","PeriodicalId":127186,"journal":{"name":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122195111","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 : 2021-06-01DOI: 10.1109/ICCWorkshops50388.2021.9473823
Yun Zhong, Wenbo Guo, Hongzhi Zhao, Youxi Tang
In physical layer secure communications, time synchronization is crucial to cooperative jamming cancellation. However, perfect time synchronization is unrealistic due to inevitable synchronization error in practical communication systems. Consequently, researchers have done some research on the above problem. Unfortunately, the impact of cooperative jamming wave shaping is neglected. In this paper, taking account of transmission signals with raised cosine-rolloff filter, performance of cooperative jamming cancellation with timing errors is studied. By infinite series expansion, an exact analytical expression of the cooperative-jamming-cancellation ratio (CJCR) is derived, which evaluates the performance of the cooperative jamming cancellation. Furthermore, impact of the normalized time synchronization error and the rolloff factor on CJCR is studied. Simulation results show that the normalized time synchronization error of 0.1 causes a loss of 42dB in CJCR, with the ideal received cooperative-jamming-to-noise ratio of 60dB and the rolloff factor of 0.5. Besides, the communication system with a lower rolloff factor and a higher cooperative jamming power is more sensitive to time synchronization error.
{"title":"Cooperative Jamming Cancellation Analysis Based on RC Shaping Filter in Physical Layer Security","authors":"Yun Zhong, Wenbo Guo, Hongzhi Zhao, Youxi Tang","doi":"10.1109/ICCWorkshops50388.2021.9473823","DOIUrl":"https://doi.org/10.1109/ICCWorkshops50388.2021.9473823","url":null,"abstract":"In physical layer secure communications, time synchronization is crucial to cooperative jamming cancellation. However, perfect time synchronization is unrealistic due to inevitable synchronization error in practical communication systems. Consequently, researchers have done some research on the above problem. Unfortunately, the impact of cooperative jamming wave shaping is neglected. In this paper, taking account of transmission signals with raised cosine-rolloff filter, performance of cooperative jamming cancellation with timing errors is studied. By infinite series expansion, an exact analytical expression of the cooperative-jamming-cancellation ratio (CJCR) is derived, which evaluates the performance of the cooperative jamming cancellation. Furthermore, impact of the normalized time synchronization error and the rolloff factor on CJCR is studied. Simulation results show that the normalized time synchronization error of 0.1 causes a loss of 42dB in CJCR, with the ideal received cooperative-jamming-to-noise ratio of 60dB and the rolloff factor of 0.5. Besides, the communication system with a lower rolloff factor and a higher cooperative jamming power is more sensitive to time synchronization error.","PeriodicalId":127186,"journal":{"name":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116840535","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 : 2021-06-01DOI: 10.1109/ICCWorkshops50388.2021.9473815
Haipeng Wang, Zhipeng Lin, Kun Guo, Tiejun Lv
As a new technology in the fifth generation (5G) mobile networks, mobile edge computing (MEC) can reduce network computations and shorten task-processing delay by offloading the tasks to nearby vehicles with idle resources. However, such technology needs more vehicles to participate in task processing, increasing the network computations. In this paper, we propose a MEC-assisted vehicular network where vehicles can offload their tasks via vehicle-to-vehicle (V2V) or vehicle-to-infrastructure (V2I) links. The vehicles in the same links will interfere with each other during offloading tasks, which affects energy consumption and delay. To minimize the network computation overhead and extend the battery lifetime of the vehicles, task offloading decision-making is optimized in this paper. We investigate the problem of MEC computation offloading in the vehicular networks and propose a game-based computation offloading (GBCO) algorithm and an optimal offloading (OO) algorithm. We demonstrate that the proposed algorithms can achieve the Nash equilibrium (NE) and converge after the finite improvement property (FIP). Simulation results show that the proposed GBCO algorithm can increase the convergence rate and the proposed OO algorithm can reduce the energy consumption.
{"title":"Energy and Delay Minimization Based on Game Theory in MEC-Assisted Vehicular Networks","authors":"Haipeng Wang, Zhipeng Lin, Kun Guo, Tiejun Lv","doi":"10.1109/ICCWorkshops50388.2021.9473815","DOIUrl":"https://doi.org/10.1109/ICCWorkshops50388.2021.9473815","url":null,"abstract":"As a new technology in the fifth generation (5G) mobile networks, mobile edge computing (MEC) can reduce network computations and shorten task-processing delay by offloading the tasks to nearby vehicles with idle resources. However, such technology needs more vehicles to participate in task processing, increasing the network computations. In this paper, we propose a MEC-assisted vehicular network where vehicles can offload their tasks via vehicle-to-vehicle (V2V) or vehicle-to-infrastructure (V2I) links. The vehicles in the same links will interfere with each other during offloading tasks, which affects energy consumption and delay. To minimize the network computation overhead and extend the battery lifetime of the vehicles, task offloading decision-making is optimized in this paper. We investigate the problem of MEC computation offloading in the vehicular networks and propose a game-based computation offloading (GBCO) algorithm and an optimal offloading (OO) algorithm. We demonstrate that the proposed algorithms can achieve the Nash equilibrium (NE) and converge after the finite improvement property (FIP). Simulation results show that the proposed GBCO algorithm can increase the convergence rate and the proposed OO algorithm can reduce the energy consumption.","PeriodicalId":127186,"journal":{"name":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128799872","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 : 2021-06-01DOI: 10.1109/ICCWorkshops50388.2021.9473600
S. Abu-Surra, Won-Chul Choi, Sung Tae Choi, E. Seok, Dongjoo Kim, N. Sharma, Siddharth Advani, Vitali Loseu, Kitaek Bae, Ilju Na, A. Farid, M. Rodwell, Gary Xu, Jianzhong Zhang
It is projected that mobile traffic will increase by 80x by year 2030. To meet this increase in demand, it is inevitable to utilize the terahertz bands (0.1 THz to 10 THz) for future 6G wireless systems. However, operating at such high frequency comes with several fundamental and technical challenges. In this work, we present a proof-of-concept system to demonstrate the feasibility of establishing a communication link at 140 GHz carrier frequency. In addition, this work highlights techniques to tackle the challenges that comes with operating in the terahertz regime. To the authors knowledge, this is the world’s first end-to-end system with up to 16-channel digitally-beamformed 140 GHz system and dynamic beam steering capability. The paper presents lab results which demonstrate link throughput of 6 Gbps at 15-meter distance with adaptive beamforming.
{"title":"End-to-end 140 GHz Wireless Link Demonstration with Fully-Digital Beamformed System","authors":"S. Abu-Surra, Won-Chul Choi, Sung Tae Choi, E. Seok, Dongjoo Kim, N. Sharma, Siddharth Advani, Vitali Loseu, Kitaek Bae, Ilju Na, A. Farid, M. Rodwell, Gary Xu, Jianzhong Zhang","doi":"10.1109/ICCWorkshops50388.2021.9473600","DOIUrl":"https://doi.org/10.1109/ICCWorkshops50388.2021.9473600","url":null,"abstract":"It is projected that mobile traffic will increase by 80x by year 2030. To meet this increase in demand, it is inevitable to utilize the terahertz bands (0.1 THz to 10 THz) for future 6G wireless systems. However, operating at such high frequency comes with several fundamental and technical challenges. In this work, we present a proof-of-concept system to demonstrate the feasibility of establishing a communication link at 140 GHz carrier frequency. In addition, this work highlights techniques to tackle the challenges that comes with operating in the terahertz regime. To the authors knowledge, this is the world’s first end-to-end system with up to 16-channel digitally-beamformed 140 GHz system and dynamic beam steering capability. The paper presents lab results which demonstrate link throughput of 6 Gbps at 15-meter distance with adaptive beamforming.","PeriodicalId":127186,"journal":{"name":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128344138","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 : 2021-06-01DOI: 10.1109/ICCWorkshops50388.2021.9473528
Wen-Jing Wang, K. Xu, Li Zhen, Keping Yu, A. Bashir, S. Garg
In this paper, we develop a time allocation strategy that enhances transmission efficiency of small-size Internet of Mobile Things (IoMT) devices by relaying the information backscattered from user. The system works in a slotted fashion, where each transmission slot is divided into two phases. Specifically, in phase one, user backscatters downlink signals from power beacon (PB) and relay harvests the radio frequency (RF) energy from signal backscattered by user and that transmitted by PB. In phase two, relay forwards the decoded information to destination with harvested RF energy. We formulate the optimization problem and develop an optimal time allocation strategy maximizing throughput considering adaptively adjusted backscattering coefficient and battery capacity constraint at relay. We investigate the effect of transmit power and relay location on the throughput for infinite/finite battery capacity scenario, respectively. Numerical results verify that the proposed time allocation strategy outperforms that with fixed backscattering coefficient.
{"title":"Throughput Maximization for Energy Harvesting based Relay Cooperative Backscattering Transmission","authors":"Wen-Jing Wang, K. Xu, Li Zhen, Keping Yu, A. Bashir, S. Garg","doi":"10.1109/ICCWorkshops50388.2021.9473528","DOIUrl":"https://doi.org/10.1109/ICCWorkshops50388.2021.9473528","url":null,"abstract":"In this paper, we develop a time allocation strategy that enhances transmission efficiency of small-size Internet of Mobile Things (IoMT) devices by relaying the information backscattered from user. The system works in a slotted fashion, where each transmission slot is divided into two phases. Specifically, in phase one, user backscatters downlink signals from power beacon (PB) and relay harvests the radio frequency (RF) energy from signal backscattered by user and that transmitted by PB. In phase two, relay forwards the decoded information to destination with harvested RF energy. We formulate the optimization problem and develop an optimal time allocation strategy maximizing throughput considering adaptively adjusted backscattering coefficient and battery capacity constraint at relay. We investigate the effect of transmit power and relay location on the throughput for infinite/finite battery capacity scenario, respectively. Numerical results verify that the proposed time allocation strategy outperforms that with fixed backscattering coefficient.","PeriodicalId":127186,"journal":{"name":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123648823","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 : 2021-06-01DOI: 10.1109/ICCWorkshops50388.2021.9473580
Ons Aouedi, Kandaraj Piamrat, B. Parrein
The rapid development of smart devices triggers a surge in new traffic and applications. Thus, network traffic classification has become a challenge in modern communications and may be applied to a various range of applications ranging from QoS provisioning to security-related applications. Developing Machine Learning (ML) methods, which can successfully distinguish network applications from each other, is one of the most important tasks. Since ML algorithms are as good as the quality of data, feature selection has become a crucial step in the ML process. Therefore, selecting effective and relevant features for traffic analysis is also another essential issue. In this paper, we are interested in identifying the most relevant features to characterize network traffic. Empirical results indicate that significant input feature selection is important to classify network traffic. Then, a comparative analysis of various Decision Tree-based models (both traditional and recent algorithms) has been conducted with feature selection methods in terms of accuracy, training, and classification time.
{"title":"Performance evaluation of feature selection and tree-based algorithms for traffic classification","authors":"Ons Aouedi, Kandaraj Piamrat, B. Parrein","doi":"10.1109/ICCWorkshops50388.2021.9473580","DOIUrl":"https://doi.org/10.1109/ICCWorkshops50388.2021.9473580","url":null,"abstract":"The rapid development of smart devices triggers a surge in new traffic and applications. Thus, network traffic classification has become a challenge in modern communications and may be applied to a various range of applications ranging from QoS provisioning to security-related applications. Developing Machine Learning (ML) methods, which can successfully distinguish network applications from each other, is one of the most important tasks. Since ML algorithms are as good as the quality of data, feature selection has become a crucial step in the ML process. Therefore, selecting effective and relevant features for traffic analysis is also another essential issue. In this paper, we are interested in identifying the most relevant features to characterize network traffic. Empirical results indicate that significant input feature selection is important to classify network traffic. Then, a comparative analysis of various Decision Tree-based models (both traditional and recent algorithms) has been conducted with feature selection methods in terms of accuracy, training, and classification time.","PeriodicalId":127186,"journal":{"name":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124503856","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 : 2021-06-01DOI: 10.1109/ICCWorkshops50388.2021.9473664
Nasim Ferdosian, S. Skaperas, A. Chorti, L. Mamatas
5G new radio (NR) introduced flexible numerology to accommodate applications with varying quality of service (QoS) requirements. However, optimizing the scheduling of services with varying delay and throughput QoS constraints remains a challenging task. Under existing proposals, supporting ultra-reliable low-latency communication (URLLC) services comes at the cost of reduced throughput offered to enhanced mobile broadband (eMBB) users. In this paper, we propose an efficient, low complexity scheduling of radio resources for URLLC when coexisting with eMBB services. We re-formulate the standard eMBB throughput maximization problem as an equivalent conflict minimization with URLLC and prove that this equivalent objective can be treated as a Bin Packing optimization problem. Moreover, in order to further increase the efficiency of resource utilization, non-orthogonal multiple access (NOMA) is also investigated for URLLC and eMBB coexistence. The superior performance of NOMA, with the superposition of services over the same resource blocks, is due to alleviating conflicts, as shown by an extensive set of numerical results.
{"title":"Conflict-Aware Multi-Numerology Radio Resource Allocation for Heterogeneous Services","authors":"Nasim Ferdosian, S. Skaperas, A. Chorti, L. Mamatas","doi":"10.1109/ICCWorkshops50388.2021.9473664","DOIUrl":"https://doi.org/10.1109/ICCWorkshops50388.2021.9473664","url":null,"abstract":"5G new radio (NR) introduced flexible numerology to accommodate applications with varying quality of service (QoS) requirements. However, optimizing the scheduling of services with varying delay and throughput QoS constraints remains a challenging task. Under existing proposals, supporting ultra-reliable low-latency communication (URLLC) services comes at the cost of reduced throughput offered to enhanced mobile broadband (eMBB) users. In this paper, we propose an efficient, low complexity scheduling of radio resources for URLLC when coexisting with eMBB services. We re-formulate the standard eMBB throughput maximization problem as an equivalent conflict minimization with URLLC and prove that this equivalent objective can be treated as a Bin Packing optimization problem. Moreover, in order to further increase the efficiency of resource utilization, non-orthogonal multiple access (NOMA) is also investigated for URLLC and eMBB coexistence. The superior performance of NOMA, with the superposition of services over the same resource blocks, is due to alleviating conflicts, as shown by an extensive set of numerical results.","PeriodicalId":127186,"journal":{"name":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128025043","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 : 2021-06-01DOI: 10.1109/ICCWorkshops50388.2021.9473692
M. W. Akhtar, S. Hassan, Haejoon Jung, H. Pervaiz
As the number of mobile devices grows exponentially, it is critical to design a robust access scheme that can handle a large number of devices with low latency. Non-orthogonal multiple access (NOMA) is an effective approach to meet such requirements that can provide higher spectral efficiency. As an extended version, cooperative NOMA has been introduced, where the users with higher channel gains forward signals for users with weak channel gains as cooperators. The conventional cooperative NOMA (CCN) technique can provide diversity gains, which can be used to improve reliability. However, in CCN, the overhead caused by successive interference cancellations (SIC) at each user may become significant, when there exist a massive number of users, which eventually degrades the performance of NOMA considering the power and computational resource limitations of mobile devices. As an alternative, the space-time block-coded NOMA (STBC-NOMA) has been proposed to achieve diversity gain with lower SIC overhead compared to CCN. To better evaluate it, in this paper, we investigate the impact of imperfect channel state information (ipCSI), which is more realistic in real-time processing. We dervie the closed-form expression of the outage probability of STBC-NOMA with ipCSI and compare its performance with CCN and conventional NOMA.
{"title":"On the Performance of Alamouti-Coded Cooperative NOMA with Imperfect Channel State Information","authors":"M. W. Akhtar, S. Hassan, Haejoon Jung, H. Pervaiz","doi":"10.1109/ICCWorkshops50388.2021.9473692","DOIUrl":"https://doi.org/10.1109/ICCWorkshops50388.2021.9473692","url":null,"abstract":"As the number of mobile devices grows exponentially, it is critical to design a robust access scheme that can handle a large number of devices with low latency. Non-orthogonal multiple access (NOMA) is an effective approach to meet such requirements that can provide higher spectral efficiency. As an extended version, cooperative NOMA has been introduced, where the users with higher channel gains forward signals for users with weak channel gains as cooperators. The conventional cooperative NOMA (CCN) technique can provide diversity gains, which can be used to improve reliability. However, in CCN, the overhead caused by successive interference cancellations (SIC) at each user may become significant, when there exist a massive number of users, which eventually degrades the performance of NOMA considering the power and computational resource limitations of mobile devices. As an alternative, the space-time block-coded NOMA (STBC-NOMA) has been proposed to achieve diversity gain with lower SIC overhead compared to CCN. To better evaluate it, in this paper, we investigate the impact of imperfect channel state information (ipCSI), which is more realistic in real-time processing. We dervie the closed-form expression of the outage probability of STBC-NOMA with ipCSI and compare its performance with CCN and conventional NOMA.","PeriodicalId":127186,"journal":{"name":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125662938","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 : 2021-06-01DOI: 10.1109/ICCWorkshops50388.2021.9473511
Y. Nakayama, D. Hisano
Ultra-low latency (ULL) data transmission is essential for many network applications. The IEEE 802.1Qbv Time-Aware Shaper (TAS) is a typical mechanism for providing ULL data transmission in bridged networks. All TAS enabled nodes must be time-synchronized and their gate time schedule in the gate control list (GCL) must be pre-configured considering the data arrival time and the maximum burst size. Consequently, the bandwidth utilization is drastically deteriorated if the data size becomes small, because no data can be forwarded until the state of the gate changes. Although the underutilization of link bandwidth can be addressed with gate shrunk (GS-)TAS which enables runtime reconfiguration of the GCL using a GS-frame at the end of an express traffic. However, the states of gates cannot be appropriately controlled with the existing scheme if there are many express streams. To address this issue, this paper proposes a concept of multi-stream gate control for TAS. The proposed idea enables runtime reconfiguration of the GCL to avoid the reduction in bandwidth utilization irrespective of the burst size and the number of streams. The performance of the proposed scheme was confirmed with computer simulations.
{"title":"Multi-Stream Gate Control of Time Aware Shaper for High Link Utilization","authors":"Y. Nakayama, D. Hisano","doi":"10.1109/ICCWorkshops50388.2021.9473511","DOIUrl":"https://doi.org/10.1109/ICCWorkshops50388.2021.9473511","url":null,"abstract":"Ultra-low latency (ULL) data transmission is essential for many network applications. The IEEE 802.1Qbv Time-Aware Shaper (TAS) is a typical mechanism for providing ULL data transmission in bridged networks. All TAS enabled nodes must be time-synchronized and their gate time schedule in the gate control list (GCL) must be pre-configured considering the data arrival time and the maximum burst size. Consequently, the bandwidth utilization is drastically deteriorated if the data size becomes small, because no data can be forwarded until the state of the gate changes. Although the underutilization of link bandwidth can be addressed with gate shrunk (GS-)TAS which enables runtime reconfiguration of the GCL using a GS-frame at the end of an express traffic. However, the states of gates cannot be appropriately controlled with the existing scheme if there are many express streams. To address this issue, this paper proposes a concept of multi-stream gate control for TAS. The proposed idea enables runtime reconfiguration of the GCL to avoid the reduction in bandwidth utilization irrespective of the burst size and the number of streams. The performance of the proposed scheme was confirmed with computer simulations.","PeriodicalId":127186,"journal":{"name":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125678895","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 : 2021-06-01DOI: 10.1109/ICCWorkshops50388.2021.9473566
Naveed A. Abbasi, Jorge Gómez-Ponce, Daoud Burghal, Revanth Kondaveti, S. Abu-Surra, Gary Xu, C. Zhang, A. Molisch
The large swaths of bandwidth available in the THz band (0.1-10 THz) make it an ideal candidate to meet the ever-increasing data rate demands for upcoming applications. However, detailed channel sounding measurements are required before an eventual deployment of THz band communication can be considered. Keeping this goal in mind, in the current paper we present double-directional channel measurements in the 140-141 GHz range in an urban environment on a linear route for distances up to 15 m. Using our results, we analyze how key channel parameters change as we move from short to longer distances. These measurements allow us to take another step towards creation of detailed THz channel models.
{"title":"Double-Directional Channel Measurements for Urban THz Communications on a Linear Route","authors":"Naveed A. Abbasi, Jorge Gómez-Ponce, Daoud Burghal, Revanth Kondaveti, S. Abu-Surra, Gary Xu, C. Zhang, A. Molisch","doi":"10.1109/ICCWorkshops50388.2021.9473566","DOIUrl":"https://doi.org/10.1109/ICCWorkshops50388.2021.9473566","url":null,"abstract":"The large swaths of bandwidth available in the THz band (0.1-10 THz) make it an ideal candidate to meet the ever-increasing data rate demands for upcoming applications. However, detailed channel sounding measurements are required before an eventual deployment of THz band communication can be considered. Keeping this goal in mind, in the current paper we present double-directional channel measurements in the 140-141 GHz range in an urban environment on a linear route for distances up to 15 m. Using our results, we analyze how key channel parameters change as we move from short to longer distances. These measurements allow us to take another step towards creation of detailed THz channel models.","PeriodicalId":127186,"journal":{"name":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125761669","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
扫码关注我们
求助内容：
应助结果提醒方式：