• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1249-1272
• /
• 2016

In this paper, we propose a symmetric key establishment scheme for wireless sensor networks which tries to minimize the resource usage while satisfying the security requirements. This is accomplished by taking advantage of the communication pattern of wireless sensor networks and adopting heterogeneous wireless sensor networks. By considering the unique communication pattern of wireless sensor networks due to the nature of information gathering from the physical world, the number of keys to be established is minimized and, consequently, the overhead spent for establishing keys decreases. With heterogeneous wireless sensor networks, we can build a hybrid scheme where a small number of powerful nodes do more works than a large number of resource-constrained nodes to provide enhanced security service such as broadcast authentication and reduce the burden of resource-limited nodes. In addition, an on-demand key establishment scheme is introduced to support extra communications and optimize the resource usage. Our performance analysis shows that the proposed scheme is very efficient and highly scalable in terms of storage, communication and computation overhead. Furthermore, our proposed scheme not only satisfies the security requirements but also provides resilience to several attacks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.9
• /
• pp.24-29
• /
• 2000

As a result of the continuing increase in the high capacity and high speed requirement, ATM will be important technology. But previous AAL type cant support service that is variable length, low speed. So AAL2 is the most recently standardized AAL type, which is aimed at providing for the bandwidth efficient transmission of low-rate, short, and variable length packets in delay-sensitive applications. In this paper, we propose the architecture and the behavior of scalable AAL2 switch that are far different from ATM switch. Also, the performance of the designed switch is analyzed by computer simulation.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.118-123
• /
• 2009

In this paper, we propose packet selection and significance based interval allocation algorithm for real-time streaming service. In real-time streaming of inter-frame (and layer) coded video, minimizing packet loss does not imply maximizing QoS. It is true that packet loss adversely affects the QoS but one single packet can have more impact than several other packets. We exploit the fact that the significance of each packet loss is different from the frame type it belongs to and its position within GoP. Using packet dependency and PSNR degradation value imposed on the video from the corresponding packet loss, we find each packet's significance value. Based on the packet significance, the proposed algorithm determines which packets to send and when to send them. The proposed algorithm is tested using publicly available MPEG-4 video traces. Our scheduling algorithm brings significant improvement on user perceivable QoS. We foresee that the proposed algorithm manifests itself in last mile connection of the network where intervals between successive packets from the source and to the destination are well preserved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.3203-3215
• /
• 2015

Due to the high growth of SNS population, service scalability is one of the critical issues to be addressed. The cloud environment provides the flexible computing and storage resources for services deployment, which fits the characteristics of scalable SNS deployment. However, if the SNS related information is not properly placed, it will cause unbalance load and heavy transmission cost on the storage virtual machine (VM) and cloud data center (CDC) network. In this paper, we characterize the SNS into a graph model based on the users' associations and interest correlations. The node weight represents the degree of associations, which can be indexed by the number of friends or data sources, and the link weight denotes the correlation between users/data sources. Then, based on the SNS graph, the two-step algorithm is proposed in this paper to determine the placement of SNS related data among VMs. Two k-means based clustering schemes are proposed to allocate social data in proper VM and physical servers for pre-configured VM and dynamic VM environment, respectively. The experimental example was conducted and to illustrate and compare the performance of the proposed schemes.

• Journal of Cadastre & Land InformatiX
• /
• v.45 no.1
• /
• pp.169-179
• /
• 2015

Recently, as the amount of data increases rapidly, the development of IT technology entered the 'Big Data' era, dealing with large-volume of data at once. In the spatial field, a spatial data service technology is required to use that various and big amount of data. In this study, firstly, we explained the technology of typical spatial information data services abroad, and then we have developed large KML data processing techniques those can be applied as KML format to VWorld desktop. The test was conducted using a large KML data in order to verify the development KML partitioned methods and tools. As a result, the index file and the divided files are produced and it was visible in VWorld desktop.

• The KIPS Transactions:PartD
• /
• v.14D no.5
• /
• pp.565-572
• /
• 2007

In this paper, we developed a VoWLAN(Voice over WLAN) system based on an open source software. The system aims to provide VoIP service over wireless LAN with an IP-PBX server. The features of system presented in this paper are as follows. First, the initial cost for the development is reduced since the system is developed based on open source software. Second, the system provides various additional services such as Voice Mail, Conference Call, and Interactive Voice Response with a software IP-PBX server. Third, the VoWLAN terminal provides high-level user applications with minimal system resources using lightweight open software solutions. Finally, it is highly scalable since it is based on the open source software.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.11
• /
• pp.471-474
• /
• 2013

In this paper, we propose a distributed parent peer selection method to construct an efficient peer-to-peer(P2P) network topology by considering the capacity of a peer and the hop distance from a data source to the peer. To achieve this goal, we propose a method to combine the two performance metrics to calculate the probability that a peer becomes a parent peer. Using the probability, we propose a method to select a parent peer stochastically by making use of the state information of the neighboring peers that each peer maintains. Through simulation studies, we show that the proposed method drives high capacity peers to support more children peers and makes the diameter of the P2P network shorter than the other methods.

• Journal of Internet Computing and Services
• /
• v.7 no.2
• /
• pp.121-136
• /
• 2006

Software architecture and protocols to be maintained between components for the reconfigurable SDR system is analyzed and suggest system design idea for the implementation of software. To do this, related surveys are reviews and set up the system model with the structure of embedded system. SDR system architecture is suggested with five layered structure, consisted with hardware, operating system, middle-ware, service objects and application layer. SDR system is designed to be work on the basis of Linux operating system, and aimed to be scalable and reconfigurable. It is introduced the design result of software protocol and state transition diagram for the implementations of software download function which is the most important feature in SDR.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1487-1497
• /
• 2016

Explosively growing service of digital multimedia data increases the need for highly scalable low-cost storage. This paper proposes the new storage architecture based on torus network which does not need network switch and erasure coding for efficient storage usage for high scalability and efficient disk utilization. The proposed model has to compensate for the disadvantage of long network latency and network processing overhead of torus network. The proposed storage model was compared to two most popular distributed file system, GlusterFS and Ceph distributed file systems through a prototype implementation. The performance of prototype system shows outstanding results than erasure coding policy of two file systems and mostly even better results than replication policy of them.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.248-251
• /
• 2010

Smart Phones from a PC using the Internet using a multimedia data service provides a scalable and user convenience is provided in the form of an application. Wired and wireless communications, especially with the reduction of royalty free WiFi or the Internet to download the application program on the PC you're using on the Smart Phone. In this paper, the location API in Android-based Smart Phone, using GPS coordinates identified in the latitude and longitude coordinates can be transferred to the server, Android Smart Phone to know the possibility of retracing the location. You are smart trace back information from the user application program design, development, and real-time GPS location signals combined backtrack to read the GPS location in Google Earth application is to study the trace back.