• Title/Summary/Keyword: Single-hop

Search Result 176, Processing Time 0.043 seconds

Fan-shaped Search Zone Routing Protocol for Ship Ad Hoc Networks (선박 애드 혹 네트워크를 위한 부채꼴 탐색구역 경로배정 프로토콜)

  • Son, Joo-Young
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.521-528
    • /
    • 2008
  • Such conventional maritime communication technologies as radio have short some comings in their transmission quality. It can be overcome by wireless channels provided by satellites such as INMARSAT, which nevertheless suffer from the high costs. In this paper, we propose a novel technology resolving the above problems, featuring in the establishment of maritime communication networks with multi-hop structures. The inter vessel and ship-to- shore networks previously modeled after MANET are remodeled by SANET (Ship Ad Hoc Networks) in the present work. Fan-shaped Search Zone Routing (FSR) protocol also is presented, which utilizes not only static geographical information including the locations of ports and the navigations of courses but also the unique characteristics of ships in terms of mobile nodes. The FSR finds the fan-shaped search zone on which the shortest path is located. The performance of LAR protocol is compared with that of FSR in several ways. First, FSR does not make use of a type of control packets as beaconing data, resulting in a full utilization of the bandwidth of the wireless channels. Second, the delivery rate by the FSR is 100% for the fan-shaped search zone includes at least one route between source and destination nodes on its border line, where as that of LAR has been turned out to be 64%. Third, the optimality of routes searched by the FSR is on a 97% level. Of all, the FSR shows a better performance than LAR by about 50%.

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.

Comparison of Clinical Outcomes in ACL Reconstruction using auto-Hamstring Tendon and allo-Tibialis Anterior Tendon (자가슬괵건 및 동종전경골건을 이용한 전방십자인대 재건술 후 임상적 결과의 비교)

  • Kim, Jae-Hwa;Lee, Yoon-Seok;Rhee, Seung-Yong;Chung, Ju-Hwan
    • Journal of the Korean Arthroscopy Society
    • /
    • v.11 no.2
    • /
    • pp.104-110
    • /
    • 2007
  • Purpose: The purpose of this study is comparison of clinical outcomes in ACL reconstruction between auto-hamstring tendon and allo-tibialis anterior tendon. Materials and Methods: In this prospective study, we included 60 subjects who underwent ACL reconstruction using 30 hamstring autograft(mainly, national health insurance) and 30 tibialis anterior allograft(including MVA and industrial injuries) between May 2003 and June 2005 by a single surgeon, with a minimum follow-up of 12 months. Outcome measurements were the range of motion, the Lachman test, the IKDC score, the Lysholm score, KT-1000 arthrometer and one-leg hop test. Results: For all the cases, the range of motion was above 135 degrees. The Lachman test, KT-1000 arthrometer and one-leg hop test showed no significant difference between two groups. The IKDC score of auto-hamstring group($87.840{\pm}2.106$) was significantly higher than that of allo-tibialis anterior group($85.273{\pm}2.782$). The Lysholm score of auto-hamstring group($88.067{\pm}2.586$) was also significantly higher than that of allo-tibialis anterior group($85.300{\pm}3.030$). Conclusion: The results of ACL reconstruction using the auto-hamstring tendon and allo-tibialis anterior tendon showed no significant difference in objective items but auto-hamstring group showed better results in subjective scoring. This difference may result from individual factors such as economic problem, secondary gain.

  • PDF

A Combining Scheme to Reduce Power Consumption in Cooperation and Cyclic Code for Wireless Sensor Networks (협력-순환 부호를 이용한 무선 센서 네트워크에서의 전력 소모 감소를 위한 결합기법에 관한 연구)

  • Kong, Hyung Yun;Hwang, Yun Kyeong;Hong, Seong Wook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.6
    • /
    • pp.63-69
    • /
    • 2008
  • In this paper, our goal is to find a power-effective protocol that improves the accuracy of transmission in sensor networks. Therefore we propose a cooperative communication protocol based on MRC(Maximal Ratio Combining) and cyclic code. In our proposal, one sensor node assists two others to communicate with a clusterhead that can get diversity effect and MRC can improve diversity effect also. The proposed protocol with cyclic code can correct error up to 3-bit and reduce decoding complexity compared with convolutional code. Simulation results reveal proposed protocol can save the network energy up to 6dB over single-hop protocol at BER(Bit Error Rate) of $10^{-2}$.

  • PDF

An Adaptive Superframe Duration Allocation Algorithm for Resource-Efficient Beacon Scheduling

  • Jeon, Young-Ae;Choi, Sang-Sung;Kim, Dae-Young;Hwang, Kwang-il
    • Journal of Information Processing Systems
    • /
    • v.11 no.2
    • /
    • pp.295-309
    • /
    • 2015
  • Beacon scheduling is considered to be one of the most significant challenges for energy-efficient Low-Rate Wireless Personal Area Network (LR-WPAN) multi-hop networks. The emerging new standard, IEEE802.15.4e, contains a distributed beacon scheduling functionality that utilizes a specific bitmap and multi-superframe structure. However, this new standard does not provide a critical recipe for superframe duration (SD) allocation in beacon scheduling. Therefore, in this paper, we first introduce three different SD allocation approaches, LSB first, MSB first, and random. Via experiments we show that IEEE802.15.4e DSME beacon scheduling performs differently for different SD allocation schemes. Based on our experimental results we propose an adaptive SD allocation (ASDA) algorithm. It utilizes a single indicator, a distributed neighboring slot incrementer (DNSI). The experimental results demonstrate that the ASDA has a superior performance over other methods from the viewpoint of resource efficiency.

A Design of Signal Transport System with High Reliability in an Underwater Sensor Array (수중 센서 어레이에서 고 신뢰성을 고려한 신호 전송 시스템 설계)

  • Son Dong-Hwan;Chung Hyun-Ju
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.7 no.4 s.19
    • /
    • pp.13-19
    • /
    • 2004
  • A system for detecting underwater target demands a high operational reliability because of the difficulty of maintenance and repair when the system has a few troubles during long operating period. Therefore, in this paper, we have proposed a signal transport system with a high reliability in an underwater sensor array system composed of magnetic and acoustic sensors. In this system, the nodes for signal transport are connected dually each other with single-hop construction and a magnetic sensor is connected to a couple of neighboring nodes. This enables the output signal to transport from a node to the next node and the next but one node. Also, the signal from a magnetic sensor can be transported to two nodes at the same time. Thus, the system with this construction makes possible to transport sensor data to another node which works normally when a transport node or cable have some faults and will operate normally although it happens some problems in a few signal transport nodes and connection cables.

A Model Interconnecting ISP Networks (ISP 네트워크간 상호접속 모델)

  • Choi, Eun-Jeong;Tcha, Dong-Wan
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.388-393
    • /
    • 2005
  • Private peering, public peering and transit are three common types of interconnection agreements between providers in the Internet. An important decision that an Internet service provider (ISP) has to make is which private peering/transit ISPs and Internet exchanges (IXs) to connect with to transfer traffic at a minimal cost. In this paper, we deal with the problem to find the minimum cost set of private peering/transit ISPs and IXs for a single ISP. There are given a set of destinations with traffic demands, and a set of potential private peering/transit ISPs and IXs with routing information (routes per destination, the average AS-hop count to each destination, etc.), cost functions and capacities. Our study first considers all the three interconnection types commonly used in real world practices. We show that the problem is NP-hard, and propose a heuristic algorithm for it. We then evaluate the quality of the heuristic solutions for a set of test instances via comparison with the optimal ones obtained by solving a mixed integer programming formulation of the problem. Computational results show that the proposed algorithm provides near-optimal solutions in a fast time.

  • PDF

Routing for Location Privacy in the Presence of Dormant Sources (휴면 소오스들이 존재하는 환경에서의 위치 보호 라우팅)

  • Yang, G.;Shin, S.;Kim, D.;Park, S.;Lim, H.;Tscha, Y.
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06a
    • /
    • pp.164-165
    • /
    • 2008
  • 전장에서 임무 수행중인 병력이나 탱크 등을 지원하거나 보호 동물의 활동을 모니터링 하는 센서 네트워크에서는 전송 정보뿐만 아니라 그러한 대상들의 위치를 악의적 추적자로부터 보호할 수 있어야 한다. 본 논문에서는 활동 소오스 노드처럼 메시지 전송은 진행하고 있지 않지만 위치가 보호되어야 할 대상과 근접한 휴면(dormant) 소오스 노드들을 고려한 소오스 위치 보호 라우팅 기법 GSLP(GPSR-based Source-Location Privacy)를 제안한다. GSLP는 알고리즘의 간결성과 신장성(scalability)이 뛰어난 GPSR(greedy perimeter stateless routing)을 확장하여 메시지 전달 노드를 선정할 때 일정 확률로 임의의 이웃 노드를 선택하는 한편, perimeter 라우팅을 적용하여 소오스 노드들을 우회하도록 하여 위치를 보호하도록 하였다. 시뮬레이션 결과, 기존의 대표적인 소오스 위치 보호 라우팅 프로토콜인 PR-SP(Phantom Routing-Single Path)에 비해 GSLP는 휴면 소오스 노드들의 수에 거의 관계없이 높은 안전 기간(전송 메시지 수)을 일정하게 제공하면서도 전달 지연(경로의 평균 홉(hop) 수)은 도착지와의 최단 홉 수의 약 두 배 이내에 머물러 대규모 센서 네트워크에서의 소오스의 위치를 보호하기 위한 방안으로 적합한 것으로 평가되었다.

  • PDF

A Multi-path Dynamic Source Routing Protocol for Mobile Ad-Hoc Networks (이동 애드 혹 네트워크를 위한 다중경로 동적 소스 라우팅 프로토콜)

  • Lim Hwa-Jung;Tscha Yeong-hwan
    • The KIPS Transactions:PartC
    • /
    • v.12C no.1 s.97
    • /
    • pp.111-120
    • /
    • 2005
  • A mobile ad-hoc network is an autonomous system of mobile nodes which are free to move around randomly and organize themselves arbitrarily, hence a routing protocol that handles the dynamic network topology changes is required for the network. In this paper we present a multi -Path on-demand routing protocol called R-DSR (Robust Dynamic Source Routing), an extension to the existing IETF protocol DSR. The proposed protocol has it that every pair of 2-hop away nodes on the single route is additionally connected via an alternative node. Throughout mathematical analysis we show the proposed protocol reveals higher message delivery rate than that of the Das's multi-path protocol, currently known as one of the most typical approaches related to DSR.

A Design and Implementation of MPLS Based Wireless Mesh Network (MPLS기반 메쉬 네트워크 설계 및 구현)

  • Kim, Young-Han;Kim, Jeong-Myun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.10 no.2
    • /
    • pp.103-111
    • /
    • 2011
  • Recently, wireless mesh networks are used in various application areas. However, wireless mesh networks have limited bandwidth by the wireless transmission property, and have severe throughput degradation in multi-hop transmission in single channel wireless mesh networks. To solve this problem and support QoS, a lot of routing protocols have been proposed in mesh networks. In this paper, we propose a wireless mesh networks architecture with MPLS for QoS service. The path and traffic management from the application could be independent from QoS routing protocols by using the MPLS in wirelss mesh networks. In this paper, we design a MPLS-based mesh router with IEEE 802.11e for traffic differentiation and investigate the operation by implementation and test.