Wireless sensor networks, as a multi-hop self-organized network system formed by wireless communication, are vulnerable to malware diffusion by breaking the data confidentiality and service availability, owing to their low configuration and weak defense mechanism. To reveal the rules of malware diffusion in the really deployed wireless sensor networks, we propose a model called Malware Diffusion Based on Cellular Automaton to describe the dynamics of malware diffusion based on cellular automaton. According to the model, we first analyze and obtain the differential equations, which can reflect the various state dynamics of sensor nodes with cellular automaton. Then, we attain the equilibrium points of the model Malware Diffusion Based on Cellular Automaton to determine the threshold for whether malware will diffuse or die out in wireless sensor networks. Furthermore, we compute the basic regeneration number of the model Malware Diffusion Based on Cellular Automaton using the next-generation matrix and prove the stability of the equilibrium points. Finally, via experimental simulation, we verify the effectiveness of the model Malware Diffusion Based on Cellular Automaton, which can provide administrators with the theoretical guidance on suppressing malware diffusion in wireless sensor networks.
3 January 2019 in Wireless Communications and Mobile Computing
The Narrowband Internet of Things (NB-IoT) is a main stream technology based on mobile communication system. The combination of NB-IoT and WSNs can active the application of WSNs. In order to evaluate the influence of node heterogeneity on malware propagation in NB-IoT based Heterogeneous Wireless Sensor Networks, we propose a node heterogeneity model based on node distribution and vulnerability differences, which can be used to analyze the availability of nodes. We then establish the node state transition model by epidemic theory and Markov chain. Further, we obtain the dynamic equations of the transition between nodes and the calculation formula of node availability. The simulation result is that when the degree of node is small and the node vulnerability function is a power function, the node availability is the highest; when the degree of node is large and the node vulnerability function satisfies the exponential function and the power function, the node availability is high. Therefore, when constructing a NBIOT-HWSNs network, node protection is implemented according to the degree of node, so that when the node vulnerability function satisfies the power function, all nodes can maintain high availability, thus making the entire network more stable.
25 December 2018 in International Journal of Distributed Sensor Networks
NB-IoT (Narrowband Internet of Things), as a part of new-generation cellular communication technology, leads an innovation in wireless sensor networks. It pushes wireless sensor networks to be applied in more application fields. NB-IoT Release 14 has got the ability of positioning from cellular network service. To solve the positioning problem of new wireless sensor networks based on NB-IoT, instead of static three-point measuring way DV-HOP (distance vector hop), NB-IoT connecting point node is deployed to work as an anchor node that moves among three different places and receives signals from all other unknown nodes in the cluster. Based on the DV-HOP algorithm, in this article a topological structure for new-generation wireless sensor networks is built and the NBIOT-DVHOP mechanism combining the NB-IoT cellular network positioning ability and the DV-HOP algorithm is proposed. According to the simulation on the MATLAB platform, the effectiveness of this mechanism is verified and the deviation rate of each point from the relative position is presented. The deviation rate is related to the communication radius and the numbers of unknown nodes and anchor nodes. The simulation results can support the next step of research in NB-IoT-based wireless sensor networks, especially in data collection and fast positioning of unknown sensor nodes.
11 September 2019 in International Journal of Distributed Sensor Networks
In mobile ad hoc networks, network nodes accomplish a target task usually by cooperative packet forwarding from the source to the destination. It is a challenge to enforce their mutual cooperation for a node’s self-interest. In this article, we focus on cooperative packet forwarding in a one-hop unreliable channel, which leads to packet loss and retransmission. We model the process of packet forwarding with the nodes’ remaining energy and reputation value. We propose a packet-forwarding non-cooperative game model reflecting the utilities of different packet-forwarding strategies, in which an incentive mechanism is introduced to enforce cooperation of packet forwarding. Furthermore, we analyze the packet-forwarding game with replicator dynamics and derive and prove three theorems. If the conditions of the theorems are met, the evolutionarily stable strategies can be attained. Three inferences also reveal how convergence speed to evolutionarily stable states is affected by the cooperative incentive, the probability of successful packet transmissions, and the upper limit of the retransmission number. The simulation results support the proposed theorems and inferences. In addition, we show that our game model with a reputation value and the mechanism of incentive cooperation can improve the probability of successful packet transmissions, and reduce the network overhead.
1 December 2025 in Studies in the Education of Adults