• Title/Summary/Keyword: Multi-Hop

Search Result 788, Processing Time 0.025 seconds

An Enhanced DAP-NAD Scheme for Multi-Hop Transmission in Combat Net Radio Networks (전투 무선망에서 다중 홉 전송을 위한 향상된 DAP-NAD 기법)

  • Jung, Jong-Kwan;Kim, Jong-Yon;Roh, Byeong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.10
    • /
    • pp.977-985
    • /
    • 2012
  • Recently, many countries have been developing new protocols to improve the performance of tactical ad hoc networks for implementing NCW (Network Centric Warfare). Combat net radio (CNR) networks are the most important communication infra for the ground forces such as infantry of Army. U.S. Army had developed MIL-STD-188-220D that is the Interoperability Standard for DMTDs (Digital Messages Transfer Device Subsystems) for voice and data communication in CNR. MIL-STD-188-220D is a candidate for MAC protocol of TMMR which is next radio and has a few constraints to used in TMMR. NAD (Network Access Delay) defined in MIL-STD-188-220D needs time synchronization to avoid collision. However, it is difficult for time synchronization to fit in multi-hop environment. We suggest the enhanced DAP (Deterministic Adaptable Priority)-NAD to prevent conflicts and decrease delays in multi-hop CNR. Simulation results show that the proposed scheme improves the performance in multi-hop CNR networks.

A Decision Scheme of Amount of Required Resources for Adaptive Resource Reuse in Wireless Multi-hop Systems (무선 멀티홉 시스템에서 적응적 자원 재사용을 위한 요구 자원량 결정 기법)

  • Bae, Byung-Joo;Shin, Bong-Jhin;Hong, Dae-Hyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3A
    • /
    • pp.229-234
    • /
    • 2009
  • In this paper, we propose a decision scheme of amount of required resources in wireless multi-hop systems which can reuse radio resources adaptively among relay stations (RSs). Base stations (BSs) can allocate resources dynamically based on amount of required resources of each RS. Moreover using resource reuse with this allocation method can increase amount of available resources in multi-hop systems. Generally, BSs allocate same amount of resources for RSs which share and reuses same resources for each other. Since amount of required resources are different among these RSs, a decision scheme of a specific value which can represent various required resources of RSs is needed. We propose this scheme which can decide the representative value of required resources of RSs adaptively based on the amount of required resources and the buffer state of each RS. Our simulation results show that the proposed scheme can increase performance of a multi-hop system. System capacity with the proposed adaptive scheme is increased by twice as large as one with a fixed representation value.

Implementation of Multimedia Services in a Mobile Ad-hoc Network (이동 Ad-hoc 네트워크에서의 멀티미디어 서비스 구현)

  • Ro Kwang-Hyun;Kwon Hye-Yeon;Shin Jae-Wook;Park Ae-Soon
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.7 no.2
    • /
    • pp.45-52
    • /
    • 2006
  • Mobile Ad-hoc Network(MANET) could be applied to various applications by virtue of its characteristics such as self-organizing and infrastructure-free network. This paper proposes a multimedia application service model for MANET, called multi-hop Relay(mRelay) system. It supports a multi-hop communication-based multimedia service interworked with Internet by using an unmanned moving robot with wireless multimedia communication function as a mRelay terminal. The modified AODV routing protocol was applied to the terminal and it was verified that composition and maintenance of mobile Ad-hoc network in mRelay system under the various indoor scenarios were successful and stable multi-hop multimedia services were possible. The mRelay system can be applicable to various application services of mobile Ad-hoc networks.

  • PDF

Throughput and Delay of Single-Hop and Two-Hop Aeronautical Communication Networks

  • Wang, Yufeng;Erturk, Mustafa Cenk;Liu, Jinxing;Ra, In-ho;Sankar, Ravi;Morgera, Salvatore
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.58-66
    • /
    • 2015
  • Aeronautical communication networks (ACN) is an emerging concept in which aeronautical stations (AS) are considered as a part of multi-tier network for the future wireless communication system. An AS could be a commercial plane, helicopter, or any other low orbit station, i.e., Unmanned air vehicle, high altitude platform. The goal of ACN is to provide high throughput and cost effective communication network for aeronautical applications (i.e., Air traffic control (ATC), air traffic management (ATM) communications, and commercial in-flight Internet activities), and terrestrial networks by using aeronautical platforms as a backbone. In this paper, we investigate the issues about connectivity, throughput, and delay in ACN. First, topology of ACN is presented as a simple mobile ad hoc network and connectivity analysis is provided. Then, by using information obtained from connectivity analysis, we investigate two communication models, i.e., single-hop and two-hop, in which each source AS is communicating with its destination AS with or without the help of intermediate relay AS, respectively. In our throughput analysis, we use the method of finding the maximum number of concurrent successful transmissions to derive ACN throughput upper bounds for the two communication models. We conclude that the two-hop model achieves greater throughput scaling than the single-hop model for ACN and multi-hop models cannot achieve better throughput scaling than two-hop model. Furthermore, since delay issue is more salient in two-hop communication, we characterize the delay performance and derive the closed-form average end-to-end delay for the two-hop model. Finally, computer simulations are performed and it is shown that ACN is robust in terms of throughput and delay performances.

A Control Channel Access Scheme for Clustered Multi-interface Multi-hop Cognitive Radio Networks (클러스터 형태의 다중 인터페이스 다중 홉 인지 라디오 네트워크를 위한 제어 채널 접근 기법)

  • Lee, Ji-Wun;Jeon, Wha-Sook;Jeong, Dong-Geun
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.4
    • /
    • pp.301-306
    • /
    • 2010
  • We propose the control channel access scheme for multi-interface multi-hop cognitive radio (CR) environment having a cluster structure. Due to the difficulty of obtaining common channels across the entire CR network, most multi-interface multi-hop CR networks put the control channel outside the CR bandwidth and dedicate one network interface to it in order to exchange the control information such as the activation of licensed users. However, this will be the waste of the network interface. Our focus is how to alternate between the control and the data channel without multichannel hidden node problem under the cluster structure where CR nodes connect with neighbors through multiple data channels. By using simulation, we evaluate the performance of the proposed scheme. The results show that the proposed scheme achieves higher network throughput than the dedicated scheme where one network interface card should dedicate to the control channel and cannot be used for data transmission.

Particle filter-assisted ad hoc routing in a multi-hop wireless ad hoc network for multi-robots

  • Doh, Nak-Ju Lett;Nam, Chang-Joo;Lee, Suk-Kyu;Kim, Hwang-Nam
    • Journal of IKEEE
    • /
    • v.14 no.4
    • /
    • pp.312-316
    • /
    • 2010
  • We describe in this paper how to facilitate ad hoc routing with a particle filter in a hostile radio environment for multi-hop wireless ad hoc networks that connect multi-robots. The proposed scheme increases a connection's throughput by exploiting alternative links without going through the procedure of route discovery when link failure happens among multi-robots' networking. The scheme is implemented by using a particle filter to find strongly connected nodes. The filter estimates the probability distribution function in a sample-based manner with N particles. The particles are associated with a weight which represents the probability of the corresponding node to be the node with the best link. At every step of the estimation, the weights of particles are calculated and particles are resampled based on the weights. Since a node with the strongest link status possesses the largest number of particles, we take this node to forward the packets.

An Optimal Path Routing in Wireless Mesh Network (무선 메쉬 네트워크에서 최적화된 경로선정을 위한 라우팅)

  • Lee, Ae-Young;Roh, II-Soon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.43-48
    • /
    • 2009
  • Wireless mesh networks, unlike Ad-hoc network, has low mobility and multi-path communication between terminals and other networks because it has the backbone structures. Most studies are advanced on finding the optimal routing path in multi-hop wireless mesh network environment. Various routing metric, minimum number of hops(Hop_count) and ETX, ETT metric, are proposed to wireless mesh networks. However, most metrics cannot identify the high throughput routing paths because this metric uses a different measurement parameters in each direction. So actual delivery rate does not provide to this metric. This paper describes the metric and implementation of IETC as a metric. This paper shows the improvement in performance.

  • PDF

Efficient Aggregation and Routing Algorithm using Local ID in Multi-hop Cluster Sensor Network (다중 홉 클러스터 센서 네트워크에서 속성 기반 ID를 이용한 효율적인 융합과 라우팅 알고리즘)

  • 이보형;이태진
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.135-139
    • /
    • 2003
  • Sensor networks consist of sensor nodes with small-size, low-cost, low-power, and multi-functions to sense, to process and to communicate. Minimizing power consumption of sensors is an important issue in sensor networks due to limited power in sensor networks. Clustering is an efficient way to reduce data flow in sensor networks and to maintain less routing information. In this paper, we propose a multi-hop clustering mechanism using global and local ID to reduce transmission power consumption and an efficient routing method for improved data fusion and transmission.

  • PDF

Cooperative Beamformer Design for Improving Physical Layer Security in Multi-Hop Decode-and-Forward Relay Networks

  • Lee, Han-Byul;Lee, Jong-Ho;Kim, Seong-Cheol
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.187-199
    • /
    • 2016
  • In this paper, we consider secure communications in multi-hop relaying systems, where multiple decode-and-forward (DF) relays are located at each individual hop and perform cooperative beamforming to improve physical layer security. In order to determine the cooperative relay beamformer at each hop, we propose an iterative beamformer update scheme using semidefinite relaxation and bisection techniques. Numerical results are presented to verify the secrecy rate performance of the proposed scheme.

Two-Way Relaying-Based Two-Hop Two-User Multiple-Input Multiple-Output System

  • Cho, Young Seek;Choi, Seyeong
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.2
    • /
    • pp.67-74
    • /
    • 2014
  • In multi-hop communication systems, two-way relaying is one of the solutions to mitigate the spectral efficiency loss caused by a half-duplex transmission. In this paper, a simple two-way relaying scheme is proposed for two-hop two-user multiple input multiple output (MIMO) systems. In the proposed system, a base station and a relay station (RS), both equipped with two antennas, form a point-to-point MIMO channel, while the RS and two single-antenna mobile users form a point-to-multipoint multiuser (MU)-MIMO channel. Numerical examples show that the proposed system achieves a significant sum rate gain as compared to a one-way relaying system as the distance between a relay and the two users decreases. We also show that although we can expand the proposed scheme to more than two users, its performance gain as compared to that of one-way relaying decreases with an increase in the number of users.