• Title/Summary/Keyword: Node distance

Search Result 597, Processing Time 0.024 seconds

A Study on the Hyperlink Structures of the Official Websites of TV Networks: Analysis Focus on ABC, BBC, NHK, and KBS

  • Kweon, Sang-Hee;Kim, Se-Jin;Kang, Bo-Young;Kweon, Hea-Ji
    • Journal of Internet Computing and Services
    • /
    • v.20 no.2
    • /
    • pp.77-91
    • /
    • 2019
  • This paper explores the hyperlink structures of the official websites for the following terrestrial TV networks: ABC(US), BBC(UK), NHK(Japan), and KBS(Korea). These websites were selected and visualized to analyze the hyperlink structure and examine the connection relations among the TV networks. A total of 4378 data was collected through the Voson site and were analyzed with NodeXL. Results shows that NHK's network demonstrates a good network structure at a quite high level, holding more related websites than BBC. We discovered that ABC TV network has the largest effect with the largest number of out-links. Surprisingly, structures of BBC and NHK were quite similar, overcoming geographical and cultural differences. Thus, both TV networks were seen to be progressive and open. On the contrary, ABC and KBS were considered to be relatively conservative. A comprehensive review of the "category points" combination chart revealed that NHK's official website has the widest variety of hyperlinks. The shortest distance of a hyperlink between a website type and a TV network meant that the TV network has a larger number of links to those website types than other TV networks do. The result may provide Internet users to efficiently select TV network web pages according to the types of information they want to find out.

Phylogenetic Positioning of a Strongyloides stercoralis Isolate Recovered from a Korean Patient and Comparison with Other Asian Isolates

  • Bae, Jaeho;Jeong, Mi Jin;Shin, Dong hoon;Kim, Hyun Woo;Ahn, Sung Ho;Choi, Jun Ho;Yu, Hak Sun
    • Parasites, Hosts and Diseases
    • /
    • v.58 no.6
    • /
    • pp.689-694
    • /
    • 2020
  • Strongyloidiasis is caused by Strongyloides stercoralis and is one of the most neglected tropical diseases in tropical and subtropical regions. Although several strongyloidiasis cases have been reported in Korea, genetic analysis of Korean isolates is still incomplete. In this study, a parasite was isolated from a 61-year-old man diagnosed with strongyloidiasis during the treatment of lymphoma on his retroperitoneal lymph node. Diffuse symmetric wall thickening from the ascending to descending colon and a nematode-infected intestine was observed following microscopic examination. Genomic DNA was isolated from a patient tissue block, and S. stercoralis was identified by PCR and sequencing (18S rDNA). In order to determine phylogenetic location of a Korean isolate (named KS1), we analyzed cox1 gene (500-bp) and compared it with that from 47 previous S. stercoralis isolates (28 human isolates and 19 canid isolates) from Asian countries. Our results showed that phylogenetic tree could clearly be divided into 5 different groups according to hosts and regions. KS1 was most closely related with the Chinese isolates in terms of genetic distance.

Design and Implementation of a Service Platform that Recommends the Optimal Shortest Distance as a Patrol Route

  • Jo, Yu-min;Jang, Ye-jin;Paik, Jong-ho
    • Journal of Internet Computing and Services
    • /
    • v.23 no.1
    • /
    • pp.1-9
    • /
    • 2022
  • Recently, interest in living safety and crime prevention is increasing. The reality is that most women have anxiety about social safety and ultimately want a safe return to home. As a result of these issues, the Seoul Metropolitan Government and the National Police Agency are implementing various services to alleviate them. However, there are limitations such as that the service can be used only during a limited time or the process of checking whether the patrol is really completed is complicated. Therefore, in this paper, we propose a service platform that overcomes these limitations and suggests the best and shortest patrol route to the police based on the desired patrol location applied by citizens. It is designed based on the MVC pattern, and the functions are divided for each user. It is hoped that the platform will reduce crime rates and allow citizens to ultimately return home with peace of mind. Also we expect that the police will ablet to find places where they did not know about or need to patrol with more attention through the recommended route of the platform, which will be helpful in their task.

A Simulation Modeling for the Effect of Resource Consumption Attack over Mobile Ad Hoc Network

  • Raed Alsaqour;Maha Abdelhaq;Njoud Alghamdi;Maram Alneami;Tahani Alrsheedi;Salma Aldghbasi;Rahaf Almalki;Sarah Alqahtani
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.9
    • /
    • pp.111-119
    • /
    • 2023
  • Mobile Ad-hoc Network (MANET) is an infrastructure-less network that can configure itself without any centralized management. The topology of MANET changes dynamically which makes it open for new nodes to join it easily. The openness area of MANET makes it very vulnerable to different types of attacks. One of the most dangerous attacks is the Resource Consumption Attack (RCA). In this type of attack, the attacker consumes the normal node energy by flooding it with bogus packets. Routing in MANET is susceptible to RCA and this is a crucial issue that deserves to be studied and solved. Therefore, the main objective of this paper is to study the impact of RCA on two routing protocols namely, Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR); as a try to find the most resistant routing protocol to such attack. The contribution of this paper is a new RCA model (RCAM) which applies RCA on the two chosen routing protocols using the NS-2 simulator.

A Study on RSS correction method based ToA for Distance Estimation in Sensor node (센서 노드의 거리 정확도 측정을 위한 ToA기반 RSS보정 방법에 관한 연구)

  • Han Hyun Jin;Jo O Hyoung;Lee Hyun Wook;Kwon Tae Wook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1207-1210
    • /
    • 2008
  • 무선 센서 네트워크는 고정 인프라 없이 센서 노드만으로 정보를 수집하는 네트워크로서 센서들의 위치정보 식별은 매우 중요하다. 센서 노드간 거리 측정은 신호의 도착시간차(Time of Arrival: ToA), 신호세기(Received Signal Strength: RSS), 신호각도(Angle of Arrival: AoA)에 기반을 둔 방법 등이 있다. 무선 센서 네트워크에 배치되어 있는 각 센서 노드간 정확한 거리 식별을 위해 기존의 거리 측정 방법을 보완하여 거리 오차를 줄이는 ToA기반의 RSS보정 방법을 제안한다. 구체적으로 초음파를 통한 거리측정 값에 맵(RF-MAP)을 통해 보정한 RSS값을 가중치로 보정하여 기존의 거리 측정 방법보다 측정오차를 줄였다. 실험을 통해 제안한 방법은 기존 ToA보다 실내(5m×7m)에서 평균 0.1cm, 실외(10m×10m) 평균 0.6cm 측정 오차를 줄일 수 있음을 확인 할 수 있었다.

An efficient dual layer data aggregation scheme in clustered wireless sensor networks

  • Fenting Yang;Zhen Xu;Lei Yang
    • ETRI Journal
    • /
    • v.46 no.4
    • /
    • pp.604-618
    • /
    • 2024
  • In wireless sensor network (WSN) monitoring systems, redundant data from sluggish environmental changes and overlapping sensing ranges can increase the volume of data sent by nodes, degrade the efficiency of information collection, and lead to the death of sensor nodes. To reduce the energy consumption of sensor nodes and prolong the life of WSNs, this study proposes a dual layer intracluster data fusion scheme based on ring buffer. To reduce redundant data and temporary anomalous data while guaranteeing the temporal coherence of data, the source nodes employ a binarized similarity function and sliding quartile detection based on the ring buffer. Based on the improved support degree function of weighted Pearson distance, the cluster head node performs a weighted fusion on the data received from the source nodes. Experimental results reveal that the scheme proposed in this study has clear advantages in three aspects: the number of remaining nodes, residual energy, and the number of packets transmitted. The data fusion of the proposed scheme is confined to the data fusion of the same attribute environment parameters.

Distance-Based Channel Assignment with Channel Grouping for Multi-Channel Wireless Mesh Networks (멀티채널 무선 메쉬 네트워크에서의 채널 그룹을 이용한 거리 기반 채널 할당)

  • Kim, Sok-Hyong;Suh, Young-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12B
    • /
    • pp.1050-1057
    • /
    • 2008
  • Wireless Mesh Networks (WMNs) have recently become a hot issue to support high link capacity in wireless access networks. The IEEE 802. I 1 standard which is mainly used for the network interface technology in WMNs supports up to 3 or 12 multiple channels according to the IEEE 802.11 specification. However, two important problems must be addressed when we design a channel assigmnent algorithm: channel dependency problem and channel scanning delay. The former occurs when the dynamic channel switching of an interface leads to the channel switching of other interfaces to maintain node connectivity. The latter happens per channel switching of the interface, and affects the network performance. Therefore, in this paper, we propose the Distance-Based Channel Assigmnent (DB-CA) scheme for multi-channel WMNs to solve such problems. In DB-CA, nodes just perform channel switching without channel scanning to communicate with neighboring nodes that operate on different channels. Furthermore, DB-CA minimizes the interference of channels being used by nodes near the gateway in WMNs. Our simulation results show that DB-CA achieves improved performance in WMNs.

Effects of Light-emitting Diodes on In Vitro Growth of Virus-free Sweet Potato Plantlets (LED가 고구마 바이러스 무병묘의 기내 생장에 미치는 영향)

  • Yoo, Kyoung-Ran;Lee, Seung-Yeob
    • Horticultural Science & Technology
    • /
    • v.35 no.4
    • /
    • pp.490-498
    • /
    • 2017
  • The in vitro growth of virus-free sweet potato [Ipomoea batatas (L.) Lam.] plantlets was investigated under different light sources: fluorescent lamp (control); red (660 nm), blue (460 nm), white light-emitting diodes (LED), and two mixtures of blue and red LED (R:B = 8:2, and 7:3). Single node explants (10 mm) of three cultivars ('Matnami', 'Shincheonmi', and 'Yeonhwangmi') were cultured on Murashige and Skoog medium supplemented with $0.2mg{\cdot}L^{-1}$ 6-benzyladenine for 4 weeks. Explants were exposed to $150{\pm}5{\mu}mol{\cdot}m^{-2}{\cdot}s^{-1}$ photosynthetic photon flux at a distance of 20 cm, constant temperature of $25^{\circ}C$, and under 16/8-h (day/night) photoperiod. Using the same method, the in vitro growth of 10 cultivars under red LED was also compared. After 3 weeks, vine length was highest in plantlets cultured under red LED, and lowest in plantlets cultured under blue LED. Fresh and dry weights were also greatest in plantlets cultured under red LED. Compared to the control, vine thickness was significantly higher in plantlets grown under white LED and the 7:3 R:B LED mixture. Significant differences were observed among the 10 cultivars grown under red LED. 'Matnami', 'Shincheonmi', and 'Shinhwangmi' all had excellent vine lengths, and fresh and dry weights. Compared to the control, vine elongation of sweet potato plantlets was most effective under red LED, and culture duration was about 1 week shorter.

Improving Performance of File-referring Octree Based on Point Reallocation of Point Cloud File (포인트 클라우드 파일의 측점 재배치를 통한 파일 참조 옥트리의 성능 향상)

  • Han, Soohee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.33 no.5
    • /
    • pp.437-442
    • /
    • 2015
  • Recently, the size of point cloud is increasing rapidly with the high advancement of 3D terrestrial laser scanners. The study aimed for improving a file-referring octree, introduced in the preceding study, which had been intended to generate an octree and to query points from a large point cloud, gathered by 3D terrestrial laser scanners. To the end, every leaf node of the octree was designed to store only one file-pointer of its first point. Also, the point cloud file was re-constructed to store points sequentially, which belongs to a same leaf node. An octree was generated from a point cloud, composed of about 300 million points, while time was measured during querying proximate points within a given distance with series of points. Consequently, the present method performed better than the preceding one from every aspect of generating, storing and restoring octree, so as querying points and memorizing usage. In fact, the query speed increased by 2 times, and the memory efficiency by 4 times. Therefore, this method has explicitly improved from the preceding one. It also can be concluded in that an octree can be generated, as points can be queried from a huge point cloud, of which larger than the main memory.

Fair Queuing for Mobile Sink (FQMS) : Scheduling Scheme for Fair Data Collection in Wireless Sensor Networks with Mobile Sink (모바일 싱크를 위한 균등 큐잉(FQMS) : 모바일 싱크 기반 무선 센서 네트워크에서 균등한 데이터 수집을 위한 스케줄링 기법)

  • Jo, Young-Tae;Park, Chong-Myung;Lee, Joa-Hyoung;Seo, Dong-Mahn;Lim, Dong-Sun;Jung, In-Bum
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.3
    • /
    • pp.204-216
    • /
    • 2010
  • Since Sensor nodes around a fixed sink have huge concentrated network traffic, the battery consumption of them is increased extremely. Therefore the lifetime of sensor networks is limited because of huge battery consumption. To address this problem, a mobile sink has been studied for load distribution among sensor nodes. Since a mobile sink changes its location in sensor networks continuously, the mobile sink has time limits to communicate with each sensor node and unstable signal strength from each sensor node. Therefore, a fair and stable data collection method between a mobile sink and sensor nodes is necessary in this environment. When some sensor nodes are not able to send data to the mobile sink, a real-time application in sensor networks cannot be provided. In this paper, the new scheduling method, FQMS (Fair Queuing for Mobile Sink), is proposed for fair and stable data collection for mobile sinks in sensor networks. The FQMS guarantees balanced data collecting between sensor nodes for a mobile sink. In out experiments, the FQMS receives more packets from sensor nodes than legacy scheduling methods and provides fair data collection, because moving speed of a mobile sink, distance between a mobile sink and sensor nodes and the number of sensor nodes are considered.