• Title/Summary/Keyword: Hop

Search Result 1,603, Processing Time 0.027 seconds

Optimization of Resource Allocation for Inter-Channel Load Balancing with Frequency Reuse in ASO-TDMA-Based VHF-Band Multi-Hop Data Communication System (ASO-TDMA기반 다중-홉 VHF 대역 데이터 통신 시스템의 주파수 재사용을 고려한 채널간 부하 균형을 위한 자원 할당 최적화)

  • Cho, Kumin;Lee, Junman;Yun, Changho;Lim, Yong-Kon;Kang, Chung G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1457-1467
    • /
    • 2015
  • Depending on the type of Tx-Rx pairs, VHF Data Exchange System (VDES) for maritime communication is expected to employ the different frequency channels. Load imbalance between the different channels turns out to be a critical problem for the multi-hop communication using Ad-hoc Self-Organizing TDMA (ASO-TDMA) MAC protocol, which has been proposed to provide the connectivity between land station and remote ship stations. In order to handle the inter-channel load imbalance problem, we consider a model of the stochastic geomety in this paper. After analyzing the spatial reuse efficiency in each hop region by the given model, we show that the resource utility can be maximized by balancing the inter-channel traffic load with optimal resource allocation in each hop region.

Multi-hop Transmission Scheme for Delay-Sensitive Information in Wireless Sensor Networks (무선 센서 네트워크에서 지연에 민감한 정보의 다중 홉 전송 기법)

  • Cha, Jae-Ryong;Kim, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.10
    • /
    • pp.876-884
    • /
    • 2012
  • This paper introduces two multi-hop delay factors which can be caused by conventional TDMA scheduling; queueing delay and delay by random link scheduling, and proposes a new sequential scheduling scheme to resolve these two factors. We also simulate the TDMA network with the proposed link scheduling scheme and compare it with conventional(random) link scheduling scheme in terms of end-to-end packet transmission delay. From the simulation results, the more the average hop distance increases, the more the difference of the delay performance of both scheduling schemes increases. When the average number of hops is 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 22%, 36%, 48%, and 55% respectively when compared to the random scheduling scheme.

Channel Estimation Techniques for OFDM-based Cellular Systems with Transparent Multi-hop Relays (트랜스패런트 다중 홉 릴레이를 갖는 OFDM 기반 셀룰러 시스템을 위한 채널 추정 기법)

  • Woo, Kyung-Soo;Yoo, Hyun-Il;Kim, Yeong-Jun;Lee, Hee-Soo;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8A
    • /
    • pp.813-819
    • /
    • 2007
  • In this paper, the effect of a propagation delay resulting from the use of an OFDM-based cellular system with a transparent mobile multi-hop relay(MMR) is initially analyzed. Then, channel estimation techniques, a least square(LS) method and a minimum mean square error(MMSE) method, for the OFDM systems with throughput enhancement(TE) MMR or cooperative MMR are proposed. The proposed channel estimation techniques can overcome the performance degradation caused by the propagation delay in TE MMR or cooperative MMR systems. It is demonstrated by computer simulation that the proposed channel estimation techniques for OFDM systems with transparent MMR are superior to the conventional techniques in terms of mean square error(MSE) and bit error rate(BER).

Performance Analysis of Optical Hard-Limiter for The Beat Noise in 2-Dimensional OCDMA Receivers (2차원 OCDMA 수신기에서 비트 잡음에 대한 Optical Hard-Limiter의 성능 분석)

  • 김정중;이인성
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.4C
    • /
    • pp.485-493
    • /
    • 2004
  • The system performance of 2-Dimensional wavelength hopping/time spreading optical CDMA systems is found to be limited by the occurrence of the beat noise between the components of the signal and the multiple user interference. This paper shows that the performance is analyzed under the beat noise and no beat noise to blow impact of the beat noise. To overcome this problem, the OHL(Optical Hard-Limiter) is used in the receiver. The performance is calculated for a optical CDMA system employing asymmetric and symmetric prime-hop 2-Dimensional codes, respectively The analysis results show that the performance improved 3.5 times of simultaneous users of before and after inserting OHL in the case of no beat noise. In the case of beat noise the performance improved 1.5 times of simultaneous users of before and after inserting OHL. The performance marked use of symmetric prime-hop code.

Hop Based Gossiping Protocol (HoGoP) for Broadcasting Message Services in Wireless Sensor Networks (무선 센서 망에서 브로드캐스팅 메시지 서비스를 위한 홉 기반 가십 프로토콜)

  • So, Won-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1B
    • /
    • pp.144-153
    • /
    • 2010
  • Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.

A Hierarchical Multicast Routing Protocol based on Zone Routing Technique for Wireless multi-hop Network (무선 다중 홉 네트워크에서의 지역 기반의 계층적 멀티캐스트 라우팅 프로토콜)

  • Gui, Yi-Qi;Zhang, Jie;Yang, Dong-Il
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.3
    • /
    • pp.149-156
    • /
    • 2011
  • In wireless multi-hop network, many applications need multicast communication where the group leader needs to send data to all members of the group. Multicast routing provides a balanced, efficient, and fairness network environment for the group members. However, large load for transmission management to leader node and signal interference between several paths for multi-hop links always took long transmission delay and low throughput efficiency. In this paper, we propose a Zone-based Hierarchical Multicast Routing Protocol (ZHMP). This routing protocol is designed based on zone routing schemes, where proactive routing is applied for intra-zone node level multicasting and reactive routing is used for searching inter-zone paths. By each hierarchical and independent multicast working in separated zones, load of multicast source node will be distributed by several zone-level routings for a better load balance and signal interference between each multi-hop paths will be resisted for a maximum multicast throughput.

A Study on Hierarchical Structure and Blockchain-based Node Authentication Mechanism in MANET (MANET에서 계층적 구조와 블록체인 기반 노드 인증 기법에 관한 연구)

  • Yang, Hwanseok
    • Convergence Security Journal
    • /
    • v.19 no.3
    • /
    • pp.13-19
    • /
    • 2019
  • MANET has many security vulnerabilities because it consists of only mobile nodes using wireless. In particular, it is a very important factor determining network performance that excludes the participation of malicious nodes through accurate reliability measurements and authentication of nodes participating in the network. In this paper, we proposed a technique applied with blockchain technology in order to prevent forgery of authentication information for nodes participating in the network. And, an area-based hierarchical structure was applied to increase the efficiency of authentication for nodes and apply the optimal technique of block generation and exchange protocol. In addition, four data payloads were added to the block header in order to add authentication information for nodes in block. To improve the reliability by applying the blockchain technique to the hop-by-hop data transfer method between mobile nodes, blockchain exchange protocol through transaction creation, block packaging and verification processes were implemented. We performed the comparative experiment with the existing methods to evaluate the performance of the proposed method and confirmed the excellent performance by the experiment results.

A Buffer Management Scheme for Multi-hop Traffic in IEEE 802.11 based Mesh Networks (IEEE 802.11 기반 메쉬 네트워크에서 다중 홉 트래픽을 위한 버퍼 관리 방식)

  • Jang, Kil-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5B
    • /
    • pp.455-462
    • /
    • 2009
  • In this paper, we propose a buffer management scheme for decreasing the packet loss due to buffer overflow and improving the packet fairness between nodes in IEEE 802.11 based multi-hop mesh networks. In the proposed scheme, each mesh router that is an intermediate node receives fairly packet sent from neighboring mesh routers and mobile nodes, and it improves the reception ratio of multi-hop traffic of neighboring mesh routers. Therefore, the proposed scheme can reduce transmission delay and energy consumption. In order to improving the packet loss and the packet fairness, the proposed scheme uses the modified RTS/CTS under the IEEE 802.11 MAC protocol and reduces the packet loss by recognizing the packet size to send to the destination in advance. By using the simulation, we evaluated the proposed scheme in terms of the packet loss ratio and the number of received packet in each mesh router, and compare it to a traditional scheme.

Multi-hop RFID Reader and Tag Communication Architecture for Port Logistics (항만 물류용 RFID 리더-태그 간 다중 홉 통신 구조)

  • Yoo, Young-Hwan;Kim, Jin-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5B
    • /
    • pp.532-541
    • /
    • 2009
  • The RFID technology has attracted much attention these days due to the far better efficiency than the bar-code and magnetic card system. As an important usage, the 433 MHz active RFID tag was already adopted to the container ports in the United States and Europe for container loading/unloading automation and equipment location. However, there is one problem to be solved for the complete automation. RFID readers support only the direct communication with tags within their RF communication range. Then there are a lot of containers and equipments such as crane, yard tractor, and forklift in ports; and because they are made of metal, they interfere the RF communication, resulting in the occurrence of the dead-zone. In the dead-zone, RFID tags cannot receive any signal from readers. There may be several solutions to resolve the dead-zone problem. Among them, this paper suggests the most economical solution where RFID tags in the dead-zone can communicate with readers via neighbor tags in the multi-hop manner The new RFID communication architecture should be carefully designed in order to maintain the compatibility with the previous standard. Our experiment shows that the proposed architecture works well even in the case where some tags are out of the RF range of reader.

Relaying Device Decision Algorithm for Multi-hop Routing in WiMedia (WiMedia에서 멀티홉 라우팅을 위한 중계 디바이스 선정 알고리즘)

  • Jung, Jin-Uk;Jin, Kyo-Hong;Hwang, Min-Tae;Jeon, Young-Ae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.109-113
    • /
    • 2011
  • In intelligent subway systems, UWB-based WiMedia D-MAC Protocol can be considered to send and receive multimedia data which requires high data rate. However, network devices which do not exist within 10 meters, the limited communication rage, can not communicate with each other because WiMedia does not support multi-hop communications. In this paper, we developed the algorithm to select a relaying device for multi-hop routing on WiMedia networks. In the first step, each device acquires information of neighbors through beacon and decides whether it is a normal or relaying device using the acquired information. In the next step, all devices can create the 2-hop routing table using the information received via relaying devices and the whole routing table for all devices on networks, eventually.

  • PDF