• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.27-36
• /
• 2011

The sensor nodes of sensor network system are capable of wireless communication with sink nodes. They also acquire and transmit sensor data in broad region where people cannot access easily. However, the transmission of redundant data from sensor nodes reduces the lifetime of the entire system and substantial amount of resulted data needs to be resorted before implementing them to the specific applications. In this paper, the mobile agent middleware to eliminate the redundant sensor data is designed and implemented. In the proposed system, the mobile agent visits the destination sensor nodes according to the migration list offered by the meta table in the name space of the naming agent, eliminates the redundant sensor data corresponding to user condition, and acquires and transmits sensor data according to the purpose and needs. Thus, the excess transmission of the sensor data is avoided and the lifetime of the entire system can be extended. Moreover, the experiments using the mobile agent middleware with the conditions and limitations that are possible in real situation ore done to verify the successful elimination of the redundant sensor data and the efficiency of the data acquisition. Also, we show the potential applicability of the mobile agent middleware in various active sensor networks through the active rule based mobile agent middleware or the interaction with the active rule system.

• Journal of Powder Materials
• /
• v.27 no.2
• /
• pp.111-118
• /
• 2020

The convergence of artificial intelligence with smart factories or smart mechanical systems has been actively studied to maximize the efficiency and safety. Despite the high improvement of artificial neural networks, their application in the manufacturing industry has been difficult due to limitations in obtaining meaningful data from factories or mechanical systems. Accordingly, there have been active studies on manufacturing components with sensor integration allowing them to generate important data from themselves. Additive manufacturing enables the fabrication of a net shaped product with various materials including plastic, metal, or ceramic parts. With the principle of layer-by-layer adhesion of material, there has been active research to utilize this multi-step manufacturing process, such as changing the material at a certain step of adhesion or adding sensor components in the middle of the additive manufacturing process. Particularly for smart parts manufacturing, researchers have attempted to embed sensors or integrated circuit boards within a three-dimensional component during the additive manufacturing process. While most of the sensor embedding additive manufacturing was based on polymer material, there have also been studies on sensor integration within metal or ceramic materials. This study reviews the additive manufacturing technology for sensor integration into plastic, ceramic, and metal materials.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.229-237
• /
• 2005

One of the important issues of in this research is effective usage of energy to increase life time of nodes which form a network. Existing LEEM protocol causes unnecessary active time due to small packets with shorter transfer time than active interval period of node and packets with transfer time of more than twice of active interval period of node. In this paper, we propose Energy-Efficient MAC by Reservation (EEMR) protocol which can increase energy effectiveness in wireless sensor network environment by reducing unnecessary active time using a method that reserves next-hop depend upon the size of packet. We evaluated effectiveness of our proposed method through experiments. The result showed that using EEMR protocol had better energy effectiveness than existing LEEM protocol by 15%.

• The Journal of the Korea Contents Association
• /
• v.11 no.4
• /
• pp.101-111
• /
• 2011

Due to recent development in wireless communication technologies and mobile information devices, the services on ubiquitous computing technology without time and place restriction have been spotlighted. Moreover, the interest of the Wireless Sensor Networks (WSNs) and context-awareness technologies have largely been escalating and their technologies utilization is active in the various applications such as healthcare, farm management and so on. However, the direct adaption of the existing context-awareness technique to the WSN technology has several drawbacks as follows. First, such systems waste precious energy of sensor nodes, due to unnecessary data transmissions. Secondly, since the existing work was designed to support only specific applications, it is required to implement a new context-awareness application for a specific purpose. Therefore, we, in this paper, propose a new real-time monitoring system based on context-awareness in WSNs. Our system not only enhances energy efficiency by reducing data transmissions by doing context-awareness on a sensor node, but also is scalable in terms of supporting new context-awareness functionalities through modularization.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.99-103
• /
• 2006

In this paper, we focus on the problem of designing an energy efficient MAC protocol for wireless sensor networks and analyze S(Sensor)-MAC and T(Time-out)-MAC. S-MAC is based on the concept of the 'listen/sleep mode cycle'. This applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data moves through the network. However unlike the S-MAC, where the duration of the cycle is fixed, T-MAC introduces an adaptive duty cycle in a novel way: by dynamical ending the active part of it. This reduces the amount of energy wasted on idle listening, in which nodes wait for potentially incoming messages while still maintaining a reasonable throughput. In this paper we discuss the design of these two Protocols. We analyze them from the aspect of latency, throughput, and power savings when using the OMNeT++ simulator in various environments.

• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.12-23
• /
• 2009

Sensor networks deployed in battlefields to support military operations or deployed in natural habitats to monitor the rare wildlifes must take account of protection of the location of valuable assets(i.e., soldiers or wildlifes) from an adversary or malicious tracing as well as the security of messages in transit. In this paper we propose a routing protocol GSLP(GPSR-based Source-Location Privacy) that is capable of enhancing the location privacy of an active source node(i.e., message-originating node) in the presence of multiple dormant sources(i.e., nodes lying nearby an asset whose location needs to be secured). Extended is a simple, yet scalable, routing scheme GPSR(greedy perimeter stateless routing) to select randomly a next-hop node with a certain probability for randomizing paths and to perform perimeter routing for detouring dormant sources so that the privacy strength of the active source, defined as safety period, keeps enhanced. The simulation results obtained by increasing the number of dormant sources up to 1.0% of the total number of nodes show that GSLP yields increased and nearly invariant safety periods, while those of PR-SP(Phantom Routing, Single Path), a notable existing protocol for source-location privacy, rapidly drop off as the number of dormant sources increases. It turns out that delivery latencies of GSLP are roughly less than two-fold of the shortest path length between the active source and the destination.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1436-1458
• /
• 2017

Quorum-based algorithms are widely used for solving several problems in mobile ad hoc networks (MANET) and wireless sensor networks (WSN). Several quorum-based protocols are proposed for multi-hop ad hoc networks that each one has its pros and cons. Quorum-based protocol (QEC or QPS) is the first study in the asynchronous sleep scheduling protocols. At the time, most of the proposed protocols were non-adaptive ones. But nowadays, adaptive quorum-based protocols have gained increasing attention, because we need protocols which can change their quorum size adaptively with network conditions. In this paper, we first introduce the most popular quorum systems and explain quorum system properties and its performance criteria. Then, we present a comparative and comprehensive survey of the non-adaptive and adaptive quorum-based protocols which are subsequently discussed in depth. We also present the comparison of different quorum systems in terms of the expected quorum overlap size (EQOS) and active ratio. Finally, we summarize the pros and cons of current adaptive and non-adaptive quorum-based protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.453-461
• /
• 2010

A critical issue in wireless sensor networks is an energy-efficiency since the sensor batteries have limited energy power and, in most cases, are not rechargeable. The most practical manner relate to this issue is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. Especially, CTC (Connected Target Coverage) problem has been considered as a representative energy-efficiency problem considering connectivity as well as target coverage. In this paper, we propose a new energy consumption model considering multiple-targets and create a new problem, CMTC (Connected Multiple-Target Coverage) problem, of which objective is to maximize the network lifetime based on the energy consumption model. Also, we present SPT (Shortest Path based on Targets)-Greedy algorithm to solve the problem. Our simulation results show that SPT-Greedy algorithm performs much better than previous algorithm in terms of the network lifetime.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.316-320
• /
• 2008

Data dissemination schemes for wireless sensor networks, where sinks and event targets might be mobile, has been one of the active research fields. For doing that, stationary nodes gathered data on behalf of mobile sinks and the relayed data in previous studies. their schemes, however, lead to frequent query flooding and report congestion problems over sink moving. We propose a data dissemination protocol to solve both the query flooding and the report congestion problem. Our scheme improves the two shortcomings through sink location management. Finally, we prove effectiveness of our protocol through computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.304-310
• /
• 2006

This paper evaluates the performance of three types of data delivery mechanisms in clustered sensor networks, as a basic research to develop an energy efficient topology management scheme. In the first mechanism, one node per cluster(clusterhead) turns on its radio(or wakes up) to transmit and receive RTS/CTS/DATA/ACK messages, but in the second one, k nodes per cluster wake up and participate in the message exchange. In the last mechanism, clusterheads turn on the radio to exchange RTS/CTS messages, and if a clusterhead receives RTS containing its cluster m as a destination, it makes k nodes in the cluster hun on the radio to receive DATA and transmit ACK. Through simulation, we show the energy consumption of the three types of data delivery mechanisms as functions of the number of active nodes per cluster, offered load, and packet loss probability.