• Journal of KIISE
• /
• v.41 no.11
• /
• pp.958-966
• /
• 2014

Wireless sensor networks offer a distributed processing environment. Many sensor nodes are deployed in fields that have limited resources such as computing power, network bandwidth, and electric power. The sensor nodes construct their own networks automatically, and the collected data are sent to the sink node. In these traditional wireless sensor networks, network congestion due to packet flooding through the networks shortens the network life time. Clustering or in-network technologies help reduce packet flooding in the networks. Many studies have been focused on saving energy in the sensor nodes because the limited available power leads to an important problem of extending the operation of sensor networks as long as possible. However, we focus on the execution time because clustering and local distributed processing already contribute to saving energy by local decision-making. In this paper, we present a cooperative processing model based on the processing timeline. Our processing model includes validation of the processing, prediction of the total execution time, and determination of the optimal number of processing nodes for distributed processing in wireless sensor networks. The experiments demonstrate the accuracy of the proposed model, and a case study shows that our model can be used for the distributed application.

• Journal of Information Technology Services
• /
• v.8 no.3
• /
• pp.171-184
• /
• 2009

Since the development of the Distributed Hash Tables (DHTs), the distributed lookup services are one of the hot topics in the networking area. The main reason of this popularity is the simplicity of the lookup structure. However, the simple key based search mechanism makes the so called "keyword" based search difficult if not impossible. Thus, the applicability of the DHTs is limited to certain areas. In this paper. we find that DHTs can be used as the ubiquitous sensor network (USN) metadata lookup service across a large number of sensor networks. The popularity of the Ubiquitous Sensor Network has motivated the development of the USN middleware services for the sensor networks. One of the key functionalities of the USN middleware service is the lookup of the USN metadata, by which users get various information about the sensor network such as the type of the sensor networks and/or nodes, the residual of the batteries, the type of the sensor nodes. Traditional distributed hash table based lookup systems are good for one sensor network. However, as the number of sensor network increases, the need to integrate the lookup services of many autonomous sensor networks so that they can provide the users an integrated view of the entire sensor network. In this paper, we provide a hybrid lookup model, in which the autonomous lookup services are combined together and provide seamless services across the boundary of a single lookup services. We show that the hybrid model can provide far better lookup performance than a single lookup system.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.12
• /
• pp.195-202
• /
• 2020

The control system for the efficiency of resource utilization in sensor network environment based on object detection and environmental sensor requires active control function which based on sensor data acquisition and transmission functions and server's data analysis. Using active rule-based mobile agent middleware, this paper proposes a new distributed control framework that reduces the load of central sensor data server in sensor network environment by implementing remote data sensing and Zigbee-based communication with server and data analysis method of server. In addition, we implemented a power-saving system prototype using active rule-based distributed control methods that applied consumer's demand and environmental variables, and verified the validity of the proposed system through experiments and evaluations in the mobile agent middleware environment. The proposed system is a system framework that can efficiently autonomously control distributed objects in the sensor network environment, and it can be applied effectively to the development of demand response service based on optimal power control for the smart power system in the future.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.911-923
• /
• 2010

In wireless sensor networks (WSNs), cluster based data routing protocols have the advantages of reducing energy consumption and link maintenance cost. Unfortunately, most of clustering protocols have been designed for uniformly distributed sensor networks. However, some urgent situations do not allow thousands of sensor nodes being deployed uniformly. For example, air vehicles or balloons may take the responsibility for deploying sensor nodes hence leading a normally distributed topology. In order to improve energy efficiency in such sensor networks, in this paper, we propose a new cluster formation algorithm named DAEEC (Density Aware Energy-Efficient Clustering). In this algorithm, we define two kinds of clusters: Low Density (LD) clusters and High Density (HD) clusters. They are determined by the number of nodes participated in one cluster. During the data routing period, the HD clusters help the neighbor LD clusters to forward the sensed data to the central base station. Thus, DAEEC can distribute the energy dissipation evenly among all sensor nodes by considering the deployment density to improve network lifetime and average energy savings. Moreover, because the HD clusters are densely deployed they can work in a manner of our former algorithm EEVAR (Energy Efficient Variable Area Routing Protocol) to save energy. According to the performance analysis result, DAEEC outperforms the conventional data routing schemes in terms of energy consumption and network lifetime.

• Molecules and Cells
• /
• v.25 no.1
• /
• pp.131-137
• /
• 2008

Crk-associated substrate (CAS) is a focal adhesion protein that is involved in integrin signaling and cell migration. CAS deficiency reduces the migration and spreading of cells, both of which are processes mediated by Rac activation. We examined the functions of v-Crk, the oncogene product of the CT10 virus p47gag-crk, which affects cell migration and spreading, membrane ruffling, and Rac activation in CAS-deficient mouse embryonic fibroblasts (CAS-/- MEFs). CAS-/- MEFs showed less spreading than did CAS+/+ MEFs, but spreading was recovered in mutant cells that expressed v-Crk (CAS-/-v-Crk MEF). We observed that the reduction in spreading was linked to the formation of membrane ruffles, which were accompanied by Rac activation. In CAS-/- MEFs, Rac activity was significantly reduced, and Rac was not localized to the membrane. In contrast, Rac was active and localized to the membrane in CAS-/-v-Crk MEFs. Lamellipodia protrusion and ruffle retraction velocities were both reduced in CAS-/- MEFs, but not in CAS-/-v-Crk MEFs. We also found that microinjection of anti-gag antibodies inhibited the migration of CAS-/-v-Crk MEFs. These findings indicate that v-Crk controls cell migration and membrane dynamics by activating Rac in CAS-deficient MEFs.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.350-358
• /
• 2009

In a wireless sensor network (WSN) setting, this paper presents a distributed decision-making framework and illustrates its application in an online structural health monitoring (SHM) system. The objective is to recover a damage severity vector, which identifies, localizes, and quantifies damages in a structure, via distributive and collaborative decision-making among wireless sensors. Observing the fact that damages are generally scarce in a structure, this paper develops a nonlinear 0-norm minimization formulation to recover the sparse damage severity vector, then relaxes it to a linear and distributively tractable one. An optimal algorithm based on the alternating direction method of multipliers (ADMM) and a heuristic distributed linear programming (DLP) algorithm are proposed to estimate the damage severity vector distributively. By limiting sensors to exchange information among neighboring sensors, the distributed decision-making algorithms reduce communication costs, thus alleviate the channel interference and prolong the network lifetime. Simulation results in monitoring a steel frame structure prove the effectiveness of the proposed algorithms.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.3
• /
• pp.9-18
• /
• 2008

Mobile devices do not need the fixed network infrastructure in ad-hoc network, these devices communicate each other through the distributed control. Accordingly, mobile devices can discover several services using dynamic searching method and provide safely public ownership of these services. Ad-hoc network needs the distributed control and topology of dynamic network because the limited power for processing and network communication. This paper is devoted to provide the secure protocol that provides efficient services discovery using SDP(Service Discovery Protocol) and considers the security requirements. Proposed protocol provides the distributed control based on PKI without central server, the discovery of trusted service, secure telecommunication, the identification among mobile devices, and service access control by user authority.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.1
• /
• pp.9-21
• /
• 2010

In this paper, optimum design of distributed detection is considered for a parallel sensor network system consisting of a fusion center and multiple passive sonar nodes. Nonrandom fusion rules are employed as the fusion rules of the sensor network. For the nonrandom fusion rules, it is shown that a threshold rule of each sensor node has uniformly most powerful properties. Optimum threshold for each sensor is investigated that maximizes the probability of detection under a constraint on energy consumption due to false alarms. It is also investigated through numerical experiments how signal strength, false alarm probability, and the distance between three sensor nodes affect the system detection performances.

• Journal of Communications and Networks
• /
• v.16 no.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.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.2
• /
• pp.159-169
• /
• 2009

In this paper, optimum design of distributed detection is considered for a parallel sensor network system consisting of a fusion center and two passive sonar nodes. AND rule and OR rule are employed as the fusion rules of the sensor network. For the fusion rules, it is shown that a threshold rule of each sensor node has uniformly most powerful properties. Optimum threshold for each sensor is investigated that maximizes the probability of detection under the constraint of a specified probability of false alarm. It is also investigated through numerical experiments how signal strength, false alarm probability, and the distance between two sensor nodes affect the system detection performances.