{"title":"Energy-Minimization Resource Allocation for FD-NOMA Enabled Integrated Sensing, Communication, and Computation in PIoT","authors":"Xiaobo Liu;Xinru Wang;Xiongwen Zhao;Fei Du;Yu Zhang;Zihao Fu;Jing Jiang;Peizhe Xin","doi":"10.1109/TNSE.2024.3462602","DOIUrl":"10.1109/TNSE.2024.3462602","url":null,"abstract":"The integration of power Internet of Things (PIoT) with integrated sensing, communication, and computation (ISCC) has become crucial for achieving hierarchical co-regulation and sustainable development in power systems. However, traditional PIoT models designed for edge computing are facing complex challenges due to more intricate and coupled resource allocation in the ISCC design. In this work, we propose a full-duplex (FD) and non-orthogonal multiple access (NOMA) assisted ISCC framework (FD-NOMA-ISCC) in PIoT and investigate the main challenges of FD-NOMA-ISCC from the perspective of joint resource optimization. We jointly optimize the receive beamformer, transmit beamforming design, uplink power control, task offloading decision, and computing resource allocation to minimize the total energy consumption. This forms a complex mixed integer nonlinear programming (MINLP) problem due to the strong correlation between uplink and downlink, as well as the coupling between communication and computing resource allocation. To tackle this, we propose an alternating optimization algorithm based on linear constrained minimum variance (LCMV) that decouples the problem into two iteratively solved subproblems: 1) joint transmit beamforming and power control problem, and 2) joint computing resource allocation and offloading decision problem. Numerical results show that the proposed scheme has a significant advantage in reducing system energy consumption compared with the benchmark schemes.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"5863-5877"},"PeriodicalIF":6.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Augmenting Backpressure Scheduling and Routing for Wireless Computing Networks","authors":"KM Mahfujul;Kaige Qu;Qiang Ye;Ning Lu","doi":"10.1109/TNSE.2024.3460479","DOIUrl":"10.1109/TNSE.2024.3460479","url":null,"abstract":"Driven by the ever-increasing computing capabilities of mobile devices, the next-generation wireless networks are evolving towards distributed networking and computing platforms, which enable in-network computing and unified resource/service provisioning. The evolution leads to a growing research interest in wireless computing networks that operate under the high dynamics of the wireless environment, the complexity of heterogeneous resource allocation, scheduling, and overall optimization. In this paper, we propose a low-complexity efficient solution to jointly allocate both networking resources (e.g., links to forward packets between connected computing nodes) and computing resources (e.g., computing power at each node for packet processing) for wireless computing networks. Specifically, we propose a novel network utility maximization problem under computing and networking resource constraints and develop an enhanced backpressure-based dynamic scheduling and routing algorithm. We verify the network stability and near-optimal performance of the algorithm via both theoretical analysis and extensive simulations.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6605-6622"},"PeriodicalIF":6.7,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142269396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Contract-Based Incentive Design for Resource Allocation in Edge Computing-Based Blockchain","authors":"Ziqing Yu;Zheng Chang;Li Wang;Geyong Min","doi":"10.1109/TNSE.2024.3457888","DOIUrl":"10.1109/TNSE.2024.3457888","url":null,"abstract":"To boost the wide applications of the blockchain, Mobile edge computing (MEC) emerges as potential solution that can provide computing resources in terms of computation offloading. In blockchain, pool mining allows to combine a small amount of computing resources to operate together, which helps the miners with small number of resources mine blocks more efficiently. Therefore, a MEC-enabled blockchain has recently received significant research interests. However, how to encourage the involvements of different parties and operate resource allocation in the MEC-enabled blockchain in an efficient manner are still under-investigation. In this paper, we study the problem of resource allocation in a MEC-enabled blockchain network, and design a novel contract-based incentive mechanism to motivate the MEC service providers (SPs) to provide computing services to blockchain miners. Numerical results demonstrate that the proposed mechanism can improve the payoffs of miners and SPs. Besides, we also analyzed the impact of changes in the number of miners and SPs on network performance based on experimental results, aiming to provide some suggestions to construct efficient resources trading networks.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6143-6156"},"PeriodicalIF":6.7,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Profit-Maximizing Service Function Chain Embedding in NFV-Based 5G Core Networks","authors":"Zhenke Chen;He Li;Kaoru Ota;Mianxiong Dong","doi":"10.1109/TNSE.2024.3454759","DOIUrl":"10.1109/TNSE.2024.3454759","url":null,"abstract":"Network Function Virtualization (NFV) is a promising technology to make 5G networks more flexible and cost-efficient. With NFV, a 5G network service is implemented as several Virtual Network Functions (VNFs) that run on general machines, called a Service Function Chain (SFC). A recent survey has revealed that when multiple VNFs are colocated in the same machine, contention for shared physical resources will occur and hence degrade the throughput of a VNF and finally increase its processing delays by 50%, as compared to it runs in isolation. However, prior works fail to capture this important characteristic because they simply treat machines as a resource pool without any resource contention happening, making their approach inapplicable to the SFC embedding problem when resource contention is taken into consideration. To bridge that gap, in this paper, we study a contention-aware QoS-guaranteed SFC embedding problem and formulate it as an Integer Non-Linear Programming (INLP) under a couple of constraints. Given the formulated problem is challenging to solve due to high complexity, we propose a low-complexity approach, which can achieve a near-optimal result in a reasonable time. Numerical results reveal that the proposed approach has advantages in profit, delay, and execution time compared with other state-of-the-art approaches.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6105-6117"},"PeriodicalIF":6.7,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142191974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Communication Topology Reconstruction for a Three-Dimensional Persistent Formation With Fault Constraint","authors":"Guoqiang Wang;He Luo;Xiaoxuan Hu","doi":"10.1109/TNSE.2024.3457489","DOIUrl":"10.1109/TNSE.2024.3457489","url":null,"abstract":"The aim of communication topology reconstruction of a persistent formation with fault constraint is to reconstruct the communication topology in a timely manner in the case of a fault to ensure that the agents continue to maintain the formation shape and to minimize the communication energy consumption among agents. The formation communication cost of solutions obtained by existing algorithms is high, and their calculation time is long. To address this problem, a novel communication topology reconstruction algorithm for persistent formations in three-dimensional space is proposed based on arc addition and path reversal operations. Then, the correctness of the algorithm is proved theoretically, and its scalability for two-dimensional space is also analyzed. Finally, its effectiveness is verified through numerical experiments. Compared with existing algorithms, its advantages regarding solution quality and calculation time increase with the increase in the number of agents and the proportion of link loss in the faults.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6574-6588"},"PeriodicalIF":6.7,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142191976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Geometry-Based Data-Driven Complete Stealthy Attacks Against Cyber-Physical Systems","authors":"Kaiyu Wang;Dan Ye","doi":"10.1109/TNSE.2024.3458095","DOIUrl":"10.1109/TNSE.2024.3458095","url":null,"abstract":"This paper proposes a data-driven complete stealthy attack strategy against cyber-physical systems (CPSs) based on the geometric approach. The attacker aims to degrade estimation performance and maintain stealthiness by compromising partial communication links of the actuator and sensor. Different from the classic analysis methods that require accurate model parameters, we focus on how to establish the connection between geometry and data-driven approaches to represent the malicious behavior of attacks on state estimation. First of all, the existence of complete stealthy attacks is analyzed. Then, the maximal attached stealthy subspace and the set of estimation errors under complete stealthy attacks are analyzed intuitively from the geometric point of view. On this basis, the complete stealthy subspace is constructed with the subspace identification method, which is applied to generate the corresponding stealthy attack sequence through the collected system input-output data. Finally, simulation results are provided to illustrate the effectiveness of the proposed strategies.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"5839-5849"},"PeriodicalIF":6.7,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142191978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hide and Recognize Your Privacy Image","authors":"Zhiying Zhu;Hang Zhou;Haoqi Hu;Qingchao Jiang;Zhenxing Qian;Xinpeng Zhang","doi":"10.1109/TNSE.2024.3456103","DOIUrl":"10.1109/TNSE.2024.3456103","url":null,"abstract":"Recent studies have demonstrated that deep neural networks show excellent performance in information hiding. Considering the tremendous progress that deep learning has made in image recognition, we explore whether neural networks can recognize invisible private images hidden in cover images. In this article, we propose a method for image recognition in the covert domain using neural networks. Our target is to hide an image inside another image with minimal visual quality loss, while at the same time, the hidden image can be recognized correctly without being recovered. In the proposed system, the hiding and recognition of secret images are all performed by neural networks. The hiding network and the recognition network are designed to specifically work as a pair. We design and jointly train preparation, hiding, and recognition networks, where given a cover and a secret image, the preparation network reduces redundant information of the secret image, the hiding network produces a stego image that is visually indistinguishable from the cover image, and the PSNR and SSIM reach 38.5 dB and 0.991 on the MNIST & CIFAR-10 dataset and 41.8 dB and 0.995 on the CelebA & Scene dataset, respectively. The recognition network can correctly identify the secret image inside the stego image which reaches 98.3% recognition accuracy on MNIST dataset and 91.6% recognition accuracy on CelebA dataset in the covert domain, less than 1% recognition decrease compared with direct recognition. In summary, our approach can successfully identify the secret image without revealing its content. Across various datasets, both the classification accuracy and the invisibility of private images are consistently satisfactory.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6130-6142"},"PeriodicalIF":6.7,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142191979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Higher-Order Rewiring Strategy for Enhancing Robustness of Multiplex Aviation Networks","authors":"Dongming Fan;Meng Liu;Xingshuo Hai;Yi Ren;Qiang Feng","doi":"10.1109/TNSE.2024.3422471","DOIUrl":"10.1109/TNSE.2024.3422471","url":null,"abstract":"Aviation networks consist of networks of flight services provided by numerous airlines and are represented in the form of multiplex networks composed of a set of nodes, multiple layers of links, and coupling node relationships across all layers. However, multiplex aviation networks (MANs) are vulnerable to disturbances due to potential cascading failures. Thus, the robustness of MANs must be maintained. Previous studies on the robustness of MANs have mainly focused on the pairwise interactions between two nodes, which are insufficient for characterizing the dynamic processes of actual MANs. In addition, current cascading failure models are not adequate for MANs, as flow must be redistributed within multiplex networks rather than to nearby airports. To solve these issues, this study developed a topology model of MANs and introduced a model of node congestion to simulate the cascading failure process. Given the robustness assessment of MANs under intentional attacks, numerous analyses of higher-order interactions in networks are conducted. A higher-order cycle structure rewiring strategy is proposed to enhance the dynamic interaction among the layers and further improve the robustness of the MANs. Extensive experiments on synthetic and actual EU-Air multiplex networks are presented to illustrate the superiority of the proposed approach over state-of-the-art algorithms in improving the robustness of MANs.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6417-6430"},"PeriodicalIF":6.7,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142191981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jing Zhang;Zichen Pan;Jie Cui;Hong Zhong;Jiaxin Li;Debiao He
{"title":"Toward Open-Set Intrusion Detection in VANETs: An Efficient Meta-Recognition Approach","authors":"Jing Zhang;Zichen Pan;Jie Cui;Hong Zhong;Jiaxin Li;Debiao He","doi":"10.1109/TNSE.2024.3459087","DOIUrl":"10.1109/TNSE.2024.3459087","url":null,"abstract":"Vehicular intrusion detection systems (IDS) are crucial to ensure the security of vehicular ad hoc networks (VANETs). However, most current IDS for vehicles have been developed using closed datasets, resulting in a limited detection range. Furthermore, in the real world, updates to IDS often fall behind the emergence of novel and unknown attacks, rendering these systems ineffective in defending against such attacks. To overcome this limitation and protect against network attacks in open scenarios, we propose a novel vehicular intrusion detection method that uses meta-recognition. This method utilizes a new neural network to extract joint features and calibrate the predicted values of a pre-trained model via extreme value theory (EVT). In addition, to adapt to the VANETs environment, we introduce temperature scaling and tail separation sampling methods to enhance the modeling effect and increase the prediction accuracy. Comprehensive experiments indicated that the proposed method can detect known attacks at a fine-grained level, identify unknown attacks, and outperform the current state-of-the-art schemes.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6589-6604"},"PeriodicalIF":6.7,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142191980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhi Lian;Peng Shi;Chee Peng Lim;Imre J. Rudas;Ramesh K. Agarwal
{"title":"Hybrid Stealthy Attacks on Stochastic Event-Based Remote Estimation Under Packet Dropouts","authors":"Zhi Lian;Peng Shi;Chee Peng Lim;Imre J. Rudas;Ramesh K. Agarwal","doi":"10.1109/TNSE.2024.3457911","DOIUrl":"10.1109/TNSE.2024.3457911","url":null,"abstract":"Security related issues of cyber-physical systems are important and interesting from the perspectives of both attackers and defenders. In this paper, we design a stochastic event-based stealthy hybrid attack scheme for remote state estimation in the event of packet dropouts. The objective of the attacker is to maximize the performance degradation while remaining stealthy. Firstly, attack stealthiness is characterized based on the probability distribution and transmission rate. With the stealthiness constraints, an innovation-based stealthy attack model is designed under the assumption that attackers can intercept and modify the measurement innovations. Then, an optimal hybrid attack technique is proposed to maximize the estimation error. With the developed attack strategy, attackers can launch hybrid attacks, including denial-of-service attacks and/or false data injection attacks, to block the network communication channel and compromise the transmitted measurements, therefore degrading and even destroying the system performance. Verification examples are given to illustrate the effectiveness of the attack design performance.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"5829-5838"},"PeriodicalIF":6.7,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142191982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}