No abstract

No abstract

Key management is a decisive part for security in Wireless Sensor Networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the number of sensor node is huge. Recently, a random key pre-distribution scheme is proposed as an efficient solution for sharing keys among sensor nodes to reduce the length of shared key and avoid unnecessary key assignments. By studying the range of the communication signal in sensor nodes, we can improve the pre-distribution key mechanism, thus get a higher connectivity possibility between sensor nodes in the whole network. In this paper, we present a grid-based scheme with novel approach for key-distribution mechanism based on the communication range of sensor nodes that guarantees a high probability of sharing keys between sensor nodes. Our evaluation and simulation show that our approach outperforms the existing schemes in both high connectivity probability and low memory usage. Among security issues, key management is one of the most important factors and it has been highly studied recently. There are some type of key agreement schemes, such as trusted-server scheme, self-enforcing scheme and key pre-distribution scheme. However, no trusted infrastructure of WSN and limited computation and energy resources make two former schemes unsuitable for WSN. In this paper we propose a new grid-based mechanism for pre-distribution with respect to the communication range of sensor nodes. Communication range should be studied to avoid unnecessary key assignments because if two nodes are not in their communication ranges, it is unnecessary to store the common keys. Correspondingly, the probability of sharing keys should be different depending on the communication range of the node. The key sharing of our proposed scheme consists of three steps, namely generation of a large pool of P keys; random drawing m keys out of P to establish key ring of a sensor (sensor A); establishing key ring for neighbor nodes of A by random selecting k keys from m keys of A and (m-k) keys from the key pool P. These three steps are repeated until it covers the entire network. They will be thoroughly discussed in the following sections. + 1 Corresponding author: Dugki Min (dkmin@konkuk.ac.kr) International Conference on Convergence and Hybrid Information Technology 2008 978-0-7695-3328-5/08 $25.00

No abstract

these days, distributed simulation system domain is growing increasingly in terms of data size and number of data transmission. Therefore, network control mechanism for data transmission in distributed system is required. For this, we replace transport layer of HLA-based distributed simulation system using Data Distribution Service (DDS) communication. In this paper, we pursue the network-controllable distributed simulation using DDS. We suggest HLA-DDS wrapper API which combines HLA APIs and DDS APIs and wraps them to be seen as one middleware API to users. HLA-DDS wrapper API consists of simulation service APIs from HLA and QoS-based network configuration APIs from DDS and some HLA-DDS data transformation APIs for interconnecting HLA data object and DDS data object. HLA-DDS wrapper is not only allow networkcontrollable distributed simulation systems but also preserve existing HLA-based distributed simulation system; because HLA-DDS wrapper API comply with HLA standard APIs.

No abstract

No abstract

No abstract