• Journal of Advanced Navigation Technology
• /
• 제24권6호
• /
• pp.613-619
• /
• 2020

Hybrid media access control (MAC) is used in internet of things (IoT) network, because of communication feature concern with data capacity and communication interval between gateway and sensor nodes and the cost efficiency. Hybrid MAC consists of TDMA and CSMA generally. The distance between gateway and sensor node is openly changed in marine IoT network. Therefore, it is needed to control the period of timeslot of hybrid MAC used in marine IoT network. In this paper, the design rule of TDMA timeslot with the variable period depending on communication distance was proposed. It was confirmed from the analysis that 72 times communication between gateway and sensor nodes is possible in LoRa network by using the proposed TDMA variable timeslot scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제21권10호
• /
• pp.1840-1848
• /
• 2017

Linear wireless sensor networks typically construct a network topology with a high reliability through sequential 1:1 mapping among sensor nodes, so that they are used in various surveillance applications of major national infrastructures. Most existing techniques for identifying sensor nodes in those networks are using GPS, AOA, and RSSI mechanisms. However, GPS or AOA based node identification techniques affect the size or production cost of the nodes so that it is not easy to construct practical sensor networks. RSSI based techniques may have a high deviation regrading location identification according to propagation environments and equipment quality so that complexity of error correction algorithm may increase. We propose a timestamps based sequential localization algorithm that uses transmit and receive timestamps in a message between sensor nodes without using GPS, AOA, and RSSI techniques. The algorithms for distance measurement between each node are expected to measure distance within up to 1 meter in case of an crystal oscillator of 300MHz or more.

• Journal of the Korea Society of Computer and Information
• /
• 제24권10호
• /
• pp.79-89
• /
• 2019

While most research focuses on the k-nearest neighbors (kNN) queries in the database community, an important type of proximity queries called k-farthest neighbors (kFN) queries has not received much attention. This paper addresses the problem of finding the k-farthest neighbors in road networks. Given a positive integer k, a query object q, and a set of data points P, a kFN query returns k data objects farthest from the query object q. Little attention has been paid to processing kFN queries in road networks. The challenge of processing kFN queries in road networks is reducing the number of network distance computations, which is the most prominent difference between a road network and a Euclidean space. In this study, we propose an efficient algorithm called FANS for k-FArthest Neighbor Search in road networks. We present a shared computation strategy to avoid redundant computation of the distances between a query object and data objects. We also present effective pruning techniques based on the maximum distance from a query object to data segments. Finally, we demonstrate the efficiency and scalability of our proposed solution with extensive experiments using real-world roadmaps.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제15권5호
• /
• pp.133-138
• /
• 2015

In this paper, we propose a method for improving the lifetime of the sensor network SEP through the wireless sensor network divided into two spaces by reducing the transmission distance of the cluster head in the layer in the distance. With reference to the position information of the node, the base station divides the layer based on the midpoint of the nearest node and the furthest distance away from the base station node. And the cluster head in the outer layer far from the base station is transmitted the data to the base station via the cluster head in the inner layer base station to transmit data. That is, we are proposed the layered SEP by reducing the transmission distance of the cluster head in the outer layer for the energy consumption to a minimum. The proposed algorithm is verified by comparison with the existing SEP.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (D)
• /
• pp.169-171
• /
• 2006

무선 센서 네트워크에서는 고정된 인프라에 의존하기 어려운 환경을 가지고 있다. 하지만, 위치기반 기술을 접목하여 센서의 절대적 또는 상대적인 위치정보를 이용하면 다양한 응용서비스를 효과적으로 적용 할 수 있다. 이러한 센서 노드의 위치를 측정하는 방법 중에 시간을 기반으로 위치를 측정하는 방법이 가장 정확도가 높게 평가되었다[1]. 그러나 이러한 TOA방법은 노드의 Clock Rate에 의존적이기 때문에 위치오차가 발생하게 된다. 따라서 Node의 Clock Drifi를 줄이기 위해서 주기적인 시간동기화가 필요했다[3,4]. 하지만 본 논문에서는 이러한 거리오차를 제거하기 위한 방법으로 시간 비동기화 방법(ALS)을 소개하고, ALS를 기반으로 시뮬레이션과 실질적인 센서를 가지고 노드 사이의 거리와 위치를 측정하였다. 실험 결과, 기존의 TOA방법과 비교하여 거리 및 위치 정확도, Packet 트래픽에 대해서 성능 향상을 확인한다.

• Journal of Korea Society of Industrial Information Systems
• /
• 제19권5호
• /
• pp.1-7
• /
• 2014

Distance based mobility management schemes have been considered as a major issue in the wireless network research area. Accordingly, many efforts have been made to analyze them numerically with suitable mobility models. In particular, bidirectional random walk model has been employed frequently due to its simplicity. Nevertheless, the exact equations are not presented so far. In this paper, we provide the exact equations regarding the bidirectional random walk model, which is very useful for the analysis of the distance based mobility management schemes.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2001년도 봄 학술발표논문집 Vol.28 No.1 (A)
• /
• pp.331-333
• /
• 2001

현재 사용되고 있는 라우팅 프로토콜들은 정적인 인자를 사용하여 최단 거리 경로를 설정하기 때문에 혼잡(Congestion)이 자주 발생 할 뿐 아니라 최단 거리 경로를 설정하는 이들 라우팅 프로토콜로는 혼잡상황을 해결하기 어렵다. 이를 해결하기 위해서 트래픽 엔지니어링 기법이 등장하게 되었다. 트랙픽 엔지니어링을 위해서는 네트워크의 동적인 상태를 반영하는 정보를 저장하는 트래픽 엔지니어링 데이터베이스가 필요하다. 현대 NS-2에는 프래픽 엔지니어링에 필요한 정보를 제공하고, 네트워크의 상태에 따라 동적으로 경로를 설정하는 라우팅 프로토콜이 구현되어 있지 않다. 본 논문에서는 NS-2에 구현되어 있는 rtProtoLS라는 Link-State Protocol을 수정하여 플러딩(Flooding) 하는 정보에 동적인 인자의 하나인 가용 대역폭을 정보를 실어서 트래픽 엔지니어링 데이터베이스에 제공 할 수 있도록 하고, 가용 대역폭 정보를 기반으로 하여 동적으로 새로운 경로를 계산 할 수 있는 기능을 추가한 QoS를 고려한 Link-State Protocol(QLS)을 구현하였다. 그리고 본 논문에서는 기존의 라우팅 기법 중 거리 백터 프로토콜(Distance Vector Protocol) 라우팅과 QLS 라우팅의 성능을 Throughput 측면에서 비교, 분석했다.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 2011년도 제42회 하계학술대회
• /
• pp.1954-1955
• /
• 2011

본 연구에서는 교육용으로 제작된 NXT 장비에 설치된 Light 센서, Ultrasonic센서, Sound센서를 이용하여 각 거리(10~60cm)에서 5cm 간격으로 각 센서 데이터를 취득하였다. 데이터 취득은 NI(National Instrument)에서 제공하는 LabVIEW Software를 사용하여 각 거리마다 100개의 셈플 데이터를 취득하였다. 취득한 데이터는 제안한 모델의 입력 데이터로 사용하여 실제거리와 모델 출력과의 정확도를 평가 하였다. 본 연구에서 제안한 모델은 지능형 모델 중 퍼지추론 기반의 최적 다항식 RBF 뉴럴네트워크(Radial Basis Function Neural Network; RBFNN)를 설계한다. 제안된 RBFNN은 기존 RBF 뉴럴네트워크를 기반으로 한 구조로, 퍼지추론 메커니즘의 기능적 모듈 동작 특성을 갖도록 정규화 부분을 추가하고, 은닉층과 출력층 사이의 연결가중치를 기존 상수항에서 선형식(first order)으로 확장한 형태이다. 또한 최적의 알고리즘인 PSO(Paticle Swarm Optimization)와 DE(Differential Evolution)을 이용하여 제안된 모델의 파라미터들을 동정하여 성능을 비교, 분석 하였다.

• Journal of IKEEE
• /
• 제27권4호
• /
• pp.679-682
• /
• 2023

In wireless sensor networks, communication failure between sensor nodes causes continuous connection attempts, which results in a large power loss. In this paper, an appropriate distance between the CH(Cluster Head) node and the communicating sensor nodes is limited so that a group of clusters of appropriate size is formed on a two-dimensional plane. To equalize the cluster size, sensor nodes in the shortest distance communicate with each other to form member nodes, and clusters are formed by gathering nearby nodes. Based on the proposed cluster uniformity algorithm, the improvement rate of cluster uniformity is shown by simulation results. The proposed method can improve the cluster uniformity of the network by about 30%.

• The KIPS Transactions:PartC
• /
• 제17C권5호
• /
• pp.427-432
• /
• 2010

It is important to efficiently elect the cluster header in Hierarchical Sensor Network, because it largely effects on the life duration of the network. Therefore, a recent research is going forward a research activity with regard to life time extension of the whole network for efficient cluster header election. In this paper, we propose the new Cluster Header Election Scheme in which the cluster is divided into Group considering Distance from a Sink, and a cluster header will be elected by node density of the Group. Also, we evaluate the performance of this scheme, and show that this proposed scheme improves network lifetime in Zigbee environment.