• 제목/요약/키워드: Multi Hop

검색결과 788건 처리시간 0.025초

무선 모바일 멀티 홉 네트워크에서의 인증 기법 고찰 및 개선 (Authentication Scheme in Wireless Mobile Multi-hop Networks)

  • 이용;이구연
    • 산업기술연구
    • /
    • 제27권B호
    • /
    • pp.43-51
    • /
    • 2007
  • In mobile multi-hop wireless networks, the authentication between a base station and a mobile multi-hop node, between multi-hop nodes, and between user a station and a multi-hop node is needed for the reliable and secure network operation. In this paper, we survey various authentication schemes which can be considered to be adopted in mobile multi-hop wireless networks and propose a concept of novel mutual authentication scheme applicable to mobile multi-hop network architecture. The scheme should resolve the initial trust gain problem of a multi-hop node at its entry to the network, the problem of rogue mobile multi-hop node and the problem of hop-by-hop authentication between multi-hop nodes. Effectively, the scheme is a hybrid scheme of the distributed authentication method and the centralized authentication method which are considered to be deployed in the wireless ad-hoc network and the wireless network connected to wired authentication servers, respectively.

  • PDF

LoRaWAN 통신용 Multi-hop 네트워크 설계에 관한 연구 (A Study on Multi-hop Network Design for LoRaWAN Communication)

  • 김민영;전형구;장종욱
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2019년도 춘계학술대회
    • /
    • pp.129-132
    • /
    • 2019
  • 본 논문은 IoT 제품에서 사용하는 데이터 통신망 중 LoRaWAN Gateway의 Back-haul 사용료 절감 및 통신 커버리지를 확장하기 위해 기존 Single-hop 방식에서 Multi-hop 기반의 네트워크로 설계를 위한 연구 내용 다룬다. 본 본문은 기존 Single-hop 방식으로 구현된 LoRaWAN의 통신방식을 분석하여 Multi-hop 네트워크를 어떻게 설계할 것인지 그리고 LoRaWAN 표준안을 분석하여 Multi-hop 네트워크 설계할 때 반영해야 하는 사안들을 무엇이 있는지 언급할 것이다.

  • PDF

전술 애드 혹 네트워크에서 다중 홉 전송을 위한 자원 예약 및 백오프 기법 (IEEE 802.11 MAC based Multi-hop Reservation and Backoff Scheme in MIMC Tactical Ad Hoc Networks)

  • 조윤철;윤선중;고영배
    • 한국군사과학기술학회지
    • /
    • 제15권1호
    • /
    • pp.16-27
    • /
    • 2012
  • In multi-interface multi-channel(MIMC) based tactical ad hoc networks, QoS support for required operational capacity is one of the main challenging issues for multi-hop transmissions. To support QoS in such a harsh environment, we propose a novel MAC scheme to minimize multi-hop as well as per-hop delay. The current IEEE 802.11 MAC protocols should contend to reserve the channel resource at every hop by each sender. The every-hop channel contention results in a degradation of end-to-end delay for multi-hop transmissions. The basic idea of our scheme is to make a "multi-hop reservation" at the MAC layer by using the modified RTS frame. It contains additional information such as destination information, packet priority, and hop count, etc. In addition, we differentiate the contention window area according to the packet priority and the number of hops to deliver packets in the predefined allowed latency. Our scheme can minimize the multi-hop delay and support the QoS of the critical data in real time(i.e., VoIP, sensing video data, Video conference between commanders). Our simulation study and numerical analysis show that the proposed scheme outperforms the IEEE 802.11 MAC.

멀티 홉 N-스크린 서비스를 위한 WiMedia D-MAC에서의 효율적인 멀티 홉 자원 예약 기술 (Efficient Multi-hop Resource Reservation Scheme in WiMedia D-MAC for Multi-hop N-Screen Services)

  • 허경
    • 한국정보통신학회논문지
    • /
    • 제19권5호
    • /
    • pp.1091-1096
    • /
    • 2015
  • 본 논문에서는 멀티 홉 N-스크린 서비스를 위한 무선 통신 MAC 구조로서, WiMedia Distributed-MAC 프로토콜을 적용하고, D-MAC 프로토콜에서 P2P 스트리밍이 가능한 OSMU (One Source Multi Use) 멀티 홉 N-스크린 서비스를 제공하기 위해, 종단 간 지연시간을 감소시키는 멀티 홉 자원 예약 기술을 제안하고 성능을 분석하였다. 이를 위해 새로운 MSCDRP (Multi-Stage Cooperative DRP) IE 기술을 제안하였다. 시뮬레이션 결과를 통해, 제안하는 N-스크린 멀티 홉 MSCDRP 기술은 다양한 멀티 홉 환경에서 기존 D-MAC 방식보다 향상된 지연시간 및 수율 성능을 나타내었다.

Secure Connectivity Probability of Multi-hop Clustered Randomize-and-Forward Networks

  • Wang, Xiaowei;Su, Zhou;Wang, Guangyi
    • ETRI Journal
    • /
    • 제39권5호
    • /
    • pp.729-736
    • /
    • 2017
  • This work investigates secure cluster-aided multi-hop randomize-and-forward networks. We present a hop-by-hop multi-hop transmission scheme with relay selection, which evaluates for each cluster the relays that can securely receive the message. We propose an analytical model to derive the secure connectivity probability (SCP) of the hop-by-hop transmission scheme. For comparison, we also analyze SCPs of traditional end-to-end transmission schemes with two relay-selection policies. We perform simulations, and our analytical results verify that the proposed hop-by-hop scheme is superior to end-to-end schemes, especially with a large number of hops or high eavesdropper channel quality. Numerical results also show that the proposed hop-by-hop scheme achieves near-optimal performance in terms of the SCP.

Dynamic Multi-frame Transmission Technology Using the WiMedia MAC for Multi-hop N-screen Services

  • Hur, Kyeong
    • Journal of information and communication convergence engineering
    • /
    • 제14권1호
    • /
    • pp.21-25
    • /
    • 2016
  • N-screen is a promising technology to improve support for multimedia multicasting, content sharing, content mobility, media scalability, and seamless mobility. In this paper, the WiMedia distributed-MAC (D-MAC) protocol is adopted for development of a seamless N-screen wireless service. Furthermore, to provide a multi-hop, one source multi-use N-screen service through point to point streaming in a seamless D-MAC protocol, a dynamic multi-frame transmission technology is proposed. In this technology, a dynamic time slot allocation scheme and a multi-hop resource reservation scheme are combined. In the proposed dynamic time slot allocation scheme, two thresholds, a hard threshold and a soft threshold, are included to satisfy the power consumption and delay requirements. A multi-frame DRP reservation scheme is proposed to minimize end-to-end delay during the multi-hop transmissions between N-screen devices. The proposed dynamic multi-frame transmission scheme enhances N-screen performance in terms of the multi-hop link establishment success rate and link establishment time compared to the conventional WiMedia D-MAC system.

Throughput-Delay Analysis of One-to-ManyWireless Multi-Hop Flows based on Random Linear Network

  • Shang, Tao;Fan, Yong;Liu, Jianwei
    • Journal of Communications and Networks
    • /
    • 제15권4호
    • /
    • pp.430-438
    • /
    • 2013
  • This paper addresses the issue of throughput-delay of one-to-many wireless multi-hop flows based on random linear network coding (RLNC). Existing research results have been focusing on the single-hop model which is not suitable for wireless multi-hop networks. In addition, the conditions of related system model are too idealistic. To address these limitations, we herein investigate the performance of a wireless multi-hop network, focusing on the one-to-many flows. Firstly, a system model with multi-hop delay was constructed; secondly, the transmission schemes of system model were gradually improved in terms of practical conditions such as limited queue length and asynchronous forwarding way; thirdly, the mean delay and the mean throughput were quantified in terms of coding window size K and number of destination nodes N for the wireless multi-hop transmission. Our findings show a clear relationship between the multi-hop transmission performance and the network coding parameters. This study results will contribute significantly to the evaluation and the optimization of network coding method.

무선 멀티 홉 통신에서 협력적인 무선 에너지 공유를 통한 생존시간 최대화 (Lifetime Maximization with Cooperative Wireless Energy Sharing in Wireless Multi-Hop Communications)

  • Choi, Hyun-Ho
    • 한국정보통신학회논문지
    • /
    • 제24권11호
    • /
    • pp.1550-1553
    • /
    • 2020
  • In this paper, we maximize the lifetime of a multi-hop path through a cooperative wireless energy sharing scheme between constituent nodes in a wireless multi-hop communication. Considering a bidirectional multi-hop communication environment, we present an optimization problem to maximize path lifetime by adjusting the amount of energy each node needs to share with its neighboring nodes. On the basis of solidarity property, i.e., the lifetime of the multi-hop path is maximized when the lifetimes of all nodes are the same, we convert the considered optimization problem into a linear programming problem and solve it easily. Simulation result shows that the proposed two-way wireless energy sharing method maximizes the path lifetime of multi-hop communications and approximately doubles the path lifetime compared with the one-way energy sharing method.

Performance Evaluation of Multi-Hop Communication Based on a Mobile Multi-Robot System in a Subterranean Laneway

  • Liu, Qing-Ling;Oh, Duk-Hwan
    • Journal of Information Processing Systems
    • /
    • 제8권3호
    • /
    • pp.471-482
    • /
    • 2012
  • For disaster exploration and surveillance application, this paper aims to present a novel application of a multi-robot agent based on WSN and to evaluate a multi-hop communication caused by the robotics correspondingly, which are used in the uncertain and unknown subterranean tunnel. A Primary-Scout Multi-Robot System (PS-MRS) was proposed. A chain topology in a subterranean environment was implemented using a trimmed ZigBee2006 protocol stack to build the multi-hop communication network. The ZigBee IC-CC2530 modular circuit was adapted by mounting it on the PS-MRS. A physical experiment based on the strategy of PS-MRS was used in this paper to evaluate the efficiency of multi-hop communication and to realize the delivery of data packets in an unknown and uncertain underground laboratory environment.

A Model for Analyzing the Performance of Wireless Multi-Hop Networks using a Contention-based CSMA/CA Strategy

  • Sheikh, Sajid M.;Wolhuter, Riaan;Engelbrecht, Herman A.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권5호
    • /
    • pp.2499-2522
    • /
    • 2017
  • Multi-hop networks are a low-setup-cost solution for enlarging an area of network coverage through multi-hop routing. Carrier sense multiple access with collision avoidance (CSMA/CA) is frequently used in multi-hop networks. Multi-hop networks face multiple problems, such as a rise in contention for the medium, and packet loss under heavy-load, saturated conditions, which consumes more bandwidth due to re-transmissions. The number of re-transmissions carried out in a multi-hop network plays a major role in the achievable quality of service (QoS). This paper presents a statistical, analytical model for the end-to-end delay of contention-based medium access control (MAC) strategies. These strategies schedule a packet before performing the back-off contention for both differentiated heterogeneous data and homogeneous data under saturation conditions. The analytical model is an application of Markov chain theory and queuing theory. The M/M/1 model is used to derive access queue waiting times, and an absorbing Markov chain is used to determine the expected number of re-transmissions in a multi-hop scenario. This is then used to calculate the expected end-to-end delay. The prediction by the proposed model is compared to the simulation results, and shows close correlation for the different test cases with different arrival rates.