• Title/Summary/Keyword: 다중홉 네트워크

Search Result 203, Processing Time 0.028 seconds

Multi-Hop Secondary Transmission in Cognitive Radio Networks Having Multiple Primary Sources (다수의 1 차 사용자가 존재하는 무선 인지 네트워크에서의 2 차 사용자 다중 홉 통신 연구)

  • Lee, Juhyun;Hong, Seung Geun;Lee, Jae Hong
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2015.11a
    • /
    • pp.41-42
    • /
    • 2015
  • 본 논문에서는 다수 1 차 사용자가 다수 존재하고 2 차 사용자들이 다중 홉 통신을 하는 스펙트럼 공유 방식 무선 인지 네트워크를 분석한다. 다수의 1 차 사용자로부터의 간섭신호를 고려하여 각 2 차 사용자에서의 수신 신호대간섭잡음비를 분석하고 이를 바탕으로 2 차 사용자 네트워크의 불능확률을 구한다. 모의실험을 통해 1 차 사용자의 수가 감소함에 따라 불능확률이 감소한다는 것을 확인하였다.

  • PDF

Energy-Efficient Routing Protocol based on Interference Awareness for Transmission of Delay-Sensitive Data in Multi-Hop RF Energy Harvesting Networks (다중 홉 RF 에너지 하베스팅 네트워크에서 지연에 민감한 데이터 전송을 위한 간섭 인지 기반 에너지 효율적인 라우팅 프로토콜)

  • Kim, Hyun-Tae;Ra, In-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.3
    • /
    • pp.611-625
    • /
    • 2018
  • With innovative advances in wireless communication technology, many researches for extending network lifetime in maximum by using energy harvesting have been actively performed on the area of network resource optimization, QoS-guaranteed transmission, energy-intelligent routing and etc. As known well, it is very hard to guarantee end-to-end network delay due to uncertainty of the amount of harvested energy in multi-hop RF(radio frequency) energy harvesting wireless networks. To minimize end-to-end delay in multi-hop RF energy harvesting networks, this paper proposes an energy efficient routing metric based on interference aware and protocol which takes account of various delays caused by co-channel interference, energy harvesting time and queuing in a relay node. The proposed method maximizes end-to-end throughput by performing avoidance of packet congestion causing load unbalance, reduction of waiting time due to exhaustion of energy and restraint of delay time from co-channel interference. Finally simulation results using ns-3 simulator show that the proposed method outperforms existing methods in respect of throughput, end-to-end delay and energy consumption.

An Effective Multi-hop Relay Algorithm in Wireless Mesh Network (무선 메쉬 네트워크 환경에서 효율적인 다중 홉 전달 기법)

  • Kim, Young-An;Park, Chul-Hyun;Hong, Choong-Seon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10B
    • /
    • pp.872-882
    • /
    • 2006
  • The Wireless Mesh Network uses a wireless communication technology with transmission rates similar to that of a cable, which is used as a backbone network. The topology structure is in a Mesh form which resembles an Ad-hoc network, however a metric is needed in order to set the channel and channel methods since the operation intentions and interior motions are different. This thesis proposes a metric(ETR : Expected Transmission Rate) that sets the channel with physical link performance and multi hop transmission capabilities. This metric will also be based on multi channel creation methods and Hop-by-hop routing techniques for an effective multi hop transmission with no loops.

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.

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.

Dynamic Slot Allocation Scheme in Tactical Multi-hop Networks for Future Soldier Systems (개인전투체계 다중홉 네트워크를 위한 동적 시간슬롯 할당 기법)

  • Lee, Jongkwan
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.24 no.1
    • /
    • pp.115-122
    • /
    • 2021
  • In this paper, we propose a dynamic slot allocation scheme to improve the slot utilization rate in tactical multi-hop networks in which the channel condition varies due to node movements. The proposed scheme takes advantage of the fact that nodes that are more than three hops apart can use the same slot simultaneously. The frame is divided into two parts: the control period and the data period. To know the available slot information within two-hop distance, the node exchanges a slot allocation information with one-hop neighbors during the control period. The node can get the information on idle slots that are not used within two-hop distance but assigned already to other nodes that are more than three-hop away. The identified idle slot can be used by the node, which increases the slot utilization rate. The performance analysis results of the proposed scheme show that it increases the slot utilization rate sufficiently despite the overhead of the control period in the multi-hop networks of the future soldier system.

Cooperative Analog and Digital (CANDI) Time Synchronization for Large Multihop Network (다중 홉 네트워크를 위한 디지털 및 아날로그 협동 전송 시간 동기화 프로토콜)

  • Cho, Sung-Hwan;Ingram, Mary Ann
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1084-1093
    • /
    • 2012
  • For large multihop networks, large time synchronization (TS) errors can accumulate with conventional methods, such as TPSN, RBS, and FTSP, since they need a large number of hops to cover the network. In this paper, a method combining Concurrent Cooperative Transmission (CCT) and Semi- Cooperative Spectrum Fusion (SCSF) is proposed to reduce the number of hops to cover the large network. In CCT, cooperating nodes transmit the same digitally encoded message in orthogonal channels simultaneously, so receivers can benefit from array and diversity gains. SCSF is an analog cooperative transmission method where different cooperators transmit correlated information simultaneously. The two methods are combined to create a new distributed method of network TS, called the Cooperative Analog and Digital (CANDI) TS protocol, which promises significantly lower network TS errors in multi-hop networks. CANDI and TPSN are compared in simulation for a line network.

Analysis of Power-Saving Protocols through Beacon Interval in Multi-hop Ad Hoc Networks based on IEEE 802.11 (IEEE 802.11기반 다중 홉 Ad Hoc 망에서 Beacon 간격에 따른 Power-Saving 프로토콜의 성능분석)

  • 김동일;김동현
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.141-144
    • /
    • 2003
  • The mobile radio networks can be divided into networks that has the base station or the infrastructures like AP(Access Point) and Ad Hoc network that hasn't any infrastructures. As there aren't any fixed infrastructures in Ad Hoc Networks, mobile nodes should transmit the data only among mobile nodes themselves. To supplement these weakpoints of the two networks, many studies about Ad Hocs based on the 802.11 are in progress. In this thesis, we try to propose the efficiency of the suggested protocols by comparing and analyzing power saving protocols according to the Beacon intervals in multi hop Ad Hoc Networks based on IEEE 802.11.

  • PDF

Analysis of Power-Saving Protocols through Beacon Interval in Multi-hop Ad Hoc Networks based on IEEE 802.11 (IEEE 802.11기반 다중 홉 Ad Hoc 망에서 Beacon 간격에 따른 Power-Saving 프로토콜의 성능분석)

  • 김동일;김동현
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.7
    • /
    • pp.1415-1420
    • /
    • 2003
  • The mobile radio networks can be divided into networks that has the base station or the infrastructures like AP(Access Point) and Ad Hoc network that hasn't any infrastructures. As there aren't any fixed infrastructures in Ad Hoc Networks, mobile nodes should transmit the data oかy among mobile nodes themselves. To supplement these weakpoints of the two networks, many studies about Ad Hon based on the 802.11 are in progress. In this thesis, we try to propose the efficiency of the suggested protocols by comparing and analyzing power saving protocols according to the Beacon intervals in multi hop Ad Hoc Networks based on IEEE 802.11.