Pushpita Chatterjee

A Distributed Trust Model for Securing Mobile Ad Hoc Networks

In mobile ad hoc networks, the security enforcement and its implementation becoming increasingly difficult due to quasi-static nature of the mobile nodes (wireless communication devices), no fixed network topology and more importantly absence of centralized authority. In such networks, communication links between nodes may be bandwidth constrained, messages typically roamed in multi-hoped fashion, nodes may be powered by limited energy source and also have limited physical security. The major challenge in such networks is to give a robust security solution. The complexity of the problem is compounded by the fact that both active and passive attackers may present in the system, and nodes may not function properly in order to save its own energy by selective forwarding of the packets. This paper presents a distributed trust based security framework for ad hoc networks. We have proposed a clustering mechanism and security is enforced by local monitoring system by a new kind of nodes referred as guard nodes. This framework stems from cryptographic computation, which is not suitable in this scenario. The trust is computed depending upon some parameters which have a primary role in enforcing security and cooperation between the nodes. Also this solution conforms graceful leave and dynamic secure allocation of IP of the nodes.

A trust enhanced secure clustering framework for wireless ad hoc networks

Secure clustering in Wireless Ad Hoc Networks is a very important issue. Traditional cryptographic solution is useless against threats from internal compromised nodes. In light of this, we propose a novel distributed secure trust aware clustering protocol that provides secure solution for data delivery. A trust model is proposed that computes the trust of a node using self and recommendation evidences of its one-hop neighbors. Therefore, it is lightweight in terms of computational and communication requirements, yet powerful in terms of flexibility in managing trust. In addition, the proposed clustering protocol organizes the network into one-hop disjoint clusters and elects the most qualified, trustworthy node as a Clusterhead. This election is done by an authenticated voting scheme using parallel multiple signatures. Analysis of the protocol shows that it is more efficient and secure compared to similar existing schemes. Simulation results show that proposed protocol outperforms the popular ECS, CBRP and CBTRP in terms of throughput and packet delivery ratio with a reasonable communication overhead and latency in presence of malicious nodes.

Energy Aware Secure Routing for Wireless Ad Hoc Networks

ABSTRACT In this paper, we present a clustering-based energy aware secure routing protocol that computes trustworthy and energy efficient secure routes for wireless ad hoc networks (WANETs). Clustering in ad hoc networking paradigm is very useful for achieving scalability and robustness as it helps to save the bandwidth, to take simpler routing decisions, thus results in decreased energy dissipation of the network. WANETs are often deployed in such places where recharge or replace of energy sources is difficult. Further, unpredicted mobility and quasi-static nature of nodes and dynamic network topology yield a serious need for battery awareness during routing. In light of this, we first provide a definition of network lifetime based on application-specific criteria. Also a mathematical model for calculating residual battery power has been framed to propose an energy aware routing protocol. Trust-based scheme is used to assure secure end-to-end delivery of packets in the network. Extensive simulation has been carried out to show the efficacy of the proposed protocol to prolong the network lifetime.

Approach for modelling trust in cluster-based wireless ad hoc networks

In this study, the authors propose a cluster-based trust management model that efficiently detects the malicious nodes and restricts them to be on a route in wireless ad hoc networks. In contrast to previous works, the trust of a node is calculated using various trust attributes having substantial effect on reliable routing in the networks. In the proposed model, each node periodically predicts the value of each trust attribute about other nodes using autoregression. Subsequently, the direct trust is estimated using the weighted combination of trust attributes and it is fine tuned using proportional-integral model. All these recommendation trusts, from common neighbours, are collected and combined by the clusterhead to quantify the trust, and hence the routing is reliable and secure in the proposed model. Simulation results show that the proposed trust model provides better throughput and packet delivery ratio in presence of malicious nodes compared to other existing schemes.

SA-TCP: A Secure and Adaptive TCP for Wireless Ad Hoc Networks

In this paper, we propose a secure and adaptive transmission control protocol (SA-TCP) for wireless ad hoc networks that utilizes network layer information to detect various types of packet losses and adjusts the value of congestion window (CWND) dynamically according to the dynamic network conditions. SA-TCP operates normally to collect the samples of CWND and takes the mean from these samples to set for the future samples. It also adjusts the value of congestion window limit (CWL) according to the dynamic network environment. A low complexity identity-based public key cryptography has been integrated with SA-TCP to make it suitable in highly vulnerable wireless ad hoc networks. A secret session key is generated on-fly between source and destination nodes to secure the three-way handshaking process of SA-TCP. Simulation results are given to show that SA-TCP outperforms the popular New Reno and ATCP in terms of throughput in different network scenarios.

A Trust based Auction oriented Routing Model for Ad Hoc Networks

In this paper we propose a game theoretic framework for routing in mobile ad hoc networks. A trust oriented auction based packet forwarding model is developed for stimulating cooperation among the nodes avoiding the selfish behavior. Our proposed scheme provides incentive for cooperative behavior of the node and the amount of incentive is decided by the trustworthiness of a node. To find the cost of a packet we use two auction mechanisms Procurement and Dutch auction. Trust is measured by the past behavior of each node towards proper functionality of the network.

A Security Framework for SDN-Enabled Smart Power Grids

Emerging software defined networking (SDN) paradigm provides flexibility in controlling, managing, and dynamically reconfiguring smart grid networks. It can be seen in the literature that considerably less attention has been given to provide security in SDN-enabled smart grid networks. Most of the efforts focus on protecting smart grid networks against various forms of outsider attacks only by providing consistent access control, applying efficient and effective security policies, and managing and controlling the network through the use of a centralized SDN controller. Furthermore, centralized SDN controllers are plagued by reliability and security issues. This paper presents a framework with multiple SDN controllers and security controllers that provides a secure and robust smart grid architecture. The proposed framework deploys a local IDS in a substation to collect the measurement data periodically and to monitor the control-commands that are executed on SCADA slaves. A global IDS in control center collects the measurement data from the substations and estimates the state of the smart grid system by utilizing the theory of differential evolution. The global IDS further verifies the consequences of control-commands issued by SDN controller and SCADA master. An alarm is generated upon detection of an attacker or unsteady state of the smart grid system. The framework also deploys light-weight identity based cryptography to protect the smart grid network from outside attacks. Performance comparison and initial simulation result have been presented to show that the proposed framework is effective as compared to existing security frameworks for SDN-enabled smart grids.

An SDN Based Framework for Guaranteeing Security and Performance in Information-Centric Cloud Networks

Cloud data centers are critical infrastructures to deliver cloud services. Although security and performance of cloud data centers have been well studied in the past, their networking aspects are overlooked. Current network infrastructures in cloud data centers limit the ability of cloud provider to offer guaranteed cloud network resources to users. In order to ensure security and performance requirements as defined in the service level agreement (SLA) between cloud user and provider, cloud providers need the ability to provision network resources dynamically and on the fly. The main challenge for cloud provider in utilizing network resource can be addressed by provisioning virtual networks that support information centric services by separating the control plane from the cloud infrastructure. In this paper, we propose an sdn based information centric cloud framework to provision network resourcesin order to support elastic demands of cloud applications depending on SLA requirements. The framework decouples the control plane and data plane wherein the conceptually centralized control plane controls and manages the fully distributed data plane. It computes the path to ensure security and performance of the network. We report initial experiment on average round-trip delay between consumers and producers.

A trusted framework for secure routing in wireless ad hoc networks

This paper proposes a novel quantitative trust model that supports both first-hand (direct) and second-hand (recommendation) trust opinion to calculate the final trust of each node in the network. In order to compute direct trust of a node, the proposed trust model utilizes the theory of ARMA/GARCH to predict the trust parameters and a probabilistic model to combine those parameters. The proposed trust model collects recommendation trusts from common neighbors of the node under review and combines these trusts to get the resultant trust using a weighted combination model. Based on proposed trust model, a routing protocol has been driven to provide trustworthy routes. Simulation results show that the proposed protocol gives significantly higher packet delivery fraction as compared to CBRP even in presence of malicious nodes in the network. In summary, our proposed model is lightweight in terms of computation and powerful in terms of flexibility and accuracy in managing trust in WANET.

A Review on Pulse-Code Modulation

ABSTRACTA brief review of the theory and practices of Pulse-Code Modulation is given. A bibliography of the literature available on the topic is included at the end.