• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.81-90
• /
• 2014

For necessary information sharing or operation control via wire-wireless/mobile network connecting of devices at disaster area in greatest need of attention, an emergency network efficient construction method quickly connecting nodes within specific range using Delaunay triangulation is proposed. The emergency network constructed by proposed method shows the same aggregate network length, but does more excellent performance in term of network construction time the more long max length connectable to adjacent node as compared with the network by naive method. In experiment of 1000 input terminal nodes, 5 max length connectable to adjacent node, our proposed method enhances 89.1% in execution time without network length increase compared to naive method. So our method can go well to many useful applications as shift construction of communication network of adjacent devices, internet of things and efficient routing in the sensor network in continuous improvement of communication capability.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.481-488
• /
• 2005

The Mobile W provides an efficient and scalable mechanism for host mobility within the Internet. However, the mobility implies higher security risks than static operations in fixed networks. In this paper, the Mobile IP has been adapted to allow AAA protocol that supports authentication, authorization, and accounting(AAA) for security and collection for accounting information of network usage by mobile nodes(MNs). For this goal, we Propose the boundary tone overlapped network structure while solidifying the security for the authentication of an MN. That is, the Proposed scheme delivers the session keys at the wired link for MN's security instead of the wireless one, so that it provides a fast and seamless handoff mechanism. According to the analysis of modeling result, the proposed mechanism compared to the existing session key reuse method is up to about $40\%$ better in terms of normalized surcharge for the handoff failure rate that considers handoff total time.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.183-188
• /
• 2009

Wireless sensor networks will be broadly deployed in the real world and widely utilized for various applications. A prerequisite for secure communication among the sensor nodes is that the nodes should share a session key to bootstrap their trust relationship. The open problems are how to verify the identity of communicating nodes and how to minimize any information about the keys disclosed to the other side during key agreement. At any rate, any one of the existing schemes cannot perfectly solve these problems due to some drawbacks. Accordingly, we propose a new pre-distribution scheme with the following merits. First, it supports authentication services. Second, each node can only find some indices of key spaces that are shared with the other side, without revealing unshared key information. Lastly, it substantially improves resilience of network against node capture. Performance and security analyses have proven that our scheme is suitable for sensor networks in terms of performance and security aspects.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.11-19
• /
• 2019

Recently, hybrid CDN/P2P video streaming architecture is specially designed and deployed to achieve the scalability of P2P networks and the desired low delay and high throughput of CDNs. In this paper, we propose a cooperative video streaming and active node buffer management technique in hybrid CDN/P2P architecture. The key idea of this streaming strategy is to minimize network latency such as jitter and packet loss and to maximize the QoS(quality of service) by effectively and efficiently utilizing the information sharing of file location in CDN's proxy server which is an end node located close to a user and P2P network. Through simulation, we show that the proposed cooperative video streaming and active node buffer management technique based on CDN and P2P network improves the performance of realtime video streaming compared to previous methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.11
• /
• pp.1060-1073
• /
• 2013

In this paper, we present a cluster-based routing scheme for efficiently delivering data to group mobile users by extracting and clustering mobile user group simply from beacon message information in wireless ad-hoc networks. First, we propose an online-clustering mechanism that uses a local neighbor table on each node by recursively transmitting to neighbor nodes, and forms a group table where a set of listed nodes are classified as group members, without incurring much overhead. A node that appears the most frequently from neighbor tables throughout the network is selected as the cluster-head node, serving as a data gateway for the intra-cluster. Second, we design an inter-cluster routing that delivers data from stationary data sources to the selected cluster-head node, and a intra-cluster routing to deliver from the cluster-head node to users. Simulation results based on ns-2 in the ad-hoc networks consisting of 518 stationary nodes and 20 mobile nodes show that our proposed clustering mechanism achieves high clustering accuracy of 96 % on average. Regarding routing performance, our cluster-based routing scheme outperforms a naive one-to-one routing scheme without any clustering by reducing routing cost up to 1/20. Also, our intra-cluster routing utilizing a selected cluster-head node reduces routing cost in half as opposed to a counterpart of the intra-cluster routing through a randomly-selected internal group member.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.469-480
• /
• 2008

A shared disk (SD) cluster couples multiple nodes for high performance transaction processing, and all the coupled nodes share a common database at the disk level. To reduce the number of disk accesses, each node caches database pages in its memory buffer. Since a particular page may be cached simultaneously in different nodes, cache consistency should be maintained to ensure that nodes can always access the most recent version of database pages. Most cache consistency schemes proposed in the SD cluster adopted LRU as a buffer replacement algorithm. In this paper, we first present four buffer replacement algorithms that consider the characteristics of the SD cluster. Then we compare the performance of the buffer replacement algorithms. We perform the experiments on a variety of cluster configurations and database workloads. The experiment results show that the proposed algorithms achieve performance improvement up to 5 times of LRU algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.220-222
• /
• 2021

In this paper, we propose a resource allocation scheme based on entropy for tactical wireless networks. In a tactical situation, the sensing nodes that are located randomly provide transmitted data values depending on environmental conditions. Since they share wireless resources, nodes providing valuable data compared to others need to have more resources. The proposed scheme evaluates the value of received data by a sink node. Based on the results, the sink node reallocates resources to sensing nodes. Through various experiments, we verified the proposed scheme is superior to the fixed allocation scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.804-807
• /
• 2012

Cloud service provider has to protect client's information securely since all the resources are offered by the service provider, and a large number of users share the resources. In this paper, a NoSQL-based anomaly detection system is proposed in order to enhance the security of mobile cloud services. The existing integrated security management system that uses a relational database can not be used for real-time processing of data since security log from a variety of security equipment and data from cloud node have different data format with unstructured features. The proposed system can resolve the emerging security problem because it provides real time processing and scalability in distributed processing environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.664-674
• /
• 1996

In high speed multi-wavelength networks, retransmission overhead due to desination conflict or control packet collision is one factor of performance degration because signal prpagation delay is much larger than the transmission time of data packet. In this paper, an efficient WDMA protocol with a collision avoidance mechanism is proposed for high speed WDM single-hop network with a passive star topology. In proposed protocol, each node has cource queues and routing table to store souting informatio. This architecture makes is possible to avoid any kind of collision when a node reserves the channel to transmit a data packet. High system thoughput and channel utilization can be achieved by proposed protocol since there are no discarded packets caused by any collision at transmission time. The performance of proposed protocol is evaluated in term of throughput and delay with variations in offered load. Simulation results show that the proposed protocol has superior performance to convertional protocols under nonuniform traffic as well as uniform traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.762-768
• /
• 2015

D2D communication as an underlaying LTE-Advanced network has proven to be efficient in improving the network performance and decreasing the traffic load of eNodeB(enhanced NodeB). However large amount of interference can be caused by sharing the resources between the cellular users and D2D pairs. So, a resource allocation for D2D communication to coordinate the interference is necessary. Related works for resource allocation that D2D can reuse the resources of more than one cellular user with best CQI(Channel Quality Indicator) have been proposed. D2D communications may still cause interference to the primary cellular network when radio resource are shared between them. To avoid this problem, we propose a radio resource allocation algorithm with low computational complexity for D2D communication in OFDM-based wireless cellular networks. Unlike the previous works, the proposed algorithm utilizes unused ones of the whole resource. The unused resource allocate to on D2D pair can be shared only with other D2D pairs. In other words, if the distance between the D2D pairs is sufficient, we allowed more than two D2D pairs to share the same resources. The simulation results have proven that the proposed algorithm has up to 11 times lower computational complexity than the compared one according to the number of D2D.