Riaz Ahmed Shaikh

Group-Based Trust Management Scheme for Clustered Wireless Sensor Networks

Traditional trust management schemes developed for wired and wireless ad hoc networks are not well suited for sensor networks due to their higher consumption of resources such as memory and power. In this work, we propose a new lightweight group-based trust management scheme (GTMS) for wireless sensor networks, which employs clustering. Our approach reduces the cost of trust evaluation. Also, theoretical as well as simulation results show that our scheme demands less memory, energy, and communication overheads as compared to the current state-of-the-art trust management schemes and it is more suitable for large-scale sensor networks. Furthermore, GTMS also enables us to detect and prevent malicious, selfish, and faulty nodes.

Trust Management Problem in Distributed Wireless Sensor Networks

Sensor network security solutions that have been proposed so far are mostly built on the assumption of a trusted environment, which is not very realistic so we need trust management before deploying any other security solution. Traditional trust management schemes that have been developed for wired and wireless ad-hoc networks are not suitable for wireless sensor networks because of higher consumption of resources such as memory and power. In this paper, we propose a novel lightweight group based trust management scheme (GTMS) for distributed wireless sensor networks in which the whole group will get a single trust value. Instead of using completely centralized or distributed trust management schemes, GTMS uses hybrid trust management approach that helps in keeping minimum resource utilization at the sensor nodes

LSec: lightweight security protocol for distributed wireless sensor network

Constraint specific wireless sensor networks need energy efficient and secure communication mechanisms. In this paper we propose Lightweight Security protocol (LSec) that fulfils both requirements. LSec provides authentication and authorization of sensor nodes with simple secure key exchange scheme. It also provides confidentiality of data and protection mechanism against intrusions and anomalies. LSec is memory efficient that requires 72 bytes of memory storage for keys. It only introduces 74.125 bytes of transmission and reception cost per connection.

Achieving Network Level Privacy in Wireless Sensor Networks

Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.

Dynamic risk-based decision methods for access control systems

In traditional multi-level security systems, trust and risk values are pre-computed. Any change in these values requires manual intervention of an administrator. In many dynamic environments, however, these values should be auto-adaptive, and auto-tunable according to the usage history of the users. Moreover, occasional exceptions on resource needs, which are common in dynamic environments like healthcare, should be allowed if the subjects show a positive record of use toward resources they acquired in the past. Conversely, access of authorized users, who have negative record, should be restricted. These requirements are not taken into consideration in existing risk-based access control systems. In order to overcome these shortcomings and to meet different sensitivity requirements of various applications, we propose two dynamic risk-based decision methods for access control systems. We provide theoretical and simulation-based analysis and evaluation of both schemes. Also, we analytically prove that the proposed methods, not only allow exceptions under certain controlled conditions, but uniquely restrict legitimate access of bad authorized users.

Securing Distributed Wireless Sensor Networks: Issues and Guidelines

With the emergence of ubiquitous computing the role of sensor network is becoming more important which demands highest level security and energy efficiency. In this paper we have investigated the current available solutions and found that none of the solutions are completely meeting the basic security requirements such as authentication, access control, and non-repudiation, etc. Therefore we have proposed hypothetical framework called Tetra security framework for the distributed wireless sensor networks in order to achieve highest level security and overall energy efficiency

Intrusion-aware trust model for vehicular ad hoc networks

In vehicular ad hoc networks, peers make decisions on the basis of the information provided by the other peers. If the received information is fake, then the result could be catastrophic, such as road accidents. Therefore, many researchers use the concept of trust to evaluate the trustworthiness of the received data. However, existing trust management schemes proposed so far for the vehicular networks are suffered from various limitations. For example, some schemes measure trust on the basis of the history of interactions, which is infeasible for vehicular networks due to its ephemeral nature. Also, none of the existing schemes operate in an identity anonymous environment. In order to overcome these limitations, we propose a novel trust management scheme for identity anonymous vehicular ad hoc networks. The proposed method is simple and completely decentralized that makes it easy to implement in the vehicular networks. Also, we prove that the proposed method is not only robust, but it also detects false location and time information. Furthermore, it introduces linear time complexity, which makes it suitable to use in real time. Copyright

Network Level Privacy for Wireless Sensor Networks

Full network level privacy spectrum comprises of identity, route, location and data privacy. Existing privacy schemes of wireless sensor networks only provide partial network level privacy. Providing full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes, sensor networks and QoS issues. In this paper, we propose full network level privacy solution that addresses this problem. This solution comprises of Identity, Route and Location (IRL) privacy algorithm and data privacy mechanism, that collectively provides protection against privacy disclosure attacks such as eavesdropping and hop-by-hop trace back attacks.

An analysis of fault detection strategies in wireless sensor networks

Wireless sensor networks have emerged as a key technology which is used in many safety critical applications. The sensors in wireless sensor network have to be deployed in hostile, harsh and unattended environments for long periods of time. This creates a great challenge in providing a good quality of service. This results in introductions of faults, sensor failures, communication failures and changes in topology. Hence, efficient fault detection techniques are required for good quality of service. In this article, we survey various fault detection techniques and provide a new taxonomy to integrate new fault detection techniques. We perform a qualitative comparison of the latest fault detection algorithms. From a qualitative analysis, we select a list of techniques that are analyzed quantitatively. We also discuss the shortcomings, advantages and future research directions for fault detection in wireless sensor networks.

Inconsistency detection method for access control policies

In enterprise environments, the task of assigning access control rights to subjects for resources is not trivial. Because of their complexity, distribution and size, access control policies can contain anomalies such as inconsistencies, which can result in security vulnerabilities. A set of access control policies is inconsistent when, for specific situations different incompatible policies can apply. Many researchers have tried to address the problem of inconsistency using methods based on formal logic. However, this approach is difficult to implement and inefficient for large policy sets. Therefore, in this paper, we propose a simple, efficient and practical solution for detecting inconsistencies in access control policies with the help of a modified C4.5 data classification algorithm.