Young Jae Song

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.

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

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.

MUQAMI: A Locally Distributed Key Management Scheme for Clustered Sensor Networks

In many of the sensor network applications like natural habitat monitoring and international border monitoring, sensor networks are deployed in areas, where there is a high possibility of node capture and network level attacks. Specifically in such applications, the sensor nodes are severely limited in resources. We propose MUQAMI, a locally distributed key management scheme for resilience against the node capture in wireless sensor networks. Our scheme is efficient both in case of keying, re-keying and node compromise. Beauty of our scheme is that it requires minimal message transmission outside the cluster. We base our Scheme on Exclusion Basis System (EBS).

Trusting Anomaly and Intrusion Claims for Cooperative Distributed Intrusion Detection Schemes of Wireless Sensor Networks

Any unidentified malicious nodes in the network could send faulty anomaly and intrusion claims about the legitimate nodes to the other nodes. Verifying the validity of such claims is a critical and challenging issue that is not considered in existing cooperative-based distributed anomaly and intrusion detection schemes of wireless sensor networks. In this paper, we propose a validation algorithm that addresses this problem. This algorithm utilizes the concept of intrusion-aware reliability that helps to provide adequate reliability at the modest communication cost.

Intrusion-Aware Alert Validation Algorithm for Cooperative Distributed Intrusion Detection Schemes of Wireless Sensor Networks

Existing anomaly and intrusion detection schemes of wireless sensor networks have mainly focused on the detection of intrusions. Once the intrusion is detected, an alerts or claims will be generated. However, any unidentified malicious nodes in the network could send faulty anomaly and intrusion claims about the legitimate nodes to the other nodes. Verifying the validity of such claims is a critical and challenging issue that is not considered in the existing cooperative-based distributed anomaly and intrusion detection schemes of wireless sensor networks. In this paper, we propose a validation algorithm that addresses this problem. This algorithm utilizes the concept of intrusion-aware reliability that helps to provide adequate reliability at a modest communication cost. In this paper, we also provide a security resiliency analysis of the proposed intrusion-aware alert validation algorithm.

A Study on Model Transformation Mechanism Using Graph Comparison Algorithm, Abstract Factory Pattern and Bridge Pattern

In order to easily port mobile applications suitable for each platform, that have been developed under diverse development environment for individual wireless communication service providers, or redevelop them on a specific platform, it is required to reuse them at software model level that is a software development paradigm for MDA (Model Driven Architecture). Verification of existing design models and test models for the study, mainly checking (Model Checking) with a code-based software designed to define in the abstract syntax tree or on the models generated using refactoring on design models for refinery operations and define how to perform. The problem with these traditional research methods, but the first model, design model for checking the information with the model by defining a formal representation in the form of an abstract syntax tree, as youve shown how to perform verification of the model to perform refactoring. Additional steps need to define more complex due to a software problem that is not the way to the model suitable for optimization refactoring. In this paper, as defined in the MDA-based model transformation studies of a reusable model transformation patterns, abstract factory pattern and the bridge pattern given the pattern information automatically through the software model offers a way to perform refactoring..