• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.5744-5764
• /
• 2018

In Wireless Sensor Networks (WSNs) for Internet of Things (IoT) environment, fault tolerance is a most fundamental issue due to strict energy constraint of sensor node. In this paper, a robust energy saving data dissemination protocol for IoT-WSNs is proposed. Minimized energy consumption and dissemination delay time based on signal strength play an important role in our scheme. The representative dissemination protocol SPIN (Sensor Protocols for Information via Negotiation) overcomes overlapped data problem of the classical Flooding scheme. However, SPIN never considers distance between nodes, thus the issue of dissemination energy consumption is becoming more important problem. In order to minimize the energy consumption, the shortest path between sensors should be considered to disseminate the data through the entire IoT-WSNs. SPMS (Shortest Path Mined SPIN) scheme creates routing tables using Bellman Ford method and forwards data through a multi-hop manner to optimize power consumption and delay time. Due to these properties, it is very hard to avoid heavy traffic when routing information is updated. Additionally, a node failure of SPMS would be caused by frequently using some sensors on the shortest path, thus network lifetime might be shortened quickly. In contrast, our scheme is resilient to these failures because it employs energy aware concept. The dissemination delay time of the proposed protocol without a routing table is similar to that of shortest path-based SPMS. In addition, our protocol does not require routing table, which needs a lot of control packets, thus it prevents excessive control message generation. Finally, the proposed scheme outperforms previous schemes in terms of data transmission success ratio, therefore our protocol could be appropriate for IoT-WSNs environment.

• 지역연구
• /
• 제33권1호
• /
• pp.29-41
• /
• 2017

본 논문에서는 서울 대도시권의 대중교통체계를 구성하는 서울 시내버스 시스템과 수도권 지하철 시스템을 통합한 교통망의 각 노드인 버스정류장이나 지하철역의 시간거리 접근성을 계산하는 알고리즘을 제안하고 그 결과를 분석한다. 서울 대도시권 대중 교통망 그래프의 링크는 승객들이 노드들을 이동하는 데 소요되는 시간을 가중치로 설정하였다. 버스 노선과 지하철 노선의 노드들을 연결하는 링크들의 가중치는 교통카드 트랜잭션 데이터베이스로부터 추출된 노선별 속도에 따라 인접한 노드들 사이의 이동시간으로 설정하고, 승객들이 도보로 이동할 수 있는 일정 거리 이내인 노드들 사이의 링크의 가중치는 승객의 도보 이동 시간으로 설정하였다. 최단 경로의 시간거리를 찾는 알고리즘의 입력으로 링크들의 가중치를 표현한 시간 거리 인접 행렬을 사용하고 그 출력으로 노드들의 최단 시간 거리 행렬을 구하여 각 노드의 접근도와 평균 이동시간을 계산하였다. 2013년도 데이터를 사용한 실험 결과에서 서울 대도시권 대중교통체계 통합 교통망의 노드들의 개수는 서울 시내 600개 버스노선들에 연결되어 있는 버스정류장 15,702개와 수도권 지하철 16개 노선들에 연결된 지하철역 575개를 합하면 16,277개가 된다. 이 논문에서 서울 대도시권 통합 교통망과 이미 연구되었던 서울 시내버스 교통망 및 수도권 지하철 교통망을 평균 접근도와 평균 이동시간 관점에서 비교 분석하였다. 본 논문은 서울 대도시권 대중교통체계의 버스와 지하철 통합 교통망에서 각 노드의 접근도를 계산하는 첫 번째 연구 결과를 서술한다.

• 한국발생생물학회지:발생과생식
• /
• 제16권4호
• /
• pp.315-320
• /
• 2012

The gDNA isolated from Cyclina sinensis from Gochang (GOCHANG), Incheon (INCHEON) and a Chinese site (CHINESE), were amplified by PCR. Here, the seven oligonucleotide decamer primers (BION-66, BION-68, BION-72, BION-73, BION-74, BION-76, and BION-80) were used to generate the unique shared loci to each population and shared loci by the three cyclina clam populations. As regards multiple comparisons of average bandsharing value results, cyclina clam population from Chinese (0.763) exhibited higher bandsharing values than did clam from Incheon (0.681). In this study, the dendrogram obtained by the seven decamer primers indicates three genetic clusters: cluster 1 (GOCHANG 01~GOCHANG 07), cluster 2 (INCHEON 08~INCHEON 14), cluster 3 (CHINESE 15~CHINESE 21). The shortest genetic distance that displayed significant molecular differences was between individuals 15 and 17 from the Chinese cyclina clam (0.049), while the longest genetic distance among the twenty-one cyclina clams that displayed significant molecular differences was between individuals GOCHANG no. 03 and INCHEON no. 12 (0.575). Individuals of Incheon cyclina clam population was somewhat closely related to that of Chinese cyclina clam population. In conclusion, our PCR analysis revealed a significant genetic distance among the three cyclina clam populations.

• 대한한의진단학회지
• /
• 제14권2호
• /
• pp.75-84
• /
• 2010

Objectives: The objective of the current study is to determine whether an ultrasound device system is adequate for measuring distance from Sangwan (CV13) to pancreas. Methods: We recruited 3 healthy young male subjects and 2 sonographers. The each sonographer measured vertical shortest distance from CV13 to pancreas with a ultrasound device three times in random order. Because the total variation could be divided into repeatability, reproducibility and subject-to-subject variation in Gage R&R method, we compared the sources of variation associated with the measurement system with an analysis of variance model. Results & Conclusions: Number of distinct categories is calculated on the basis of standard deviation of subject-to-subject divided by standard deviation of total Gage R&R. If the number of categories is five or more, the measurement system may be acceptable for the analysis of the process. The number of distinct categories of the ultrasound device system for measuring distance from CV13 to pancreas was 6.29. So we concluded that repeatability and reproducibility of the ultrasound device system for measuring distance from CV13 to pancreas was acceptable.

• 한국패류학회지
• /
• 제29권3호
• /
• pp.163-169
• /
• 2013

In the present study, the seven primers BION-33, BION-34, BION-37, BION-41, BION-44, BION-45 and BION-42 generated the total number of loci, average number of loci per lane and specific loci in Hongseong, Yeosu and Goheung population of F. mutica, respectively. 7 primers generated 19 specific loci in the Hongseong population, 29.3 in the Yeosu population and 23.1 in the Goheung population, respectively. Especially, the decamer primer BION-37 generated 7 unique loci to each population, which were identifying each population, approximately 700 bp in Hongseong population. In this study, the dendrogram obtained by the seven primers indicates three genetic clusters: cluster 1 (HONGSEONG 01-HONGSEONG 07), cluster 2 (YEOSU 08-YEOSU 14) and cluster 3 (GOHEUNG 15-GOHEUNG 21). Among the twenty one cockles, the shortest genetic distance that displayed significant molecular differences was between individuals 17 and 19 from the Goheung population (genetic distance = 0.051), while the longest genetic distance among the twenty-one cockle individuals that displayed significant molecular differences was between individuals HONGSEONG no. 03 and YEOSU no. 12 (genetic distance = 0.616). Relatively, individuals of YEOSU population were fairly closely related to that of GOHEUNG population. Ultimately, PCR fragments revealed of in this study may be useful as a DNA marker the three geographic populations to distinguish.

• International Journal of Computer Science & Network Security
• /
• 제22권1호
• /
• pp.139-148
• /
• 2022

Research into wireless sensor networks (WSNs) is a trendy issue with a wide range of applications. With hundreds to thousands of nodes, most wireless sensor networks interact with each other through radio waves. Limited computational power, storage, battery, and transmission bandwidth are some of the obstacles in designing WSNs. Clustering and routing procedures have been proposed to address these concerns. The wireless sensor network's most complex and vital duty is routing. With the Greedy Perimeter Stateless Routing method (GPSR), an efficient and responsive routing protocol is built. In packet forwarding, the nodes' locations are taken into account while making choices. In order to send a message, the GPSR always takes the shortest route between the source and destination nodes. Weighted directed graphs may be constructed utilising four distinct distance metrics, such as Euclidean, city block, cosine, and correlation distances, in this study. NS-2 has been used for a thorough simulation. Additionally, the GPSR's performance with various distance metrics is evaluated and verified. When compared to alternative distance measures, the proposed GPSR with correlation distance performs better in terms of packet delivery ratio, throughput, routing overhead and average stability time of the cluster head.

• International journal of advanced smart convergence
• /
• 제5권2호
• /
• pp.53-58
• /
• 2016

With the growing use of big data and data mining, it serves to understand how such techniques can be used to understand various relationships in the healthcare field. This study uses hierarchical methods of data analysis to explore similarities in hospitalization across several New York state counties. The study utilized methods of measuring crowding distance of data for age-specific hospitalization period. Crowding distance is defined as the longest distance, or least similarity, between urban cities. It is expected that the city of Clinton have the greatest distance, while Albany the other cities are closer because they are connected by the shortest distance to each step. Similarities were stronger across hospital stays categorized by age. Hierarchical clustering can be applied to predict the similarity of data across the 10 cities of hospitalization with the measurement of crowding distance. In order to enhance the performance of hierarchical clustering, comparison can be made across congestion distance when crowding distance is applied first through the application of converting text to an attribute vector. Measurements of similarity between two objects are dependent on the measurement method used in clustering but is distinguished from the similarity of the distance; where the smaller the distance value the more similar two things are to one other. By applying this specific technique, it is found that the distance between crowding is reduced consistently in relationship to similarity between the data increases to enhance the performance of the experiments through the application of special techniques. Furthermore, through the similarity by city hospitalization period, when the construction of hospital wards in cities, by referring to results of experiments, or predict possible will land to the extent of the size of the hospital facilities hospital stay is expected to be useful in efficiently managing the patient in a similar area.

• 한국전자통신학회논문지
• /
• 제8권12호
• /
• pp.1883-1890
• /
• 2013

위치 추정 기술 (LDT, Location Detection Technology)은 자원관리 및 통신 서비스의 품질을 향상시키기 위한 무선통신 분야에서 사용되고 있는 LBS(Location Based Service)의 핵심기술 중 하나이다. 이동국(MS, mobile station)의 위치는 세 개의 기지국(BS, base station)들의 좌표와 이동국과 기지국들 사이의 거리에 상응하는 반지름에 기초한 세 개의 원들에 기반한 도래시간(TOA, Time of Arrival)기법을 사용하여 추정된다. 삼각변 측량법을 이용하여 정확한 이동국의 위치를 추정하기 위해서는 세 개의 원들이 한 점에서 만나야 하는데, 이동국과 기지국의 거리를 추정하기 위한 시간지연 개수와 전송 주파수에 따라 원들의 반지름이 증가하여 세 개의 원들이 한 점에서 만나지 못하는 경우들이 발생한다. 반지름이 증가된 세 개의 원들은 여섯 개의 교점을 가지게 되고 이 교점들 중 세 개의 교점들이 특정 이동국의 좌표에 가까이 위치하게 된다. 본 논문에서는 여섯 개의 전체 교점들 중에서 세 개의 내부 교점들을 선택하는 TOA 삼각변 측량법을 위한 최단 거리 알고리즘을 제안한다. 제안된 방법은 여섯 개의 교점들 중 이동국의 좌표와 가장 가까운 세 개의 교점을 선택하고, 선택된 교점들의 평균 좌표를 특정 이동국의 위치로 결정한다. 제안된 알고리즘의 성능은 컴퓨터 시뮬레이션 예를 통해 확인된다.

• 사상체질의학회지
• /
• 제14권1호
• /
• pp.51-66
• /
• 2002

The main purpose of this study is to differentiate Sasang Constitutions of men and women by measuring 5 parts of the body. By the definitions about Four Chos(四焦) in ${\ulcorner}$The Discourse on Viscera and Bowels(臟腑論)${\lrcorner}$, the body is divided into four parts and sets up the five borderlines. They are Top-line, Bosom-line, Stomach-line, Navel-line and Bottom-line. Top-line(第一線) is the horizontal distance between Rt. & Lt. Coracoid processes passing through the acupuncture point CV-22(天突穴) or the horizontal distance between Rt. & Lt. beginning points of Axillary lines. Bosom-line(第二線) is the horizontal distance passing through Rt.& Lt. Nipples. Stomach-line(第三線) is the horizontal distance passing through Rt.& Lt. acupuncture point ST-19(不容穴). Navel-line(第四線) is the horizontal distance passing through the navel(CV-8; 神闕穴) and the acupuncture point ST-25(天樞穴). Bottom-line(第五線) is the horizontal distance between Rt. & Lt. Anterior Superior Iliac Spine(ASIS). The measured numerical values of Five Lines are the most important factors to classify the Four Constitutions(Taeyangin, Taeumin, Soyangin, Soeumin). Among the five lines, Stomach-line(Middle-line) is the base line to decide Yin and Yang. As a result, I could differentiate the four Constitutions as follows. 1. Taeyangin's Top-line is more than 36cm long. Top-line is the longest. Bottom-line is the shortest. The length-difference between Top-line and Bottom-line is more or less 10cm long. 2. In case of Taeumin, Navel-line is the longest. The numerical values of Middle and Bottom lines are almost the same or Bottom-line is shorter than Middle-line by 1 or 2 cm long. In some special case, the five lines are all the same and the body just looks like a log. 3. In case of Soyangin, just like Taeyangin, Top-line is the longest. Bottom-line is the shortest. The length of Top-line is ranged between 30cm to 35cm long. From Top-line to Bottom-line, the length gradually diminishes each by 2cm: for example, 34-32-30-28-26. 4. In case of Soeumin, the longest one is Bottom-line. Specially, Navel-line is shorter than Middle-line. Bottom-line is longer than the Middle.

• 대한교통학회지
• /
• 제23권1호
• /
• pp.103-114
• /
• 2005

서울시 대중교통체계개편에서 요금부과방안은 기본적으로 거리비례제에 근거하고 있다. 거리비례제에서 요금은 일정거리까지의 통행에 따른 기본요금과 수단적 환승에서 발생하는 환승요금, 일정거리 이상의 통행에 따른 할증요금으로 구분하여 부과된다. 본 연구는 거리비례제에 따른 요금부과 시 순차적으로 정렬된 K개의 요금경로를 탐색하는 K요금경로탐색알고리즘을 제안한다. 이를 위해 다수의 대중교통수단이 존재하는 복합교통망에서 링크표지기법을 적용하여 네트워크확장이 요구되지 않도록 하였으며, 동일링크를 통행하는 복수의 통행순단을 각각의 개별링크로 처리되도록 구축하였다. 따라서 본 연구에서 제안하는 K요금경로탐색알고리즘은 수단과 관련된 별도의 표식이 요구되지 않으므로 단일수단 교통망에 확용되는 K경로탐색알고리즘이 직접 적용될 수 있다. 본 연구는 또한 출발지에서 수단을 탑승한 이용자에게 요금이 부과되는 과정을 복합교통망에서 나타내가 위하여 출발지를 기준으로 탐색되는 인접된 두 링크에 대해서 기본요금, 환승요금, 할증요금이 계산되어 합산되는 과정을 수식으로 표현하였다. 이 수식을 K개의 원소를 포함하는 재귀벡터형태(Recursive Vector Formula)로 전화하여 K요금경로탐색을 위한 최적식과 알고리즘을 제안하였다. 간단한 사례연구를 통하여 알고리즘 수행과정을 검증하고 향후에 연구진행방향에 대하여 서술하였다.