• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.267-275
• /
• 2021

The advent of the "un-tact 2.0 era," described as a "new normal non-face-to-face social relationship," accelerates the transformation of the living paradigm as a fully digital mediated social relationship. The emergence of these new forms of digital behaviors and mediated relationships significantly influences the industry prospect and consumers' individual lives. Advertising has played a decisive role in moving the formation forces of society, creating a dynamic flow of the capitalist system across races and geographical boundaries. Its role will become more fundamental in the physical contactless environment due to the COVID-19 outbreak. Accordingly, advertising has changed and modified its shape and meaning throughout history to adapt to the dynamic external environment. In this article, we illustrated four primary stages of the evolution in the advertising industry from simple advertising to convergence of advertising. Finally, we also identified the challenges of the present advertising industry and the paradigm transformation of "un-tact 2.0" with various related examples.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.1001-1008
• /
• 2010

In this paper, we propose the dynamic spectrum allocation (DSA) algorithm using spectrum sharing method considering the long-term priority between NOs and service classes for the maritime communication system environment where a ship locates at either near shore (or land) or off-shore. It was shown that the proposed algorithm using spectrum sharing with priorities could deliver better satisfaction ratio (SR) than the fixed allocation schemes, in the context of provision of required bandwidth (or spectrum) for each users. Therefore, we conclude that the proposed DSA with priorities could apply to the maritime communication environment and exploit the under-used (or unused, idle) spectrum of terrestrial communication networks.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.1
• /
• pp.9-16
• /
• 2016

Since most of devices in the IEEE 802.15.4 LR-WPAN are expected to operate on batteries, they must be designed to consume energy in a very conservative way. Two energy conservation algorithms are proposed for the LR-WPAN: DDC (Dynamic Duty Cycle) and DBT (Dynamic Beacon Tracking). The DDC algorithm adjusts duty cycle dynamically depending on channel conditions. The DBT algorithm switches beacon tracking mode on and off adaptively depending on traffic conditions. Combining the two algorithms reduces energy consumption more efficiently for a wide range of input loads, while maintaining frame delivery ratio and average delay at satisfactory levels.

• Journal of Industrial Technology
• /
• v.38 no.1
• /
• pp.41-52
• /
• 2018

Recently, object detection is a critical function for any system that uses computer vision and is widely used in various fields such as video surveillance and self-driving cars. However, the conventional methods can not detect the objects clearly because of the dynamic background change in the beach. In this paper, we propose a new technique to detect humans correctly in the dynamic videos like shores. A new background modeling method that combines spatial GMM (Gaussian Mixture Model) and temporal GMM is proposed to make more correct background image. Also, the proposed method improve the accuracy of people detection by using SVM (Support Vector Machine) to classify people from the objects and KCF (Kernelized Correlation Filter) Tracker to track people continuously in the complicated environment. The experimental result shows that our method can work well for detection and tracking of objects in videos containing dynamic factors and situations.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.422-429
• /
• 2013

Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.3D
• /
• pp.355-361
• /
• 2011

In order to properly evaluate ITS services exposed in SMART Highway project, a confident dynamic origin-destination (OD) is inevitably needed. This paper used WAVE communication information as a part of call and response (C&R) communication which constitutes core part of the technology for constructing OD. This information includes node information and vehicle information (e.g., latitude and longitude) as well as trajectory data and sample path volume date calculated using node information and vehicle information. A procedure developed to construct a dynamic OD and to validate OD is consist of 1) making toy network and one-hour 00 (random distribution), 2) collecting link information and vehicle information, 3) constructing five-minute OD, and 4) validating estimated OD result using traffic volume and travel time simultaneously. The constructed OD is about 84.79% correct within less than 20% error range for 15min traffic volume, and about 85.42%, within less than 20% error rate of 15 min travel time. Some limitations and future research agenda have also been discussed.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.1-8
• /
• 2021

In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.12-18
• /
• 2003

A web crawler is used widely in a variety of Internet applications such as search engines. As the Internet continues to grow, high performance web crawlers become more essential. Crawl scheduling which manages the allocation of web pages to each process for downloading documents is one of the important issues. In this paper, we identify issues that are important and challenging in the crawl scheduling. To address the issues, we propose a dynamic owl scheduling framework and subsequently a system architecture for a web crawler subject to the framework. This paper presents the architecture of a web crawler with dynamic scheduling support. The result of our preliminary performance evaluation made to the proposed crawler architecture is also presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1265-1278
• /
• 2017

Dynamic task scheduling is one of the most popular research topics in the cloud computing field. The cloud scheduler dynamically provides VM resources to variable cloud tasks with different scheduling strategies in cloud computing. In this study, we utilized a valid model to describe the dynamic changes of both computing facilities (such as hardware updating) and request task queuing. We built a novel approach called Policy Iteration Scheduling (PIS) to globally optimize the independent task scheduling scheme and minimize the total execution time of priority tasks. We performed experiments with randomly generated cloud task sets and varied the performance of VM resources using Poisson distributions. The results show that PIS outperforms other popular schedulers in a typical cloud computing environment.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.2
• /
• pp.49-55
• /
• 2008

To address the convergence issue of power control algorithms, a number of algorithms have been developed hat shape the dynamics of up-link power control for cellular network. Power algorithms based on fixed point iterations can be accelerated by the use of various methods, one of the simplest being the use of Newton iterations, however, this method has the disadvantage which not only needs derivatives of the cost function but also may be weak to noisy environment. we showed performance of the power control schemes to solve the fixed point problem under static or stationary channel. They proved goof performance to solve the fixed point problem due to their predictor based optimal control and quadratic convergence rate. Here, we apply the proposed power control schemes to the problem of the dynamic channel or to dynamic time varying link gains. The rigorous simulation results demonstrated the validity of our approach.