Pub Date : 2024-09-24DOI: 10.1109/TNSE.2024.3466997
Lianghao Ji;Yuhe Dou;Cuijuan Zhang;Huaqing Li
The communication networks of smart grids are often influenced by ubiquitous uncertainty. These uncertainties can directly influence the communication weights between generating units, consequently degrading the performance of economic dispatch (ED) algorithms. Despite this, much of the related work has been centered on ideal communication channels, thereby overlooking the impact of communication uncertainties. Consequently, this paper primarily delves into the economic dispatch problem (EDP) in smart grids with uncertain communication networks. Initially, we propose an adaptive algorithm grounded on an event-triggered strategy. This algorithm can effectively offset the communication uncertainties within a predefined upper limit, thereby facilitating optimal power allocation. Subsequently, we introduced a new self-triggered strategy. This strategy eliminates the need for continuous monitoring of neighboring statuses, leading to a reduction in controller updates and message transmissions, without negatively affecting the system's convergence performance. However, the effectiveness of the self-triggered strategy might be influenced by the accuracy of generator predictions. Finally, simulations demonstrate that the proposed approach effectively mitigates the impact of communication uncertainties on ED performance while reducing communication overhead.
智能电网的通信网络经常受到无处不在的不确定性的影响。这些不确定性会直接影响发电机组之间的通信权重，从而降低经济调度（ED）算法的性能。尽管如此，大部分相关工作都以理想通信通道为中心，从而忽略了通信不确定性的影响。因此，本文主要研究具有不确定通信网络的智能电网中的经济调度问题（EDP）。首先，我们提出了一种基于事件触发策略的自适应算法。该算法能在预定的上限内有效抵消通信不确定性，从而促进电力的优化分配。随后，我们引入了一种新的自触发策略。这种策略无需持续监控相邻设备的状态，从而减少了控制器更新和信息传输，同时不会对系统的收敛性能产生负面影响。不过，自触发策略的有效性可能会受到发电机预测准确性的影响。最后，模拟结果表明，所提出的方法在减少通信开销的同时，有效地减轻了通信不确定性对 ED 性能的影响。
{"title":"Self-Triggered Consensus-Based Strategy for Economic Dispatch in Uncertain Communication Networks","authors":"Lianghao Ji;Yuhe Dou;Cuijuan Zhang;Huaqing Li","doi":"10.1109/TNSE.2024.3466997","DOIUrl":"https://doi.org/10.1109/TNSE.2024.3466997","url":null,"abstract":"The communication networks of smart grids are often influenced by ubiquitous uncertainty. These uncertainties can directly influence the communication weights between generating units, consequently degrading the performance of economic dispatch (ED) algorithms. Despite this, much of the related work has been centered on ideal communication channels, thereby overlooking the impact of communication uncertainties. Consequently, this paper primarily delves into the economic dispatch problem (EDP) in smart grids with uncertain communication networks. Initially, we propose an adaptive algorithm grounded on an event-triggered strategy. This algorithm can effectively offset the communication uncertainties within a predefined upper limit, thereby facilitating optimal power allocation. Subsequently, we introduced a new self-triggered strategy. This strategy eliminates the need for continuous monitoring of neighboring statuses, leading to a reduction in controller updates and message transmissions, without negatively affecting the system's convergence performance. However, the effectiveness of the self-triggered strategy might be influenced by the accuracy of generator predictions. Finally, simulations demonstrate that the proposed approach effectively mitigates the impact of communication uncertainties on ED performance while reducing communication overhead.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6652-6663"},"PeriodicalIF":6.7,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142713858","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}
Pub Date : 2024-09-19DOI: 10.1109/TNSE.2024.3464852
Qiulin Xu;Hideaki Ishii
This paper studies novel epidemic spreading problems influenced by opinion evolution in social networks, where the opinions reflect the public health concerns. A coupled bilayer network is proposed, where the epidemics spread over several communities through a physical network layer while the opinions evolve over the same communities through a social network layer. The epidemic spreading process is described by a susceptible-infected-vigilant (SIV) model, which introduces opinion-dependent epidemic vigilance state compared with the classical epidemic models. The opinion process is modeled by a polar opinion dynamics model, which includes infection prevalence and human stubbornness into the opinion evolution. By introducing an opinion-dependent reproduction number, we analyze the stability of disease-free and endemic equilibria and derive sufficient conditions for their global asymptotic stability. We also discuss the mutual effects between epidemic eradication and opinion consensus, and the possibility of suppressing the epidemic spreading by intervening in the opinions or implementing public health strategies. Simulations are conducted to verify the theoretical results and demonstrate the feasibility of epidemic suppression.
{"title":"On a Discrete-Time Networked SIV Epidemic Model With Polar Opinion Dynamics","authors":"Qiulin Xu;Hideaki Ishii","doi":"10.1109/TNSE.2024.3464852","DOIUrl":"https://doi.org/10.1109/TNSE.2024.3464852","url":null,"abstract":"This paper studies novel epidemic spreading problems influenced by opinion evolution in social networks, where the opinions reflect the public health concerns. A coupled bilayer network is proposed, where the epidemics spread over several communities through a physical network layer while the opinions evolve over the same communities through a social network layer. The epidemic spreading process is described by a susceptible-infected-vigilant (SIV) model, which introduces opinion-dependent epidemic vigilance state compared with the classical epidemic models. The opinion process is modeled by a polar opinion dynamics model, which includes infection prevalence and human stubbornness into the opinion evolution. By introducing an opinion-dependent reproduction number, we analyze the stability of disease-free and endemic equilibria and derive sufficient conditions for their global asymptotic stability. We also discuss the mutual effects between epidemic eradication and opinion consensus, and the possibility of suppressing the epidemic spreading by intervening in the opinions or implementing public health strategies. Simulations are conducted to verify the theoretical results and demonstrate the feasibility of epidemic suppression.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6636-6651"},"PeriodicalIF":6.7,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10684542","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142713759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-19DOI: 10.1109/TNSE.2024.3463639
Feng-Sheng Tsai;Sheng-Yi Hsu;Mau-Hsiang Shih
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 Caenorhabditis elegans 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.
{"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}
Pub Date : 2024-09-17DOI: 10.1109/TNSE.2024.3461858
Jingyuan Wang;Wei Wang;Yao Zou;Xiuyu He
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.
{"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}
Pub Date : 2024-09-17DOI: 10.1109/TNSE.2024.3462462
Jie Lian;Xuzheng Wang;Xincan Lin;Zhihao Wu;Shiping Wang;Wenzhong Guo
With the deeper research on attributed networks, graph anomaly detection is becoming an increasingly important topic. It aims to identify patterns deviating from a majority of nodes. Currently, graph anomaly detection algorithms based on reconstruction-based learning and contrastive-based learning have gained significant attention. To harness diverse supervised signals, an intuitive approach is to find an elegant strategy to fuse these two paradigms, forming the hybrid learning paradigm. Despite the success of the hybrid learning paradigm, due to its subgraph sampling based approach, it still grapples with issues related to unreliable neighborhood information and the neglect of topological details. To address these limitations, this paper proposes a new hybrid learning paradigm via multi-view discriminative awareness learning for graph anomaly detection. Unlike the previous hybrid learning paradigm, the graph reconstruction module fully incorporates attribute and topology information, enhancing the comprehensiveness of data reconstruction. Moreover, the multi-view discrimination module employs a view-level contrast method based on the complete graph, which helps to comprehensively extract the information in the attributed network and mitigates the neighborhood unreliability without increasing the complexity. The experimental results, obtained from a rigorous evaluation on six benchmark datasets, demonstrate the effectiveness of the proposed method compared to existing baseline methods.
{"title":"Graph Anomaly Detection via Multi-View Discriminative Awareness Learning","authors":"Jie Lian;Xuzheng Wang;Xincan Lin;Zhihao Wu;Shiping Wang;Wenzhong Guo","doi":"10.1109/TNSE.2024.3462462","DOIUrl":"10.1109/TNSE.2024.3462462","url":null,"abstract":"With the deeper research on attributed networks, graph anomaly detection is becoming an increasingly important topic. It aims to identify patterns deviating from a majority of nodes. Currently, graph anomaly detection algorithms based on reconstruction-based learning and contrastive-based learning have gained significant attention. To harness diverse supervised signals, an intuitive approach is to find an elegant strategy to fuse these two paradigms, forming the hybrid learning paradigm. Despite the success of the hybrid learning paradigm, due to its subgraph sampling based approach, it still grapples with issues related to unreliable neighborhood information and the neglect of topological details. To address these limitations, this paper proposes a new hybrid learning paradigm via multi-view discriminative awareness learning for graph anomaly detection. Unlike the previous hybrid learning paradigm, the graph reconstruction module fully incorporates attribute and topology information, enhancing the comprehensiveness of data reconstruction. Moreover, the multi-view discrimination module employs a view-level contrast method based on the complete graph, which helps to comprehensively extract the information in the attributed network and mitigates the neighborhood unreliability without increasing the complexity. The experimental results, obtained from a rigorous evaluation on six benchmark datasets, demonstrate the effectiveness of the proposed method compared to existing baseline methods.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6623-6635"},"PeriodicalIF":6.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257893","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}
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.
{"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}
Pub Date : 2024-09-13DOI: 10.1109/TNSE.2024.3460479
KM Mahfujul;Kaige Qu;Qiang Ye;Ning Lu
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.
{"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}
Pub Date : 2024-09-13DOI: 10.1109/TNSE.2024.3457888
Ziqing Yu;Zheng Chang;Li Wang;Geyong Min
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.
{"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}
Pub Date : 2024-09-12DOI: 10.1109/TNSE.2024.3457489
Guoqiang Wang;He Luo;Xiaoxuan Hu
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.
{"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}
Pub Date : 2024-09-12DOI: 10.1109/TNSE.2024.3454759
Zhenke Chen;He Li;Kaoru Ota;Mianxiong Dong
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：