• Journal of Advanced Marine Engineering and Technology
• /
• v.37 no.2
• /
• pp.213-219
• /
• 2013

Recently, with the rapid advancement in information and communication technology, indoor location-based services(LBSs) that require precise position tracking have been actively studied with outdoor-LBS using GPS. However, in case of a ship which consists of steel structure, it is difficult to measure a precise localization due to significant ranging error by the diffraction and refraction of radio waves. In order to reduce location measurement errors that occur in these indoor environments, this paper presents distance compensation algorithms that are suitable for a narrow passage such as ship corridors without any additional sensors by using UWB(Ultra-wide-band), which is robust to multi-path and has an error in the range of a few centimeters in free space. These improvement methods are that Pythagorean theory and adjacent node technique are used to solve the distance error due to the node deployment and distance variation analysis technique is applied to reduce the ranging errors which are significantly fluctuated in the corner section. The experimental results show that the number of nodes and the distance error are reduced to 66% and 57.41%, respectively, compared with conventional CSS(Chirp spread spectrum) method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1955-1963
• /
• 2009

In the application of wireless sensor networks to monitor valuable assets under concern, the appearance of a certain asset can be identified and reported simultaneously by several adjacent nodes, and this may dissipate the power of related nodes and network bandwidth as well. In the proposed method, a node that senses the appearance of some asset is allowed to send the sensing-reporting packet only after it has been being idle for a certain period without receiving any DRP(Don't Report Packet) from neighbors. It turns out that not only the cost of propagating DRPs but also that of reporting the events to the sink becomes minimal when depth of each DRP propagation is 2. In case of depth 1, at least, two routes are set up for the delivery of the sensing-reporting packet hence, reliable transfer to the sink is provided.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.78-83
• /
• 2017

Finding the densest subgraphs from social networks, such that people in the subgraph are in a particular community or have common interests, has been a recurring problem in numerous studies undertaken. However, these algorithms focused only on finding the single densest subgraph. We suggest a heuristic algorithm of the bottom-up type, which finds the densest subgraph by increasing its size from a given starting node, with the repeated addition of adjacent nodes with the maximum degree. Furthermore, since this approach matches well with parallel processing, we further implement a parallel algorithm on the MapReduce framework. In experiments using various graph data, we confirmed that the proposed algorithm finds the densest subgraphs in fewer steps, as compared to other related studies. It also scales efficiently for many given starting nodes.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.589-598
• /
• 2009

In wireless sensor networks, a node that reports information gathered from adjacent assets should relay packets appropriately so that its location context is kept private, and thereby helping ensure the security of the assets that are being monitored. Unfortunately, existing routing methods that counter the local eavesdropping-based tracing deal with a single asset, and most of them suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. In this paper, we propose a routing method, greedy perimeter stateless routing-based source-location privacy with crew size w (GSLP-w), that enhances location privacy of the packet-originating node (i.e., active source) in the presence of multiple assets. GSLP-w is a hybrid method, in which the next-hop node is chosen in one of four modes, namely greedy, random, perimeter, and retreat modes. Random forwarding brings the path diversity, while greedy forwarding refrains from taking an excessively long path and leads to convergence to the destination. Perimeter routing makes detours that avoid the nodes near assets so that they cannot be located by an adversary tracing up the route path. We study the performance of GSLP-w with respect to crew size w (the number of packets being sent per path) and the number of sources. GSLP-w is compared with phantom routing-single path (PR-SP), which is a notable routing method for source-location privacy and our simulation results show that improvements from the point of the ratio of safety period and delivery latency become significant as the number of source nodes increases.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.4 s.235
• /
• pp.534-539
• /
• 2005

Nodal displacements are referred to the initial configuration in the total Lagrangian formulation and to the last converged configuration in the updated Lagrangian furmulation. This research proposes a relative nodal displacement method to represent the position and orientation for a node in truss structures. Since the proposed method measures the relative nodal displacements relative to its adjacent nodal reference frame, they are still small for a truss structure undergoing large deformations for the small size elements. As a consequence, element formulations developed under the small deformation assumption are still valid for structures undergoing large deformations, which significantly simplifies the equations of equilibrium. A structural system is represented by a graph to systematically develop the governing equations of equilibrium for general systems. A node and an element are represented by a node and an edge in graph representation, respectively. Closed loops are opened to form a spanning tree by cutting edges. Two computational sequences are defined in the graph representation. One is the forward path sequence that is used to recover the Cartesian nodal displacements from relative nodal displacement sand traverses a graph from the base node towards the terminal nodes. The other is the backward path sequence that is used to recover the nodal forces in the relative coordinate system from the known nodal forces in the absolute coordinate system and traverses from the terminal nodes towards the base node. One open loop and one closed loop structure undergoing large deformations are analyzed to demonstrate the efficiency and validity of the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.155-165
• /
• 2012

This paper suggests traveling salesman problem algorithm that have been unsolved problem with NP-Hard. The proposed algorithm is a heuristic with edge-swap method. The classical method finds the initial solution starts with first node and visits to mostly adjacent nodes then decides the traveling path. This paper selects minimum weight edge for each nodes, then perform Min-Min method that start from minimum weight edge among the selected edges and Min-Max method that starts from maximum weight edges among it. Then we decide tie initial solution to minimum path length between Min-Min and Min-Max method. To get the final optimal solution, we apply previous two-opt to initial solution. Also, we suggest extended 3-opt and 4-opt additionally. For the 7 actual experimental data, this algorithm can be get the optimal solutions of state-of-the-art with fast and correct.

• Journal of Internet Computing and Services
• /
• v.14 no.4
• /
• pp.13-24
• /
• 2013

IEEE 802.15.4 network and WiFi network are installed to overlap each other and configured to use adjacent frequency bands in which case the communication service required by applications can not be guaranteed because of randomly increased frame transmission delay and frequent frame transmission failures at nodes in IEEE 802.15.4 network. In this paper, transmission delay model at IEEE 802.15.4 nodes and an experimental system to evaluate the interference from WiFi traffic are described, then elements for the evaluation of interference are measured with the analysis of their characteristics. A sequential method of using medium access layer and physical layer elements of IEEE 802.15.4 protocols is proposed to decide interference from WiFi network. With the proposed method, if an evaluation function having frame transmission failures and transmission delay as variables returns a value greater than a threshold, intensive measurements of wireless channel power are carried out subsequently and the final decision of interference is made by the calculated average channel power. Experimental results of the method show that the decision time is reduced with increased frequency of decision in comparison to an other similar method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.3
• /
• pp.143-150
• /
• 2014

In this paper, we propose an energy efficient and delay guaranteed node scheduling scheme inspired by biological systems, which have gained considerable attention as a computing and problem solving technique. With the identification of analogies between cellular signaling systems and WSN systems, we formulate a new mathematical model that considers the networking challenges of WSNs. The proposed bio-inspired algorithm determines the state of the sensor node, as required by each application and as determined by the local environmental conditions and the states of the adjacent nodes. A control analysis shows that the proposed bio-inspired scheme guarantees the system stability by controlling the parameters of each node. Simulation results also indicate that the proposed scheme provides significant energy savings, as well as reliable delay guarantees by controlling the states of the sensor nodes.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.788-791
• /
• 2005

Nodal displacements are referred to the Initial configuration in the total Lagrangian formulation and to the last converged configuration in the updated Lagrangian formulation. This research proposes a relative nodal displacement method to represent the position and orientation for a node in truss structures. Since the proposed method measures the relative nodal displacements relative to its adjacent nodal reference frame, they are still small for a truss structure undergoing large deformations for the small size elements. As a consequence, element formulations developed under the small deformation assumption are still valid fer structures undergoing large deformations, which significantly simplifies the equations of equilibrium. A structural system is represented by a graph to systematically develop the governing equations of equilibrium for general systems. A node and an element are represented by a node and an edge in graph representation, respectively. Closed loops are opened to form a spanning tree by cutting edges. Two computational sequences are defined in the graph representation. One is the forward path sequence that is used to recover the Cartesian nodal displacements from relative nodal displacements and traverses a graph from the base node towards the terminal nodes. The other is the backward path sequence that is used to recover the nodal forces in the relative coordinate system from the known nodal forces in the absolute coordinate system and traverses from the terminal nodes towards the base node. One closed loop structure undergoing large deformations is analyzed to demonstrate the efficiency and validity of the proposed method.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.2
• /
• pp.87-96
• /
• 2019

Low power issue is one of the most critical problems in the Internet of Things (IoT), which are powered by battery. To solve this problem, various approaches have been presented so far. In this paper, we propose a method to reduce the power consumption by reducing the numbers of accesses into the flash memory consuming a large amount of power for on-chip software execution. Our approach is based on using cooperative logging structure to distribute the sampling overhead in single sensor node to adjacent nodes in case of rare-event applications. The proposed algorithm to identify event occurrence is newly introduced with negative feedback method by observing difference between past data and recent data coming from the sensor. When an event with need of flash access is determined, the proposed approach only allows access to write the sampled data in flash memory. The proposed event detection algorithm (EDA) result in 30% reduction of power consumption compared to the conventional flash write scheme for all cases of event. The sampled data from the sensor is first traced into the random access memory (RAM), and write access to the flash memory is delayed until the page buffer of the on-chip flash memory controller in the micro controller unit (MCU) is full of the numbers of the traced data, thereby reducing the frequency of accessing flash memory. This technique additionally reduces power consumption by 40% compared to flash-write all data. By sharing the sampling information via LoRa channel, the overhead in sampling data is distributed, to reduce the sampling load on each node, so that the 66% reduction of total power consumption is achieved in several IoT edge nodes by removing the sampling operation of duplicated data.