An Opinion Evolution Model Based on Heterogeneous Benefit with Malicious Nodes Added

Individuals with different levels of education have substantial differences in their willingness to communicate with malicious nodes in a group; thus, the results of evolution of opinions tend to differ significantly. In this study, malicious nodes, driven by the benefits of a game, were added to groups of individuals with different levels of education, and a theoretical model of the game theory of group opinions that introduces malicious nodes was established. The influence of the proportion of malicious node spreading messages, the extent of tampering when malicious nodes spread messages, and the distribution of education levels in the group on the evolution of group opinions were considered. It was found that the rate of evolution of group opinions declined in groups with higher average education levels. The results of this study can be used to explain the phenomenon of fewer knowledge exchange behaviors in communities with high education levels, as is found in actual sociology. The reason is that highly educated individuals are more affected by distorted news when communicating. Therefore, the loss of communication with malicious nodes is greater, resulting in lower vigilance and willingness to communicate.

Ranking the spreading ability of nodes in network core

Ranking nodes by their spreading ability in complex networks is of vital significance to better understand the network structure and more efficiently spread information. The k-shell decomposition method could identify the most influential nodes, namely network core, with the same ks values regardless to their different spreading influence. In this paper, we present an improved method based on the k-shell decomposition method and closeness centrality (CC) to rank the node spreading influence of the network core. Experiment results on the data from the scientific collaboration network and U.S. aviation network show that the accuracy of the presented method could be increased by 31% and 45% than the one obtained by the degree k, 32% and 31% than the one by the betweenness.

Inscribing in to an Control Attempt against Jammer Attack Using FB Decoding Mechanism

Previously Spread Spectrum (SS) communication involve by setting up preconfigured keys among the communicating nodes that are constrained to possess synchronous behaviour. This extends to several issues creating circular dependency problem, offering less energy efficiency and thereby leading to insecure short-lived communication. In this paper, an opponent resilient secret sharing concept is introduced without any establishment of pre-shared keys by FB (Forward Backward) decoding. It illustrates using time reversed message extraction and key scheduling at receiver side that enables secured transmission over wireless communication even when the receiver node remains inactive and attaining jammer not to obtain the original data sent by the sender node. Spreading the data involves use of DSSS as it would be more compatible in adjusting to multiple bandwidths. Main goal is to transmit the message in such a way that the time required to deliver the secret must be less than the time for the opponent to find key during transmission. Further, it come up with minimal storage overhead, cost effective and sustains long-lived secured communication among the interacting nodes. Evaluation of various parameters is performed using NS-2 toolkit to prove that this newer approach is better than earlier work.