• Title/Summary/Keyword: 다중 홉

Search Result 296, Processing Time 0.028 seconds

A Study on the Efficient Interference Cancellation for Multi-hop Relay Systems (다중 홉 중계 시스템에서 효과적인 간섭 제거에 관한 연구)

  • Kim, Eun-Cheol;Cha, Jae-Sang;Kim, Seong-Kweon;Lee, Jong-Joo;Kim, Jin-Young;Kang, Jeong-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.47-52
    • /
    • 2009
  • The transmitted signal from a source is transmitted to a destination through wireless channels. But if the mobile destination is out of the coverage of the source or exists in the shady side of the coverage, the destination can not receiver the signal from the source and they can not maintain communication. In order to overcome these problems, we adopt relays. A system employing relays is a multi-hop relay system. In the multi-hop relay system, coverages of each relay that is used for different systems can overlap each other in some place. When there is a destination in this place, interference occurs at the destination. In this paper, we study on the efficient co-channel interference (CCI) cancellation algorithm. In the proposed strategy, CCI is mitigated by zero forcing (ZF) or minimum mean square error (MMSE) receivers. Moreover, successive interference cancellation (SIC) with optimal ordering algorithm is applied for rejecting CCI efficiently. And we analyzed and simulated the proposed system performance in Rayleigh fading channel. In order to justify the benefit of the proposed strategy, the overall system performance is illustrated in terms of bit error probability.

  • PDF

Design of Slot Reservation Multiple Access Algorithm in Single-hop Double Star Coupler WDM Networks (단일홉 이중 성형결합기 구조의 WDM 통신망에서 슬롯 예약 방식의 다중 접근 알고리즘 설계)

  • 엄종훈;김병재;류상률;김승호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.584-586
    • /
    • 1999
  • 본 논문에서는 파장 재사용 이중 단일홉 WDM(Wavelength Division Multiplexing) 통신망에서 전체 노드의 수가 사용 가능한 파장의 수보다 클 경우에 트래픽의 지역성(locality)을 고려하여 시간 분할 다중 접속 (TDMA) 방식으로 파장을 이용하는 다중 접근 알고리즘을 제안한다. 사용 가능한 파장을 그룹내에서 사용하는 전역 파장과 그룹간의 통신에 사용하는 지역 파장으로 나누고 전역 파장은 통신망에 속하는 모든 노드가 공유하고 지역 파장은 그룹내의 노드가 공유한다. 따라서 지역 파장은 모든 그룹 내에서 재사용 가능하기 때문에 전체 파장의 사용율이 증가한다. 모든 노드는 전역파장와 지역 파장으로 동조 가능한 하나의 동조 송신기와 전역 파장 중에 하나의 파장으로 수신 파장이 고정된 고정 수신기와 지역 파장 중에 하나의 파장으로 수신 파장이 고정된 고정 수신기를 가진다. 제안하는 알고리즘은 노드에서 패킷의 전송 요구가 필요한 만큼 슬롯 시간을 할당받아 모든 패킷을 연속해서 전송하는 슬롯 예약 방식을 채택한다. 이 방식은 동조 시간을 최소화함으로써 슬롯 시간을 모드 노드가 균일하게 할당하여 전체 동조 시간이 길어지는 고정 할당 방식보다 파장 사용율이 효율적이다.

  • PDF

Self-jamming based opportunistic relaying for a cooperative network (협력 네트워크를 위한 자가 전파방해 기반 기회적 중계 기법)

  • Kim, Jinsu;Lee, Jae Hong
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.07a
    • /
    • pp.371-372
    • /
    • 2012
  • 본 논문은 협력 네트워크(cooperative network)에서 무선 채널의 보안성(security) 강화를 위한 자가 전파방해(self-jamming) 기반 기회적 중계(opportunistic relaying) 기법을 제안한다. 단일 송신 단말 (source)과 단일 수신 단말(destination)이 다중 중계 단말(relay)의 협력을 통해 송수신하는 이중 홉(dualhop) 네트워크에서 도청 단말(eavesdropper)에 의한 정보 절취를 최소화하기 위해 자가 전파방해 기법과 기회적 중계 기법을 결합한다. 이를 통해 무선 채널의 방송(broadcasting) 특성에 기인한 도청 용이성을 저하 시키고, 다중 중계 단말의 송신 전력을 최소화하여 협력 네트워크의 수명(lifetime)을 연장한다. 컴퓨터 모의실험 결과를 통해 제안된 기법이 다중 중계기가 있는 이중 홉 협력 네트워크에서 보안 전송률(secrecy rate)의 불능확률(outage probability) 성능을 제고함을 보인다.

  • PDF

An Interference-Aware Multi-Path Routing Protocol for Multimedia Data Transmission over Wireless Sensor Networks (무선 센서 네트워크에서 멀티미디어 데이터 전송을 위한 간섭 회피 다중 경로 설정 기법)

  • Heo, Hyeong-Min;Yoo, Myung-Sik
    • 한국IT서비스학회:학술대회논문집
    • /
    • 2010.05a
    • /
    • pp.207-210
    • /
    • 2010
  • 무선 센서 네트워크 시스템을 이용한 많은 응용 시스템이 연구되고 있는 가운데, 최근 무선 센서 네트워크 시스템의 신뢰성 확보에 대한 문제점이 대두되었다. 이러한 문제점을 해결하기 위하여 영상 데이터를 전송함으로써 보다 신뢰성 있는 정보를 제공할 수 있는 멀티미디어 센서 네트워크에 대한 연구가 활발히 진행되고 있다. 그러나 영상 데이터를 저속의 멀티 홉 무선 센서 네트워크 환경에서 효율적으로 전송하는 프로토콜에 관련된 연구는 비교적 많지 않다. 지금까지의 통신 프로토콜들은 비교적 단순한 센싱 데이터를 전송할 수 있도록 설계되었으며, 새로운 응용들을 지원하기 위해서는 새로운 통신 프로토콜이 필요하다. 따라서 본 논문에서는 연속적인 영상 데이터를 멀티 홉 환경에서 효율적으로 전송할 수 있는 다중 경로 간 간섭이 없는 간섭 회피 다중 경로 설정 기법을 제안한다.

  • PDF

Probabilistic Directional Routing Protocol in Multi-Hop Maritime Communication Networks (다중-홉 선박 통신망에서 확률 기반의 지향성 라우팅 프로토콜)

  • Lee, Junman;Cho, Kumin;Yun, Changho;Kang, Chung G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.5
    • /
    • pp.857-859
    • /
    • 2015
  • In this letter, we consider a directional routing protocol that reduces the duplicated packets for AODV-based flooding in the course of establishing the end-to-end route in the multi-hop maritime ad-hoc networks. We propose an adaptive means of reducing the routing overhead subject to the node density and the target probability of successful routing that is analyzed by the stochastic geometry.

Opportunistic Data Relay Scheme for Narrowband Multihop Combat Radio Networks (협대역 다중홉 전투무선망에서 기회적 데이터 중계 기법)

  • Lee, Jongkwan
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.25 no.1
    • /
    • pp.65-71
    • /
    • 2022
  • In this paper, we propose an opportunistic data relay scheme in narrowband multihop combat radio networks. Narrowband networks have physical restrictions on high-speed transmission. Furthermore, the topology changes dynamically due to the jamming of the enemy, signal interference between friendly forces, and movement of network entities. Therefore, the traditional relay scheme that collects topology information and calculates a relay path before transmission is unsuitable for such networks. Our proposed scheme does not collect topology information and transmits data opportunistically. The scheme can cause unnecessary data relaying that is not related to data delivery to the destination node. However, for small networks, the effect of increasing network throughput by not gathering topology information is much greater than the effect of reducing throughput by unnecessary data relays. We demonstrate the performance superiority of the proposed scheme through simulation in the worst case of network topology.

Implementation of a Buoy System Based on Multi-Hop Relay Networks for Ocean Observation (해양관측을 위한 다중 홉 릴레이 네트워크 기반의 부이 시스템 구현)

  • Lee, Woon-hyun;Kwon, Hyuk-Jin;Kim, Si-moon;Jeong, SeongHoon;Kim, Jeongchang
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.3
    • /
    • pp.182-189
    • /
    • 2016
  • In this paper, we propose a buoy system based on multi-hop relay networks for ocean observation. The proposed system consists of various sensor modules, a gateway, wireless communication modules, and a remote monitoring site. The sensor modules are integrated with various communication interfaces and connected to the gateway of the proposed buoy system with an unified protocol based on controller area network (CAN)-bus. In order to communicate with the remote monitoring site and extend the coverage, the proposed system uses long-term evolution (LTE) router and XBee mesh network modules. The field test results show that the proposed system can extend the coverage using the proposed multi-hop relay network.

Wireless Multihop Communications for Frontier cell based Multi-Robot Path Finding with Relay Robot Random Stopping (다중홉 통신 기법을 활용한 네트워크 로봇의 협력적 경로 탐색)

  • Jung, Jin-Hong;Kim, Seong-Lyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11B
    • /
    • pp.1030-1037
    • /
    • 2008
  • This paper presents an algorithm for the path-finding problem in unknown environments with cooperative and commutative multi-robots. To verify the algorithm, we investigate the problem of escaping through the exit of a randomly generated maze by muti-robots. For the purpose, we adopt the so called frontier cells and cell utility functions, which were used in the exploration problem for the multi-robots. For the wireless communications among the mobile robots, we modify and utilize the so called the random basket routing, a kind of hop-by-hop opportunistic routing. A mobile robot, once it finds the exit, will choose its next action, either escape immediately or stay-and-relay the exit information for the others, where the robot takes one action based on a given probability. We investigate the optimal probability that minimizes the average escaping time (out of the maze to the exit) of a mobile robot.

A Cost-Aware Multi-path DSDV Routing Protocol in Wireless Mesh Networks (무선 메쉬 네트워크에서 비용 인지 다중 경로 DSDV 라우팅 프로토콜)

  • Lee, Seong-Woong;Chung, Yun-Won
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.289-296
    • /
    • 2008
  • In wireless mesh network, studies on routing protocols have been actively carried out recently, and hop count is used as a major routing metric in destination-sequenced distance-vector (DSDV) routing protocol, which is a representative proactive routing protocol. Although hop-by-hop multi-path (HMP) DSDV and enhanced HMP (EHMP) DSDV routing protocols perform routing by considering both hop count and residual bandwidth within one hop distance nodes, it has a shortcoming that routing is carried out via non-optimal path from the aspect of end-to-end routing. In order to overcome the shortcoming, a cost-aware multi-path (CAMP) DSDV routing protocol is proposed in this paper, which considers hop count and end-to-end minimum residual bandwidth. Simulation results based on NS-2 show that the proposed routing protocol performs better than DSDV, HMP DSDV, and EHMP DSDV protocols from the aspect of throughput and packet delivery ratio, by appropriately using hop count and end-to-end minimum residual bandwidth information and has the same number of management messages with HMP DSDV and EHMP DSDV protocols.

Energy and Delay-Efficient Multipath Routing Protocol for Supporting Mobile Sink in Wireless Sensor Networks (무선 센서 네트워크에서 이동 싱크를 지원하기 위한 다중 경로 라우팅 프로토콜)

  • Lee, Hyun Kyu;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.12
    • /
    • pp.447-454
    • /
    • 2016
  • The research on multipath routing has been studied to solve the problem of frequent path breakages due to node and link failures and to enhance data delivery reliability in wireless sensor networks. In the multipath routing, mobile sinks such as soldiers in battle fields and rescuers in disaster areas bring about new challenge for handling their mobility. The sink mobility requests new multipath construction from sources to mobile sinks according to their movement path. Since mobile sinks have continuous mobility, the existing multipath can be exploited to efficiently reconstruct to new positions of mobile sinks. However, the previous protocols do not address this issue. Thus, we proposed an efficient multipath reconstruction protocol called LGMR for mobile sinks in wireless sensor networks. The LGMR address three multipath reconstruction methods based on movement types of mobile sinks: a single hop movement-based local multipath reconstruction, a multiple hop movement-based local multipath reconstruction, and a multiple hop movement-based global multipath reconstruction. Simulation results showed that the LGMR has better performance than the previous protocol in terms of energy consumption and data delivery delay.