• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.941-948
• /
• 2005

In the self-healing group key distribution scheme, users are capable of recovering lost group keys on their own without requesting additional transmission from the group manager, where there is no reliable network infrastructure. In this paper, we propose a new self-healing group key distribution scheme with revocation capability, which is optimal in terms of user memory storage and more efficient in terms of communication complexity than the previous results. We obtain a slightly improved result from (13) and (14) by using the new broadcasting method. In addition, we prove that our scheme has the properties of t-wise forward secrecy and t-wise backward secrecy, and extend this self-healing approach to the session key recovery scheme from a single broadcast message.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2310-2326
• /
• 2000

Client-server DBMS based on a data-shipping model can exploit e1ient resources effectively by allowing inter-transaction caching. However, inter-transaction caching raises the need of transactional cache consistency maintenancetTCCM protocol. since each client is able to cache a portion of the database dynamically. Deferred locking(DL) is a new detection-based TCCM scheme designed on the basis of a primary copy locking algorithm. In DL, a number of lock ,ujuests and a data shipping request are combined into a single message packet to minimize the communication overhead required for consistency checking. Lsing a simulation model. the performance of the prolxlsed scheme is compared with those of two representative detection based schemes, the adaptive optimistic concurrency control and the caching two-phase locking. The performance results indicate that DL improves the overall system throughput with a reasonable transaction abort ratio over other detection - based schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.706-714
• /
• 2010

In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.618-624
• /
• 2009

In the evolution from wireless sensor networks(WSNs) to ubiquitous sensor networks(USNs), technologies that can support intensive data-traffic loads, large number of users, improved interoperability, and extreme longevity are required. Therefore, efficient communication time coordination control and low power consumption becomes one of the most important design goals for USN MAC protocols. So far several time division multiplexed (TDM) MAC protocols have been proposed. However, since the pros and cons of existing protocols are not easy to analyze, it becomes a challenging task to design improved TOM MAC protocols. Based on this objective, this paper provides a novel protocol analysis along with a message complexity derivation and comparison of the existing TDM MAC protocols.

• Convergence Security Journal
• /
• v.12 no.6
• /
• pp.61-67
• /
• 2012

Accordingly the number of smart-phone-based malicious codes is also increasing and their techniques for malicio us purpose are getting more clever and evolved. Among them, the malicious codes related to Android take the major portion and it can be estimated that they are based on open source so that the access to the system is easy. Intent is a technique to support the communication between application's components by transmitting message subjects in Android. Intent provides convenience to developers, but it can be utilized as security vulnerability that allows the developer with a malicious purpose to control the system as intended. The vulnerability of intent security is that personal information can be accessed using discretionally its proper function given to application and smart phone's functions can be maliciously controlled. This paper improves with the Intent security vulnerability caused by the smart phone users' discretional use of custom kernel. Lastly, it verifies the malicious behaviors in the process of installing an application and suggests a technique to watch the Intent security vulnerability in realtime after its installation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.750-757
• /
• 2007

This paper analyzes spam threats and proposes key exchange scheme for user authentication and SDP encryption to protect potential spam threats in SIP-based VoIP services. The existing HTTP digest authentication scheme exchanges many message because challenge is sent for every establishment of the session and doesn't provide a confidentiality of SDP. To protect SPIT, our scheme exchanges initial nonce and a session master key for authentication and SDP encryption during registration. In our scheme, the challenge and response procedure is not necessary and the communication overhead is much less than applying S/MIME or TLS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.719-727
• /
• 2007

The Wireless Mesh Network technology is able to provide an infrastructure for isolated islands, in which it is difficult to install cables or wide area such as battlefield of armed forces. Therefore, Wireless Mesh Network is frequently used to satisfy needs for internet connection and active studies and research on them are in progress However, as a result of increase in number of hops under hop-by-hop communication environment has caused a significant decrease in throughput and an increase in delay. Considering the heavy traffic of real-time data, such as voice or moving pictures to adaptive WMN, in a military environment, it is restricted for remote units to have their Mesh Node to get real-time services. Such phenomenon might cause an issue in fairness. In order to resolve this issue, the Location-based Packet Scheduling Scheme, which can provide an fair QoS to each mesh node that is connected to each echelon's AP and operates based on WRR method that gives a priority to emergency message and control packet. The performance of this scheme is validated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.12
• /
• pp.817-821
• /
• 2014

As users generate lots of contents independently of time and places anytime and anywhere together with a rapid development of mobile wireless communication technologies and an explosive dissemination of smart devices, content centric networking (CCN) has emerged as a new networking architecture. However, as CCN is based on one to one message exchanges, it is not appropriate for ad hoc network environment that has frequent network topology changes, which results in high control overhead and low transmission throughput. So, this paper proposes the new content sharing methods using group interest messages in CCN ad hoc environment. It is shown from the simulation that the proposed method can provide low control overhead and high transmission throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.4
• /
• pp.334-342
• /
• 2014

Military communications for future warfare have limited resources but highly requirements. MANET has a lot of advantages for future military network due to easily deploying without infrastructure and supporting dynamic topology in restricted environments. But, one of the biggest issues for MANET is difficulty of transmitting data due to link failure in dynamic topology. Content Centric Networking is a future Internet paradigm which solves various IP network problem. In this paper, we propose a future military communication routing scheme using CCN in military tactical MANET. Simulation results show our scheme gets lower control message overhead and faster data downloads as number of node increases and mobile speed increases than other two schemes.

• Journal of Communications and Networks
• /
• v.15 no.5
• /
• pp.504-513
• /
• 2013

Communication in delay tolerant networks (DTNs) relies on message transport by mobile nodes, and a correct understanding of the node mobility characteristics is therefore crucial to the design of an efficient DTN routing protocol. However, previous work has mainly focused on uncovering all behaviors of node movement, which is not conducive to accurately detecting the specific movement characteristics of a different node. In this paper, we seek to address this problem based on a consideration of social relationships. We first consider social ties from both static and dynamic perspectives. For a static perspective, in addition to certain accidental events, social relations are considered for a long time granularity and tend to be stable over time. For a dynamic perspective, social relations are analyzed in a relatively short time granularity and are likely to change over time. Based on these perspectives, we adopted different efficient approaches to dividing node pairs into two classes, i.e., familiar and unfamiliar pairs. A threshold approach is used for static social ties whereas a density-based aggregation method is used for dynamic social relationships. Extensive experimental results show that both familiar and unfamiliar node pairs have the same inter-contact time distribution, which closely follows a power-law decay up to a certain point, beyond which it begins to exponentially decay. The results also demonstrate that the inter-contact time distribution of familiar pairs decays faster than that of unfamiliar pairs, whether from a static or dynamic perspective. In addition, we also analyze the reason for the difference between the inter-contact time distributions of both unfamiliar and familiar pairs.