• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.706-714
• /
• 2010

In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1120-1127
• /
• 2007

In this paper, we propose a generalized processor sharing - dynamic resource allocation (GPS-DRA) scheme which allocates the required amount of resources to each hop dynamically in cellular-based multi-hop systems. In the hybrid-distributed system considered in this paper, a central controller such as a base station (BS) should allocate resources properly to each hop. However, due to changing channel condition with time, it is difficult to allocate as much amount of resources as each hop needs for transmission. GPS-DRA scheme allocates the required amount of resources dynamically to each hop based on the amount of resources used in previous frames by each hop. The amount of control overhead generated by GPS-DRA scheme can be very small because a central controller doesn't need to collect all link information for resource allocation. Our simulation results show that channel utilization increased about 16% and cell capacity increased about 65% compared to those of fixed resource allocation (FRA) scheme.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.3
• /
• pp.40-47
• /
• 2012

In dual-hop relaying systems, the conventional partial relay selection is based on the channel information only for the first hop. On the other hand, the efficient partial relay selection is based on the channel information for the hop with the minimum of the average channel powers for the first and second hops at each end-to-end link since the correlation coefficient between the end-to-end link quality and the link quality of the hop with the minimum of the average channel powers for the first and second hops is larger than that between the end-to-end link quality and the link quality of the other hop. In this paper, the outage probability of the conventional partial relay selection and the efficient partial relay selection in dual-hop decode-and-forward relaying systems is analyzed for non-identically distributed Rayleigh fading channels. Through numerical investigation, the outage performance of the efficient partial relay selection is compared with the outage performances of the conventional partial relay selection and the best relay selection based on all the channel information for the first and second hops.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.731-763
• /
• 2017

In Underwater Linear Sensor Networks (UW-LSN) routing process, nodes without proper address make it difficult to determine relative sensor details specially the position of the node. In addition, it effects to determine the exact leakage position with minimized delay for long range underwater pipeline monitoring. Several studies have been made to overcome the mentioned issues. However, little attention has been given to minimize communication delay using dynamic addressing schemes. This paper presents the novel solution called Hop-by-Hop Dynamic Addressing based Routing Protocol for Pipeline Monitoring (H2-DARP-PM) to deal with nodes addressing and communication delay. H2-DARP-PM assigns a dynamic hop address to every participating node in an efficient manner. Dynamic addressing mechanism employed by H2-DARP-PM differentiates the heterogeneous types of sensor nodes thereby helping to control the traffic flows between the nodes. The proposed dynamic addressing mechanism provides support in the selection of an appropriate next hop neighbour. Simulation results and analytical model illustrate that H2-DARP-PM addressing support distribution of topology into different ranges of heterogeneous sensors and sinks to mitigate the higher delay issue. One of the distinguishing characteristics of H2-DARP-PM has the capability to operate with a fewer number of sensor nodes deployed for long-range underwater pipeline monitoring.

• Physical Therapy Korea
• /
• v.24 no.1
• /
• pp.1-8
• /
• 2017

Background: The multiple hop test is an active performance test that has been commonly used to assess individuals with functional ankle instability. Previous studies have suggested that insufficiency of dynamic postural stability and passive stability during dynamic activities can have an influence on performance in the multiple hop test. However, no study has investigated the effects of dynamic postural stability training and ankle bracing on multiple hop test performance in individuals with functional ankle instability. Objects: The purpose of this study was to compare the immediate effects of dynamic postural stability training versus ankle bracing in the performance of the multiple hop test for participants with functional ankle instability. Methods: Twenty-nine participants with functional ankle instability who scored below 24 in the Cumberland Ankle Instability Tool were selected. The participants were randomly divided into two groups: a dynamic postural stability training group (n1=14) and an ankle bracing control group ($n_2=15$). The multiple hop tests were performed before and after applying each intervention. Dynamic postural stability training was performed using visual-feedback-based balance-training equipment; participants in this group were asked to perform a heel raise in a standing position while watching the centering of their forefoot pressure to prevent excessive ankle inversion. Ankle bracing was applied in the control group. Results: When comparing the pre- and post-intervention period for both groups, both methods significantly improved the results of the multiple hop test (p<.05). However, no significant differences were shown between the dynamic postural stability training and ankle bracing groups (p>.05). Conclusion: Both dynamic postural stability training and ankle bracing showed significant improvement (2.85 seconds and 2.05 seconds, respectively) in test performance. Further study is needed to determine the long-term effects of dynamic postural stability training and to determine whether insufficient dynamic postural stability is a causative factor for functional ankle instability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9A
• /
• pp.853-866
• /
• 2008

In this paper, a multi-hop relaying transmission scheme is analyzed regarding its feasibility and potentiality in the IEEE 802.22-based cognitive radio (CR) environment. Shortly, basic design issues are addressed such as relay station (RS) deployment and a frame structure of physical channel to escape inter-hop interference. This paper mainly develops a radio resource management scheme based on spectrum sensing results aggregated from CR secondary nodes and improves the opportunistic spectrum sharing efficiency. In particular, a decision rule about a channel availability is made using a distributed sensing method. Subsequently, spectrum allocation and routing path decision procedures are proposed to establish a link from source to destination with a hop-by-hop manner. Simulation results show that the proposed multi-hop relaying scheme is substantially profitable in CR environments if the number of hops and RS deployment are designed in such a way that the spectrum sharing gain is larger than spectrum division loss which is inherently induced in multi-hop relaying systems.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.07a
• /
• pp.79-81
• /
• 2016

무선 센서 네트워크 환경에서 사건을 탐지하거나 정보를 추적하는 등의 업무를 수행하기 위해 센서 노드가 있는 곳의 위치를 측정하는 문제는 매우 중요한 문제이다. DV-Hop 알고리즘은 위치를 알 수 없는 미지 노드들이 비콘 노드가 전송한 비콘과 홉거리 정보를 이용하여 센서 노드의 위치를 찾는 방법으로 거리 오차가 크다고 할 수 있다. 본 논문에서는 비콘 노드와 미지 노드 사이의 통신 반경 측정을 통하여 DV-Hop 알고리즘을 개선하고, MATLAB을 이용하여 개선 알고리즘의 성능을 평가하였다.

• Journal of Microbiology and Biotechnology
• /
• v.25 no.5
• /
• pp.658-661
• /
• 2015

Genes encoding enzymes with sequence similarity to hopanoids biosynthetic enzymes of other organisms were cloned from the hopanoid (hop) gene cluster of Streptomyces peucetius ATCC 27952 and transformed into Streptomyces venezuelae YJ028. The cloned fragments contained four genes, all transcribed in one direction. These genes encode polypeptides that resemble polyprenyl diphosphate synthase (hopD), squalene-phytoene synthases (hopAB), and squalene-hopene cyclase (hopE). These enzymes are sufficient for the formation of the pentacyclic triterpenoid lipid, hopene. The formation of hopene was verified by gas chromatography/mass spectrometry.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.831-832
• /
• 2017

링크드오픈데이터를 통해 다양한 분야의 RDF 데이터가 공개되고 있으며 그 양이 지속적으로 증가하고 있다. RDF 데이터는 그래프 형태이기 때문에 대용량 RDF 데이터를 효율적으로 관리하기 위한 그래프 데이터베이스에 대한 연구가 중요하다. 2개의 RDF 리소스가 그래프 상에서 연결됐는지 여부를 알아내는 기능은 RDF 요소간 연관관계를 식별하는 데에 관련이 있기 때문에 그래프 데이터베이스의 중요한 기능 중 하나이다. 대용량 그래프 데이터에 대한 그래프 도달가능성을 빠르게 처리하기 위해서 2-Hop 레이블링 변형들이 제안됐다. 최근에 2-Hop 레이블 크기를 줄이기 위해 2-Hop 레이블링이 진행되기 전에 노드 아이디를 부여하는 방법이 제안됐다. 하지만 그래프의 지역 정보만을 활용하기 때문에 복잡한 형태의 그래프에 대해서는 비효율적이라는 문제점이 있다. 본 논문에서는 그래프의 전역 정보를 반영할 수 있는 Topological Sort를 활용한 노드 아이디 부여 기법에 대한 설계를 제안한다.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.448-450
• /
• 2005

A ubiquitous network allows all users to access and exchange information of any kind freely at any time, from anywhere, and from any appliance through the use of broadband and mobile access. Bluetooth commincation can provide the missing wireless extension to the heterogeneous network, allowing a more ubiquitous access. In this point of view, the BT specifications define ways for which each BT device can set up multiple connections with neighboring devices to communicate in a multi-hop fashion. this paper provides insights on the Bluetooth technology and on some limitations of the scatternet formations. so that, we describe a new multi-hop routing protocol for the establishment of scatternets. this protocol defines rules for forming a multi-hop topology in two phases. the first phase, topology discovery, concerns the discovery of the node's depth from a root node initiating inquiry process. the second phase forms scatternet topology based on the result of topology discovery.