• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.8
• /
• pp.528-537
• /
• 2014

Wireless Sensor Network(WSN) is a network which consists of sensor nodes(SNs) in data collection area. It is hard for the SNs to replace battery. Thus energy and transfer efficiency is important because the energy is limited. In this paper, we propose energy-efficient data collection algorithm for wireless sensor networks by using mobile agent in distance-based cluster structure. For avoid collisions and guarantee low latency, make distance-based topology and build cluster by the topology. For performance comparison of the proposed algorithm, compare with existing mobile agent algorithm. When network constructed by 300 nodes, proposed algorithm has performance increase than existing algorithm(GCF, LCF, TBID) in network lifetime 194, 124.6, 1.46 times each and data merging energy efficiency 87.5%, 85%, 45% each.

• 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.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.5
• /
• pp.1011-1016
• /
• 2018

Ubiquitous services for the convenience and safety of human beings along with the development of society are being realized through RFID technology and sensor network, and its application range of fields is also broaden. However, since the USN contains all the information of individuals and things, all of its private spaces can be attacked by external attacks; so, that the problem of security continues to arise. We designed a one-way chaotic feedback synchronization method as a secure communication method to fit the USN composed of one sync node and n number of sensor nodes. We designed the method by which the sensor node is synchronized in one direction of the sync node. This method solves the problem that all sensor nodes need to be resynchronized when the sync node is changed, which is shown in bidirectional synchronization. This is a security method that can be effectively applied to 1:n communication such as USN.

• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.845-858
• /
• 2020

This paper proposes a modified end-to-end secure low energy adaptive clustering hierarchy (ME-LEACH) algorithm for enhancing the lifetime of a wireless sensor network (WSN). Energy limitations are a major constraint in WSNs, hence every activity in a WSN must efficiently utilize energy. Several protocols have been introduced to modulate the way a WSN sends and receives information. The end-to-end secure low energy adaptive clustering hierarchy (E-LEACH) protocol is a hierarchical routing protocol algorithm proposed to solve high-energy dissipation problems. Other methods that explore the presence of the most powerful nodes on each cluster as cluster heads (CHs) are the sparsity-aware energy efficient clustering (SEEC) protocol and an energy efficient clustering-based routing protocol that uses an enhanced cluster formation technique accompanied by the fuzzy logic (EERRCUF) method. However, each CH in the E-LEACH method sends data directly to the base station causing high energy consumption. SEEC uses a lot of energy to identify the most powerful sensor nodes, while EERRCUF spends high amounts of energy to determine the super cluster head (SCH). In the proposed method, a CH will search for the nearest CH and use it as the next hop. The formation of CH chains serves as a path to the base station. Experiments were conducted to determine the performance of the ME-LEACH algorithm. The results show that ME-LEACH has a more stable and higher throughput than SEEC and EERRCUF and has a 35.2% better network lifetime than the E-LEACH algorithm.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.12
• /
• pp.409-414
• /
• 2015

The energy conservation is the most important subject for long run operation of the sensor nodes with limited power resources. Clustering is one of most energy efficient technique to grouped the sensor nodes into distinct cluster. But, in a cluster based WSN, CHs and gateways bear an extra work load to send the processed data to the sink. The inappropriate cluster formation may cause gateways overloaded and may increase latency in communication. In this paper, we propose a novel load balanced clustering model for improving energy efficiency and giving a guarantee of long network lifetime. We show the result of performance measurement experiments that designs using a branch and bound algorithm and a multi-start local search algorithm to compare with the existing load balanced clustering model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.5
• /
• pp.1037-1045
• /
• 2007

An efficient management system for parking lots and traffic monitoring in a metropolitan city is a very important issue, which is tightly closed to qualify of life. While a residential permit parking program has been contributing to resolve the lack of parking places, there has been no autonomous authentication system due to no apparent entrance gate and smallness of each parking zone. In this paper, we propose and implement an authentication system for residential permit parking lot using wireless sensor networks, which is cost-effective and even no need for additional managing person. Through the experimental evaluation, we analyzed relationship between the life time of sensor nodes and the various values of sleep periods to minimize power consumption of the nodes, and also showed that the difference of luminance sensed by each sensor node is at least 45 or bigger between when the parking place is occupied or not, resultingly it can be used to decide whether a parking place is occupied or not by simply detecting the change of luminance sensed.

• Smart Structures and Systems
• /
• v.6 no.5_6
• /
• pp.561-578
• /
• 2010

This study proposes a multi-level damage localization strategy to achieve an effective damage detection system for civil infrastructure systems based on wireless sensors. The proposed system is designed for use of distributed computation in a wireless sensor network (WSN). Modal identification is achieved using the frequency-domain decomposition (FDD) method and the peak-picking technique. The ASH (angle-between-string-and-horizon) and AS (axial strain) flexibility-based methods are employed for identifying and localizing damage. Fundamentally, the multi-level damage localization strategy does not activate all of the sensor nodes in the network at once. Instead, relatively few sensors are used to perform coarse-grained damage localization; if damage is detected, only those sensors in the potentially damaged regions are incrementally added to the network to perform finer-grained damage localization. In this way, many nodes are able to remain asleep for part or all of the multi-level interrogations, and thus the total energy cost is reduced considerably. In addition, a novel distributed computing strategy is also proposed to reduce the energy consumed in a sensor node, which distributes modal identification and damage detection tasks across a WSN and only allows small amount of useful intermediate results to be transmitted wirelessly. Computations are first performed on each leaf node independently, and the aggregated information is transmitted to one cluster head in each cluster. A second stage of computations are performed on each cluster head, and the identified operational deflection shapes and natural frequencies are transmitted to the base station of the WSN. The damage indicators are extracted at the base station. The proposed strategy yields a WSN-based SHM system which can effectively and automatically identify and localize damage, and is efficient in energy usage. The proposed strategy is validated using two illustrative numerical simulations and experimental validation is performed using a cantilevered beam.

• Journal of the Korea Society for Simulation
• /
• v.25 no.4
• /
• pp.43-52
• /
• 2016

Wireless sensor network (WSN) technology has been implemented using commercial off-the-shelf microcontrollers (MCUs), In this paper, we propose a simulation environment to realize the physical evaluation of FPGA-based node by considering vertically cross-layered WSN in terms of physical node device and network interconnection perspective. The proposed simulation framework emulates the physical FPGA-based sensor nodes to interoperate with the NS3 through the runtime infrastructure (RTI). For the emulation and interoperation of FPGA-based nodes, we extend a vendor-providing FPGA design tool from the host computer and a script to execute the interoperation procedures. The standalone NS-3 is also revised to perform interoperation through the RTI. To resolve the different time-advance mechanisms between the FPGA emulation and event-driven NS3 simulation, the pre-simulation technique is applied to the proposed environment. The proposed environment is applied to IEEE 802.15.4-based low-rate, wireless personal area network communication.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.195-202
• /
• 2008

In this paper, To improve the effectiveness of security enforcement, the first contribution in this work is that we present a clustered heterogeneous WSN(Wareless Sensor Network) architecture, composed of not only resource constrained sensor nodes, but also a number of more powerful high-end devices acting as cluster heads. Compared to sensor nodes, a high-end cluster head has higher computation capability, larger storage, longer power supply, and longer radio transmission range, and it thus does not suffer from the resource scarceness problem as much as a sensor node does. A distinct feature of our heterogeneous architecture is that cluster heads are equipped with TC(trusted computing) technology, and in particular a TCG(Trusted Computing Group) compliant TPM (Trusted Platform Module) is embedded into each cluster head. According the TCG specifications, TPM is a tamper-resistant, self-contained secure coprocessor, capable of performing cryptographic functions. A TPM attached to a host establishes a trusted computing platform that provides sealed storage, and measures and reports the integrity state of the platform.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3412-3432
• /
• 2019

Recent advances in radio frequency (RF) power transfer provide a promising technology to power sensor nodes. Adoption of mobile chargers to replenish the nodes' energy has recently attracted a lot of attention and the mobility assisted energy replenishment provides predictable and sustained power service. In this paper, we study the joint optimization of mobile charging and data gathering in sensor networks. A wireless multi-functional vehicle (WMV) is employed and periodically moves along specified trajectories, charge the sensors and gather the sensed data via one-hop communication. The objective of this paper is to maximize the uplink throughput by optimally allocating the time for the downlink wireless energy transfer by the WMV and the uplink transmissions of different sensors. We consider two scenarios where the WMV moves in a straight line and around a circle. By time discretization, the optimization problem is formulated as a 0-1 programming problem. We obtain the upper and lower bounds of the problem by converting the original 0-1 programming problem into a linear programming problem and then obtain the optimal solution by using branch and bound algorithm. We further prove that the network throughput is independent of the WMV's velocity under certain conditions. Performance of our proposed algorithm is evaluated through extensive simulations. The results validate the correctness of our proposed theorems and demonstrate that our algorithm outperforms two baseline algorithms in achieved throughput under different settings.