• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2627-2640
• /
• 1998

In this paper, we analyze the performance of the virtual cell system[1] for the transmission of IP datagrams in mobile computer communications. A virtual cell consistsof a group of physical cells shose base stationsl are implemented b recote bridges and interconnected via high speed datagram packet switched networks. Host mobility is supported at the data link layer using the distributed hierachical location information of mobile hosts. Given mobility and communication ptems among physical cells, the problem of deploying virtual cells is equivalent to the optimization cost for the entire system where interclster communication is more expesive than intracluster communication[2]. Once an iptimal partitionof disjoint clusters is obtained, we deploy the virtual cell system according to the topology of the optimal partition such that each virtual cell correspods to a cluser. To analyze the performance of the virtual cell system, we adopt a BCMP open multipel class queueing network model. In addition to mobility and communication patterns, among physical cells, the topology of the virtual cell system is used to determine service transition probabilities of the queueing network model. With various system parameters, we conduct interesting sensitivity analyses to determine network design tradeoffs. The first application of the proposed model is to determine an adequate network bandwidth for base station networking such that the networks would not become an bottleneck. We also evaluate the network vlilization and system response time due to various types of messages. For instance, when the mobile hosts begin moving fast, the migration rate will be increased. This results of the performance analysis provide a good evidence in demonsratc the sysem effciency under different assumptions of mobility and communication patterns.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.920-929
• /
• 2004

Nowadays, wireless packet data services are provided over cdma2000 1x/1xEV-DO mobile communication network and Portable Internet are being standardized for users demanding higher data rate services. Portable Internet can provide high data rate services, but its service coverage is relatively small. If Portable Internet may be integrated with cdma2000 mobile networks, users are able to choose the best service according to service areas and get seamless services while they are moving around. At the same time, it is cost-effective for operators to construct and maintain the integrated network. For the purpose of effectively integrating Portable Internet into cdma2000 networks, we propose an integration scheme including network architecture, protocol architecture, functions in network elements, interfaces between them, and call-flow procedures. The integration scheme proposed in this paper adopts a tightly-coupled architecture for unified authentication/accounting and seamless services. In addition, the scheme can be implemented without modifying the existing cdma2000 mobile communication networks. It is also simple to develop the dual-mode mobile station. Through the simulation results based on the performance model for handoffs between cdma2000 and Portable Internet, it has teen validated that the proposed scheme diminishes packet losses compared with the loosely-coupled architecture.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.421-426
• /
• 2010

Due to the ease of deployment and the extended coverage, wireless mesh networks (WMNs) are gaining popularity and research focus. For example, the routing protocols that enhance the throughput on the WMNs and the link quality measurement schemes are among the popular research topics. However, most of these works assume that the locations of the mesh routers are predetermined. Since the operators in an Indoor mesh network can determine the locations of the mesh routers by themselves, it is essential to the WMN performance for the mesh routers to be initially placed by considering the performance issues. In this paper, we propose a mesh router placement scheme based on genetic algorithms by considering the characteristics of WMNs such as interference and topology. There have been many related works that solve similar problems such as base station placement in cellular networks and gateway node selection in WMNs. However, none of them actually considers the interference to the mesh clients from non-associated mesh routers in determining the locations of the mesh routers. By simulations, we show that the proposed scheme improves the performance by 30-40% compared to the random selection scheme.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.1
• /
• pp.36-44
• /
• 2007

This paper presented a hybrid ternary encoding scheme using 3-valued logic. It can adapt to the delay-insensitive(DI) model. We designed an asynchronous wrapper for the hybrid ternary encoding scheme to communicate with various asynchronous encoding schemes. It reduced about 50% of transmission lines and power consumption compared with the conventional 1-of-4 and ternary encoding scheme. The proposed wrappers were designed and simulated using the $0.18-{\mu}m$ standard CMOS technology. As a result, the asynchronous wrapper operated over 2 GHz communicating with a system bus. Moreover, the power dissipation of the system bus adapted the hybrid ternary encoding logic decreases 65%, 43%, and 36% of the dual-rail, 1-of-4, and ternary encoding scheme, respectively. The proposed data encoding scheme and the wrapper circuit can be useful for asynchronous high-speed and low-power asynchronous interface.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.2 no.1 s.2
• /
• pp.15-24
• /
• 2003

While public institutions and privite coperations have constructed the data collecting infrastructure and commercialized it to service traffic information, inaccuracy with information, insufficiency with the public sector, overapping investment and the rest are arising from the differences of data treatment, offering method, communication protocal and the like. For these reasons, we need standardization it as a national enterprise. In this paper, we would like to present the unity management and joint method of traffic information based on the present position of system construction and national ITS standardization. At first, we presented the relation between data elements and message sets and then analyzed how message sets have been used to message sets to share traffic information so far in public institutions and private coperations like Korea freeway cooperation-ITS model city-Cheonan-Nonsan expressway, In-cheon international airport expressway-Korea freeway cooperation and Seoul metropolitan police agency-Seoul metropolitan government. As the results of analyzing message sets, it had disclosed that data transmission is impossible or a system is unchangeable because data form and each items to transmission were different from each other and its own address and link IDS were not determined yet. Also it showed these message sets did not abidy by The Draft of National ITS Standards. First of all, we proposed data basic form and elements which were form by items used in each center in common and the elements to manage traffic information suggested by Standards based on the results of analyses.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.127-136
• /
• 2013

The study of the compatibility of EPUB DRM, granted by the Korea Copyright Commission, as a CT R & D project (Project Title: The Development of the standard reference software technology for International Standard EPUB-based eBook DRM) developed standards such as profile standards for encryption digital signature and authentication certificates and standards for technical terms of rights information. In 2012, these four standards have been established as the Korean Industrial Standards under the names of 'Encryption specification for EPUB DRM,' 'the Digital signature specification for EPUB DRM,' 'the Certificate specification for EPUB DRM,' and 'Definitions of Right Terms for EPUB DRM' through the ODPF(Open Digital Standardization Forum) and the TTA(Telecommunications Technology Association). The research project also proposed standards of ebook DRM license protocols in order for the four standards to practically apply to ebook DRM compatibility. It is necessary for technology standards to require a compatibility standard test process for testing whether implementations which were developed on the basis of the standard specification, comply with standards. This study suggests an automated compatible standard test method and a test model under the ebook DRM standard technical specification.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.179-187
• /
• 2014

The underlay protocol is a cognitive radio method in which secondary or cognitive users use the same frequency without affecting the quality of service (QoS) for the primary users. In addition, because of the broadcast characteristics of the wireless environment, some nodes, which are called eavesdropper nodes, want to illegally receive information that is intended for other communication links. Hence, Physical Layer Security is applied considering the achievable secrecy rate (ASR) to prevent this from happening. In this paper, a performance analysis of the amplify-and-forward scheme under an interference constraint and Physical Layer Security is investigated in the cooperative communication mode. In this model, the relays use an amplify-and- forward method to help transmit signals from a source to a destination. The best relay is chosen using an opportunistic relay selection method, which is based on the end-to-end ASR. The system performance is evaluated in terms of the outage probability of the ASR. The lower and upper bounds of this probability, based on the global statistical channel state information (CSI), are derived in closed form. Our simulation results show that the system performance improves when the distances from the relays to the eavesdropper are larger than the distances from the relays to the destination, and the cognitive network is far enough from the primary user.

• Journal of Broadcast Engineering
• /
• v.25 no.4
• /
• pp.560-568
• /
• 2020

In recent years, as network technology develops, the usage of streaming services by users is increasing. However, the complexity of streaming services is also increasing due to various terminal environments. Even when streaming the same content, it is necessary to re-encode the content according to the type of service. In order to solve the complexity and latency of the streaming service, Moving Picture Experts Group (MPEG) has standardized the Common Media Application Format (CMAF). In addition, as content transmission using a communication network becomes possible, the Republic of Korea's Ultra High Definition (UHD) broadcasting standard has been enacted as a hybrid standard using a broadcasting network and a communication network. The hybrid service enables various services such as transmitting additional information of contents or providing user-customized contents through a communication network. The Republic of Korea's UHD transmission standard utilizes MPEG Media Transport (MMT), and Mobile MMT is an extension of MMT to provide mobile network-specific functions. This paper proposes a method of inserting CMAF contents suitable for various streaming services using signaling messages of MMT and Mobile MMT. In addition, this paper proposes a model for content insertion system in heterogeneous network environment using broadcasting and communication networks, and verifies the validity of the proposed technology by checking the result of content insertion.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.47-54
• /
• 2004

The growth of computer resource and network speed has increased requests for the use of remotely located computer systems by connecting through computer networks. This phenomenon has hoisted research activities for application service provision that uses server-based remote computing paradigm. The server-based remote computing paradigm has been developed as the ASP (Application Service Provision) model, which provides remote users through application sharing protocol to application programs. Security requirement such as confidentiality, availability, integrity should be satisfied to provide ASP service using centralized computing system. Existing Telnet or FTP service for a remote computing systems have satisfied security requirement by a simple access control to files and/or data. But windows-based centralized computing system is vulnerable to confidentiality, availability, integrity where many users use the same application program installed in the same computer. In other words, the computing system needs detailed security level for each user different from others, such that only authorized user or group of users can run some specific functional commands for the program. In this paper, we propose windows based centralized computing system that sets security policies for each user for the use of instructions of the application programs, and performs access control to the instructions based on the security policies. The system monitors all user messages which are executed through graphical user interface by the users connecting to the system. Ail Instructions, i.e. messages, for the application program are now passed to authorization process that decides if an Instruction is delivered to the application program based on the pre-defined security polices. This system can be used as security clearance for each user for the shared computing resource as well as shared application programs.

• The KIPS Transactions:PartA
• /
• v.17A no.1
• /
• pp.9-18
• /
• 2010

Races that occur in shared-memory parallel programs such as OpenMP programs must be detected for debugging because of causing unintended non-deterministic results. Previous works which verify the existence of these races on-the-fly are limited to the programs without internal non-determinism. But in the programs with internal non-determinism, such works need at least N! execution instances for each critical section to verify the existence of races, where N is the degree of maximum parallelism. This paper presents a preprocessor that statically analyzes the locations of non-deterministic accesses using program slicing and can detect apparent races as well as potential races through single execution using the analyzed information. The suggested tool can deterministically monitor non-deterministic accesses to occur in OpenMP programs so that this tool can verify the existence of races even if it is used any race detection protocol which can apply to programs with critical section. To prove empirically this tool, we have experimented using a set of benchmark programs such as synthetic programs that involve non-deterministic accesses, OpenMP Microbenchmark, NAS Parallel Benchmark, and OpenMP application programs.