Impact Of Malicious Nodes Research Articles

SDSWSN—A Secure Approach for a Hop-Based Localization Algorithm Using a Digital Signature in the Wireless Sensor Network

Localization and security are among the most dominant tasks of wireless sensor networks (WSN). For applications containing sensitive information on the location parameters of the event, secure localization is mandatory and must not be compromised at any cost. The main task, as if any node is malicious, is to authenticate nodes that are involved in the localization process. In this paper, we propose a secure hop-based algorithm that provides a better localization accuracy. In addition, to maintain the security of the localization process, the digital signature approach is used. Moreover, the impact of malicious nodes on the proposed scheme has also been observed. The proposed approach is also contrasted with the basic DV-Hop and improved DV-Hop based on error correction. From the simulation outcomes, we infer that this secure digital-signature-based localization strategy is quite robust against any node compromise attacks, thereby boosting its precision. Comparisons between the proposed algorithm and the state of the art were made on the grounds of different parameters such as the node quantity, ratio of anchor nodes, and range value towards the localization error.

The impact of malicious nodes on the spreading of false information.

Increasing empirical evidence in recent years has shown that bots or malicious users in a social network play a critical role in the propagation of false information, while a theoretical modeling of such a problem has been largely ignored. In this paper, applying a simple contagion model, we study the effect of malicious nodes on the spreading of false information by incorporating the smart nodes who perform better than normal nodes in discerning false information. The malicious nodes, however, will always repost (or adopt) the false message as long as they receive it. We show analytically that, for a random distribution of malicious nodes, there is a critical number of malicious nodes above which the false information could outbreak in a random network. We further study three different distribution strategies of selecting malicious nodes for false information spreading. We find that malicious nodes that have large degrees, or are tightly connected, can enhance the spread. However, when they are close to the smart nodes, the spreading of false information can either be promoted or inhibited, depending on the network structure.

Impact of Malicious Nodes under Different Route Refresh Intervals in Ad Hoc Network

Problem statement: Ad hoc networks are formed dynamically by group of mobile devices co operating with each other. Intermediate nodes be tween source and destination act as routers so that source node can communicate with the destination node even if it is out radio range and thus eliminating the necessity of infrastructure. Co ope ration of nodes is a very important feature for the successful deployment of Ad hoc networks. The inter mediate nodes should not only be involved in the route discovery process but also should be involved in the re transmission of packets as an intermedia te between source and destination. Approach: Since nodes have to be co operative for successful deployment of Ad hoc networks, the security mechanisms cannot afforded to be stringent which enables malicious nodes to successfully attack the network. The capability of optimized link state routing protocol has been studied extensively for d ifferent types of ad hoc networks and has been proved to behave somewhere in between pro active and reactive routing protocols. Results: In this study we investigate the impact of malicious nodes on the Optimized Link State Routing (OLSR) protocol under different hello intervals which affe cts the route discovery process and subsequently investigate the degradation of Quality Of Service ( QOS). Conclusion: It is observed that the throughput deteriorates when the network is attacke d by malicious nodes which selectively retransmit data to some of the destinations. The performance d egradation increases as the hello interval time is set beyond 4 sec. Higher hello interval decreases the c ontrol packet overheads. It is observed that even with higher hello intervals the network performance is much better than an attack by small group of malicious nodes.

Information Sharing in Vehicular AdHoc Network

Relevance Technique broadcast the useful information and removes the redundant data. 802.11e protocol implementation has certain flaws and is not suitable for VANETs scenarios. Main issue in 802.11e protocol is internal sorting of packets, no priority mechanism within the queues and often lower priority traffic get more medium than high priority traffic. In this paper, the mathematical model of relevance scheme is enhanced so that it can consider the network control in real scenario by considering the impact of malicious node in network. Problems of 802.11e protocol can be resolved by making virtual queue at application level. We analyze the comparison of simple virtual queue with the over all impact of virtual queue and mathematical model. Similarly we compare the mathematical model with over all impact of virtual queue and modified mathematical model using NS-2 simulator.