首页 > 最新文献

2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)最新文献

英文 中文
Trust Management Model of VANETs Based on Machine Learning and Active Detection Technology 基于机器学习和主动检测技术的VANETs信任管理模型
Pub Date : 2022-08-11 DOI: 10.1109/ICCCWorkshops55477.2022.9896700
Fanwei Huang, Qiuping Li, Junhui Zhao
With the continuous development of vehicular ad hoc networks (VANETs), it brings great traffic convenience. How-ever, it is still a difficult problem for malicious vehicles to spread false news. In order to ensure the reliability of the message, an effective trust management model must be established, so that malicious vehicles can be detected and false information can be identified in the vehicle ad hoc network in time. This paper presents a trust management model based on machine learning and active detection technology, which evaluates the trust of vehicles and events to ensure the credibility of communication. Through the active detection mechanism, vehicles can detect the indirect trust of their neighbors, which improves the filtering speed of malicious nodes. Bayesian classifier can judge whether a vehicle is a malicious node by the state information of the vehicle, and can limit the behavior of the malicious vehicle at the first time. The simulation results show that our scheme can obviously restrict malicious vehicles.
随着车载自组织网络(VANETs)的不断发展,给交通带来了极大的便利。然而,恶意车辆传播虚假新闻仍然是一个难题。为了保证消息的可靠性,必须建立有效的信任管理模型,以便在车辆自组网中及时检测出恶意车辆,识别出虚假信息。本文提出了一种基于机器学习和主动检测技术的信任管理模型,该模型对车辆和事件的信任进行评估,以保证通信的可信性。通过主动检测机制,车辆可以检测到邻居的间接信任,提高了恶意节点的过滤速度。贝叶斯分类器可以根据车辆的状态信息判断车辆是否为恶意节点,并在第一时间限制恶意车辆的行为。仿真结果表明,该方案能够明显地抑制恶意车辆。
{"title":"Trust Management Model of VANETs Based on Machine Learning and Active Detection Technology","authors":"Fanwei Huang, Qiuping Li, Junhui Zhao","doi":"10.1109/ICCCWorkshops55477.2022.9896700","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896700","url":null,"abstract":"With the continuous development of vehicular ad hoc networks (VANETs), it brings great traffic convenience. How-ever, it is still a difficult problem for malicious vehicles to spread false news. In order to ensure the reliability of the message, an effective trust management model must be established, so that malicious vehicles can be detected and false information can be identified in the vehicle ad hoc network in time. This paper presents a trust management model based on machine learning and active detection technology, which evaluates the trust of vehicles and events to ensure the credibility of communication. Through the active detection mechanism, vehicles can detect the indirect trust of their neighbors, which improves the filtering speed of malicious nodes. Bayesian classifier can judge whether a vehicle is a malicious node by the state information of the vehicle, and can limit the behavior of the malicious vehicle at the first time. The simulation results show that our scheme can obviously restrict malicious vehicles.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124786958","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}
引用次数: 2
A Spatially Coupled PAC Coding Scheme and Its List Decoding 一种空间耦合PAC编码方案及其列表解码
Pub Date : 2022-08-11 DOI: 10.1109/ICCCWorkshops55477.2022.9896664
Siyu Ying, Shan Jin, Zhaoyang Zhang
In order to promote the reliability and efficiency of transport block (TB)-based transmission, we propose a new class of spatially coupled Polarization-Adjusted Convolutional (PAC) coding scheme in this paper. In the proposed scheme, several consecutive code blocks (CBs) in each TB are coupled by the register states at the end of the encoding of each CB, and a depth-first successive-cancellation list (SCL)-based decoder is used for decoding. The proposed spatially coupled PAC codes introduce little coding complexity at the encoding side, and the coupling procedure is able to significantly mitigate the TB error rate (TBER), which are validated by extensive simulation results.
为了提高基于传输块(TB)的传输的可靠性和效率,本文提出了一类新的空间耦合极化调整卷积(PAC)编码方案。在该方案中,每个TB中的几个连续码块(CB)通过每个CB编码结束时的寄存器状态耦合,并使用基于深度优先的连续取消列表(SCL)解码器进行解码。本文提出的空间耦合PAC码在编码端引入了很小的编码复杂度,并且耦合过程能够显著降低TB错误率(TBER),大量的仿真结果验证了这一点。
{"title":"A Spatially Coupled PAC Coding Scheme and Its List Decoding","authors":"Siyu Ying, Shan Jin, Zhaoyang Zhang","doi":"10.1109/ICCCWorkshops55477.2022.9896664","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896664","url":null,"abstract":"In order to promote the reliability and efficiency of transport block (TB)-based transmission, we propose a new class of spatially coupled Polarization-Adjusted Convolutional (PAC) coding scheme in this paper. In the proposed scheme, several consecutive code blocks (CBs) in each TB are coupled by the register states at the end of the encoding of each CB, and a depth-first successive-cancellation list (SCL)-based decoder is used for decoding. The proposed spatially coupled PAC codes introduce little coding complexity at the encoding side, and the coupling procedure is able to significantly mitigate the TB error rate (TBER), which are validated by extensive simulation results.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126986360","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}
引用次数: 0
Robust ISAC Signal Processing on Unlicensed Spectrum Bands 非授权频段上的稳健ISAC信号处理
Pub Date : 2022-08-11 DOI: 10.1109/ICCCWorkshops55477.2022.9896701
Zhiqing Wei, Hanyang Qu, Liang Ma, Chengkang Pan
The integrated sensing and communication (ISAC) technology is regarded as a potential key technology in the future mobile communication systems. In order to make full use of spectrum resources, mobile communication systems work not only in continuous frequency band but also in non-continuous frequency band. The orthogonal frequency division multiplex (OFDM) signal working in non-continuous frequency band is called non-continuous OFDM (NC-OFDM). In order to enhance the anti-noise performance of ISAC signal based on NC-OFDM, an improved signal processing algorithm is proposed according to the communication signaling. Finally, the feasibility of the proposed algorithm is verified by simulation. Compared with traditional signal processing algorithms, the proposed algorithm has better anti-noise performance in non-continuous spectrum.
集成传感与通信(ISAC)技术被认为是未来移动通信系统中潜在的关键技术。为了充分利用频谱资源,移动通信系统不仅可以工作在连续频带,还可以工作在非连续频带。工作在非连续频带的正交频分复用(OFDM)信号被称为非连续OFDM (NC-OFDM)。为了提高基于NC-OFDM的ISAC信号的抗噪声性能,根据通信信令提出了一种改进的信号处理算法。最后,通过仿真验证了该算法的可行性。与传统的信号处理算法相比,该算法在非连续频谱中具有更好的抗噪声性能。
{"title":"Robust ISAC Signal Processing on Unlicensed Spectrum Bands","authors":"Zhiqing Wei, Hanyang Qu, Liang Ma, Chengkang Pan","doi":"10.1109/ICCCWorkshops55477.2022.9896701","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896701","url":null,"abstract":"The integrated sensing and communication (ISAC) technology is regarded as a potential key technology in the future mobile communication systems. In order to make full use of spectrum resources, mobile communication systems work not only in continuous frequency band but also in non-continuous frequency band. The orthogonal frequency division multiplex (OFDM) signal working in non-continuous frequency band is called non-continuous OFDM (NC-OFDM). In order to enhance the anti-noise performance of ISAC signal based on NC-OFDM, an improved signal processing algorithm is proposed according to the communication signaling. Finally, the feasibility of the proposed algorithm is verified by simulation. Compared with traditional signal processing algorithms, the proposed algorithm has better anti-noise performance in non-continuous spectrum.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129032598","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}
引用次数: 1
Key Issue Analysis on 5G Inter-networks Roaming 5G网际漫游关键问题分析
Pub Date : 2022-08-11 DOI: 10.1109/ICCCWorkshops55477.2022.9896675
Haoquan Liang, Zhenhua Lv, Xuexin Li, Chunsheng Du, Qingyang Wang, Minqing Wu
There is an increasing demand for cost-effective deployment of 5G network during radically generational change. Various solutions are proposed to address co-construction and network sharing issues, including an emerging technology of 5G inter-networks roaming. In this paper, new business scenarios are specially clarified in comparison with international roaming with respect to scope of application, service experience and commercial secret protection. Furthermore, five key issues concerning 5G inter-networks roaming are examined and corresponding solutions are introduced to settle problems that may arise. To address service experience problems in bidirectional mobility scenarios between a non-roaming area and a roaming area, data and voice service continuity solutions with inter-networks N14 and N26 interfaces enabled are proposed. Besides, problems of emergency call compatibility are proposed to be resolved by switching to common call procedure with adaptation of UE and 5GC emergency capabilities. Finally, optimization of signaling procedure with enhanced transformation feature on SEPP and a novel Number Masking Function are collectively proposed to conceal operators' sensitive information including IP address, port number, FQDN and GPSI number.
在急剧的代际变化中,对成本效益高的5G网络部署的需求越来越大。提出了多种解决方案,以解决共建和网络共享问题,包括5G网络间漫游的新兴技术。本文特别从适用范围、服务体验、商业秘密保护等方面与国际漫游进行了对比,阐明了新的业务场景。此外,研究了5G网际漫游的五个关键问题,并介绍了相应的解决方案,以解决可能出现的问题。针对非漫游区域与漫游区域双向移动场景下的业务体验问题,提出了启用N14和N26跨网接口的数据和语音业务连续性解决方案。同时,提出通过适配UE和5GC应急能力,切换到通用呼叫流程来解决紧急呼叫兼容性问题。最后,提出了基于SEPP的增强变换特征的信令过程优化和一种新的数字掩蔽函数,以隐藏运营商的IP地址、端口号、FQDN和GPSI号等敏感信息。
{"title":"Key Issue Analysis on 5G Inter-networks Roaming","authors":"Haoquan Liang, Zhenhua Lv, Xuexin Li, Chunsheng Du, Qingyang Wang, Minqing Wu","doi":"10.1109/ICCCWorkshops55477.2022.9896675","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896675","url":null,"abstract":"There is an increasing demand for cost-effective deployment of 5G network during radically generational change. Various solutions are proposed to address co-construction and network sharing issues, including an emerging technology of 5G inter-networks roaming. In this paper, new business scenarios are specially clarified in comparison with international roaming with respect to scope of application, service experience and commercial secret protection. Furthermore, five key issues concerning 5G inter-networks roaming are examined and corresponding solutions are introduced to settle problems that may arise. To address service experience problems in bidirectional mobility scenarios between a non-roaming area and a roaming area, data and voice service continuity solutions with inter-networks N14 and N26 interfaces enabled are proposed. Besides, problems of emergency call compatibility are proposed to be resolved by switching to common call procedure with adaptation of UE and 5GC emergency capabilities. Finally, optimization of signaling procedure with enhanced transformation feature on SEPP and a novel Number Masking Function are collectively proposed to conceal operators' sensitive information including IP address, port number, FQDN and GPSI number.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121751732","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}
引用次数: 1
Beam Weights Optimization Based on Reinforcement Learning for 6G 基于强化学习的6G梁权重优化
Pub Date : 2022-08-11 DOI: 10.1109/ICCCWorkshops55477.2022.9896688
Jinbo Zhao, Bin Zhang, Shiyuan Chang, Yihui Wang, Li Chen
With the continuous evolution of wireless radio access network architecture, artificial intelligence (AI) plays an increasingly significant role in network optimization. Native-AI will realize fast and accurate optimization, real-time policy adjustment and trend prediction in future 6G systems. To cope with the increasing user density and complex wireless environment, beam weights optimization becomes one of the key factors to promote the communication capacity, coverage and anti-interference ability. In this paper, we build an intelligent network model based on the reinforcement learning (RL) algorithm and optimize the beam pattern in a real typical scenario that contains both roads and buildings. A field test is conducted to investigate the potential impacts of the intelligent algorithm on network optimization. The data used in the field test are real measurement reports from UEs, which imply the location information and the uneven distribution of UEs. The coverage performance and received signal quality are significantly improved after optimization. We also analyze the limitations of AI in the current 5G systems and discuss the future work on native-AI and RL.
随着无线接入网架构的不断演进,人工智能在网络优化中发挥着越来越重要的作用。Native-AI将在未来6G系统中实现快速准确的优化、实时的策略调整和趋势预测。为了应对日益增长的用户密度和复杂的无线环境,波束权重优化成为提升通信容量、覆盖范围和抗干扰能力的关键因素之一。在本文中,我们建立了一个基于强化学习(RL)算法的智能网络模型,并在包含道路和建筑物的真实典型场景中对梁模式进行了优化。通过现场测试,研究了该智能算法对网络优化的潜在影响。现场测试使用的数据是ue的真实测量报告,包含ue的位置信息和不均匀分布。优化后的信号覆盖性能和接收信号质量均有明显提高。我们还分析了人工智能在当前5G系统中的局限性,并讨论了未来在原生人工智能和强化学习方面的工作。
{"title":"Beam Weights Optimization Based on Reinforcement Learning for 6G","authors":"Jinbo Zhao, Bin Zhang, Shiyuan Chang, Yihui Wang, Li Chen","doi":"10.1109/ICCCWorkshops55477.2022.9896688","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896688","url":null,"abstract":"With the continuous evolution of wireless radio access network architecture, artificial intelligence (AI) plays an increasingly significant role in network optimization. Native-AI will realize fast and accurate optimization, real-time policy adjustment and trend prediction in future 6G systems. To cope with the increasing user density and complex wireless environment, beam weights optimization becomes one of the key factors to promote the communication capacity, coverage and anti-interference ability. In this paper, we build an intelligent network model based on the reinforcement learning (RL) algorithm and optimize the beam pattern in a real typical scenario that contains both roads and buildings. A field test is conducted to investigate the potential impacts of the intelligent algorithm on network optimization. The data used in the field test are real measurement reports from UEs, which imply the location information and the uneven distribution of UEs. The coverage performance and received signal quality are significantly improved after optimization. We also analyze the limitations of AI in the current 5G systems and discuss the future work on native-AI and RL.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130470618","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}
引用次数: 0
Dynamic User Scheduling with User Satisfaction Rate in Cell-Free Massive MIMO 无小区大规模MIMO中用户满意度的动态用户调度
Pub Date : 2022-08-11 DOI: 10.1109/ICCCWorkshops55477.2022.9896715
Xiaoqing Gong, Gang Wu
For cell-free multiple-input multiple-output (MIMO) system, this paper derived the mathematical formula for the optimization problem considering system throughput and user satisfaction rate (USR) in this architecture, and proposed an USR based dynamic user scheduling algorithm considering the transmission reliability of paired users. This method can dynamically control the number and list of multiplex users on different subband resources in the same system according to the requirements of user service transmission reliability after pairing, and maximize the system throughput on the premise of meeting the user transmission requirements. We simulate and verify this algorithm under the centralized processing cell-free system architecture. At the same time, a user scheduling and pairing transmission scheme based on partial signaling feedback on cell-free scenario is further proposed, and the effectiveness of this scheme is verified by simulation.
针对无小区多输入多输出(MIMO)系统,推导了该体系结构中考虑系统吞吐量和用户满意度(USR)的优化问题的数学公式,提出了一种考虑配对用户传输可靠性的基于USR的动态用户调度算法。该方法可以根据配对后用户业务传输可靠性的要求,动态控制同一系统内不同子带资源上复用用户的数量和列表,在满足用户传输需求的前提下实现系统吞吐量的最大化。在无集中处理单元的系统架构下对该算法进行了仿真验证。同时,进一步提出了一种基于部分信令反馈的无蜂窝场景下的用户调度配对传输方案,并通过仿真验证了该方案的有效性。
{"title":"Dynamic User Scheduling with User Satisfaction Rate in Cell-Free Massive MIMO","authors":"Xiaoqing Gong, Gang Wu","doi":"10.1109/ICCCWorkshops55477.2022.9896715","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896715","url":null,"abstract":"For cell-free multiple-input multiple-output (MIMO) system, this paper derived the mathematical formula for the optimization problem considering system throughput and user satisfaction rate (USR) in this architecture, and proposed an USR based dynamic user scheduling algorithm considering the transmission reliability of paired users. This method can dynamically control the number and list of multiplex users on different subband resources in the same system according to the requirements of user service transmission reliability after pairing, and maximize the system throughput on the premise of meeting the user transmission requirements. We simulate and verify this algorithm under the centralized processing cell-free system architecture. At the same time, a user scheduling and pairing transmission scheme based on partial signaling feedback on cell-free scenario is further proposed, and the effectiveness of this scheme is verified by simulation.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132972633","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}
引用次数: 3
Location-enhanced VoWiFi service solution and key issues analysis 位置增强VoWiFi服务解决方案及关键问题分析
Pub Date : 2022-08-11 DOI: 10.1109/ICCCWorkshops55477.2022.9896473
Xiao Shen, Guojin Huang, Yingbin Niu, Zhen Shao
Voice coverage in home mobile networks has always been a problem for telecom operators, and VoWiFi service based on the 3GPP S2b solution should solve the problem of accurate user location information before it can be commercially available in China. This paper focuses on the overall solution of accurate user location information and the procedure of acquiring and transferring user location information. In addition, a solution is proposed to support VoWiFi service for 5G SA users under the interworking architecture between ePDG/EPC and 5GS.
家庭移动网络的语音覆盖一直是电信运营商面临的难题,基于3GPP S2b解决方案的VoWiFi业务在中国商用之前,应该先解决用户位置信息的精准化问题。本文重点研究了准确用户位置信息的整体解决方案以及用户位置信息的获取和传输过程。提出了在ePDG/EPC与5GS联动架构下,支持5G SA用户VoWiFi业务的解决方案。
{"title":"Location-enhanced VoWiFi service solution and key issues analysis","authors":"Xiao Shen, Guojin Huang, Yingbin Niu, Zhen Shao","doi":"10.1109/ICCCWorkshops55477.2022.9896473","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896473","url":null,"abstract":"Voice coverage in home mobile networks has always been a problem for telecom operators, and VoWiFi service based on the 3GPP S2b solution should solve the problem of accurate user location information before it can be commercially available in China. This paper focuses on the overall solution of accurate user location information and the procedure of acquiring and transferring user location information. In addition, a solution is proposed to support VoWiFi service for 5G SA users under the interworking architecture between ePDG/EPC and 5GS.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133160089","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}
引用次数: 0
An Incentivized Online Learning Approach for Context Information Caching and Sharing in V2X Networks V2X网络中上下文信息缓存与共享的激励在线学习方法
Pub Date : 2022-08-11 DOI: 10.1109/ICCCWorkshops55477.2022.9896674
Yuejiao Huang, Xishuo Li, Zhiyuan Wang, Shan Zhang, Hongbin Luo
Provisioning context information via vehicle-to-everything (V2X) networks can greatly enhance the context awareness and driving intelligence of vehicles. Considering the location-related interests, it is favorable to employ the cache-enabled vehicles for content sharing. In this work, we investigate how to incentivize the selfish vehicles to share their context information with the multi-dimensional imperfect information of content dynamics, requests, and cache costs. The incentivized interaction process between the Base Station (BS) and cache-enabled vehicles is modeled as an online learning problem from the BS aspect. Based on the reverse auction theorem, an incentivized online vehicle caching mechanism is proposed to ensure the vehicles' voluntary participation in edge services and maximize the social welfare (vehicle-offloaded traffic excluding the caching and sharing cost), which is proved to approach an idealistic performance with prior knowledge of reward of contents and cost of vehicle caching. Simulation results show that the proposed incentive method can enhance the social welfare by around 3X to 7X compared with the popularity based and random caching schemes.
通过车联网(V2X)网络提供上下文信息可以极大地增强车辆的上下文感知和驾驶智能。考虑到与位置相关的兴趣,使用支持缓存的车辆进行内容共享是有利的。在这项工作中,我们研究了如何激励自私车辆在内容动态、请求和缓存成本等多维不完全信息的情况下共享其上下文信息。从基站的角度出发,将基站与高速缓存车辆之间的激励交互过程建模为一个在线学习问题。基于逆向拍卖定理,提出了一种激励的在线车辆缓存机制,以保证车辆自愿参与边缘服务,最大化社会福利(不包括缓存和共享成本的卸载流量),并证明了该机制接近于具有内容奖励和车辆缓存成本先验知识的理想性能。仿真结果表明,与基于流行度和随机缓存方案相比,所提出的激励方法可使社会福利提高约3 ~ 7倍。
{"title":"An Incentivized Online Learning Approach for Context Information Caching and Sharing in V2X Networks","authors":"Yuejiao Huang, Xishuo Li, Zhiyuan Wang, Shan Zhang, Hongbin Luo","doi":"10.1109/ICCCWorkshops55477.2022.9896674","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896674","url":null,"abstract":"Provisioning context information via vehicle-to-everything (V2X) networks can greatly enhance the context awareness and driving intelligence of vehicles. Considering the location-related interests, it is favorable to employ the cache-enabled vehicles for content sharing. In this work, we investigate how to incentivize the selfish vehicles to share their context information with the multi-dimensional imperfect information of content dynamics, requests, and cache costs. The incentivized interaction process between the Base Station (BS) and cache-enabled vehicles is modeled as an online learning problem from the BS aspect. Based on the reverse auction theorem, an incentivized online vehicle caching mechanism is proposed to ensure the vehicles' voluntary participation in edge services and maximize the social welfare (vehicle-offloaded traffic excluding the caching and sharing cost), which is proved to approach an idealistic performance with prior knowledge of reward of contents and cost of vehicle caching. Simulation results show that the proposed incentive method can enhance the social welfare by around 3X to 7X compared with the popularity based and random caching schemes.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124552264","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}
引用次数: 0
AoI-Oriented Context-Aware Priority Design and Vehicle Scheduling Strategy in Vehicular Networks 面向aoi的车辆网络环境感知优先级设计与车辆调度策略
Pub Date : 2022-08-11 DOI: 10.1109/ICCCWorkshops55477.2022.9896680
Qiu Zhang, Nan Cheng, Ruijin Sun, Dayue Zhang
Real-time status updates are playing a key role in the emergence of autonomous driving. Due to the limited and dynamic environment, the vehicle communications may not guarantee the required quality of service (QoS) on demand. In this paper, we consider the intersection scenario with relatively heavy traffic and slightly higher risk, where the base station (BS) remotely controls multiple vehicles. The vehicles sense their own and surrounding contextual information through sensors and send them to the BS through the uplink. Since the urgency of different status information is distinct, the analytic hierarchy process (AHP) method is used to give each status information a context-aware weight so that emergency vehicles can be scheduled first by the BS. Then, age of information (AoI) is also exploited to describe the time elapsed since the generation of the status information obtained from the perspective of the BS. On this basis, the Lyapunov method is considered to optimize the average weighted AoI subject to the limited throughput constraint. Finally, a scheduling strategy based on dynamic domain value is proposed to update vehicles in real time in the long run, so as to minimize the average weighted AoI. The simulation results show that the context-aware weight proposed in this paper has a significant impact on scheduling, and the average weighted AoI of the whole system is optimized compared with other approaches.
实时状态更新在自动驾驶的出现中发挥着关键作用。由于环境的有限性和动态性,车载通信可能无法保证所需的服务质量(QoS)。本文考虑交通流量较大、风险稍高的交叉口场景,基站(BS)远程控制多辆车辆。车辆通过传感器感知自身和周围的环境信息,并通过上行链路将其发送到BS。由于不同状态信息的紧急程度不同,采用层次分析法(AHP)赋予每个状态信息上下文感知的权重,使BS能够优先调度应急车辆。然后,还利用信息年龄(age of information, AoI)来描述从BS角度获得的状态信息产生以来所经过的时间。在此基础上,考虑Lyapunov方法在有限吞吐量约束下优化平均加权AoI。最后,提出了一种基于动态域值的车辆长期实时更新调度策略,使加权平均AoI最小。仿真结果表明,本文提出的上下文感知权值对调度有显著影响,与其他方法相比,优化了整个系统的平均加权AoI。
{"title":"AoI-Oriented Context-Aware Priority Design and Vehicle Scheduling Strategy in Vehicular Networks","authors":"Qiu Zhang, Nan Cheng, Ruijin Sun, Dayue Zhang","doi":"10.1109/ICCCWorkshops55477.2022.9896680","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896680","url":null,"abstract":"Real-time status updates are playing a key role in the emergence of autonomous driving. Due to the limited and dynamic environment, the vehicle communications may not guarantee the required quality of service (QoS) on demand. In this paper, we consider the intersection scenario with relatively heavy traffic and slightly higher risk, where the base station (BS) remotely controls multiple vehicles. The vehicles sense their own and surrounding contextual information through sensors and send them to the BS through the uplink. Since the urgency of different status information is distinct, the analytic hierarchy process (AHP) method is used to give each status information a context-aware weight so that emergency vehicles can be scheduled first by the BS. Then, age of information (AoI) is also exploited to describe the time elapsed since the generation of the status information obtained from the perspective of the BS. On this basis, the Lyapunov method is considered to optimize the average weighted AoI subject to the limited throughput constraint. Finally, a scheduling strategy based on dynamic domain value is proposed to update vehicles in real time in the long run, so as to minimize the average weighted AoI. The simulation results show that the context-aware weight proposed in this paper has a significant impact on scheduling, and the average weighted AoI of the whole system is optimized compared with other approaches.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116161045","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}
引用次数: 1
An Economic Evaluation Method for LEO Satellite Constellation Considering Revenue and Efficiency 考虑收益和效率的LEO卫星星座经济评价方法
Pub Date : 2022-08-11 DOI: 10.1109/ICCCWorkshops55477.2022.9896712
Zhenkai Lian, Yingshuai Dong, L. Yin, Youzheng Wang
Considering the rapid development of space technol-ogy and the increasingly scarce spectral resources of terrestrial communication network, people redirect their view to broadband satellite communication. Recently, low orbit satellites have at-tracted wide attention and research because of their low latency, large capacity and less susceptibility to external environmental impact. The existing analysis of satellite constellation coverage and capacity has yielded many results, while many of which are based on the uniform distribution of ground users and mostly from the satellite supply side, ignoring the actual needs of ground users. However, from the point of view of commercial satellite communication, the profit of satellite constellation is of concern to operators. Therefore, we propose an evaluation method that considers the revenue capability and efficiency of constellation. The simulation results show that the constellation efficiency of Starlink is lower than One Web, while the revenue capacity is significantly higher. After we adjust the constellation structure of Starlink, the constellation efficiency and revenue capability has been improved.
随着空间技术的飞速发展和地面通信网络频谱资源的日益紧缺,人们将目光转向了宽带卫星通信。近年来,低轨卫星以其低时延、大容量、不易受外界环境影响等特点引起了广泛的关注和研究。现有的卫星星座覆盖和容量分析已经得出了很多结果,但其中很多都是基于地面用户的均匀分布,而且大多是从卫星供应方出发,忽略了地面用户的实际需求。然而,从商业卫星通信的角度来看,卫星星座的利润是运营商关注的问题。为此,我们提出了一种综合考虑星座收益能力和效率的评价方法。仿真结果表明,Starlink的星座效率低于One Web,而收益容量明显高于One Web。通过对星链星座结构的调整,提高了星座的效率和创收能力。
{"title":"An Economic Evaluation Method for LEO Satellite Constellation Considering Revenue and Efficiency","authors":"Zhenkai Lian, Yingshuai Dong, L. Yin, Youzheng Wang","doi":"10.1109/ICCCWorkshops55477.2022.9896712","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896712","url":null,"abstract":"Considering the rapid development of space technol-ogy and the increasingly scarce spectral resources of terrestrial communication network, people redirect their view to broadband satellite communication. Recently, low orbit satellites have at-tracted wide attention and research because of their low latency, large capacity and less susceptibility to external environmental impact. The existing analysis of satellite constellation coverage and capacity has yielded many results, while many of which are based on the uniform distribution of ground users and mostly from the satellite supply side, ignoring the actual needs of ground users. However, from the point of view of commercial satellite communication, the profit of satellite constellation is of concern to operators. Therefore, we propose an evaluation method that considers the revenue capability and efficiency of constellation. The simulation results show that the constellation efficiency of Starlink is lower than One Web, while the revenue capacity is significantly higher. After we adjust the constellation structure of Starlink, the constellation efficiency and revenue capability has been improved.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123699714","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}
引用次数: 1
期刊
2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1