• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2457-2464
• /
• 2015

Distributed Networked Control Systems (NCSs) through wireless networks have a tremendous potential to improve the efficiency of various control systems. In this paper, we define the State Update Interval (SUI) as the elapsed time between successful state vector reports derived from the NCSs. A simple expression of the SUI is derived to characterize the key interactions between the control and communication layers. This performance measure is used to formulate a novel optimization problem where the objective function is the probability to meet the SUI constraint and the decision parameter is the channel access probability. We prove the existence and uniqueness of the optimal channel access probability of the optimization problem. Furthermore, the optimal channel access probability for NCSs is lower than the channel access probability to maximize the throughput. Numerical results indicate that the improvement of the success probability to meet the SUI constraint using the optimal channel access probability increases as the number of nodes increases with respect to that using the channel access probability to maximize the throughput.

• Journal of Advanced Marine Engineering and Technology
• /
• v.35 no.2
• /
• pp.278-287
• /
• 2011

NMEA 2000 protocol known as IEC 61162-3 of Multi-talker, Multi-listener and Plug and Play network communication has been adopted as standard network for SOLAS(Safety of Life at Sea) ship by IMO. This paper focuses on the implementation of FPGA and MicroBlaze for NMEA 2000 based gateway, which is able to convert NMEA 2000 protocol into various types of network protocol such as Ethernet, UART and USB using Vertex4-based ML401 board. Each communication module and the stack of NMEA 2000 are mounted on FPGA. To be able to receive each communication data, ML401 board is configured to handle required communication speed. PC based NMEA 2000 monitoring program is developed to verify that data on different networks are correctly converted each other in real time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.48-58
• /
• 2002

As internet traffic increases, the problem that it should be efficiently accepted in to the existing voice network in the pending problem importantly to the existing communication corporations. The feature of next generation exchange network is made up of the form of integration network that connect data traffic(internet service. Etc) with the existing voice network and it can be showed with very diverse aspects according to the constitution time of network or the characteristics of business. The progress strategy that develop the existing circuit based communication network into packet-based communication network can be divided into two in a large scale according to the application position These are VoDSL application method(Technology that packetize access network) and softswitch technology application method(after packetizing relay network, packetizing that into the access network). In this paper, we will deduce the desirable technology that can construct packet-based next generation exchange networks in the structure of the existing communication network environment. We will perform the research on a device to offer the necessary core technique VoSDL service with realistic resolutions primarily.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.721-732
• /
• 2000

Multimedia communication systems require not only high-performance computer hardwares and high-speed networks, but also a buffer management mechanism to process many data efficiently. Two buffer handling methods, Push and Pull, are commonly used. In the Push method, a server controls the flow of dat to a client, while in the Pull method, a client controls the flow of data from a server. Those buffering schemes can be applied to the data transfer between the packet receiving buffer, which receives media data from a network server, and media playout devices, which play the recived media data. However, the buffer management mechanism in client-sides mainly support either one of the Push or the Pull method. Consequently, they have some limitations to support various media playout devices. Futhermore, even though some of them support both methods, it is difficult to use since they can't provide a unified structure. To resolved these problems, in this paper, we propose an efficient and flexible Push/Pull buffer management mechanism at client-side. The proposed buffer management scheme supports both Push and Pull method to provide various media playout devices and to support buffering function to absorb network jitter. The proposed scheme can support the various media playback devices using a single buffer space which in consequence, saves memory space compared to the case that a client keeps tow types of buffers. Moreover, it facilitates the single buffer as a mechanism for the absorbing network jitter effectively and efficiently. The proposed scheme has been implemented in an existing multimedia communication system, so called ISSA (Integrated Streaming Service Architecture), and it shows a good performance result compared to the conventional buffering methods in multimedia communication environments.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.232-239
• /
• 2011

This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

• Journal of the Korean Society for information Management
• /
• v.18 no.4
• /
• pp.127-142
• /
• 2001

It has been criticized that the right of reproduction and right of communication to the public in the Copyrigt Act of Korea, which was amended in the year of 2000 in line with new environments around digital networks, limited the limitation to author’s property right in private use and library exemption too much. Solving the problem above, this study analyzes comparatively WCT, Amended Proposal for a Directive on Copyright and Related Rights in the Information Society, Copyright Law of the United States of America, Copyright Amendment(Digital Agenda), and Copyright Act of Korea. Based on the results from related case analyses and a survey on how stakeholders view copyright issue, in addition, this study presents a reasonable way of limiting rights of reproduction and rights of communication to the public.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.5
• /
• pp.539-547
• /
• 2001

Cluster systems employ high speed interconnection networks and use efficient communication layers to gain high performance and scalability. But the diversity in implementation mechanism among these communication layers causes lack of portability. A solution is to provide communication standard APIs such as MPI. This paper introduces MPI-VMMC: an MPI implementation on VMMC. Though the direct deposit transfer mechanism used in VMMC is not suitable for Send/Recv mechanism used in MPI, the proposed sub-layer laid between MPI and VMMC efficiently translates from one mechanism to the other. We also use the lazy pointer and selective zero-copy transfer technique to gain high performance. The peak performance of MPI-VMMC is 90.7Mbytes/sec, which is about 95% of the base communication layer\`s.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4228-4247
• /
• 2018

Many methods have been developed for the vehicles to create clusters in vehicular ad hoc networks (VANETs). Usually, nodes are vehicles in the VANETs, and they are dynamic in nature. Clusters of vehicles are made for making the communication between the network nodes. Cluster Heads (CHs) are selected in each cluster for managing the whole cluster. This CH maintains the communication in the same cluster and with outside the other cluster. The lifetime of the cluster should be longer for increasing the performance of the network. Meanwhile, lesser the CH's in the network also lead to efficient communication in the VANETs. In this paper, a novel algorithm for clustering which is based on the social behavior of Gray Wolf Optimization (GWO) for VANET named as Intelligent Clustering using Gray Wolf Optimization (ICGWO) is proposed. This clustering based algorithm provides the optimized solution for smooth and robust communication in the VANETs. The key parameters of proposed algorithm are grid size, load balance factor (LBF), the speed of the nodes, directions and transmission range. The ICGWO is compared with the well-known meta-heuristics, Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) for clustering in VANETs. Experiments are performed by varying the key parameters of the ICGWO, for measuring the effectiveness of the proposed algorithm. These parameters include grid sizes, transmission ranges, and a number of nodes. The effectiveness of the proposed algorithm is evaluated in terms of optimization of number of cluster with respect to transmission range, grid size and number of nodes. ICGWO selects the 10% of the nodes as CHs where as CLPSO and MOPSO selects the 13% and 14% respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.3
• /
• pp.359-364
• /
• 2016

As cable TV networks have a media feature that is a broadband wire network, they can provide not only TV broadcasting services but also communication services. Accordingly, the cable TV network is mentioned as the optimal network for convergence of broadcasting and communication services. Recently, Available frequencies of the cable TV network have become insufficient as enhancement of video quality, increment of VoD service, and growth of high-speed internet service. This paper presents a new implementation method of switched digital video (SDV) technology that is introduced for obtaining additional frequency band. In the SDV system, only TV channels requested from viewer are sent and non-requested channels are dropped. The presented SDV uses a sharing method of TV broadcasting and communication service in a same frequency band. This method shows increase of spectrum efficient from switching of TV service channels without building a complex system.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.664-677
• /
• 2011

In order to control interference and improve spectrum efficiency in the femtocell and macrocell overlaid system (FMOS), we propose a joint frequency bandwidth dynamic division, clustering and power control algorithm (JFCPA) for orthogonal-frequency-division-multiple access-based downlink FMOS. The overall system bandwidth is divided into three bands, and the macro-cellular coverage is divided into two areas according to the intensity of the interference from the macro base station to the femtocells, which are dynamically determined by using the JFCPA. A cluster is taken as the unit for frequency reuse among femtocells. We map the problem of clustering to the MAX k-CUT problem with the aim of eliminating the inter-femtocell collision interference, which is solved by a graph-based heuristic algorithm. Frequency bandwidth sharing or splitting between the femtocell tier and the macrocell tier is determined by a step-migration-algorithm-based power control. Simulations conducted to demonstrate the effectiveness of our proposed algorithm showed the frequency-reuse probability of the FMOS reuse band above 97.6% and at least 70% of the frequency bandwidth available for the macrocell tier, which means that the co-tier and the cross-tier interference were effectively controlled. Thus, high spectrum efficiency was achieved. The simulation results also clarified that the planning of frequency resource allocation in FMOS should take into account both the spatial density of femtocells and the interference suffered by them. Statistical results from our simulations also provide guidelines for actual FMOS planning.