• 한국통신학회논문지
• /
• 제32권5B호
• /
• pp.270-276
• /
• 2007

현재까지 HR-WPAN(High Rate-Wireless Personal Area Network)에 제안된 LDS(Link-status Dependent Scheduling) 알고리즘(algorithm)은 전체 네트워크(network)의 처리율(throughput) 향상만을 목적으로 함으로서, worst-link에 상대적으로 중요한 디바이스(device)가 연결된 경우, 그 디바이스의 처리율은 더욱 악화 된다. 본 논문에서 제안한 WGS(Worst-case Guaranteed Scheduling) 알고리즘은 link 상태가 변하더라도 모든 디바이스의 처리율을 동일하게 유지함으로써, worst-link에 연결된 디바이스의 처리율을 어느 정도 보장하고 전체 네트워크의 지연은 기존의 LDS 알고리즘보다 감소시킬 수 있다. 따라서 향후 HR-WPAN의 설계 시 worst-link에 연결된 디바이스의 처리율을 어느 정도 보장하고 전체 네트워크의 지연을 감소시키고 싶을 경우, 본 논문에서 제안한 WGS 알고리즘이 유용하게 사용될 수 있을 것이다.

• 한국시뮬레이션학회논문지
• /
• 제15권1호
• /
• pp.27-33
• /
• 2006

서비스의 품질(QoS : quality of service) 보장 지원을 위해 라우터는 망 구성 정보 외에 링크 상태 정보를 기반으로 라우팅 경로를 설정한다. 따라서 라우터가 정확한 링크 상태를 파악하는 것은 최적의 라우팅 경로를 설정하는 데 있어 매우 중요하다. 그러나 라우터가 링크 상태 정보를 다른 라우터에게 알리기 위해 링크 상태 업데이트 메시지를 필요 이상으로 전송 할 경우, 이들 메시지의 생성, 처리, 전달 등에 의한 라우터 시스템 자원의 낭비에 기인한 성능 저하가 야기되며, 이와는 반대로 링크 상태 정보가 적절한 때에 업데이트 되지 않는 경우, 실제 수용 가능한 서비스 요구가 거절될 수 있다. 본 논문에서는 업데이트 메시지를 줄이면서 라우팅 성능을 향상 시키는 알고리즘을 제안하고, 시뮬레이션을 통하여 기존의 알고리즘과 비교해 성능 개선의 정도를 평가하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.249-251
• /
• 2007

The proposed LDS(Link-status Dependent Scheduling) algorithm in HR-WPAN up to now aims at doing only throughput elevation of the whole network, when the crucial DEV(Device) is connected with worst-link relatively, throughput of this DEV becomes aggravation, The proposed the WGS(Worst-case Guaranteed Scheduling) _algorithm in this paper guarantees throughput of the DEV which is connected with worst-link in a certain degree as maintaining throughput of all DEVs identically even if a link-status changes, decreases delay of the whole network more than current LDS algorithm Therefore proposed WGS algorithm in this paper will be useful in case of guaranteeing throughput of a DEV which is connected worst-link in a certain degree in a design of HR-WPAN hereafter.

• 보건행정학회지
• /
• 제20권2호
• /
• pp.104-127
• /
• 2010

To vitalize the link program of Korean long-term care insurance system to community-based services for non-eligible people, we analysed the claim data from the Korean National Health Insurance Corporation (NHIC), and conducted a questionnaire survey to charging employees of elderly service department at local governments. The subjects were all 81,377 people, 57,454 of them were arranged to community-based services. The link program was more necessary among the missed subjects rather than the arranged people due to the need for physical or psychological assistance. By the result of the survey to the local government employees, 59.5% of subjects responded their proportion of link service was over 10% and under 20%, and 54.3% of them responded their job boundary are not clear. Major type of linking was notification the subject list to local government, 91.4%; proportion of periodical notification on the status of their service link were 57.1%, only 7.1% were followed to manage after the link. Difficult factors at the link process were pointed out the overload by other side work, deficiency of resources, rigidity of priority of link, and so on. Considering these results, to vitalize the community-based services to the non-eligible people, it may be essential the active participation of the subjects, construction of parts working in coordination among the institutions including NHIC, local governments, and service providers; development of various services for maintenance or promotion of the non-eligible peoples' health and functional status; and active participation of institutions from the third sector, and so on.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.311-312
• /
• 2008

This paper try to show that the method for maintaining link stability by fast reporting the status PDU to RLC layer in MAC layer. The proposed method is implemented based on the mechanism of reordering processing in MAC-ehs entity in HSPA evolution system.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2015년도 추계학술대회
• /
• pp.579-581
• /
• 2015

제2차 세계대전 이후 항공기, 미사일 등 대공 위협이 급속히 증가함에 따라 상대적으로 대공 능력이 취약한 함정을 보호하기 위해 미국을 중심으로 다양한 전술데이터링크 체계가 개발되었다. 표적정보를 실시간 또는 근실시간으로 처리하고 공유하는 체계인 전술데이터링크(TDL, Tactical Data Link)는 전장관리를 효율적으로 하고, 지휘 및 통제를 원활하고 신속히 할 수 있게 만드는 기반 체계이다. 본 논문에서는 전술데이터링크의 종류, 운용 현황 및 특징에 대해 조사하고, 한국형 전술데이터링크(LINK-K) 등 최신 기술 동향에 대해 설명하였다.

• ETRI Journal
• /
• 제28권6호
• /
• pp.815-818
• /
• 2006

In the global Internet, a constraint-based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint-based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link-usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2005년도 춘계학술대회 논문집
• /
• pp.2015-2018
• /
• 2005

In this paper, we are willing to prepare the reasonable optimization, Combinatorial Optimization and Genetic Algorithm. Thus we define position status of end-effect (or terminative link module) using promised form, (G, M(G), A(G), and so on.). For this preparing step, the reorganizing procedure of Link and Joint Module is necessary, like as enumerating the kinematically identical assembly group of several links and joints. Thus, we draw a G, directed graph in a first step. Because, directed graph contains the path information between adjacent Link Module and Joint Module. From the directed graph,G, we can incite the Incidence Matrix, M(G). The incidence matrix, M(G), contains the contact information of the Link (Joint) Module and the type of Link (Joint). At the end of this paper, we generalize the modular information as a matrix form, A(G). From this matrix, we can make a population of assembly status. That is the finial output of this paper.

• 한국멀티미디어학회논문지
• /
• 제19권11호
• /
• pp.1829-1836
• /
• 2016

Today, the application area and scope of FANET(Flying Ad Hoc Network) has been extended. As a result, FANET related research are actively conducted, but there is no decision yet as the routing protocol for FANET. In this paper, we propose the OLSR-Pds (Prediction with direction and speed) which is added a method to predict status of link for OLSR protocol. The mobility of nodes are modeled using Gauss-Markov algorithm, and relative speed between nodes were calculated by derive equation of movement, and thereby we can predict link status. An experiment for comparing AODV, OLSR and, OLSR-Pds was conducted by three factors such as packet delivery ratio, end to end delay, and routing overhead. In experiment result, we were confirm that OLSR-Pds performance are superior in these three factors. OLSR-Pds has the disadvantage that requires time-consuming calculations for link state and required for computing resources, but we were confirm that OLSR-Pds is suitable for routing to the FANET environment because it has all the characteristics of proactive protocol and reactive protocol.

• 한국통신학회논문지
• /
• 제19권5호
• /
• pp.892-900
• /
• 1994

ITU-TSS에서는 최근 B-ISDN의 신호 전송을 위하여 service specific connection oriented protocol(SSCOP)을 권고하였다. SSCOP에서는 오류 제어 및 흐름 제어를 위하여 주기적으로 상태 정보를 교환한다. 본 논문에서는 SSCOP를 end-to-end의 경우와 link-by-link인 경우로 나누어 이산 대기 모델로 분석하였다. 메시지의 에러율, 트래픽 부하, 상태 정보의 교환주기 등의 영향을 고려하여 성능 측정값으로써 지연기산, 수신단 버퍼 크기, 그리고 전송 효율의 평균값을 구하고 성능 분석의 결과를 검증하기 위하여 시뮬레이션을 수행하였다.