检索结果-内蒙古大学图书馆

Joint Communication and Computation Resource Allocation in Fog-Based Vehicular Networks

IEEE INTERNET OF THINGS JOURNAL 2022年第15期9卷 13195-13208页

作者： Zhang, Xinran Peng, Mugen Yan, Shi Sun, Yaohua Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

To satisfy the low-latency requirements of emerging computation-intensive vehicular services, offloading these services to edge or cloud servers has been recognized as an effective solution. Due to the limited resources of edge servers and the faraway distance of cloud servers, it is challenging to provide an efficient resource allocation strategy to balance the latency, throughput and the resource utilization. In this paper, an end-edge-cloud collaboration paradigm is presented for computation offloading in fog-based vehicular networks (FVNETs) by incorporating vehicles with idle resources as fog user equipments (F-UEs). To adaptively orchestrate end-edge-cloud resources in different load cases, a two-timescale resource reservation and allocation framework is proposed. Wherein, a Stackelberg-game-based dynamic F-UE incentive problem is first formulated with the cloud server as the leader and multiple F-UEs as the followers, and then an iterative algorithm is proposed to achieve the Stackelberg equilibrium of the computation resource pricing and reservation. On a small timescale, the joint communication and computation resource allocation problem is transferred into a multiagent stochastic game and a lenient multiagent deep-reinforcement-learning-based distributed algorithm is developed to minimize the sum latency. When latency performance deteriorates, F-UE incentive optimization will be triggered to reserve more resources of F-UEs. Simulation results show that the proposed end-edge-cloud orchestrated computation offloading scheme in FVNETs outperforms baselines in terms of average latency.

关键词： Resource management Servers Cloud computing Task analysis Vehicle dynamics Collaboration Games Computation offloading fog-computing-based vehicular networks (VNs) multiagent deep reinforcement learning (DRL) resource allocation

来源：评论

学校读者我要写书评

暂无评论

Content Collaborative Caching Strategy in the Edge Maintenance of Communication Network: A Joint Download Delay and Energy Consumption Method

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2022年第12期33卷 4148-4163页

作者： Rui, Lanlan Song, Dai Chen, Shiyou Yang, Yingtai Yang, Yang Gao, Zhipeng Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

With the development of Big Data technology and Internet, the surge of data in the network will cause network congestion and untimely task processing. Additionally, caching content in the core network may cause redundant access of content and backhaul bottlenecks. Due to the increasing requirements of users for task processing efficiency, the centralized maintenance system based on traditional cloud computing cannot meet the current computing requirements. In view of these problems, we propose a content collaborative caching mechanism based on joint decision of download delay and energy consumption. By integrating network coding and content caching technology, the work content maintained in the communication network is deployed near the edge of the network in the form of coding to reduce the redundant transmission of content and acquisition time of content. This article establishes a user QoE satisfaction model, which consists of two indexes that measure time delay and energy consumption. This article proposes a e-hybrid Q-learning algorithm to optimize the placement of cache files, and made the cache action selection based on the combination of improved heuristic greedy algorithm and simulated annealing algorithm. The experimental results show that the proposed cache strategy can reduce the delay of users downloading content and the energy consumption of content cache, so as to improve the quality of field maintenance work in communication network.

关键词： Multi-access edge computing communication network content caching quality of experience

来源：评论

学校读者我要写书评

暂无评论

Complementary Coded Identical Code Cyclic Shifted Multiple Access and its Performance Analysis

引用

IEEE SYSTEMS JOURNAL 2022年第3期16卷 4892-4903页

作者： Wang, Zhifeng Liu, Xiqing Peng, Mugen Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

The scarcity of available spreading codes poses a hard limitation to user capacity for a code-division multiple access system. In previous work by Liu et al. (2020), the identical code cyclic shift multiple access (ICCSMA) scheme was developed, which allows multiple users to share one spreading code. However, the ICCSMA system uses the basic $m$-sequence as the prime code to generate the identical code cyclic shift code, which has a nonideal correlation property and produces a considerable interference in a frequency-selective fading channel. To address this issue, we suggest using the complementary code (CC), which exhibits the perfect correlation property, to suppress the interference, and the proposed scheme is named CC-ICCSMA. Different from the article by Liu et al. (2020), a 3-D transceiver is designed in this article, and the CC set is employed to perform the multiple user detection. The simulation results demonstrate that the CC-ICCSMA strategy achieves a much better bit error rate performance than $m$-sequence-based ICCSMA in the frequency-selective fading channels. Also, the outstanding anti-interference capability of CC-ICCSMA can help improve user capacity.

关键词： Codes Multiaccess communication Fading channels Interference Multipath channels Channel estimation Receivers Complementary code (CC) frequency-selective fading channel identical code cyclic shift (ICCS) code multiple access interference (MAI)

来源：评论

学校读者我要写书评

暂无评论

DBT-PDP:Provable data possession with outsourced data batch transfer based on blockchain

引用

High-Confidence Computing 2024年第2期4卷 62-72页

作者： Chengming Yi Hua Zhang Weiming Sun Jun Ding State key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 100876China Zhe Jiang Computer Network Emergency Response Technical Team Hangzhou 310052China

In the scenario of large-scale data ownership transactions,existing data integrity auditing schemes are faced with security risks from malicious third-party auditors and are inefficient in both calculation and communication,which greatly affects their *** paper proposes a data integrity audit scheme based on blockchain where data ownership can be traded in batches.A data tag structure which supports data ownership batch transaction is adopted in our *** update process of data tag does not involve the unique information of each data,so that any user can complete ownership transactions of multiple data in a single transaction through a single transaction auxiliary *** the same time,smart contract is introduced into our scheme to perform data integrity audit belongs to third-party auditors,therefore our scheme can free from potential security risks of malicious third-party *** analysis shows that our scheme is proved to be safe under the stochastic prediction model and k-CEIDH *** with similar schemes,the experiment shows that communication overhead and computing time of data ownership transaction in our scheme is ***,the communication overhead and computing time of our scheme is similar to that of similar schemes in data integrity audit.

关键词： Data integrity Cloud outsourcing audit Data ownership batch transaction Blockchain Smart contract

来源：评论

学校读者我要写书评

暂无评论

Virtual Reality Streaming in Blockchain-Enabled Fog Radio Access Networks

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第11期9卷 8067-8077页

作者： Liu, Yang Chang, Qingan Peng, Mugen Dang, Tian Xiong, Wanling Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

Virtual reality (VR) streaming is becoming a popular mobile application that requires ultralow latency and active participation of devices. Meanwhile, blockchain is a promising paradigm to decentralize the traditional ledger of a single trusted entity. In this article, a deep deterministic policy gradient (DDPG)-based scheme is proposed to tackle the joint resource allocation and replica selection challenge of VR streaming in blockchain-enabled fog radio access networks (F-RANs). The proposed scheme balances the load on VR streaming and blockchain maintenance and fully exploits the edge caching and computing resources on fog-based access points (F-APs). Thus, less energy is consumed compared with other learning schemes based on extensive simulations.

关键词： Blockchains Wireless communication Resource management Internet of Things Videos Three-dimensional displays Solid modeling Blockchain deep deterministic policy gradient (DDPG) fog radio access networks (F-RANs) virtual reality (VR)

来源：评论

学校读者我要写书评

暂无评论

Timely Device Status Updates in Industrial Wireless Monitoring Systems Under Resource Constraints

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第19期9卷 18791-18805页

作者： Zhao, Junwei Wang, Ying Qin, Xiaoqi Fei, Zixuan Lu, Jiarong Wang, Xue Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

In Industrial Internet of Things (IIoT), it is essential to acquire timely device status information to ensure efficient operation. In this article, we consider a wireless monitoring system in IIoT and employ the concept of Age of Information (AoI) to characterize the timeliness of device status information in the system. Considering the impact of resource constraints on information acquisition, we apply a pull-based model to control the entire process of sampling, transmission, and processing associated with device status updates, which constitutes a system-wide AoI minimization problem. The formulated problem is a mixed-integer nonconvex problem, due to the temporal correlation of AoI and the intractability of the implicit AoI-associated objective function. We introduce the concept of average AoI earnings to equivalently substitute the optimization objective. The original problem in consecutive time slots is decomposed into the per-time slot average AoI earnings maximization problem to deal with the temporal correlation of AoI. Then, an online slot-by-slot optimization algorithm (SBSA) is proposed to control device status updates without long-term system state information. Simulation results show that SBSA can significantly improve the AoI performance of the system. However, the problem decomposition in SBSA inevitably brings approximation error. Hence, based on the actual transmission and processing in the system, we get the lower bound of the system total AoI by designing a multislot optimization algorithm (MSA) and analyze the approximate error caused by SBSA. Through simulation results, SBSA has a substantially lower computational complexity, while maintaining acceptable approximation error in comparison to MSA.

关键词： Monitoring Performance evaluation Optimization Industrial Internet of Things Data communication Wireless networks Real-time systems Age of Information (AoI) data processing device status updates Industrial Internet of Things (IIoT) wireless monitoring systems

来源：评论

学校读者我要写书评

暂无评论

Price-Aware Service Deployment in Hierarchical Mobile-Edge Computing

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第13期9卷 11533-11541页

作者： Huang, Jie Zhou, Ao Wang, Shangguang Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

Mobile-edge computing (MEC) is considered as a promising solution to release pressure on the core network and reduce service response time. Edge nodes with storage and computation resources are able to cache various services and process tasks rather than offloading to remote clouds. However, it is difficult to make service deployment decisions appropriately since resources are limited in edge nodes and requirements of services are diverse. The hierarchical MEC structure in the 5G network causes extra complication, and the cost of service deployment aggravates the hardness, especially for service providers. In this article, we focus on the service deployment problem considering service caching, resource allocation, and task scheduling in the hierarchical MEC network, aiming at minimizing monetary cost. To address the heterogeneous limitations and requirements, we formulate the problem as a mixed-integer nonlinear programming problem and develop an iterative service deployment algorithm by exploiting Gibbs sampling. We make the service caching strategies of edge nodes iteratively. Furthermore, we transform the resource allocation and task scheduling optimization into the linear programming problem and employ a typical optimization function. Simulation results show that our algorithm always obtains minimal monetary cost for various number of services and task arrival rates, compared with benchmarks.

关键词： Task analysis Costs Resource management Processor scheduling Cloud computing Servers Multi-access edge computing Mobile-edge computing (MEC) resource allocation service caching service deployment task scheduling

来源：评论

学校读者我要写书评

暂无评论

Redactable Blockchain Based on Decentralized Trapdoor Verifiable Delay Functions

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2024年 19卷 7492-7507页

作者： Wang, Wei Wang, Licheng Duan, Junke Tong, Xiaofei Peng, Haipeng Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Beijing Inst Technol Sch Cyberspace Sci & Technol Beijing 100081 Peoples R China

Blockchain technology was originally designed to ensure data security and trustworthiness through decentralization and immutability. However, in recent years, the misuse of immutability limits the development of blockchain. To address this challenge, several redactable blockchain solutions have been proposed. However, existing solutions either struggle to maintain block consistency or compromise the decentralization principles of blockchain. In this paper, we present a novel redactable blockchain to address these issues. Firstly, we propose a decentralized trapdoor verifiable delay function (DTVDF) based on Wesolowski's verifiable delay function (VDF) scheme (EUROCRYPT'2019), which distributes trapdoor shares among a group of participants. Then, we leverage the proposed DTVDF to construct our redactable blockchain solution (DTRB), where redacting blocks requires consensus from threshold nodes. Moreover, DTRB provides accountability for malicious modifications and supports aggregate verification of redacted blocks, significantly improving the efficiency of our scheme. Through experimental analysis and comparison with existing solutions, our approach demonstrates superior performance.

关键词： Blockchains Digital TV Delays Security Digital signatures Hash functions Buildings Verifiable delay functions redactable blockchain decentralization aggregate

来源：评论

学校读者我要写书评

暂无评论

Request Scheduling Combined With Load Balancing in Mobile-Edge Computing

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第21期9卷 20841-20852页

作者： Liu, Haojiang Li, Yuanzhe Wang, Shangguang Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

Edge servers can cache some delay-sensitive and resource-intensive applications to reduce the delay of user tasks. However, due to the limited resources of edge servers, they cannot cache all services and process all user requests like remote clouds. In order to take advantage of the low latency, we need to make full use of the limited resources of the edge servers and reasonably allocate user requests to edge servers for processing. Meanwhile, in order to maintain the efficient and long-term operation of the server cluster, we should also consider the load balancing of the cluster. How to balance the server load while making users have the best experience is an urgent problem to be solved. Solving the problem faces the challenge of the interaction between service placement and request scheduling, the tradeoff between communication and computation, and the consideration of response time and edge server load. We propose the service placement algorithm based on user visits and our request scheduling algorithm based on the simulated annealing algorithm. We verify the superiority of our algorithms in response time and server load balancing. The experimental results based on the real data sets prove our algorithm can cope with the actual situation and quickly converge to a favorable value.

关键词： Servers Optimization Time factors Delays Load management Base stations Internet of Things Load balancing mobile-edge computing (MEC) request scheduling service placement

来源：评论

学校读者我要写书评

暂无评论

AlsoDTN: An Air Logistics Service-Oriented Digital Twin Network Based on Collaborative Decision Model

AlsoDTN: An Air Logistics Service-Oriented Digital Twin Netw...

引用

20th International Conference on Service-Oriented Computing (ICSOC)

作者： Fu, Qianlong Chen, Dezhi Sun, Haifeng Qi, Qi Wang, Jingyu Liao, Jianxin Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China

ISBN: (纸本)9783031265068;9783031265075

As cities expand and the pace of life accelerates, modern logistics services need to explore new air routes. While air logistics is fast and convenient, it also faces many problems, such as time-sensitive dynamic order requirements, the limited battery power of unmanned aerial vehicle (UAV) and so on. Besides, UAVs need to cooperate and make decisions in real time to meet city-wide logistics needs. However, limited by the computing power, it is difficult to process massive logistics demands in real time. In this paper, we propose an Air Logistics Service-Oriented Digital Twin Network based on collaborative decision model, called AlsoDTN. Firstly, in order allocation task, we establish an information fusion mechanism based on Transformer architecture to obtain the optimal order. Secondly, to adapt to the long-term route planning task, we use multi-agent deep reinforcement learning technology to make UAVs cooperate with each other. Experimental results show that our algorithm has an improvement of 18% relative to baseline algorithm.

关键词： Service-oriented architecture Digital twin network Logistics transport Multi-agent deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：