• Smart Structures and Systems
• /
• 제6권5_6호
• /
• pp.675-687
• /
• 2010

Structural Health Monitoring (SHM) is the science and technology of monitoring and assessing the condition of aerospace, civil and mechanical infrastructures using a sensing system integrated into the structure. Impedance-based SHM measures impedance of a structure using a PZT (Lead Zirconate Titanate) patch. This paper presents a low-power wireless autonomous and active SHM node called Autonomous SHM Sensor 2 (ASN-2), which is based on the impedance method. In this study, we incorporated three methods to save power. First, entire data processing is performed on-board, which minimizes radio transmission time. Considering that the radio of a wireless sensor node consumes the highest power among all modules, reduction of the transmission time saves substantial power. Second, a rectangular pulse train is used to excite a PZT patch instead of a sinusoidal wave. This eliminates a digital-to-analog converter and reduces the memory space. Third, ASN-2 senses the phase of the response signal instead of the magnitude. Sensing the phase of the signal eliminates an analog-to-digital converter and Fast Fourier Transform operation, which not only saves power, but also enables us to use a low-end low-power processor. Our SHM sensor node ASN-2 is implemented using a TI MSP430 microcontroller evaluation board. A cluster of ASN-2 nodes forms a wireless network. Each node wakes up at a predetermined interval, such as once in four hours, performs an SHM operation, reports the result to the central node wirelessly, and returns to sleep. The power consumption of our ASN-2 is 0.15 mW during the inactive mode and 18 mW during the active mode. Each SHM operation takes about 13 seconds to consume 236 mJ. When our ASN-2 operates once in every four hours, it is estimated to run for about 2.5 years with two AAA-size batteries ignoring the internal battery leakage.

• 대한임베디드공학회논문지
• /
• 제6권6호
• /
• pp.369-376
• /
• 2011

Since wireless sensor networks generally have the capability of network recovery, malfunction of a few sensor nodes in a sensor network does not cause a crucial problem paralyzing the sensor network. The malfunction of the sink node, however, is critical. If the sink node of a sensor network stops working, the data collected by sensor nodes cannot be delivered to the gateway because no other sensor nodes can take the place of the sink node. This paper proposes a TDMA-based wireless sensor network equipped with dual sink nodes, with a view to preventing data loss in the case of malfunction of a sink node. A secondary sink node, which synchronizes with a primary sink node and receives data from other sensor nodes in normal situations, takes the role of the primary sink node in the case of malfunction of the primary sink, thereby eliminating the possibility of data loss. The effectiveness of the proposed scheme is demonstrated through experiments.

• Journal of Computing Science and Engineering
• /
• 제6권4호
• /
• pp.294-309
• /
• 2012

In the age of multi-core and specialized accelerators in high performance computing (HPC) systems, it is critical to understand application characteristics and apply suitable optimizations in order to fully utilize advanced computing system. Often time, the process involves multiple stages of application performance diagnosis and a trial-and-error type of approach for optimization. In this study, a general guideline of performance optimization has been demonstrated with two class-representing applications. The main focuses are on node-level optimization and inter-node scalability improvement. While the number of optimization case studies is somewhat limited in this paper, the result provides insights into the systematic approach in HPC applications performance engineering.

• 스마트미디어저널
• /
• 제5권4호
• /
• pp.41-48
• /
• 2016

In mobile ad hoc networks(MANETs), all the nodes in a network have limited resources. Therefore, communication topology which has long lifetime is suitable for nodes in MANETs. And MANETs are exposed to various threats because of a new node which can join the network at any time. There are various researches on security problems in MANETs and many researches have tried to make efficient schemes for reducing network power consumption. Power consumption is necessary to secure networks, however too much power consumption can be critical to network lifetime. This paper focuses on energy efficient monitoring node distribution for enhancing network lifetime in MANETs. Since MANETs cannot use centralized infrastructure such as security systems of wired networks, we propose an efficient IDS node distribution scheme using minimum spanning tree (MST) method to cover all the nodes in a network and enhance the network lifetime. Simulation results show that the proposed algorithm has better performance in comparison with the existing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5437-5454
• /
• 2016

A Wireless Sensor Network (WSN) is composed of several sensor nodes which are severely restricted to energy and memory. Energy is the lifeblood of sensors and thus energy conservation is a critical necessity of WSN. This paper proposes a clustering algorithm namely Energy Efficient Trustworthy Clustering algorithm (EETCA), which focuses on three phases such as chief node election, chief node recycling process and bi-level trust computation. The chief node election is achieved by Dempster-Shafer theory based on trust. In the second phase, the selected chief node is recycled with respect to the current available energy. The final phase is concerned with the computation of bi-level trust, which is triggered for every time interval. This is to check the trustworthiness of the participating nodes. The nodes below the fixed trust threshold are blocked, so as to ensure trustworthiness. The system consumes lesser energy, as all the nodes behave normally and unwanted energy consumption is completely weeded out. The experimental results of EETCA are satisfactory in terms of reduced energy consumption and prolonged lifetime of the network.

• 대한전기학회논문지
• /
• 제34권1호
• /
• pp.19-28
• /
• 1985

As is well known, the power equations of the N-node system have 2N-1 voltage solutions at most. The vlotage solutions are characterized by the introduction of the mode concept in this paper. There are two mode voltages at one node. One is defined as the (+) mode voltage and the other is defined as the (-) mode one. In this paper, we show that the (-) mode voltage responds to the increase of the power condenser almost adversly to the response of the (+) one. We study how to prevent the voltage collapse in the system with the induction motor load. The critical values of the gain and the time constant in case of the continuous power condenser control, and of the unit power condenser and the closing time delay in case of the discontinuous control for the prevention of the voltage collapse, are calculated. The effect of the composition ratio of the impedance load to the induction moter load on the above critical values are also investigated.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.667-676
• /
• 2014

Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• Journal of the Optical Society of Korea
• /
• 제20권6호
• /
• pp.678-685
• /
• 2016

The standard high-availability seamless redundancy (HSR) protocol utilizes duplicated frame copies of each sent frame for zero fail over time. This means that even in cases of a node or link failure, the destination node will receive at least one copy of the sent frame, resulting in no network downtime. However, the standard HSR is mostly based on the electrical signal connection inside the node, which leads to the production of considerable latency at each node due to frame processing. Therefore, in a large scale HSR ring network, the accumulated latencies become significant and can often restrict the mission-critical real-time application of HSR. In this paper, we present a novel design for optical HSR (OHSR) that uses beam splitting/combining techniques. The proposed OHSR passes the frames directly to adjacent nodes without frame processing at each node, thereby theoretically generating no latency in any node. Various simulations for network samples, made to validate the OHSR design and its performance, show that the OHSR outperforms the standard HSR.

• Journal of Information Processing Systems
• /
• 제14권6호
• /
• pp.1347-1360
• /
• 2018

Owing to limited energy in wireless devices power saving is very critical to prolong the lifetime of the networks. In this regard, we designed a cross-layer optimization mechanism based on power control in which source node broadcasts a Route Request Packet (RREQ) containing information such as node id, image size, end to end bit error rate (BER) and residual battery energy to its neighbor nodes to initiate a multimedia session. Each intermediate node appends its remaining battery energy, link gain, node id and average noise power to the RREQ packet. Upon receiving the RREQ packets, the sink node finds node disjoint paths and calculates the optimal power vectors for each disjoint path using cross layer optimization algorithm. Sink based cross-layer maximal minimal residual energy (MMRE) algorithm finds the number of image packets that can be sent on each path and sends the Route Reply Packet (RREP) to the source on each disjoint path which contains the information such as optimal power vector, remaining battery energy vector and number of packets that can be sent on the path by the source. Simulation results indicate that considerable energy saving can be accomplished with the proposed cross layer power control algorithm.