• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.3
• /
• pp.107-114
• /
• 2017

In beacon-enabled mode, beacon collision is a significant problem for the scalability of cluster-tree wireless sensor networks. In this paper, multi-channel time division scheduling (MCTS) is proposed to prevent beacon collisions and provide scalability. A coordinator broadcasts a beacon frame, including information on allocated channels and time-slots, and a new node determines its own channel and time-slot. The performance of the proposed method is evaluated by comparing the proposed approach with a typical ZigBee. MCTS prevents beacon collisions in cluster-tree wireless sensor networks. It enables large-scale wireless sensor networks based on a cluster tree to be scalable and effectively constructed.

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

Currently, demands for outdoor broadcasts and concerts are increasing. Due to severe circumstance of outdoor places like rain, wet-damage in moved loudspeaker may occur. Experimental approaches to improve waterproof-effect for movable loud speaker have been investigated in this studies. For performance test of loud speaker, enclosures were made by MDF(Medium Density Fiberboard). Three types of finishing material, general paint, sheet paper and FRP(Fiber Reinforced Plastics) are proposed for comparing waterproof-effects.

• Journal of Satellite, Information and Communications
• /
• v.3 no.2
• /
• pp.38-42
• /
• 2008

In 2005, DVB-S2 spec. was finalized. But with a large number of DVB-S receivers already installed, backwards compatibility may be required for a period of time, where old receivers continue to receive the same capacity as before, while the new DVB-S2 receivers could receive additional capacity broadcasts. To facilitate the reception of DVB-S serviced by DVB-S2 receivers, implementation of DVB-S in DVB-S2 chips is highly recommended. For the backward compatibility the system adapt the hierarchical modulation scheme. And the system has to meet system margin, so in this paper analyzes the effect according to the deviation angle and shows the BER performance. And finally this paper shows the result of the system implement using FPGA chip.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.123-145
• /
• 2017

Due to the increasing demand for spectrum resources, cognitive radio networks and dynamic spectrum access draw a lot of research into efficiently utilizing limited spectrum resources. To set up cluster-based CR ad-hoc common channels, conventional methods require a relatively long time to successfully exchange the initialization messages. In this paper, we propose a fast and reliable common channel initialization protocol for CR ad-hoc networks. In the proposed method, the cluster head sequentially broadcasts a system activation signal through its available channels with a predetermined correlation pattern. To detect the cluster head's broadcasting channels and to join the cluster, each member node implements fast Fourier transform (FFT) and computes autocorrelation of an FFT bin sequence for each available channel of the member node. This is compared to the predetermined reference pattern. The join request and channel decision procedures are also presented in this paper. In a simulation study, the performance of the proposed method is evaluated.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.133-144
• /
• 2015

In this paper, we introduce a system and a set of algorithms for disseminating popular content to a large group of wireless clients spread over a wide area. This area is partitioned into multiple cells and there is a base station in each cell which is able to broadcast to the clients within its radio coverage. Dissemination of information in the proposed system is hybrid in nature: Each base station broadcasts a fraction of information in the form of random linear combinations of data blocks. Then the clients cooperate by exchanging packets to obtain their desired messages while they are moving arbitrarily over the area. In this paper, fundamental trade-offs between the average information delivery completion time at the clients and different parameters of the system such as bandwidth usage by the base stations, average energy consumption by the clients and the popularity of the spread information are studied. Moreover different heuristic algorithms are proposed to control and maintain a balance over these trade-offs. Also, the more complicated case of multiple sessions where each client is interested in an arbitrary subset of sessions is considered and two variants of the basic dissemination algorithm are proposed. The performance of all the proposed algorithms is evaluated via extensive numerical experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3680-3693
• /
• 2022

The handover procedure of IEEE 802.11 wireless local area networks (WLANs) introduces significant delay, which can degrade the quality of service (QoS) especially for delay-sensitive applications. Although studies have been conducted to support handover in SDN-based WLAN, there is no research to reduce the channel scanning procedure that takes up the most delay time in the handover process. The channel scanning procedure is essential to determine the appropriate access point (AP). To mitigate this problem, this paper proposes a SWITCH: SDN-WLAN integrated handover scheme for QoS-Guaranteed mobile service. In SWITCH, each AP periodically broadcasts beacon frames through different channels in a predetermined order that includes the operating channel information of the AP. This allows mobile stations (MSs) to receive the beacon frames of nearby APs, and therefore they can determine the appropriate APs for handover without the channel scanning procedure. By reporting the information of the newly moved AP to the SDN controller, a flow rule is installed in advance to provide fast handover, and packet loss is reduced by buffering data destined for MS. In addition, the proposed scheme can adaptively operate SWITCH to consider the user location and QoS requirement of flow to save radio resource overhead. Performance evaluation results demonstrate that SWITCH can reduce the handover delays, flow table utilization ratio and radio resource overhead while improving the network throughput.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.27 no.2
• /
• pp.167-176
• /
• 2024

Lip-reading is the task of inferring the speaker's utterance from silent video based on learning of lip movements. It is very challenging due to the inherent ambiguities present in the lip movement such as different characters that produce the same lip appearances. Recent advances in deep learning models such as Transformer and Temporal Convolutional Network have led to improve the performance of lip-reading. However, most previous works deal with English lip-reading which has limitations in directly applying to Korean lip-reading, and moreover, there is no a large scale Korean lip-reading dataset. In this paper, we introduce the first large-scale Korean lip-reading dataset with more than 120 k utterances collected from TV broadcasts containing news, documentary and drama. We also present a preprocessing method which uniformly extracts a facial region of interest and propose a transformer-based model based on grapheme unit for sentence-level Korean lip-reading. We demonstrate that our dataset and model are appropriate for Korean lip-reading through statistics of the dataset and experimental results.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.803-812
• /
• 2004

The performance of video-on-demand(VOD) systems is known to be mainly dependent on a scheduling mechanism which they employ. Broadcast-based scheduling schemes have attracted a lot of attention as an efficient way of distributing popular videos to very large client populations. The main motivations of broadcasting scheduling mechanisms are that they scale up extremely well and they have very modest bandwidth requirements. This paper studies this issue and proposes a new broadcasting scheduling mechanism, named fast universal video dis-tribution(FUVD). FUVD scheme dynamically constructs a video broadcasting schedule in response to client requests, and broadcasts video seg-ments according to this schedule. This paper also evaluates the performance of FUVD on the basis of a simulation approach. The simulation results indicate that FUVD protocol shows a superior performance over UD, CBHD, and NPB in terms of the average response time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.12
• /
• pp.82-88
• /
• 2009

An adaptive cooperation system is considered with the cooperation decision strategy based on the differences between instantaneous signal-to-noise ratio (SNR) S-D and R-D channels. Specifically, if the quality of the direct link (S-D) is better than that of the link from the relay to the destination (R-D), the source will transmit to destination directly with all scheme's transmitted power. Otherwise, the source broadcasts the signal with a lower power in the first time slot. Then, in the second time slot, if the relay decodes its received signal correctly, it re-transmits the re-encoded signal to the destination else the source will transmit again with the remaining power. Firstly, the spectral efficiency is derived by calculating the probabilities of direct transmission and cooperation mode. Subsequently, the BER performance for the adaptive cooperation schemes is analyzed by considering the BER routine of each mode. Finally, the Monte-Carlo simulation results are presented to confirm the performance enhancement offered by the proposed schemes.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.425-430
• /
• 2007

Without the aid of stationary infrastructure, maintaining routing information for all nodes is inefficient in the Mobile Ad hoc Networks(MANET). It is more efficient when every time routing information is necessary that the source node broadcasts a query message to neighbour nodes. The source node using Ad hoc On-Demand distance Vector(AODV), which is one of the routing protocols of MANET, uses the Expanding Ring Search(ERS) algorithm which finds a destination node efficiently. In order to reduce the congestion of the network, ERS algorithm does not broadcast Route REQuest(RREQ) messages in the whole network. When the timer expires, if source node does not receive Route REPly(RREP) messages from the destination node, it gradually increases TTL value and broadcasts RREQ messages. Existing AODV cost a great deal to find a destination node because it uses a fixed NODE_TRAVERSAL_TIME value. Without the message which is added in existing AODV protocols, this paper measures delay time among the neighbours' nodes by making use of HELLO messages. We propose Adaptive ERS(AERS) algorithm that makes NET_TRAVERSAL_TIME optimum which apply to the measured delay time to NODE_TRAVERSAL_TIME. AERS suppresses the unnecessary messages, making NET_TRAVERSAL_TIME optimum in this paper. So we will be able to improve a network performance. We prove the effectiveness of the proposed method through simulation.