• Title/Summary/Keyword: distance between nodes

Search Result 279, Processing Time 0.029 seconds

A New Technique for Localization Using the Nearest Anchor-Centroid Pair Based on LQI Sphere in WSN

  • Subedi, Sagun;Lee, Sangil
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.1
    • /
    • pp.6-11
    • /
    • 2018
  • It is important to find the random estimation points in wireless sensor network. A link quality indicator (LQI) is part of a network management service that is suitable for a ZigBee network and can be used for localization. The current quality of the received signal is referred as LQI. It is a technique to demodulate the received signal by accumulating the magnitude of the error between ideal constellations and the received signal. This proposed model accepts any number of random estimation point in the network and calculated its nearest anchor centroid node pair. Coordinates of the LQI sphere are calculated from the pair and are added iteratively to the initially estimated point. With the help of the LQI and weighted centroid localization, the proposed system finds the position of target node more accurately than the existing system by solving the problems related to higher error in terms of the distance and the deployment of nodes.

A Tour Bus Scheduling Method by Greedy Heuristic and Column Generation Techniques (Greedy Heuristic기법과 열 제조에 의한 관광버스 배차방법)

  • Park Sun-Dal;Jang Byeong-Man
    • Journal of the military operations research society of Korea
    • /
    • v.13 no.1
    • /
    • pp.101-115
    • /
    • 1987
  • This paper presents an optimization based heuristic algorithm for a tour bus scheduling problem where buses consist of various kinds of sightseeing and commutation services. First, this algorithm transforms the prolem into a vehicle routing problem on whose nodes denote trips and arcs denote connections between trips. Second, a greedy heuritic routing technique is applied to find a good feasible bus-route set. Then the greedy feasible solution is improved by the simplex method using column generation technique. The algorithm provides a better near-optimal solution which gives much reductions in the total tour distance and the number of tour buses.

  • PDF

Clustering Optimal Design in Wireless Sensor Network using Ant Colony Optimization (개미군 최적화 방법을 적용한 무선 센서 네트워크에서의 클러스터링 최적 설계)

  • Kim, Sung-Soo;Choi, Seung-Hyeon
    • Korean Management Science Review
    • /
    • v.26 no.3
    • /
    • pp.55-65
    • /
    • 2009
  • The objective of this paper is to propose an ant colony optimization (ACO) for clustering design in wireless sensor network problem. This proposed ACO approach is designed to deal with the dynamics of the sensor nodes which can be adaptable to topological changes to any network graph in a time. Long communication distances between sensors and a sink in a sensor network can greatly consume the energy of sensors and reduce the lifetime of a network. We can greatly minimize the total communication distance while minimizing the number of cluster heads using proposed ACO. Simulation results show that our proposed method is very efficient to find the best solutions comparing to the optimal solution using CPLEX in 100, 200, and 400 node sensor networks.

Power-aware Ad hoc On-Demand Distance Vector Routing for prolonging network lifetime of MANETs

  • Hoang, Xuan-Tung;Ahn, So-Yeon;Lee, Young-Hee
    • Annual Conference of KIPS
    • /
    • 2002.11b
    • /
    • pp.1317-1320
    • /
    • 2002
  • We present in this paper a new version of AODV that incorporates with "Minimizing Maximum node cost" by formulating that metric as a cost function of residual energy of nodes. An additional parameter is added to the cost function to consider the routing performance along with power-efficiency. The motivation of adding that new parameter is originated from the trace off between power-saving behaviors and routing performance.

  • PDF

Determining the Most Vital Arcs in the Weighted Network of GIS (GIS의 가중네트워크에서 MVA를 결정하는 방법)

  • 정호연
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.45
    • /
    • pp.181-191
    • /
    • 1998
  • The purpose of this paper is to develop an efficient algorithm for determining the most vital arcs in a weighted network and implement its algorithm on GIS. The most vital arcs in a weighted network of GIS is that arc whose removal from the network results in the greatest increase in shortest distance between two specified nodes. These studies are well applied to a situation where a logistics or communications network is broken by unexpected accidents. Because a user of the system wants to know which arcs are most vital to him so that he can reinforce them against unexpected accidents. We first present an algorithm to find the most vital arcs in a weighted network, then show that how its algorithm can be applied to a geo-spatial network.

  • PDF

Design and Implementation of XML-based Indexing Algorithm Using Depth-First and Shortest Distance Between Nodes (깊이탐색과 노드간 최단거리를 이용한 XML 인덱싱 알고리즘 설계 및 구현)

  • 김광남;윤희병;김화수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04b
    • /
    • pp.547-549
    • /
    • 2004
  • 웹기반 하에서 구조적인 정보를 표현하기 위해서 XML이 다양하게 사용되고 있으나 XML 기반 문서는 다양한 Schema와 노드의 표현으로 구성되어 있어서 이를 효율적으로 인덱싱 하여 저장하는 것은 매우 어려운 일이다 이를 해결하기 위하여 추상화, DTD, K-ary 완전트리 기법 등 다양한 연구가 이루어지고 있으나 응용에 많은 제한을 가지고 있다. 본 논문에서는 XML 기반의 웹문서를 효율적으로 인덱싱하고 사용자의 질의에 최적의 결과를 제공하기 위한 알고리즘을 설계 및 구현한다. 인덱싱 시스템 설계를 위해서 먼저 노드(부모 형제)의 ID를 추출하는 알고리즘을 제안하며, 문서 및 노드 테이블 설계 결과를 제시한다. 그리고 C#을 이용한 파싱과 인덱스 알고리즘을 구현하기 위하여 깊이탐색과 관계 노드간 최단거리를 이용하며, 알고리즘 실행 결과와 이 결과로 자동 생성된 문서 및 노드 테이블의 파싱 결과를 또한 제시한다.

  • PDF

Forecasting COVID-19 confirmed cases in South Korea using Spatio-Temporal Graph Neural Networks

  • Ngoc, Kien Mai;Lee, Minho
    • International Journal of Contents
    • /
    • v.17 no.3
    • /
    • pp.1-14
    • /
    • 2021
  • Since the outbreak of the coronavirus disease 2019 (COVID-19) pandemic, a lot of efforts have been made in the field of data science to help combat against this disease. Among them, forecasting the number of cases of infection is a crucial problem to predict the development of the pandemic. Many deep learning-based models can be applied to solve this type of time series problem. In this research, we would like to take a step forward to incorporate spatial data (geography) with time series data to forecast the cases of region-level infection simultaneously. Specifically, we model a single spatio-temporal graph, in which nodes represent the geographic regions, spatial edges represent the distance between each pair of regions, and temporal edges indicate the node features through time. We evaluate this approach in COVID-19 in a Korean dataset, and we show a decrease of approximately 10% in both RMSE and MAE, and a significant boost to the training speed compared to the baseline models. Moreover, the training efficiency allows this approach to be extended for a large-scale spatio-temporal dataset.

Optimizing Network Lifetime of RPL Based IOT Networks Using Neural Network Based Cuckoo Search Algorithm

  • Prakash, P. Jaya;Lalitha, B.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.1
    • /
    • pp.255-261
    • /
    • 2022
  • Routing Protocol for Low-Power and Lossy Networks (RPLs) in Internet of Things (IoT) is currently one of the most popular wireless technologies for sensor communication. RPLs are typically designed for specialized applications, such as monitoring or tracking, in either indoor or outdoor conditions, where battery capacity is a major concern. Several routing techniques have been proposed in recent years to address this issue. Nevertheless, the expansion of the network lifetime in consideration of the sensors' capacities remains an outstanding question. In this research, aANN-CUCKOO based optimization technique is applied to obtain a more efficient and dependable energy efficient solution in IOT-RPL. The proposed method uses time constraints to minimise the distance between source and sink with the objective of a low-cost path. By considering the mobility of the nodes, the technique outperformed with an efficiency of 98% compared with other methods. MATLAB software is used to simulate the proposed model.

Blockchain based Learning Management Platform for Efficient Learning Authority Management

  • Youn-A Min
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.231-238
    • /
    • 2023
  • As the demand for distance education increases, interest in the management of learners' rights is increasing. Blockchain technology is a technology that guarantees the integrity of the learner's learning history, and enables learner-led learning control, data security, and sharing of learning resources. In this paper, we proposed a blockchain technology-based learning management system based on Hyperledger Fabric that can be verified through permission between nodes among blockchain platforms. Learning resources can be shared differentially according to the learning progress. Also the percentage of individual learners that can be managed. As a result of the study, the superiority of the platform in terms of convenience compared to the existing platform was demonstrated. As a result of the performance evaluation for the research in this paper, it was confirmed that the convenience was improved by more than 5%, and the performance was 4-5% superior to the existing platform in terms of learner satisfaction.

Real time indoor positioning system using IEEE 802.15.4a and sensors (IEEE 802.15.4a와 센서를 이용한 실시간 실내위치인식 시스템)

  • Cho, Hyun-Jong;Hwang, Kwang-Il;Noh, Duck-Soo;Seo, Dong-Hoan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.36 no.6
    • /
    • pp.850-856
    • /
    • 2012
  • Bilateration using two fixed nodes has been used in the field of the real time indoor location system in the narrow space such as building or ship passage. However, as the distance between the fixed nodes increases or any obstructions exist in their zone, it is difficult to detect the location of mobile node(user) due to the degradation of its reception ratio. In order to compensate for these problems, this paper presents, based on IEEE 802.15.4a chirp signal, a new real time indoor location system using stride measurement algorithm which can calculate the location through sensors attached to user. The proposed system consists of an ultrasonic sensor to measure the leg length, a geomagnetic sensor to recognize the user's orientation, and an inertial sensor to obtain the angle between the legs. The experimental results are shown that the proposed system has twice or more accurate output compared with conventional indoor location method in the section which is partially out of communication reachability.