• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.353-356
• /
• 2001

In WCDMA systems, it is difficult to use high level modulation schemes in Rayleigh fading channel. Components of Multipath interference give signals much inteferences. Multipath interference cancellation is one of the method to overcome this problem. In this paper, multistage PIC algorithm is used to verify a performance of multipath interference cancellation. It is algorithm gradually canceling the multipath interferences as a stage number is increases. In computer simulations, it is verified that multipath interference cancelation is necessary and using its algorithm give much better performances than not using.

• Journal of Communications and Networks
• /
• 제6권1호
• /
• pp.26-34
• /
• 2004

A blind interference canceller in the presence of subchipspaced multipath channels for direct-sequence code division multiple access (DS-CDMA) down-link system is considered. This technique is based on combining the existing blind interference canceller with a technique that involves assigning subchip-tap spacing to the Rake receiver. The proposed receiver minimizes the receiver’s output energy subject to a constraint in order to mitigate the multiple access interference (MAI) along each multipath component, and then suboptimally combining all the multipath components. Moreover, it is able to mitigate the mismatch problem when subchip-spaced multipath components arrive at the blind interference canceller. It is known that optimal combining techniques perform a decorrelation operation before combining, which requires both knowledge and computational complexity. In the following, we have adopted a simpler but suboptimum approach in the combining of the suppressed signals at the output of our proposed receiver. Computer simulation results verify the effectiveness of the proposed receiver to handle subchip-spaced multipath components and still suppresses MAI significantly.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제23권2호
• /
• pp.116-121
• /
• 2017

무선 센서 네트워크에서 다중 경로는 저전력 센서의 특징으로 인해 에너지 효율적인 라우팅 방법들을 선호하였으며 라우팅 방법 중 이웃 노드들의 주변 정보를 통해 데이터를 전달하는 위치 기반 라우팅으로 다중 경로를 생성하였다. 하지만, 다중 경로가 라우팅 불가 지역에서 위치 기반 라우팅을 사용하면 경로들이 중복 사용되어 다중 경로의 디스조인트 특징을 유지하지 못한다. 이를 해결하기 위해, 다중 경로는 라우팅 불가 지역을 모델링하고 해당 지역을 우회하여 다중 경로의 디스조인트 특징을 보존하였다. 하지만 에너지 관점으로 보았을 때, 모델링과 같은 부가적인 작업은 노드의 에너지 소모를 증가시키며 센서 망의 수명을 단축시킨다. 본 논문에서는 라우팅 불가 지역에서 다중 경로의 디스조인트 특징을 보존하면서 에너지 효율적인 위치 기반 라우팅을 제안한다. 제안 방안은 노드의 에너지 소모를 줄이기 위해 모델링과 같은 부가적인 작업 없이 페이스 라우팅을 활용한다.

• Journal of Communications and Networks
• /
• 제17권4호
• /
• pp.406-418
• /
• 2015

Cognitive radio networks (CRNs) have emerged as a promising solution to the problem of spectrum under utilization and artificial radio spectrum scarcity. The paradigm of dynamic spectrum access allows a secondary network comprising of secondary users (SUs) to coexist with a primary network comprising of licensed primary users (PUs) subject to the condition that SUs do not cause any interference to the primary network. Since it is necessary for SUs to avoid any interference to the primary network, PU activity precludes attempts of SUs to access the licensed spectrum and forces frequent channel switching for SUs. This dynamic nature of CRNs, coupled with the possibility that an SU may not share a common channel with all its neighbors, makes the task of multicast routing especially challenging. In this work, we have proposed a novel multipath on-demand multicast routing protocol for CRNs. The approach of multipath routing, although commonly used in unicast routing, has not been explored for multicasting earlier. Motivated by the fact that CRNs have highly dynamic conditions, whose parameters are often unknown, the multicast routing problem is modeled in the reinforcement learning based framework of learning automata. Simulation results demonstrate that the approach of multipath multicasting is feasible, with our proposed protocol showing a superior performance to a baseline state-of-the-art CRN multicasting protocol.

• ETRI Journal
• /
• 제40권3호
• /
• pp.376-388
• /
• 2018

In through-the-wall radar imaging (TWRI), the presence of front and side walls causes multipath propagation, which creates fake targets called multipath ghosts. They populate the scene and reduce the probability of correct target detection, classification, and localization. In modern TWRI, specular multipath exploitation has received considerable attention for reducing the effects of multipath ghosts. However, this exploitation is challenged by the requirements of the reflecting geometry, which is not always available. Currently, the demand for a high radar image resolution dictates the use of a large aperture and wide bandwidth. This results in a large amount of data. To tackle this problem, compressive sensing (CS) is applied to TWRI. With CS, only a fraction of the data are used to produce a high-quality image, provided that the scene is sparse. However, owing to multipath ghosts, the scene sparsity is highly deteriorated; hence, the performance of the CS algorithms is compromised. This paper presents and discusses the adverse effects of multipath ghosts in TWRI. It describes the physical formation of ghosts, their challenges, and existing suppression techniques.

• 한국통신학회논문지
• /
• 제37권1B호
• /
• pp.21-30
• /
• 2012

무선센서네트워크는 전력 공급이 제한적인 대규모의 센서 노드들로 구성되어 있다. 에너지 비용의 최소화와 여러 홉을 거쳐 싱크 노드까지 안정적으로 데이터전송의 신뢰성을 높이는 것은 매우 중요한 요소이다. 데이터 전송의 신뢰성을 높이는 방안으로 다중경로 라우팅 방안이 제시되고 있다. 플러딩 기반의 다중경로 라우팅 방식은 불규칙적 무선센서네트워크에서도 효과적으로 다중경로를 구성할 수 있는 장점이 있지만 전원 공급에서 제약이 많은 무선센서네트워크에서는 적합하지 않은 라우팅 방식이다. 그러나 최소의 오버헤드를 가진 지역 위치정보를 이용하는 위치기반 라우팅 방식은 비플러딩 방식으로 무선센서네트워크에서 효율적인 방식이지만 다중경로 구성 시 데이터 패킷의 충돌을 유발할 수 있다. 패킷 충돌을 제어할 수 있는 방안으로 다중경로 파이프라인 개념을 도입하였지만 홀과 같은 불규칙적 네트워크에서는 파이프라인을 구성하기가 어렵다. 이러한 문제점을 해결하기 위하여 가상 그리드 좌표 상에서 위치기반 포워딩 방식과 다중경로 상의 홀 회피 알고리즘이 결합된 새로운 다중경로 라우팅 방식을 제안한다. 제안된 다중경로 방식은 불규칙적 무선센서네트워크에서 효율적이고 전송 신뢰성을 높일 수 있는 노드 분리된 다중경로(multipath) 파이프라인을 구성할 수 있는 방식이다. 시뮬레이션 결과는 이러한 주장의 타당성을 제공한다.

• 제어로봇시스템학회논문지
• /
• 제18권10호
• /
• pp.977-987
• /
• 2012

One of the most significant errors in the pseudo-range measurement performance of GNSSes (Global Navigation Satellite Systems) is their multipath error for high-precision applications. Several schemes to mitigate this error have been studied. Most of them, however, have been focused on the GPS (Global Positioning System) L1 C/A (Coarse/Acquisition) signal that was designed in the 1970s and is still being used for civil navigation. Recently, several modernized signals that were especially conceived to more significantly mitigate multipath errors have been introduced, such as Time Multiplexed and Composite Binary Offset Carrier (TMBOC and CBOC, respectively) signals. Despite this advantage, however, a problem remains with the use of TMBOC and CBOC modulations: the ambiguity of BOC (Binary Offset Carrier)-modulated signal tracking. In this paper, a novel unambiguous multipath error mitigation scheme for these modernized signals is proposed. The proposed scheme has the same complexity as HRCs (High Resolution Correlators) but with low ambiguity. The simulation results showed that the proposed scheme outperformed or performed at par with the HRC in terms of their multipath error envelopes and running averages in the static and statistical channel models. The ranging error derived by the mean multipath error of the proposed scheme was below 1.8 meters in an urban area in the statistical channel model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권8호
• /
• pp.3900-3916
• /
• 2019

The modern mobile devices are typically equipped with multiple network interfaces, e.g., 4G LTE, Wi-Fi, Bluetooth, but the current implementation of TCP can support only a single path at the same time. The Multipath TCP (MPTCP) leverages the multipath feature and provides (i) robust connection by utilizing another interface if the current connection is lost and (ii) higher throughput than single path TCP by simultaneously leveraging multiple network paths. However, if the performance between the multiple paths are significantly diverse, the receiver may have to wait for packets from the slower path, causing reordering and buffering problems. To solve this problem, previous MPTCP schedulers mainly focused on predicting the latency of the path beforehand. Recent studies, however, have shown that the path latency varies by a large margin over time, thus the MPTCP scheduler may wrongly predict the path latency, causing performance degradation. In this paper, we propose a new MPTCP scheduler called, choose fastest subflow (CFS) scheduler to solve this problem. Rather than predicting the path latency, CFS utilizes the characteristics of these paths to reduce the overall flow completion time by redundantly sending the last part of the flow to both paths. We compare the performance through real testbed experiments that implements CFS. The experimental results on both synthetic packet generation and actual Web page requests, show that CFS consistently outperforms the previous proposals in all cases.

• Journal of Communications and Networks
• /
• 제4권2호
• /
• pp.148-157
• /
• 2002

This paper investigates schemes to improve TCP performance in multipath forwarding networks. In multipath routing, packets to the same destination are sent to multiple next-hops in either packet-level or flow-level forwarding mode. Effective bandwidth is increased since we can utilize unused capacity of multiple paths to the destination. In packet-level multipath forwarding networks, TCP performance may not be enhanced due to frequent out-of-order segment arrivals at the receiver because of different delays among paths. To overcome this problem, we propose simple TCP modifications. At the sender, the fast retransmission threshold is adjusted taking the number of paths into consideration. At the receiver, the delayed acknowledgment scheme is modified such that an acknowledgment for an out-of-order segment arrival is delayed in the same way for the in-order one. The number of unnecessary retransmissions and congestion window reductions is diminished, which is verified by extensive simulations. In flow-level multipath forwarding networks, hashing is used at routers to select outgoing link of a packet. Here, we show by simulations that TCP performance is increased in proportion to the number of paths regardless of delay differences.

• 한국인터넷방송통신학회논문지
• /
• 제19권2호
• /
• pp.91-96
• /
• 2019

일반적인 무선 센서 네트워크는 연결이 안정적이지 않고 외부 간섭에 민감하며 토폴로지가 유동적이므로 상황에 맞는 효율적인 전송 경로 설정이 중요하다. IETF (Internet Engineering Task Force)의 RPL(IPv6 Routing Protocol for Low-power Lossy Networks) 표준 라우팅 프로토콜은 다양한 환경 변화에 유연하게 대응하기 어려우며 네트워크 토폴로지의 불균형으로 인한 패킷 손실 문제가 상존한다. 다중경로로 여러 부모 노드를 통해 패킷을 전송할 경우 이러한 문제를 부분적으로 해결할 수 있지만 경우에 따라 필요 이상의 timeslot 할당으로 지연시간 증가를 초래할 수 있다. 본 논문에서는 상황에 따라 적절하게 다중경로를 사용하는 적응형 다중경로 RPL 알고리즘을 제안하고, 시뮬레이션을 통해 이의 효율성이 기존 RPL이나 다중경로 RPL에 비해 높음을 보였다.