• Title/Summary/Keyword: 다중 홉

Search Result 296, Processing Time 0.029 seconds

An Efficient Mobility Support Scheme based Multi-hop ARP in Wireless Mesh Networks (무선메쉬 네트워크 환경에서 다중홉 ARP 기반의 효율적인 이동성 지원)

  • Jeon, Seung-Heub;Cho, Young-Bok;Lee, Sang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.11
    • /
    • pp.91-96
    • /
    • 2009
  • In this paper, interoperability in heterogeneous wireless mesh network, and mesh nodes for providing efficient IP mobility technique offers multi-hop ARP. Heterogeneous wireless mesh networks to MANETs based on a wireless mesh network backbone and non-MANET architecture is based on a client wireless mesh network and the two mobile networks, combined with a hybrid wireless mesh network are separate. In two different hybrid wireless mesh network routing protocols used to connect the two protocols in the protocol conversion at the gateway to parallel processing problems seriously overload occurs. All of the network reliability and stability are factors that reduce. Therefore, for efficient integration with L3 routing protocols, design techniques to build ARP multi-hop go through the experiment to increase the number of mesh nodes, the packet forwarding rate and an increased hop number of the node was to ensure reliability and stability.

Throughput Analysis of ASO-TDMA in Multi-hop Maritime Communication Network (다중-홉 선박 통신 네트워크를 위한 애드혹 자율 구성 TDMA 방식의 수율 성능 분석)

  • Cho, Kumin;Yun, Changho;Kang, Chung G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.741-749
    • /
    • 2012
  • Ad Hoc Self-Organizing TDMA (ASO-TDMA) has been proposed as a specification to support the multi-hop data communication service for ships over VHF band. It allows for organizing a multi-hop ad-hoc network in a distributed manner by sharing the radio resources among the ships navigating along the route. In this paper, Markov chain analysis is given to provide the average throughput performance for ASO-TDMA protocol Furthermore, the analytical results are verified with computer simulation, which shows that there exists the optimal transmission rate to maximize the average throughput as the subframe size and the number of ships are varying in each hop region.

Dynamic-size Multi-hop Clustering Mechanism in Sensor Networks (센서 네트워크에서의 동적 크기 다중홉 클러스터링 방법)

  • Lim, Yu-Jin;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.875-880
    • /
    • 2005
  • One of the most important issues in the sensor network with resource-constrained sensor nodes is prolonging the network lifetime by efficiently utilizing the given energy of nodes. The most representative mechanism to achieve a long-lived network is the clustering mechanism. In this paper, we propose a new dynamic-size multi-hop clustering mechanism in which the burden of a node acting as a cluster head(CH) is balanced regardless of the density of nodes in a sensor network by adjusting the size of a cluster based on the information about the communication load and the residual energy of the node and its neighboring nodes. We show that our proposed scheme outperforms other single-hop or fixed-size multi-hop clustering mechanisms by carrying out simulations.

Redundant Parallel Hopfield Network Configurations: A New Approach to the Two-Dimensional Face Recognitions (병렬 다중 홉 필드 네트워크 구성으로 인한 2-차원적 얼굴인식 기법에 대한 새로운 제안)

  • Kim, Yong Taek;Deo, Kiatama
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.2
    • /
    • pp.63-68
    • /
    • 2018
  • Interests in face recognition area have been increasing due to diverse emerging applications. Face recognition algorithm from a two-dimensional source could be challenging in dealing with some circumstances such as face orientation, illuminance degree, face details such as with/without glasses and various expressions, like, smiling or crying. Hopfield Network capabilities have been used specially within the areas of recalling patterns, generalizations, familiarity recognitions and error corrections. Based on those abilities, a specific experimentation is conducted in this paper to apply the Redundant Parallel Hopfield Network on a face recognition problem. This new design has been experimentally confirmed and tested to be robust in any kind of practical situations.

Energy Efficient Relay Selection in a Multi-hop Ad-hoc Environment (다중홉 Ad-hoc 환경에서 에너지 효율적인 릴레이 선택 방안)

  • Jung, Hae-Beom;Kim, Song-Hee;Kim, Duk-Kyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.5B
    • /
    • pp.327-337
    • /
    • 2012
  • There have been lots of researches on the optimal relay selection in relay-based systems. However, most researches have been focused on the maximization of transmission capacity with a constraint of sum power at both transmitter and relays. In Ad-hoc networks where relays have batteries of limited power, it is imperative to minimize the energy consumption while maintaining the required quality-of-service (QoS). In this paper, we propose an optimal relay selection strategy to minimize the relay power consumption while satisfying the required signal-to-noise ratio (SNR). Through intensive simulations, we show the proposed method is more effective in terms of energy consumption and guarantee lower transmission failure probability in multi-hop Ad-hoc environments.

A Reputation based Cooperative Routing Scheme for End-to-End Reliable Communications in Multi-hop Wireless Networks (다중 홉 무선 네트워크에서 종단 간 신뢰성 통신을 위한 평판 기반의 협력적 라우팅 기법)

  • Kim, Tae-Hoon;Tak, Sung-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1593-1608
    • /
    • 2009
  • If a certain relay node in multi-hop wireless networks might become a malicious node that does not cooperate with other nodes or a selfish node, network throughput will be dramatically decreased. Most of existing ad hoc routing protocols assuming that the nodes will fully cooperate with other nodes do not resolve the problem of network performance degradation due to malicious and selfish nodes. This paper presents the CARE (Cooperative Ad hoc routing protocol based REputation) scheme incorporating the reputation management that can achieve a multi-hop wireless network with high throughput performance. The proposed scheme provides the horizontal cross-layer approach which can identify misbehaving malicious, selfish nodes dropped out of the hop-by-hop based packet processing in the network and then set up an optimal packet routing path that will detour misbehaving nodes. And the vertical cross-layer approach contained in the CARE scheme attempts to improve the quality of routing paths by exploiting the quality of link information received from the MAC layer. Besides, it provides high TCP throughput by exploiting the reputation values of nodes acquired from the network layer into the transport layer. A case study on experiments and simulations shows that the CARE scheme incorporating vertical and horizontal cross-layer approaches yields better performance in terms of the low rate of packet loss, fast average packet delivery time, and high TCP throughput between end-to-end nodes.

  • PDF

Comparison of Outage Probability Between Best-relay 2-hop Relaying and 3-hop Relaying (두 릴레이가 존재할 때 삼중 홉 중계와 베스트 릴레이 선택 후 이중 홉 중계 방식의 아웃티지 확률 비교)

  • Youn, You-Sun;Kim, Dong-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1B
    • /
    • pp.136-143
    • /
    • 2010
  • In this paper, we investigate decode-and-forward (DF) relaying systems with a direct link between the source and the destination node. The objective of this paper is to determine the better relaying strategy between 3-hop DF relaying and dual-hop DF relaying with the best relay selection. Assuming Rayleigh fading channels, we present closed-form outage probability of the 3-hop relaying and the dual-hop relaying, respectively, and compare the performances by numerical investigation. Numerical results show that if the channel is poor, the outage performance of the 3-hop relaying is better than the dual-hop relaying.

Cost-Effective Traffic Grooming in WDM Ring Networks : Uniform-Traffic Case (WDM 링 네트워크의 비용 절감을 위한 트래픽 통합 기법 : 유니폼 트래픽 경우)

  • 조원홍;장민석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.8A
    • /
    • pp.1247-1253
    • /
    • 2000
  • To fully utilize the capabilities of a SONET/ADM network, traffic grooming is needed to multiplex a number of lower-rate traffic streams into a higher-rate stream, and vice versa. Although the capacity of a SONET ring network can be upgraded by operating it over multiple wavelengths, the corresponding network design may be costly if it employs a large number of ADMs. A cost-effective design attempts to minimize the total number of ADMs used in the network while carrying the offered traffic. We introduce and evaluate the performance characteristics of a new traffic-grooming approach for WDM ring networks, called multihop. The multihop implementation places an ADM at each node based on the requested traffic in the traffic-demand matrix then, it tries to groom the wavelengths which can be groomed. We select one of the nodes to be the "hub" node which has an ADM for each wavelength. The hub node, therefore, can "bridge" traffic between all of the wavelengths. The algorithm is specified and illustrated by a simple example. Our results demonstrate that it is beneficial to use a single-hop approach, but for a large grooming ratio and node number, we advocate the use of the multihop approach.e multihop approach.

  • PDF

Antenna and Relay Selection Technique of Multi-hop System using Multiple Antennas (다중 안테나를 이용하는 다중 홉 시스템의 안테나와 중계기 선택 기법)

  • Kim, Lyum;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.2
    • /
    • pp.29-34
    • /
    • 2011
  • In this paper, we propose antenna and relay selection system by considering channel environment between nodes. Each node has multiple antennas in each hop. And, we analyze the performance of proposed system. A General MIMO system receives signals through multiple channels and obtains diversity gain. But MIMO system causes performance degradation due to poor received signals. The proposed system consider transmitters-relays channels, relays-receivers channels and select a best channel. This channel selection prevents performance degradation and increase total system's performance. Therefore, we must select best antennas and a best relay, simultaneously.

A Network Coding for Multi-Hop Ship-to-Ship Communications (다중-홉 선박간 통신을 위한 네트워크 부호화 기법)

  • Do, Thinh Phu;Shin, Dongryul;Lee, Seong Ro;Jeong, Min-A;Kim, Yun Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.7
    • /
    • pp.566-572
    • /
    • 2014
  • We propose a two-way multi-hop relaying scheme improving the throughput as well as enlarging the coverage for ship-to-ship communications in multi-ship marine networks. The proposed scheme reduces the time slots required for the data exchange by designing data transmission and network coding procedures in a sophisticated way based on two-phase digital network coding. Simulation results show that the proposed two-way multi-hop relaying scheme improves the throughput of the conventional one about 5/3 times.