• ETRI Journal
• /
• v.37 no.5
• /
• pp.833-844
• /
• 2015

Recently, new network systems have begun to emerge (for instance, 5G, IoT, and ICN) that require capabilities beyond that provided by existing IP networking. To fulfill the requirements, some new networking technologies are being proposed. The promising approach of the new networking technology is to try to overcome the architectural limitations of IP networking by adopting an identifier (ID)-based networking concept in which communication objects are identified independently from a specific location and mechanism. However, we note that existing ID-based networking proposals only partially meet the requirements of emerging and future networks. This paper proposes a new ID-based networking architecture and mechanisms, named IDNet, to meet all of the requirements of emerging and future networks. IDNet is designed with four major functional blocks-routing, forwarding, mapping system, and application interface. For the proof of concept, we develop numeric models for IDNet and implement a prototype of IDNet.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.867-876
• /
• 2015

This paper proposes an efficient interference control scheme for vehicular moving networks. The features of the proposed scheme are as follows: radio resources are separated into two resource groups to avoid interference between the cellular and vehicle-to-vehicle (V2V) links; V2V links are able to share the same radio resources for an improvement in the resource efficiency; and vehicles can adaptively adjust their transmission power according to the interference among the V2V links (based on the distributed power control (DPC) scheme derived using the network utility maximization method). The DPC scheme, which is the main feature of the proposed scheme, can improve both the reliability and data rate of a V2V link. Simulation results show that the DPC scheme improves the average signal-to-interference-plus-noise ratio of V2V links by more than 4 dB, and the sum data rate of the V2V links by 15% and 137% compared with conventional schemes.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.3
• /
• pp.83-87
• /
• 2011

TCP works well in wired networks where packet losses mainly occur due to congestion in data traffic. In wireless networks TCP does not differentiate packet losses from transmission errors or from congestion, which could lead to degrade the network performance. Several methods have been proposed to improve TCP performance over wireless links. Among them the Snoop module working at the base station is the popular method. In this paper, it is shown that the performance of Snoop largely depends upon the transmission link errors and the amount of data traffic. Also, our research shows that the local retransmission timeout value of Snoop can affect throughput. From the simulation results we suggest how to effectively use the Snoop algorithm considering data traffic and transmission link errors. It is expected that the proposed adaptive method will contribute to improving the network performance reducing the burden of the processes for data traffic.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.569-595
• /
• 2007

Particularly in wireless communications, link errors severely affect the quality of the services due to the high error probability and the specific error characteristics (burst errors) in the radio access part of the network. In this work, we show that thorough analysis and appropriate modeling of radio-link error behavior are essential to evaluate and optimize higher layer protocols and services. They are also the basis for finding network-aware cross-layer processing algorithms which are capable of exploiting the specific properties of the link error statistics, such as predictability. This document presents the analysis of the radio link errors based on measurements in live Universal Mobile Telecommunication System (UMTS) radio access networks as well as new link error models originating from that analysis. It is shown that the knowledge of the specific link error characteristics leads to significant improvements in the quality of streamed video by applying the proposed novel network- and content-aware cross-layer scheduling algorithms. Although based on live UMTS network experience, many of the conclusions in this work are of general validity and are not limited to UMTS only.

• ETRI Journal
• /
• v.35 no.4
• /
• pp.655-665
• /
• 2013

Hybrid digital multimedia broadcasting (DMB) is a next-generation mobile TV system that combines broadcasting and wireless communication networks and can provide various high-quality multimedia services. However, if a system adheres to the current standard of transmitting the DMB content in the form of MPEG2-TS through wireless networks, it results in a burden on the network due to low transmission efficiency. The reasons for the low transmission efficiency are as follows. First, due to its constant bitrate characteristic, DMB MPEG2-TS includes a considerable amount of needless information, such as NULL packets and stuffing bytes. Second, due to the inflexibility of the Real-time Transport Protocol (RTP) standard, one cannot fully utilize the maximum transmission unit of the network when converting MPEG2-TS to RTP stream for transmission. This paper proposes a new transmission scheme that resolves these problems. Experiment results show that the proposed scheme improves data bitrate transmission efficiency by 8% to 36%, compared to the standard scheme, in the streaming of various real-DMB contents.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.61-67
• /
• 2017

In this paper, an adaptive MAC technique for various underwater environment with narrow-bandwidth and low transmission speed was proposed. In previously published Underwater Packet Flow Control (UPFC) technique, three transmission types (normal, block and parallel transmission) had been proposed using the number of transmission and transmission time. In addition to the UPFC, the proposed technique is an improved version of UPFC having more effective queuing technique for merge transmission. A mathematical model of the proposed queuing theory was constructed and its increased efficiency per unit transmission number was also verified based on simulations.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.3
• /
• pp.78-92
• /
• 1999

In mobile computing environments, to efficiently use the narrow bandwidth of wireless networks a mobile host caches the data that are frequently accessed. To guarantee the correctness of the mobile transaction, the data cached in a mobile host must be consistent with the data in a server. This paper proposes a new strategy which maintains cache consistency efficiently when the data cached in a mobile host are inconsistent with the data in a server by the mobility of the mobile host at the asynchronous mobile environment. In this strategy, the size of the invalidation message is relatively small and is independent of the number of data to be invalidated under conditions of variable update rates/patterns. So this strategy uses the narrow bandwidth of wireless networks efficiently and reduces the communication cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.707-715
• /
• 2006

One of the most promising services on the wireless network is multimedia data service. With recently emerged wireless communication technologies which conventionally were devoted to mobile phone services, pre-encoded contents as well as live video data can be transmitted via the same network. As there is enough room in the improvement of data transmission bandwidth in wireless network, video data service is likely to be more demanding. In this paper, real time MPEG-4 video encoder is described as apart of a whole system for live video services over wireless networks. As there are minimal assumptions on the underlying networks, presented system and service can be easily supported by different network system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.107-116
• /
• 2006

In this paper, we propose a Sensing Resolution-based Grouping(SRG) protocol for wireless sensor networks. SRG is intended for meeting the application's sensing objectives, where sensor nodes are densely deployed and have the determinate accuracy requirement. The primary contribution of this paper is active group header node selection and round-robin procedure, which increase the sensing accuracy and evenly distribute the node energy consumption. The second contribution is use of energy efficient intermediate node selection by considering group size and energy consumption. We present the design principle of SRG and provide simulation results.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.