• KIISE Transactions on Computing Practices
• /
• v.23 no.5
• /
• pp.310-315
• /
• 2017

In a centralized control structure, the software defined network controller manages all openflow enabled switched in a data plane and controls the telecommunication between all hosts. In addition, the network manager can easily deploy the network function to the application layer with a software defined network controller. For this reason, many methods for network management using a software defined network concept have been proposed. The main policies for network management are related to traffic Quality of Service and resource management. In order to provide Quality of Service and load distribution for network users, we propose an efficient routing method using a naive bayesian algorithm and transmission delay estimation module. In this method, the forwarding path is decided by flow class and estimated transmission delay result in the software defined network controller. With this method, the load on the network node can be distributed to improve overall network performance. The network user also gets better dynamic Quality of Service.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.91-105
• /
• 2010

A wireless sensor network communication technique has been broadly studied with continuous advances in ubiquitous computing environment. Especially, because the resource of the sensor node is limited, it is important to reduce the communication energy by using an energy-efficient routing protocol. The existing cluster-based routing protocols have a problem that they cannot select a cluster head efficiently by randomly choosing a head. In addition, because the existing cluster-based routing protocols do not support the large scale of network, they cannot be used for various applications. To solve the above problems, we, in this paper, propose a new cluster-based routing protocol using representative paths. The proposed protocol constructs an efficient cluster with distributed cluster heads by creating representative paths based on hop count. In addition, a new routing protocol supports multi-hop routing for data communication between a cluster member node and a cluster head as well as between cluster heads. Finally, we show that our protocol outperforms LEACH and Multihop-LEACH in terms of reliability and scalability.

• KIISE Transactions on Computing Practices
• /
• v.22 no.11
• /
• pp.547-558
• /
• 2016

Construction of multi-site Cloud Infrastructure with OpenStack, the most popular cloud open source project with various ICT infrastructure technologies, has operational inefficiency due to installation complexity and geographical limitation. To address this inefficiency, we gradually developed automated installation/configuration tools to automate installation/configuration of Linux and OpenStack by complying with DevOps methodology over a multi-site OpenStack testbed called OF@KOREN SmartX Playground. However, the pre-developed installation tools can be used only for limited cases. Therefore, we designed and developed a prototype of SmartX Provisioning Framework which could conducts Playground-wide provisioning flexibly by following three steps of resource management in Software-defined Infrastructure. We verified the efficiency of the provisioning functionality of the framework by demonstrating an example of automated multi-site cloud construction.

• KIISE Transactions on Computing Practices
• /
• v.23 no.6
• /
• pp.392-396
• /
• 2017

Although mobile device-related technologies have developed rapidly, many problems arising from resource constraints have not been solved. Computation offloading that uses resources of cloud servers over the Internet was proposed to overcome physical limitations, and many studies have been conducted in terms of energy saving. However, completing tasks within their deadlines is more important than saving energy in real-time applications. In this paper, we proposed an offloading decision scheme considering the scheduling latency in the cloud to support real-time applications. The proposed scheme can improve the reliability of real-time tasks by comparing the estimated laxity of offloading a task with the estimated laxity of executing a task in a mobile device and selecting a more effective way to satisfy the task's deadline.

• Journal of Internet Computing and Services
• /
• v.18 no.4
• /
• pp.89-97
• /
• 2017

The purpose of the present study was to estimate the effect of adolescents' depression on cell phone dependency and to identify mediating effects of parenting style and peer isolation. The study used data from the $6^{th}$ waves of 2015 KCYPS(Korean Children and Youth Panel Survey). Structural Equation Model(SEM) was conducted to examine the mediating effects of parenting style and peer isolation. The results showed that adolescents' depression had positive effects on cell phone dependency. In addition, the relationship between adolescents' depression and cell phone dependency was partially mediated by parenting style, not mediated by peer relationships. Based on these findings, further suggestions are provided to reduce adolescents' cell phone dependency by decreasing parent's over-involvement and improve adolescents' self control opportunities.

• Convergence Security Journal
• /
• v.9 no.2
• /
• pp.71-78
• /
• 2009

It is very difficult to apply previous security protocols to WSNs(Wireless Sensor Networks) directly because WNSs have resource constrained characteristics such as a low computing ability, power, and a low communication band width. In order to overcome the problem, we proposes a secure group communication scheme applicable to WSNs. The proposed scheme is a combined form of the TEEN(Threshold sensitive Energy Efficient sensor Network protocol) clustering based hierarchical routing protocol and security mechanism, and we assume that WSNs are composed of sensor nodes, cluster headers, and base stations. We use both private key and public key cryptographic algorithms to achieve an enhanced security and an efficient key management. In addition, communications among sensor nodes, cluster headers, and base stations are accomplished by a hierarchical tree architecture to reduce power consumption. Therefore, the proposed scheme in this paper is well suited for WSNs since our design can provide not only a more enhanced security but also a lower power consumption in communications.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.38-43
• /
• 2017

Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.

• Journal of Communications and Networks
• /
• v.12 no.6
• /
• pp.568-576
• /
• 2010

The paper presents a control architecture aimed at implementing bandwidth optimization combined with call admission control (CAC) over a digital video broadcasting (DVB) return channel satellite terminal (RCST) under quality of service (QoS) constraints. The approach can be applied in all cases where traffic flows, coming from a terrestrial portion of the network, are merged together within a single DVB flow, which is then forwarded over the satellite channel. The paper introduces the architecture of data and control plane of the RCST at layer 2. The data plane is composed of a set of traffic buffers served with a given bandwidth. The control plane proposed in this paper includes a layer 2 resource manager (L2RM), which is structured into decision makers (DM), one for each traffic buffer of the data plane. Each DM contains a virtual queue, which exactly duplicates the corresponding traffic buffer and performs the actions to compute the minimum bandwidth need to assure the QoS constraints. After computing the minimum bandwidth through a given algorithm (in this view the paper reports some schemes taken in the literature which may be applied), each DM communicates this bandwidth value to the L2RM, which allocates bandwidth to traffic buffers at the data plane. Real bandwidth allocations are driven by the information provided by the DMs. Bandwidth control is linked to a CAC scheme, which uses current bandwidth allocations and peak bandwidth of the call entering the network to decide admission. The performance evaluation is dedicated to show the efficiency of the proposed combined bandwidth allocation and CAC.

• Convergence Security Journal
• /
• v.19 no.5
• /
• pp.47-53
• /
• 2019

Network-based sharing of information has evolved into a cloud service environment today, increasing its number of users rapidly, but has become a major target for network-based illegal attackers.. In addition, IP spoofing among attackers' various attack techniques generally involves resource exhaustion attacks. Therefore, fast detection and response techniques are required. The existing detection method for IP spoofing attack performs the final authentication process according to the analysis and matching of traceback information of the client who attempted the connection request. However, the simple comparison method of traceback information may require excessive OTP due to frequent false positives in an environment requiring service transparency. In this paper, symmetric key cryptography based on traceback information is used as mutual authentication information to improve this problem. That is, after generating a traceback-based encryption key, mutual authentication is possible by performing a normal decryption process. In addition, this process could improve the overhead caused by false positives.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.190-196
• /
• 2014

This paper proposes a mobile-optimized pedestrian detection method using Cascade of HOG(Histograms of Oriented Gradients) for ADAS(Advanced Driver Assistance System) on smartphones. In order to use the limited resource of mobile platforms efficiently, the method is implemented by the OpenCL(Open Computing Language) library, and its processing time is reduced in the following two aspects. Firstly, the method sets a program build option specifically and adjusts work group sizes as variety of kernels in the host code. Secondly, it utilizes local memory and a LUT(Look-Up Table) in the kernel code to accelerate the program. For performance evaluation, the developed algorithm is compared with the mobile CPU-based OpenCV(Open Computer Vision) for Android function. The experimental results show that the processing speed is 25% faster than the OpenCV hogcascade.