To accommodate the diversified emerging use cases in 5G,radio access networks(RAN)is required to be more flexible,open,and versatile.It is evolving towards cloudification,intelligence and openness.By embedding computi...To accommodate the diversified emerging use cases in 5G,radio access networks(RAN)is required to be more flexible,open,and versatile.It is evolving towards cloudification,intelligence and openness.By embedding computing capabilities within RAN,it helps to transform RAN into a natural cost effective radio edge computing platform,offering great opportunity to further enhance RAN agility for diversified services and improve users’quality of experience(Qo E).In this article,a logical architecture enabling deep convergence of communication and computing in RAN is proposed based on O-RAN.The scenarios and potential benefits of sharing RAN computing resources are first analyzed.Then,the requirements,design principles and logical architecture are introduced.Involved key technologies are also discussed,including heterogeneous computing infrastructure,unified computing and communication task modeling,joint communication and computing orchestration and RAN computing data routing.Followed by that,a VR use case is studied to illustrate the superiority of the joint communication and computing optimization.Finally,challenges and future trends are highlighted to provide some insights on the potential future work for researchers in this field.展开更多
In this paper, we propose a novel space efficient secret sharing scheme on the basis of minimal linear codes, which satisfies the definition of a computationally efficient secret sharing scheme. In the scheme, we part...In this paper, we propose a novel space efficient secret sharing scheme on the basis of minimal linear codes, which satisfies the definition of a computationally efficient secret sharing scheme. In the scheme, we partition the underlying minimal linear code into disjoint classes, establishing a one-to-one correspondence between the minimal authorized subsets of participants and the representative codewords of all different classes. Each participant, with only one short share transmitted through a public channel, can share a large secret. Therefore, the proposed scheme can distribute a large secret in practical applications such as secure information dispersal in sensor networks and secure multiparty computation.展开更多
基金jointly supported by the Beijing University of Posts and Telecommunications-China Mobile Research Institute Joint Innovation Centerthe National Key Research and Development Program of China under Grant 2021YFB2900200the National Natural Science Foundation of China under Grant 62201073 and 61925101。
文摘To accommodate the diversified emerging use cases in 5G,radio access networks(RAN)is required to be more flexible,open,and versatile.It is evolving towards cloudification,intelligence and openness.By embedding computing capabilities within RAN,it helps to transform RAN into a natural cost effective radio edge computing platform,offering great opportunity to further enhance RAN agility for diversified services and improve users’quality of experience(Qo E).In this article,a logical architecture enabling deep convergence of communication and computing in RAN is proposed based on O-RAN.The scenarios and potential benefits of sharing RAN computing resources are first analyzed.Then,the requirements,design principles and logical architecture are introduced.Involved key technologies are also discussed,including heterogeneous computing infrastructure,unified computing and communication task modeling,joint communication and computing orchestration and RAN computing data routing.Followed by that,a VR use case is studied to illustrate the superiority of the joint communication and computing optimization.Finally,challenges and future trends are highlighted to provide some insights on the potential future work for researchers in this field.
基金Supported by the National Natural Science Foundation of China (11271237)
文摘In this paper, we propose a novel space efficient secret sharing scheme on the basis of minimal linear codes, which satisfies the definition of a computationally efficient secret sharing scheme. In the scheme, we partition the underlying minimal linear code into disjoint classes, establishing a one-to-one correspondence between the minimal authorized subsets of participants and the representative codewords of all different classes. Each participant, with only one short share transmitted through a public channel, can share a large secret. Therefore, the proposed scheme can distribute a large secret in practical applications such as secure information dispersal in sensor networks and secure multiparty computation.
