• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.378-385
• /
• 2011

The three-dimensional triangulation algorithm that the beacon nodes can be allocated to dynamically in not the experimental region but the practical region is suggested, and the performance of the localization system adapting the suggested algorithm is analyzed. The suggested algorithm adapts the computation method of the three dimensional point that the surfaces of three spheres overlapped, while the traditional triangulation algorithm adapts the computation method of the two dimensional point that three circles are overlapped in order to compute the distance between beacon nodes and mobile node that means a radius. In addition to this, to analyze the performance of the localization system adapting the suggested algorithm, first of all, the allocation layout of beacon nodes is made, and the allocation layout is modeled by selection of ten random distance values between mobile node and beacon nodes for computer simulation of the practical model. Next, the two dimensional coordinator of mobile node that is calculated by the suggested algorithm and the traditional triangulation algorithm is compared with each other. The localization measuring performance about three dimensional coordinator(z axis) of the suggested algorithm is also obtained by comparing with that of the practical model.

• Journal of Korea Multimedia Society
• /
• v.21 no.6
• /
• pp.667-677
• /
• 2018

Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.151-158
• /
• 2019

With the recent advances of memory technologies, high-performance non-volatile memories such as non-volatile dual in-line memory module (NVDIMM) have begun to be used as an addition or an alternative to server-side storages. When these memory bus-connected storages (MBSs) are installed over non-uniform memory access (NUMA) servers, the distance between NUMA nodes and MBSs is one of the crucial factors that influence file processing performance, because the access latency of a NUMA system varies depending on its distance from the NUMA nodes. This paper presents the design and implementation of a high-performance logical volume manager for MBSs, called MBS-LVM, when multiple MBSs are scattered over a NUMA server. The MBS-LVM consolidates the address space of each MBS into a single global address space and dynamically utilizes storage spaces such that each thread can access an MBS with the lowest latency possible. We implemented the MBS-LVM in the Linux kernel and evaluated its performance by porting it over the tmpfs, a memory-based file system widely used in Linux. The results of the benchmarking show that the write performance of the tmpfs using MBS-LVM has been improved by up to twenty times against the original tmpfs over a NUMA server with four nodes.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1781-1786
• /
• 2005

In sensor network systems, all the nodes are interconnected and the positional information of each sensor is essential. To measure the temperature, position detection and communication functions are required. Many sensor nodes are distributed to a measurement field, and these sensors have three main functions: they measure the distance to the other nodes, the data of which are used to determine the position of each node; they communicate with other nodes; and they measure the temperature of each node. A novel range measurement method using the difference between light and sound propagation speed is proposed. The experimental results show the temperature distribution as measured with the aid of the determined positions. The positions of every node were calculated with a PC program. Eight nodes were manufactured and their fundamental functions were tested. The results of the range measurement method, which takes relatively accurate measurements, contribute significantly to the accuracy of the position determination. Future studies will focus on 3-D position determination and on the architecture of appropriate sensors and actuators.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.2
• /
• pp.1-8
• /
• 2022

The message propagation between vehicles must be efficiently performed to quickly transmit information between vehicles in vehicle ad hoc networks (VANETs). Broadcasting can be the most effective solution for propagating these messages. However, broadcasting can cause broadcast storm problems, which can reduce the performance of the overall network. Therefore, rapid information delivery in VANET requires a method that can propagate messages quickly without causing the broadcast storm problems. This paper proposes a lightweight and opportunistic broadcast (LOB) protocol that leverages the features of opportunistic routing to propagate messages quickly while minimizing the load on the network in VANETs where the network topology changes frequently. LOB does not require any routing information like greedy forwarding scheme, and neighboring nodes at the farthest distance within the range of transmission nodes are likely to be selected as forwarding nodes, and multiple forwarding candidate nodes like opportunistic routing scheme can increase packet transmission rates. Simulation results using ns-2 showed that LOB outperformed existing broadcast protocols in terms of packet rate and packet delay.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.14-24
• /
• 2010

Because WSNs operate with limited resources of sensor nodes, its life is extended by cluster-based routing methods. In this study, we use data on direction, distance, density and residual energy in order to maximize the energy efficiency of cluster-based routing methods. Through this study, we expect to minimize the frequency of isolated nodes when selecting a new cluster head autonomously using information on the direction of the upper cluster head, and to reduce energy consumption by switching sensor nodes, which are included in both of the new cluster and the previous cluster and thus do not need to update information, into the sleep mode and updating information only for newly included sensor nodes at the setup phase using distance data. Furthermore, we enhance overall network efficiency by implementing secure and energy-efficient communication through key management robust against internal and external attacks in cluster-based routing techniques. This study suggests the modified cluster head selection scheme which uses the conserved energy in the steady-state phase by reducing unnecessary communications of unchanged nodes between selected cluster head and previous cluster head in the setup phase, and thus prolongs the network lifetime and provides secure and equal opportunity for being cluster head.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.641-644
• /
• 2016

Unlike wired networks, broadcasting in wireless networks can transmit data at once to several nodes with a single transmission. For omnidirectional broadcast to a node in wireless networks, all adjacent nodes receive the data at the same time. In this paper, we propose a greedy algorithm to solve the minimum power broadcasting problem of minimizing the total transmit power on broadcasting in wireless networks. We apply two matrices to the proposed algorithm: one is a distance matrix that represents the distance between each node, the other is an adjacency matrix having the number of adjacency nodes. Among the nodes that receive the data, a node that has the greatest number of the adjacent node transmits data to neighbor preferential. We compare the performance of the proposed algorithm with random method through computer simulation in terms of transmitting power of nodes. Experiment results show that the proposed algorithm outperforms better than the random method.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.2
• /
• pp.71-78
• /
• 2012

Based on the Zigbee-based wireless sensor network, I suggest the way to reduce errors between the short distance, improving the accuracy of the presumed distance by revising the deviation of RSSI(Received Signal Strength Indication) values is to estimate the distance using only the RF signal power without the additional hardware. In general, the graph measured by RSSI values shows the proximity values which are ideally reduced in proportion to the distance under the free outdoor space in which LOS(Line-Of-Sight) is guaranteed. However, if the result of the received RSSI values are each substituted to the formula, it can produce a larger margin of error and less accurate measurement since it is based upon the premise that this free space is not affected by reflected waves or obstacles caused by the ground and electronic jamming engendered by the environment. Therefore, the purpose of this study is to reduce the margin of errors between the distances and to measure the proximity values with the ideal type of graph by suggesting the way to revise the received RSSI values in the light of these reflected waves or obstacles and the electronic jamming. In conclusion, this study proves that errors are reduced by comparing the proposed deviation correction method to the revised RSSI value.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.154-161
• /
• 2010

The properties of sensor node having a restricted energy in WSN have a difficult in various application fields to apply. Our paper proposed the cluster head selection which is an effective energy in order to manage in wireless sensor network. The proposed algorithm improves an energy efficient and is applied to various network environment considering energy capacity between cluster head and nodes and distance between cluster head and base station(sink node). By using the ns-2 simulator, we evaluate the performance of the proposed scheme in comparison with the original LEACH-C. Experimental results validate our scheme, showing a better performance than original LEACH-C in terms of the number of outliving nodes and the quantity of energy consumption as time evolves.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.131-140
• /
• 2008

In this paper, we present a data dissemination protocol that guarantees energy-efficient data transmission and maximizes network lifetime. SPMS that outperforms the well-known protocol SPIN uses the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path, maximizing the network lifetime is impossible. In this paper, we propose a protocol for data dissemination called the protocol Considering Between Energy and Distance (ConBED). It solves the network lifetime problem using the residual energy and the distance between nodes to determine a path for data dissemination. The simulation results show that ConBED guarantees energy-efficient transmission and increases the network lifetime by approximately 69% than that of SPMS.