• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.12-21
• /
• 2000

Arrangement graph has desirable properties for design requirements of a multihop lightwave network, such as node and edge symmetry, low diameter, simple routing, etc. In this paper, arrangement lightwave network based on arrangement graph model is proposed as new logical topology of multihop lightwave network. In the proposed scheme, multistar and grouping of network are used for improving reusability of wavelength and scalability. Also, this paper shows that the proposed scheme is an alternative logical topology for application requiring more nodes with limited wavelengths by evaluating performance with related works.

• Information and Communications Magazine
• /
• v.24 no.5
• /
• pp.47-62
• /
• 2007

본 고에서는 셀룰러 이동망에서 다중 홉 릴레이를 도입할 때 셀 경계 및 릴레이 노드의 서비스 영역 경계에서의 서비스 불능 성능을 향상시키기 위한 방안으로서 다이버시티 이득을 제공할 수 있는 협력 통신 방식에 대해서 살펴본다. 협력 통신의 기본 개념과 관련 요소 기술들을 살펴보고, 특히 협력 통신을 고려한 다양한 전송 프로토콜들의 특성을 분석한다. 또한, IEEE 802.16e 규격의 IP-OFDMA기반 광대역 이동 액세스 망에서 이와 같은 협력 통신을 적용할 때 시스템 레벨의 성능 분석 결과를 고찰하고, 실제 시스템에서의 고려 사항에 대해서 살펴본다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.114-121
• /
• 2008

Multi-path routing has been studied widely in wired networks. Multi-path routing is known to increase end-to-end throughput and provide load balancing in wired networks. However, its advantage is not obvious in wireless multi-hop network because the traffic along the multiple paths may interfere with adjacent paths. In the paper, we introduce a new multi-path routing scheme, Cluster-Based Multi-Path Routing for multi-hop wireless networks. The main idea of the proposed routing scheme is to extend the hop-by-hop multi-path to a cluster-by-cluster multi-path. In cluster network, each cluster can work independently from other clusters and hence reduce interference. The purpose of the proposed scheme is to find a less interfering path for wireless multi-hop networks. We also showed the throughput improvement of the proposed scheme through simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.876-884
• /
• 2012

This paper introduces two multi-hop delay factors which can be caused by conventional TDMA scheduling; queueing delay and delay by random link scheduling, and proposes a new sequential scheduling scheme to resolve these two factors. We also simulate the TDMA network with the proposed link scheduling scheme and compare it with conventional(random) link scheduling scheme in terms of end-to-end packet transmission delay. From the simulation results, the more the average hop distance increases, the more the difference of the delay performance of both scheduling schemes increases. When the average number of hops is 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 22%, 36%, 48%, and 55% respectively when compared to the random scheduling scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.4
• /
• pp.163-168
• /
• 2010

In this paper, we propose novel two-way relaying scheme in which number of two users transmit the signal to number of two destination. The scheme is difference with conventional multi-hop two-way relay scheme in which number of two users exchange the each signal. In the conventional scheme, each user have to perform back-propagating self-interference method to remove the own signal from received signal. It occurred to increase the complexity for signal processing at the user. To overcome the problem, we apply the Pre-cancellation which can reduce the process of back-propagating self-interference to our proposal network Simulation result show that proposal scheme outperform the convention multi-hop two-way relay scheme. Also we analysis the trad-off between performance and complexity accordance with using Pre-cancellation method.

• Electronics and Telecommunications Trends
• /
• v.32 no.4
• /
• pp.67-77
• /
• 2017

최근 이슈가 되고 있는 자율주행차(Autonomous vehicle 또는 Self-driving car)를 실현하기 위해서는, 다양한 환경에서도 차량에 대한 끊김 없는 연결을 제공하는 커넥티드카(Connected car) 기술이 필수적이다. 현재 커넥티드카를 구현하기 위한 차량 네트워크(Vehicular network) 기술은 교통시스템 인프라 기반의 단일홉(Single-hop) 무선통신 기술이 주를 이루고 있다. 이러한 단일홉 통신은 커버리지가 교통시스템 인프라가 구축된 지역으로 제한된다. 따라서 차량 네트워크가 현재보다 더욱 넓은 지역을 커버하기 위해서는 차량 자체가 이동형 라우터 역할을 수행하여 차량 간의 전달을 통해 정보를 원거리로 전달할 수 있는 다중홉(Multi-hop) 통신 도입이 필요하다. 다중홉 차량 네트워크는 차량의 높은 동적 특성으로 인해 다수의 도전적인 기술적 이슈들을 가진다. 본고에서는 이러한 기술 이슈 중 차량 네트워크의 높은 이동성으로 발생할 수 있는 종단 노드 간 비연결성을 해결할 수 있는 기술인 지연감내형 차량 네트워킹(Delay-tolerant vehicular networking) 기술에 대한 주요 연구 동향을 살펴보고자 한다. 이를 위해 먼저 지연감내형 차량 네트워킹의 기술적 배경 및 주요 관련 기술들을 분석하고 이를 기반으로 향후 연구개발이 필요한 기술 이슈들을 정리한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.33-42
• /
• 2013

This paper presents a multihop range-free localization algorithm to estimate the physical location of a normal node with local connectivity information in anisotropic sensor networks. In the proposed algorithm, a normal node captures the detour degree of the shortest path connecting an anchor pair and itself by comparing the measured hop count and the expected hop count, and the node estimates the distances to the anchors based on the detour degree. The normal node repeats this procedure with all anchor combinations and pinpoints its location using the obtained distance estimates. The proposed algorithm requires fewer anchors and less communication overhead compared to existing range-free algorithms. We showed the superiority of the proposed algorithm over existing range-free algorithms through MATLA simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.57-62
• /
• 2014

The benefits of infrastructure support are shown by analyzing a throughput scaling law of an erasure network in which multiple relay stations (RSs) are regularly placed. Based on suitably modeling erasure probabilities under the assumed network, we show our achievable network throughput in the hybrid erasure network. More specifically, we use two types of physical models, a exponential decay model and a polynomial decay model. Then, we analyze our achievable throughput using two existing schemes including multi-hop transmissions with and without help of RSs. Our result indicates that for both physical models, the derived throughput scaling law depends on the number of nodes and the number of RSs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.931-937
• /
• 2015

Distributed relay scheme for wireless ad hoc multi-hop multicast network composed of low-power and low-complexity wireless devices with high density is proposed. The proposed relay scheme is shown to be better than flooding, which is the distributed relay scheme applied to ZigBee, in the outage probability and the multicast transmission rate by simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.12-17
• /
• 2009

We consider an OFDM based multiple AF relaying systems. Since the channel between first hop (source station-relay station) and second hop (relay station -destination station) varies independently, the subcarrier in the first hop can be paired to another subcarrier in the second hop for the increase of the system capacity. The conventional pairing which uses the brute force searching requires large complexity while giving optimal pairing for maximum system capacity. In this paper, we present sub-optimal subcarrier pairing scheme with low complexity. Every RS firstly pairs the subcarrier with the highest channel gain in the first hop to the subcarrier with highest channel gain in the second hop. The pair with the highest SNR among all the pairs is determined as final selected pair and the corresponding subcarriers are not selected at other RSs in the next paring iteration. This process is repeated until all the subcarriers are paired. Simulation results show the proposed pairing scheme achieves near optimal performance with low complexity.