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

Two grids are better than one: Hybrid indoor scene reconstruction framework with adaptive priors

NEUROCOMPUTING 2025年 618卷

作者： Bai, Boyuan Qiao, Xiuquan Lu, Ping Zhao, Hongru Shi, Wenzhe Zhang, Hengjia Huang, Yakun Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China State Key Lab Mobile Network & Mobile Multimedia T Shenzhen 518055 Peoples R China Zhengzhou Univ Sch Comp & Artificial Intelligence Zhengzhou 450001 Peoples R China

Indoor scene reconstruction from multi-view images is a pivotal technology within the field of robotics and augmented reality. Previous researches have predominantly focused on neural radiance fields aided by geometric monocular priors. However, due to the inductive smoothness bias introduced by deep Multi- Layer Perceptron (MLP) networks, these methods struggle to recover the scene surface with complex and fine geometry details. Additionally, when used as additional supervision signals during optimization, priors indifferent regions make different contributions. Simply incorporating them in all regions may lead to a decrease in the accuracy. To tackle these issues, we present a generic end-to-end framework named AdaptSurf, which combines Signed Distance Field (SDF) voxel grids and feature voxel grids to enhance the capability of reconstructing accurate geometry details, respectively. Furthermore, we design a policy network to adaptively enable the estimated depth or normal priors to supervise the learning process, which improves the reconstruction accuracy and accelerates neural surface reconstruction. Qualitative and quantitative experiments show that AdaptSurf yields high-quality surfaces, especially for fine-grained details and smooth regions. Furthermore, the policy network exhibits an interpretable behavior that depends on the voxel features, which helps to improve the quality of surface reconstruction.

关键词： 3D reconstruction NeRF Geometric priors Volume rendering

来源：评论

学校读者我要写书评

暂无评论

In-Network DDoS Mitigation Mechanism for Vehicle Road Cooperation Network With Victim-Centric Approach

引用

IEEE INTERNET OF THINGS JOURNAL 2025年第11期12卷 15514-15532页

作者： Liu, Yan Shao, Sujie Guo, Shaoyong Zang, Zhibin Chen, Xingyu Qi, Feng Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China State Grid Informat & Commun Ind Grp Co Ltd Beijing 102211 Peoples R China

Vehicle road cooperation (VRC) services closely related to personal safety impose stringent requirements on reliability and real-time performance. However, the growing trend of vehicle to network (V2N) connections has significantly intensified the threat of distributed Denial of Service (DDoS) to the end-cloud communication links. To address this challenge, this article introduces a comprehensive DDoS defense architecture for VRC, named in-network DDoS-oriented Balancer, Inspector, and Filter (IDBIF). Leveraging programmable switches, IDBIF adopts an in-network mode to dynamically mitigate volumetric DDoS traffic in real-time, which coordinates three data plane functions for traffic processing: 1) load balancing;2) packet inspection;and 3) traffic filtering. Our work faces the starved data plane resources and establishes the problem model for high reliability requirements of VRC services when subjected to DDoS attacks. Furthermore, we developed a multiagent hierarchical structure policy gradient (MAHSPG) algorithm that combines the inherent characteristics of DDoS attacks to tackle the runtime deployment of high-dimensional and heterogeneous defense function chains. Simulation experiment results show that the proposed approach alleviates the data plane resource bottleneck and improves the DDoS defense effect by 24.80%, highlighting its advantages in ensuring reliable VRC services.

关键词： Computer crime Denial-of-service attack Prevention and mitigation Collaboration Pipelines Real-time systems Filtering Roads Reliability Inspection Cloud service security distributed Denial of Service (DDoS) programmable switch vehicle road cooperation (VRC)

来源：评论

学校读者我要写书评

暂无评论

Energy Aware Virtual Network Migration

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2022年第2期10卷 1173-1189页

作者： Zhang, Zhongbao Cao, Huafeng Su, Sen Li, Weitian Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

In network virtualization, one of the key problems is to embed a sequence of virtual networks with both node and link constraints onto the physical network, which is known to be NP-hard. Recent studies focus on how to minimize the energy cost while maximizing the revenue of the physical network when the VN request arrives. However, after a period of time, due to the dramatic dynamics of the resources of the physical network, the previous solution may become less energy efficient. In this article, we study how to re-optimize the energy cost by leveraging the migration technique. In particular, we first give the problem model of virtual network migration. Then we design two energy aware virtual network migration algorithms called EA-VNM and EA-VNM-G. For EA-VNM, it answers the following key questions: when to perform migration, migrate which virtual nodes to where, and how to perform migration. Especially, for EA-VNM-G, it further reduces the high time complexity problem of EA-VNM by grouping the virtual nodes to be migrated with fewer conflicts. Extensive simulations show that EA-VNM significantly reduces the energy cost by up to 25 percent over the state-of-the-art algorithm while maintaining similar revenue and EA-VNM-G reduces the running time significantly.

关键词： Network as a service network virtualization virtual network migration energy cost label propagation

来源：评论

学校读者我要写书评

暂无评论

Minimum Spatial Sampling Method Under Spherical Test Zone in MIMO OTA Testing

引用

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2024年第8期23卷 2466-2470页

作者： Hu, Zhenyun Zhang, Yuxiang Zhang, Jianhua Tian, Lei Wang, Heng Zhang, Xiang Yang, Xiaohang Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China China Acad Informat & Commun Technol Beijing 100191 Peoples R China

In this letter, a novel 3-D test zone sampling method is proposed to realize efficient dynamic channel emulation in multiple-input-multiple-output (MIMO) over-the-air (OTA) testing. By characterizing the spatial correlation with Fourier expansion, this method can derive the minimum necessary number of test zone samples for high fidelity channel emulation. This approach significantly reduces the complexity associated with probe weight computation, which is essential for dynamic channel emulation. The simulation results indicate that compared with the sampling method with ${{\mathbf{0.1}}}$ wavelength interval, the proposed method reduces spatial samples of virtual antennas to ${{\mathbf{53.4}}\%}$, which is significant for MIMO OTA testing.

关键词： Multiple-input-multiple-output (MIMO) Nyquist sampling theorem over-the-air (OTA) testing test zone sampling Multiple-input-multiple-output (MIMO) Nyquist sampling theorem over-the-air (OTA) testing test zone sampling

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：