Tran Thanh Dai

An Efficient LU Decomposition-based Key Pre-distribution Scheme for Ensuring Security in Wireless Sensor Networks

In this paper we propose an improved and efficient key pre-distribution scheme for wireless sensor networks. Our scheme significantly increases the storage efficiency and security than that of the previously proposed scheme based on LU decomposition. It also ensures node-to-node mutual authentication in a way that an eavesdropper cannot harm the network by monitoring the traffic flows in the network. We also present detailed performance analysis and compare our scheme with the existing schemes.

Efficient ID-Based Threshold Random Key Pre-Distribution Scheme for Wireless Sensor Networks

Security for wireless sensor networks (WSNs) has become an increasingly serious concern due to the requirement level of applications and hostile deployment areas. To enable secure services, cryptographic keys must be agreed upon by communicating nodes. Unfortunately, due to resource constraints, the key agreement problem in wireless sensor networks has become quite complicated. To tackle this problem, many public-key unrelated proposals which are considered more reasonable in cost than public key based approaches have been proposed so far including random based key pre-distribution schemes. One prominent branch of these proposals is threshold random key pre-distribution schemes. However these schemes still introduce either communication overhead or both communication and computational overheads to resource constrained sensor nodes. Considering this issue, we propose an efficient ID-based threshold random key pre-distribution scheme that not only retains all the highly desirable properties of the schemes including high probability of establishing pairwise keys, tolerance of node compromise but also significantly reduces communication and computational costs of each node. The proposed scheme is validated by a thorough analysis in terms of network resiliency and related overheads. In addition, we also propose a supplementary method to significantly improve the security of pairwise keys established indirectly.

A resource-optimal key pre-distribution scheme with enhanced security for wireless sensor networks

This paper proposes an efficient resource-optimal key pre-distribution scheme for providing improved security in wireless sensor networks. We exploit the advantages of two schemes with some modifications and combine our encoding scheme to get resource-efficiency and better security.

Adaptive algorithms to enhance routing and security for wireless PAN mesh networks

Wireless PAN Mesh Network (WMN) is currently going to be standardized and enhanced to take full advantages of the flexible and heterogeneous networks Although the standard (802.15.5) is under-construction, WMNs are expected to become popular as they have the ability to connect all kinds of current networks So far, there is no applied architecture which is efficient enough to completely solve routing and security problems in WMN To assist IEEE P805.15 in routing and security aspects, in this paper, we propose an adaptive algorithm for detecting bogus nodes when they attempt to intrude into the network by attacking routing protocol In addition, a procedure to find the most optimal path between two nodes is presented along with adaptive pre-conditions for WMNs We also show that our algorithm is robust according to the mobility of the nodes and it is easy to implement in currently proposed architectures It can work with many kinds of wireless networks as well as can reduce computational costs.

An ID-Based Random Key Pre-distribution Scheme for Wireless Sensor Networks

When wireless senor networks (WSNs) are deployed in hostile areas, they indeed need to be secured by security mechanisms. To do this, cryptographic keys must be agreed on by communicating nodes. Unluckily, due to resource constraints, the key agreement problem in wireless sensor networks becomes quite intricate. In this paper, we propose a new ID-based random key pre-distribution scheme that is comparable to Du et al.s scheme [2] in terms of network resiliency and memory usage. On the other hand, our later analysis shows that our scheme outperforms Du et al.s scheme in terms of computational and communication overhead.

ID-Based Multiple Space Key Pre-distribution Scheme for Wireless Sensor Networks

Providing security services for wireless sensor networks plays a vital role in secure network operation especially when sensor networks are deployed in hostile areas. In order to pave the way for these mechanisms, cryptographic keys must be agreed on by communicating nodes. Unfortunately, due to resource constraints, the key agreement problem in wireless sensor networks becomes quite intricate. To deal with this problem, many public-key unrelated proposals have been proposed so far. One prominent branch of these proposals is based on random key pre-distribution. Inspired by this trend, in this paper, we propose a new random key pre-distribution scheme that is comparable to Du et al.s scheme [2] in terms of network resiliency and memory usage. On the other hand, our later analysis shows that our scheme outperforms Du et al.s scheme in terms of computational and communication overhead.