IEEE Transactions on Network Science and Engineering最新文献_第3页

Distributed Multi-Coalition Games With General Linear Systems Over Markovian Switching Networks 马尔可夫交换网络上带有一般线性系统的分布式多联盟游戏

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-09-25 DOI: 10.1109/TNSE.2024.3464628

Shuai Liu;Dong Wang;Zheng-Guang Wu

{"title":"Distributed Multi-Coalition Games With General Linear Systems Over Markovian Switching Networks","authors":"Shuai Liu;Dong Wang;Zheng-Guang Wu","doi":"10.1109/TNSE.2024.3464628","DOIUrl":"https://doi.org/10.1109/TNSE.2024.3464628","url":null,"abstract":"In this paper, the multi-coalition game problem with incomplete information over Markovian switching networks is investigated. Each heterogeneous player involved in the problem is driven by a general linear dynamic and shares information by exploiting the randomly evolving network. All players intend to minimize the cost function of their coalition while achieving output action consensus inside the coalition. Regarding this, we develop a distributed multi-coalition game algorithm based on the proportional-integral dynamic consensus protocol. With graph theory, stochastic processes, and the stability principle, the algorithm is proven to converge exponentially to the Nash equilibrium solution, and the effect of gain parameters on the convergence rate is revealed. In addition, motivated by concerns about typical scenarios in which transition probabilities are inaccessible and the demands of the time-limited task, the discussion is extended to cases including Markovian switching networks with partly unknown transition probabilities and the formulation of a distributed predefined time scheme. Then, the corresponding analytical results are given, respectively. Finally, the effectiveness of the proposed algorithm is verified by numerical simulations.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6157-6168"},"PeriodicalIF":6.7,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142679253","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}

引用次数: 0

A Seed Growth Algorithm for Local Clustering in Complex Networks 复杂网络中局部聚类的种子增长算法

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-09-19 DOI: 10.1109/TNSE.2024.3463639

Feng-Sheng Tsai;Sheng-Yi Hsu;Mau-Hsiang Shih

{"title":"A Seed Growth Algorithm for Local Clustering in Complex Networks","authors":"Feng-Sheng Tsai;Sheng-Yi Hsu;Mau-Hsiang Shih","doi":"10.1109/TNSE.2024.3463639","DOIUrl":"https://doi.org/10.1109/TNSE.2024.3463639","url":null,"abstract":"A seed growth algorithm based on a local connectivity rule for cluster formation in complex networks is introduced. That accompanies with the cluster normalization algorithm, the parameter determination process, and the pseudocluster inference process, forming the coherent algorithms and formalizing the categories within the realm of the cluster space. The prime clusters can be extracted from the cluster space, so that the overlapping complexity of clusters is confined to the prime clusters. To decide unequivocally whether the coherent algorithms are efficient, we have to simulate on the overlapping stochastic block networks. Our simulation shows that the dice coefficient of the prime cluster corresponding to the overlapping target cluster is 0.978± 0.024 on average. It decodes the underlying meaning that the coherent algorithms can efficiently search out the prime clusters containing almost the same nodes as the overlapping clusters. It provides a firm foundation for a simulation on the \u0000<italic>Caenorhabditis elegans</i>\u0000 neuronal network, unraveling the neurons DD04, PDB, VA08, VB06, VB07, VD07, and VD08 lying in the major overlap of clusters, among them the ablation of DD04 and PDB in biological experiments has shown to result in a pronounced loss of controllability of motor behavior.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"5878-5891"},"PeriodicalIF":6.7,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142694655","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}

引用次数: 0

Graph Anomaly Detection via Multi-View Discriminative Awareness Learning 通过多视图判别认知学习进行图异常检测

IF 6.6 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-09-17 DOI: 10.1109/tnse.2024.3462462

Jie Lian, Xuzheng Wang, Xincan Lin, Zhihao Wu, Shiping Wang, Wenzhong Guo

引用次数: 0

Saturated Distributed Centroid Tracking Control of Cluster Formation and Its Application to VTOL AAVs 集群形成的饱和分布式中心点跟踪控制及其在 VTOL 无人机中的应用

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-09-17 DOI: 10.1109/TNSE.2024.3461858

Jingyuan Wang;Wei Wang;Yao Zou;Xiuyu He

{"title":"Saturated Distributed Centroid Tracking Control of Cluster Formation and Its Application to VTOL AAVs","authors":"Jingyuan Wang;Wei Wang;Yao Zou;Xiuyu He","doi":"10.1109/TNSE.2024.3461858","DOIUrl":"10.1109/TNSE.2024.3461858","url":null,"abstract":"To improve flexibility and adaptability of the multi-agent formation, this paper studies the centroid tracking problem of cluster formation. In particular, a team of agents are separated into multiple clusters, and the clustered agents are coordinated such that i) each cluster forms a prescribed configuration, ii) all the cluster centroids form another prescribed configuration, and iii) the centroid of the whole team tracks a reference trajectory. The agents are characterized by second-order dynamics. In addition, heterogenous input saturation levels are considered into the multi-agent system. A saturated distributed control algorithm resorting to three distributed observers is proposed. The first two distributed observers with proper initial conditions enable each agent to accurately obtain the centroid of its corresponding cluster and that of the whole team. And the third distributed observer helps each agent get the accurate reference acceleration information. It is demonstrated that the proposed saturated distributed control algorithm guarantees the accomplishment of the centroid tracking objective of cluster formation. Besides, we apply the proposed saturated distributed control algorithm to the clustered VTOL AAV formation. Simulation results finally verify the effectiveness of the proposed saturated distributed control algorithm.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"5850-5862"},"PeriodicalIF":6.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257894","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}

引用次数: 0

Energy-Minimization Resource Allocation for FD-NOMA Enabled Integrated Sensing, Communication, and Computation in PIoT PIoT 中支持 FD-NOMA 的集成传感、通信和计算的能量最小化资源分配

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-09-17 DOI: 10.1109/TNSE.2024.3462602

Xiaobo Liu;Xinru Wang;Xiongwen Zhao;Fei Du;Yu Zhang;Zihao Fu;Jing Jiang;Peizhe Xin

{"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}

引用次数: 0

Augmenting Backpressure Scheduling and Routing for Wireless Computing Networks 增强无线计算网络的背压调度和路由选择

IF 6.6 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-09-13 DOI: 10.1109/tnse.2024.3460479

KM Mahfujul, Kaige Qu, Qiang Ye, Ning Lu

引用次数: 0

Contract-Based Incentive Design for Resource Allocation in Edge Computing-Based Blockchain 基于边缘计算的区块链资源分配的合约激励设计

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-09-13 DOI: 10.1109/TNSE.2024.3457888

Ziqing Yu;Zheng Chang;Li Wang;Geyong Min

{"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}

引用次数: 0

Profit-Maximizing Service Function Chain Embedding in NFV-Based 5G Core Networks 在基于 NFV 的 5G 核心网络中嵌入利润最大化的服务功能链

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-09-12 DOI: 10.1109/TNSE.2024.3454759

Zhenke Chen;He Li;Kaoru Ota;Mianxiong Dong

{"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}

引用次数: 0

Communication Topology Reconstruction for a Three-Dimensional Persistent Formation with Fault Constraint 带断层约束的三维持久性阵型的通信拓扑重构

IF 6.6 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-09-12 DOI: 10.1109/tnse.2024.3457489

Guoqiang Wang, He Luo, Xiaoxuan Hu

引用次数: 0

Geometry-Based Data-Driven Complete Stealthy Attacks Against Cyber-Physical Systems 针对网络物理系统的基于几何的数据驱动型完整隐形攻击

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-09-12 DOI: 10.1109/TNSE.2024.3458095

Kaiyu Wang;Dan Ye

引用次数: 0