Anurag Srivastava

Md Touhiduzzaman, Adam Hahn, Anurag Srivastava

Growing cybersecurity risks in the power grid require that utilities implement a variety of security mechanism (SM) composed mostly of VPNs, firewalls, or other custom security components. While they provide some protection, they might contain software vulnerabilities which can lead to a cyber-attack. In this paper, the severity of a cyber-attack has been decreased by employing a diverse set of SM that reduce repetition of a single vulnerability. This paper focuses on the allocation of diverse SM and tries to increase the security of the cyber assets located within the electronic security perimeter(ESP) of a substation. We have used a graph-based coloring game in a distributed manner to allocate diverse SM for protecting the cyber assets. The vulnerability assessment for power grid network is also analyzed using this game theoretic method. An improved, diversified SMs for worst-case scenario has been demonstrated by reaching the Nash equilibrium of graph coloring game. As a case study, we analyze the IEEE-14 and IEEE-118 bus system, observe the different distributed coloring algorithm for allocating diverse SM and calculating the overall network criticality.

Anshul Verma, Anurag Srivastava

In opportunistic networks the existence of a simultaneous path is not assumed to transmit a message between a sender and a receiver. Information about the context in which the users communicate is a key piece of knowledge to design efficient routing protocols in opportunistic networks. But this kind of information is not always available. When users are very isolated, context information cannot be distributed, and cannot be used for taking efficient routing decisions. In such cases, context oblivious based schemes are only way to enable communication between users. As soon as users become more social, context data spreads in the network, and context based routing becomes an efficient solution. In this paper we design an integrated routing protocol that is able to use context data as soon as it becomes available and falls back to dissemination based routing when context information is not available. Then, we provide a comparison between Epidemic and PROPHET, these are representative of context oblivious and context aware routing protocols. Our results show that integrated routing protocol is able to provide better result in term of message delivery probability and message delay in both cases when context information about users is available or not.