• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.899-903
• /
• 2017

In this paper, it is shown the in-vehicle network architecture and implementation for multimedia service which supports Human machine interface of multi-passengers. For multi-passengers' vehicle, it has to be considered the factor of network traffic, simultaneously data transferring to multi users and accessibility to use variety of media contents for passengers compared to conventional in-vehicle network architecture system Therefore, it is proposed the change of network architecture compared with general MOST network, implementation of designed software module which can be interoperable between ethernet and MOST network and accessible interface that passenger can be plugged into MOST network platform using their device based on ethernet network system.

• Journal of Digital Convergence
• /
• v.13 no.2
• /
• pp.127-133
• /
• 2015

In order for location information to deliver the collected information, it needs Sensor Nodes in an environment of Sensor Network. Each sensor sends data to a base station through the process of routing in a wireless sensor network environment. Therefore, Offering accurate location information is very important in a wireless sensor network environment. Most of existed routing methods save all the informations of nodes at the area of 1-hop. In order to save these informations, unnecessary wasted energy and traffics are generated. Routing Protocol proposed in this paper doesn't save node's location information, and doesn't exchange any periodic location information to reduce wasted energy. It includes transmission range of source nodes and nodes with the location information, however it doesn't include any nodes' routing near 1-hope distance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.220-223
• /
• 2016

Explosive growth of smartphone-based mobile nodes has increased exponentially the mobile data traffic on the Internet. To reduce the traffic load on the network and to support the seamless mobility of the mobile nodes, the IETF and 3GPP have standardized a number of mobility management mechanisms. More recently, they are making an effort to find some schemes to distribute the networking systems that involve in the mobility management in order to assure the scalability and the reliability of the network. In IETF, DMM concept for the distributed mobility management on the Internet is being discussed. Specifically, the DMM can be classified into the partially distributed management and fully distributed management. In this paper, we propose a fully distributed mobility management scheme (FuDMM) on PMIPv6-based network by applying the extended NDP. We also present the performance of FuDMM using the comparative analysis with the existing ones.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.10
• /
• pp.2397-2402
• /
• 2014

Recently, heterogeneous mobile communication network is attracting plenty of interest to serve explosively increasing mobile data traffic. Although the heterogeneous mobile communication network can enhance spatial reuse ratio by using both conventional macro cells and small cells simultaneously, it causes the unbalance in performance of downlink and uplink. In this paper, we propose a new cell selection scheme for heterogeneous mobile communication network. In the proposed cell selection scheme, mobiles select their home cells by considering both uplink and downlink performance, contrary to conventional schemes. We analyze the performance of the proposed scheme in terms of average cell transmission rate through system level simulations and compare it with those of conventional schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.77-82
• /
• 2015

Recently, multi-user massive MIMO (MU-Massive MIMO) network has attracted a lot of attention as a technology to accommodate explosively increasing mobile data traffic. However, the MU-Massive MIMO network causes a tremendous hardware complexity in a base station and computational complexity to select optimal set of users. In this paper, we thus propose a simple algorithm for selecting antennas and users while reducing the hardware and computational complexities simultaneously. The proposed scheme has a computational complexity of $O((N-S_a+1){\times}min(S_a,K))$, which is significantly reduced compared to the complexity of optimal scheme based on Brute-Force searching, $$O\left({_N}C_S_a\sum_{i=1}^{min(S_a,K)}_KC_i\right)$$, where N, $S_a$, and K denote the number of total transmit antennas, the number of selected antennas, and the number of all users, respectively.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.267-276
• /
• 2007

In OSPF, the larger and more unstable the area, the greater the likelihood for performance problems associated with routing protocol recalculation. Generally, an area should have no more than 50 routers. Areas with unstable links should be smaller. Military tactical data network is used for military operations during war-time. It consists of wireless network for mobility of node. Thus, it has low-bandwidth and unstable property. In addition, it is expected that many kinds of router-failure, Link-failure and recovery at emergency period. However, Military tactical data network is designed with about one and half times the number of recommendation. This paper proves that the traffic is limited by the increase of re-calculation of area.

• The Journal of the Korea Contents Association
• /
• v.3 no.2
• /
• pp.65-72
• /
• 2003

In this paper, the new scheme using a Combined Cache(CC) that combing the Paging and Routing Cache(PRC) and an alternative handoff method according to the type of data transmission for achieving the efficient realtime communication. The PRC and quasi-soft handoff method reduce the path duplication. But they increase the network traffic load because of the handoff state packet of Mobile Host(MH). Moreover the use the same handoff method without differentiating the type of transmission data. Those problems are solved by operating U with a semi-soft handoff method for realtime data transmission and with a hard handoff method for non-realtime data transmission. As a result or simulation a better performance is obtained because of the reduction of the number of control packet in case that the number of cells are below 20. And the packet arrival time and loss of packet decreased significantly for realtime data transmission.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.10
• /
• pp.1-9
• /
• 2004

User-Perceived application-level performance is a key to the adoption and success of CDMA 2000. To predict this performance in advance, a detailed end-to-end simulation model of a CDMA network was built to include application traffic characteristics, network architecture, network element details, and protocol features. We assess the user application performance when a Radio Access Network (RAN) and a Core Network (CN) adopt different transport architectures such as ATM and If. For voice Performance, we found that the vocoder bypass scenario shows 8% performance improvement over the others. For data packet performance, we found that HTTP v.1.1 shows better performance than that of HTTP v.1.0 due to the pipelining and TCP persistent connection. We also found that If transport technology is better solution for higher FER environment since the IP packet overhead is smaller than that of ATM for web browsing data traffic, while it shows opposite effect to small size voice packet in RAN architecture. Though simulation results we showed that the 3G-lX EV system gives much better packet delay performance than 3G-lX RTT, the main conclusion is that end-to-end application-level performance is affected by various elements and layers of the network and thus it must be considered in all phases of the technology evolution process.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.9-15
• /
• 2014

In this paper, We propose a block reallocation algorithm for reducing network traffic in Hadoop cluster. The scheduler of Hadoop cluster receives a job from users. And the job is divided into multiple tasks assigned to nodes. At this time, the scheduler allocates the task to the node that satisfied data locality. If a task is assigned to the node that does not have the data(block) to be processed, the task is processed after the data transmission from another node. There is difference of workload among nodes because blocks in cluster have different access frequency. Therefore, the proposed algorithm relocates blocks according to the task allocation pattern of Hadoop scheduler. Eventually, workload of nodes are leveled, and the case of the task processing in a node that does not have the block to be processing is reduced. Thus, the network traffic of the cluster is also reduced. We evaluate the proposed block reallocation algorithm by a simulation. The simulation result shows maximum 23.3% reduction of network consumption than default delay scheduling for jobs processing.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.251-261
• /
• 2014

In the typical P2P VOD system, it is very important to develop the fast and efficient peer searching scheme since the peers frequently join and leave to/from P2P system. This paper proposes a new peer searching scheme for P2P VOD system based on DHT network environment. The proposed scheme constructs DHT network by managing the peers having close playback starting times and close network locations into a peer all together. The peer information is mapped onto DHT nodes by hashing the key values each of which consists of the starting time and network location of the peer. From the simulation results, the number of messages required to search the partner peers are decreased, and the number of buffer maps exchanging among the peers are also decreased. The proposed scheme can reduce the average network distances among the partner peers. As a result, the proposed scheme makes routing more efficient and it saves the network resources by decreasing communication traffic overhead.