• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.385-390
• /
• 2008

The Study of environment monitoring through huge network of wireless sensor node is worked with activity. The sensor nodes must be very small, light and low cost. The localization which may determine where a given node is physically located in a network is one of the quite important problems for wireless sensor network. But simple localization method is required as excluding the usage of GPS(Global Positioning System) by the limit condition such as the node size, costs, and so on. In this paper, very simple method using connectivity for the outdoor RF communication environment is proposed. The proposed method is demonstrated through simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.430-435
• /
• 2007

In this paper, we propose an intelligent deployment of sensor network for reliable communication. The proposed method determines optimal transmission range based on the wireless channel characteristics, and searches the optimal number of sensor nodes, and optimal locations with SOFM. We calculate PRR against a distance uses the log-normal path loss model, and decide the communication range of sensor node from PRR. In order to verify the effectiveness of the proposed method, we performed simulations on the searching for intelligent deployment and checking for link condition of sensor network.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.87-94
• /
• 2019

A wireless sensor network is emerging technology and intelligent wireless communication paradigm that is dynamically aware of its surrounding environment. It is also able to respond to it in order to achieve reliable and efficient communication. The dynamical cognition capability and environmental adaptability rely on organizing dynamical networks effectively. However, optimally clustering the cognitive wireless sensor networks is an NP-complete problem. The objective of this paper is to develop an optimal sensor network design for maximizing the performance. This proposed Ranking Artificial Bee Colony (RABC) is developed based on Artificial Bee Colony (ABC) with ranking strategy. The ranking strategy can make the much better solutions by combining the best solutions so far and add these solutions in the solution population when applying ABC. RABC is designed to adapt to topological changes to any network graph in a time. We can minimize the total energy dissipation of sensors to prolong the lifetime of a network to balance the energy consumption of all nodes with robust optimal solution. Simulation results show that the performance of our proposed RABC is better than those of previous methods (LEACH, LEACH-C, and etc.) in wireless sensor networks. Our proposed method is the best for the 100 node-network example when the Sink node is centrally located.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.217-220
• /
• 2014

Wireless sensor network（WSN） consists by a large number of low-cost micro-sensor nodes, collaborate to achieve the perception of information collection, processing and transmission tasks in deployment area. It can be widely used in national defense, intelligent transportation, medical care, environmental monitoring, precision agriculture, and industrial automation and many other areas. One of the key technologies of sensor networks is the data maintenance management technology. In this paper we analyze the data management technology of wireless sensor network and pointed their problems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.260-263
• /
• 2019

Recently, the need of researches and developments about WSN(Wireless Sensor Network) technologies, which can be applied to services to regions where the access is difficult or services that require continuous monitoring, has gradually increased due to its expansion and efficiency of the application areas. In this paper, we analyze existing researches which focused on reducing packet loss rate and increasing lifetime of sensor nodes. Then, we conduct studies about performance improvement factors where some schemes - clustering and location-based approaches - are applied and compare our study results with existing researches. Based on our studies, we are planning to conduct researches about a new scheme that could contribute to improve WSN's performance in terms of packet loss rate and network lifetime.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.67-75
• /
• 2010

Network reprogramming is a technology that allows several sensor nodes deployed in sensor field to be repaired remotely. Unlike general communication in sensor network where small amount of data is transferred, network reprogramming requires reliable transfer of large amount of data. The existing network reprogramming techniques suffers high cost and large energy consumption to recover data loss in node communication. In this paper, a cluster based network reporgramming scheme is proposed for sensor network. It divides sensor field into several clusters and chooses a cluster header in charge of data relay to minimize duplicated transmission and unnecessary competition. It increases reliability by effective error recovery through status table.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.295-302
• /
• 2013

In the network coding, throughput can be increased by allowing the transformation of the received data at the intermediate nodes. However, the adversary can obtain more information at the intermediate nodes and make troubles for decoding of transmitted data at the sink nodes by modifying transmitted data at the compromised nodes. In order to resist the adversary activities, various information theoretic or cryptographic secure network coding schemes are proposed. Recently, a secure network coding based on the cryptographic hash function can be used at the random network coding. However, because of the computational resource requirement for cryptographic hash functions, networks with limited computational resources such as sensor nodes have difficulties to use the cryptographic solution. In this paper, we propose a new secure network coding scheme which uses linear transformations and table lookup and safely transmits n-1 packets at the random network coding under the assumption that the adversary can eavesdrop at most n-1 nodes. It is shown that the proposed scheme is an all-or-nothing transform (AONT) and weakly secure network coding in the information theory.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.15 no.2
• /
• pp.46-56
• /
• 2012

Recently, when software architecture is designed, the efficiency of reusability is emphasized. The reusability of the design can raise the quality of GIS software, and reduce the cost of maintenance. Because the object oriented GoF design pattern provides the class hierarchy that can represent repetitively, the importance is emphasized more. This method that designs the GIS software can be applied from various application systems. A multiple distributed sensor network system is composed of the complex structure that each node of the sensor network nodes has different functions and sensor nodes and server are designed by the combination of many classes. Furthermore, this sensor network system may be changed into more complex systems according to a particular purpose of software designer. This paper will design the CATL model by applying Facade pattern that can enhance the efficiency of reuse according to attributes and behaviors in classes in order to implement the complicated structure of the multiple distributed sensor network system based on TinyOS. Therefore, our object oriented GIS design pattern model will be expected to utilize efficiently for design, update, or maintenance, etc. of new systems by packing up attributes and behaviors of classes at complex sensor network systems.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.473-480
• /
• 2005

We can obtain useful information by deploying large scale sensor networks in various situations. Security is also a major concern in sensor networks, and we need to establish pairwise keys between sensor nodes for secure communication. In this paper, we propose new pairwise key establishment mechanism based on clustering and polynomial sharing. In the mechanism, we divide the network field into clusters, and based on the polynomial-based key distribution mechanism we create bivariate Polynomials and assign unique polynomial to each cluster. Each pair of sensor nodes located in the same cluster can compute their own pairwise keys through assigned polynomial shares from the same polynomial. Also, in our proposed scheme, sensors, which are in each other's transmission range and located in different clusters, can establish path key through their clusterheads. However, path key establishment can increase the network overhead. The number of the path keys and tine for path key establishment of our scheme depend on the number of sensors, cluster size, sensor density and sensor transmission range. The simulation result indicates that these schemes can achieve better performance if suitable conditions are met.

• The Journal of the Korea Contents Association
• /
• v.12 no.3
• /
• pp.44-54
• /
• 2012

In wireless sensor networks, a moving object tracking scheme is one of core technologies for real applications such as environment monitering and enemy moving tracking in military areas. However, no works have been carried out on processing the failure of object tracking in sparse sensor networks with holes. Therefore, the energy consumption in the existing schemes significantly increases due to plenty of failures of moving object tracking. To overcome this problem, we propose a novel moving object tracking scheme based on polynomial regression prediction in sparse sensor networks. The proposed scheme activates the minimum sensor nodes by predicting the trajectory of an object based on polynomial regression analysis. Moreover, in the case of the failure of moving object tracking, it just activates only the boundary nodes of a hole for failure recovery. By doing so, the proposed scheme reduces the energy consumption and ensures the high accuracy for object tracking in the sensor network with holes. To show the superiority of our proposed scheme, we compare it with the existing scheme. Our experimental results show that our proposed scheme reduces about 47% energy consumption for object tracking over the existing scheme and achieves about 91% accuracy of object tracking even in sensor networks with holes.