With the development of information networks, information diffusion becomes increasingly complicated in social networks, and the influence from different neighbors presents asymmetry. Evolutionary Game Theory (EGT), which orients the human interaction from the perspective of economics, has been widely concerned. We establish a collaborative evolution model of public opinion information and views based on dynamic evolutionary games of social networks and the underlying asymmetry relationship. In addition, the coupling mechanism of behavior and viewpoints is adopted to study the coupling evolution of the group behavior and viewpoint. Some interesting and valuable results about evolution of the behavior and viewpoints are shown.
Low Earth orbit (LEO) satellite network can provide the seamlessly global coverage and relatively low propagation delay, which has been envisioned as a key component of future sixth generation mobile communication. However, the highly dynamic network topology and quite limited communication and computation resources of LEO satellites, alongside with uneven traffic distribution and demand of ground users impose a severe challenge for the routing algorithm design. To tackle this issue, we propose a ground block division and topology switching routing algorithm with software-hardware separation to handle the frequent uploading network topology and routing tables issue and reduce the computational and communication overheads. Furthermore, we estimate the long-term traffic demand in different ground blocks, and calculate the potential traffic demand for each block, and devise the traffic distribution oriented load balancing routing algorithm (TDOLBRA) to avoid bottleneck links and reduce unnecessary overheads. Moreover, considering different Quality of Service (QoS) requirements of ground users’ traffic, we classify the traffic into high priority traffic and regular traffic, and adopt different routing strategies to further promote the network performance and resources utilization. Simulations results on satellite tool kit and optimized network engineering tool demonstrate that the proposed TDOLBRA scheme can have superior performance over three existing methods. To be specific, our proposed TDOLBRA scheme can achieve the best performance with respect to the fairness index, average traffic per link and packet drop rate $P_{\mathrm { loss}}$ . Especially, compared with three benchmark schemes, $P_{\mathrm { loss}}$ under our scheme is reduced by $3.4\times $ , $7.6\times $ , and $13.2\times $ , respectively, when the total traffic is 18000 packets/min.
This paper focuses on achieving the low-cost coexistence of the networks in an unlicensed spectrum by making them operate on non-overlapping channels. For achieving this goal, we first give a universal convergence analysis framework for the unlicensed spectrum allocation algorithm. Then, a one-timescale iteration-adjustable unlicensed spectrum allocation algorithm is developed, where the step size and timescale parameter can be jointly adjusted based on the system performance requirement and signal overhead concern. After that, we derive the sufficient condition for the one-timescale algorithm. Furthermore, the upper bound of convergence error of the one-timescale spectrum allocation algorithm is obtained. Due to the multi-timescale evolution of the network states in the wireless network, we further propose a two-timescale iteration-adjustable joint frequency selection and frequency allocation algorithm, where the frequency selection iteration timescale is set according to the slow-changing statistical channel state information (CSI), whereas the frequency allocation iteration timescale is set according to the fast-changing local CSI. Then, we derive the convergence condition of two-timescale algorithms and the upper bound of the corresponding convergence error. The experimentalresults show that the small timescale adjustment parameter and large step size can help decrease the convergence error. Moreover, compared with traditional algorithms, the two-timescale policy can achieve throughput similar to traditional algorithms with very low iteration overhead.
12 January 2026 in IEEE Transactions on Communications
This paper focuses on the robust beamforming for space-air-ground integrated networks (SAGIN) under uncertain channel state information (CSI). In SAGIN, uncertain CSI undermines the precise adjustment of beamforming, posing a major challenge to meeting users’ quality of service (QoS) requirements. To address this challenge, we first formulate the optimization problem as a quadratic program, which ensures a specified outage probability to maintain QoS. We then propose a multiple kernel-based machine learning method to model the uncertain CSI as an asymmetric convex polyhedron set. Leveraging semidefinite relaxation, the quadratic objective function is transformed into a linear function composed of beamforming matrix traces. Under the constructed CSI uncertainty set, a general robust transformation method is developed to linearly approximate the original probability constraints. Finally, we reformulate the joint optimization problem as a standard semidefinite program (SDP) and design an adaptive robust strategy to find its optimal solution. Simulation results show that our proposed method outperforms traditional robust and non-robust methods, effectively addressing limitations in existing SAGIN-related research.
2 August 2024 in IEEE Transactions on Vehicular Technology
As the fog-based internet of vehicles (IoV) is equipped with rich perception, computing, communication and storage resources, it provides a new solution for the bulk data processing. However, the impact caused by the mobility of vehicles brings a challenge to the content scheduling and resource allocation of content dissemination service. In this paper, we propose a time-varying resource relationship graph to model the intertwined impact of the perception, computation, communication and storage resources across multiple snapshots on the content dissemination process of IoV. Based on this graph model, the content dissemination process is modeled as a mathematical optimization problem, where the quality of service of both delay tolerant and delay-sensitive services are considered. Owing to its NP-completeness, the optimization problem is decomposed into a joint link and subchannel scheduling subproblem and as well a joint power and flow control subproblem. Then, a cascaded low complexity scheduling algorithm is proposed for the joint link and subchannel scheduling subproblem. Moreover, a robust resource management algorithm is developed for the power and flow control subproblem, where the channel uncertainties in future snapshots are fully considered in the algorithm. Finally, simulation results show that the effectiveness of the proposed approaches outperforms other state-of-art approaches.