2 August 2022 in IEEE Transactions on Computational Social Systems
Misinformation and rumors can spread rapidly and widely through online social networks, seriously endangering social stability. Therefore, rumor blocking on social networks has become a hot research topic. In the existing research, when users receive two opposing opinions, they tend to believe the one arrives first. In this article, we argue that users will dialectically trust the information based on their own opinions rather than the rule of first-come-first-listen. We propose a confidence-based opinion adoption (CBOA) model, which considers the opinion and confidence according to the traditional linear threshold (LT) model. Based on this model, we propose the directed graph convolutional network (DGCN) method to select the $k$ most influential positive cascade nodes to suppress the propagation of rumors. Finally, we verify our method on four real network datasets. The experimental results show that our method can sufficiently suppress the propagation of rumors and obtains smaller number of rumor nodes than the baseline algorithms.
11 November 2021 in IEEE Transactions on Computational Social Systems
Competitive opinion maximization (COM) in signed social networks targets at selecting a subset of influential individuals (i.e., seed nodes), spreading the desired opinions of the product to their neighbors against its opponents, and eventually achieving the maximum opinion propagation. Current studies mainly focus on competitive influence maximization and opinion maximization. However, COM in signed social networks has not been studied in depth. In this article, we study the COM in signed social networks and propose a novel reinforcement-learning-based opinion maximization framework (RLOM) to solve the COM problem. The proposed RLOM is composed of two phases: the activated dynamic opinion model and the reinforcement-learning-based seeding process. We theoretically prove the COM problem to be NP-hard. To model the opinion propagation process, we propose the activated dynamic opinion model based on a stateless Q-learning approach. Moreover, we propose the reinforcement-learning-based seeding scheme, which is leveraged in an unknown opponent strategy. Experiment results verify the effectiveness of our method in terms of effective opinions on three signed datasets.
4 August 2020 in IEEE Systems Journal
The power consumed by the Internet has been growing sharply in recent years, which accounts for a considerable proportion of the overall power consumption. To reduce high power consumption in the network, numerous proposals on power saving are proposed. Unfortunately, most of them have some side effects, such as load imbalance and even link congestion. Power saving and load balance are two conflicting optimization objectives, and the optimization solutions of them cannot be achieved at the same time. To achieve the desired tradeoff between power saving and load balance, in this article, based on software-defined networking, we first propose a Power-efficient and Load-balanced Online Flow Route framework. Then, we formulate the optimization problem of jointly taking power saving and load balance into account. After proving the problem is NP-hard, we propose the power-efficient and load-balanced flow scheduling algorithm to address it. In addition, we propose a route updating algorithm to enable path updating caused by flow scheduling. Finally, the experimental results demonstrate the proposed algorithm outperforms benchmarks on power saving, load balance, and reduces the possibility of link congestion.
31 December 2020 in IEEE Internet of Things Journal
The energy consumed by data centers has been growing rapidly in recent years. Among all the major contributors to the power consumption of entire data centers, data center network (DCN) can account for up to 20% of the total power consumption. In this article, we first devise a power-efficient software-defined DCN (PESD-DCN) framework, which can achieve desirable power efficiency, avoid potential link congestion, and reduce frequent device state transition. Then, we formulate the optimization problem of maximizing the radio full-utilized devices to all devices. To solve it, we propose correlation-aware flow routing (CFR) algorithm, which leverages correlation-aware flow consolidation (CFC) technique to improve energy efficiency, avoid the potential link congestion, and reduce frequent device state transition. Moreover, to further improve the DCN energy efficiency, we propose flow rerouting, link rate adaptation, and device sleeping (FLD) algorithm. Finally, simulation results demonstrate that PESD-DCN can achieve a good performance. More specifically, in comparison to the other baseline algorithms, PESD-DCN can achieve up to 79.19% energy efficiency, 67.1% decrease in switch state transition (SST), and 55.4% decrease in link state transition (LST).
6 August 2025 in IEEE Transactions on Computational Social Systems
With the continuous development of Internet technology, social networks have provided convenient conditions for information dissemination. The rapid dissemination of information has provided us with great convenience, but some criminals extensively spread rumors based on such convenience, adversely affecting social stability. In this context, two key challenges arise: the survivability of rumors, which refers to their persistence and long-term impact, and the dynamic viewpoint changes of individuals, which influence how rumors spread and diminish over time. This article proposes a dynamic-susceptible-exposed-infected-recovered (DSEIR) rumor propagation model based on human social behavior to solve the spread of rumors problem. This model considers the characteristics of rumors spread in social networks with the Markov chain and makes the simulation more authentic. To suppress rumor propagation, we introduce the concept of rumor survivability and propose a dynamic truth movement blocking strategy, which adapts to people’s evolving viewpoints to curb the influence of rumors effectively. Finally, we analyze the proposed model and blocking strategy in four real networks. The experimental results show that the proposed propagation model can authentically simulate the propagation of rumors in social networks and the proposed blocking strategy efficiently suppresses the rumor propagation. We have released our code here: https://github.com/gf9264/DSEIR.
1 March 2012 in Powder Technology