• Journal of KIISE
• /
• v.43 no.1
• /
• pp.119-125
• /
• 2016

Cognitive radio technology can allow secondary users (SUs) to access unused licensed spectrums in an opportunistic manner without interfering with primary users (PUs). Spectrum sensing is a key technology for cognitive radio (CR). However, few studies have examined energy-efficient spectrum sensing in cognitive radio sensor networks (CRSNs). In this paper, we propose an energy-efficient cooperative spectrum sensing nodes selection scheme for cluster-based cognitive radio sensor networks. In our proposed scheme, false alarm probability and energy consumption are considered to minimize the number of spectrum sensing nodes in a cluster. Simulation results show that by applying the proposed scheme, spectrum sensing efficiency is improved with a decreased number of spectrum sensing nodes. Furthermore, network energy efficiency is guaranteed and network lifetime is substantially prolonged.

• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.925-928
• /
• 2010

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor network. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with highest residual energy send data to base station. Furthermore, we can save the energy of head nodes using modes selection method. The simulation results show that CPMS achieves longer lifetime and more data messages transmissions than current important clustering protocol in wireless sensor networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2188-2208
• /
• 2023

Quality of Service (QoS) is a critical feature of Wireless Sensor Networks (WSNs) with routing algorithms. Data packets are moved between cluster heads with QoS using a number of energy-efficient routing techniques. However, sustaining high scalability while increasing the life of a WSN's networks scenario remains a challenging task. Thus, this research aims to develop an energy-balancing component that ensures equal energy consumption for all network sensors while offering flexible routing without congestion, even at peak hours. This research work proposes a Gravitational Blackhole Search Optimised splay tree routing framework. Based on the splay tree topology, the routing procedure is carried out by the suggested method using three distinct steps. Initially, the proposed GBSO decides the optimal route at initiation phases by choosing the root node with optimum energy in the splay tree. In the selection stage, the steps for energy update and trust update are completed by evaluating a novel reliance function utilising the Parent Reliance (PR) and Grand Parent Reliance (GPR). Finally, in the routing phase, using the fitness measure and the minimal distance, the GBSO algorithm determines the best route for data broadcast. The model results demonstrated the efficacy of the suggested technique with 99.52% packet delivery ratio, a minimum delay of 0.19 s, and a network lifetime of 1750 rounds with 200 nodes. Also, the comparative analysis ensured that the suggested algorithm surpasses the effectiveness of the existing algorithm in all aspects and guaranteed end-to-end delivery of packets.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.413-424
• /
• 2009

Wireless sensor network is based on an event driven system. Sensor nodes collect the events in surrounding environment and the sensing data are relayed into a sink node. In particular, when events are detected, the data sensing periods are likely to be shorter to get the more correct information. However, this operation causes the traffic congestion on the sensor nodes located in a routing path. Since the traffic congestion generates the data queue overflows in sensor nodes, the important information about events could be missed. In addition, since the battery energy of sensor nodes exhausts quickly for treating the traffic congestion, the entire lifetime of wireless sensor networks would be abbreviated. In this paper, a new congestion control method is proposed on the basis of genetic algorithm. To apply genetic algorithm, the data traffic rate of each sensor node is utilized as a chromosome structure. The fitness function of genetic algorithm is designed from both the average and the standard deviation of the traffic rates of sensor nodes. Based on dominant gene sets, the proposed method selects the optimal data forwarding sensor nodes for relieving the traffic congestion. In experiments, when compared with other methods to handle the traffic congestion, the proposed method shows the efficient data transmissions due to much less queue overflows and supports the fair data transmission between all sensor nodes as possible. This result not only enhances the reliability of data transmission but also distributes the energy consumptions across the network. It contributes directly to the extension of total lifetime of wireless sensor networks.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.75-84
• /
• 2014

In this paper, we constructed a sensor network environment where various sensors are used. Then, we evaluated the performance when this environment adopted existing clustering algorithms that are designed for only single type sensors network. In our experiments, we considered two different types of the networks. In the first, all nodes are equipped with identical sensors. In the second, all nodes are equipped with three different types of sensors. We measured performance variations of several clustering schemes in accordance with sensor data accuracy, sensor node resource depletion timing, amount of available energy, node isolation ratio, and network lifetime. According to our performance analysis, we proved that existing clustering algorithms are partially inefficient to maintain the various-sensor network. Consequently we suggest that a new algorithm is required to take aim at the various sensor network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4844-4864
• /
• 2017

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.10 no.4
• /
• pp.265-275
• /
• 2010

In this work, reliable methodology for device design is presented. Based on this method, the underlap length has been optimized for minimizing the gateinduced drain leakage (GIDL) in a 22-nm node 4-terminal (4-T) silicon-on-insulator (SOI) fin-shaped field effect transistor (FinFET) by TCAD simulation. In order to examine the effects of underlap length on GIDL more realistically, doping profile of the source and drain (S/D) junctions, carrier lifetimes, and the parameters for a band-to-band tunneling (BTBT) model have been experimentally extracted from the devices of 90-nm channel length as well as pnjunction test element groups (TEGs). It was confirmed that the underlap length should be near 15 nm to suppress GIDL effectively for reliable low standby power (LSTP) operation.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.535-542
• /
• 2009

Wireless Sensor Network (WSN) is a wireless network consisting of spatially distributed autonomous devices, using sensors to cooperatively monitor physical or environmental conditions. WSNs face the critical challenge of sustaining long-term operation on limited battery energy. Coverage maintenance has been proposed as a promising approach to prolong network lifetime. Mobile sensors equipped with communication devices can be leveraged to overcome the coverage problem. In this paper, we propose a stepwise movement scheme using perimeter coverage property for the coverage maintenance problem. In our scheme, each sensor monitors neighboring dead nodes, determines vulnerable node (i.e. dead node which makes uncovered area), computes the center of uncovered area HC, and makes a coordinated stepwise movement to compensate the uncovered area. In our experimental results, our scheme shows at least 50 % decrease in the total moving distance which determines the energy efficiency of mobile sensor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1547-1568
• /
• 2013

Wireless body area network (WBAN) is an emerging short-range wireless communication network with sensor nodes located on, in or around the human body for healthcare, entertainment and ubiquitous computing. In WBANs, energy is severely constrained which is the prime consideration in the medium access control (MAC) protocol design. In this paper, we propose a novel MAC protocol named Energy-efficient Relay MAC with dynamic Power Control (ERPC-MAC) to save energy consumption. Without relying on the additional devices, ERPC-MAC employs relaying nodes to provide relay service for nodes which consume energy fast. Accordingly the superframe adjustment is performed and then the network topology can be smoothly switched from single-hop to multi-hop. Moreover, for further energy saving and reliability improvement, the dynamic power control is introduced to adjust the power level whenever a node transmits its packets to the coordinator or the relaying node. To the best of the authors' knowledge, this is the first effort to integrate relay, topology adjustment and power control to improve the network performance in a WBAN. Comprehensive simulations are conducted to evaluate the performance. The results show that the ERPC-MAC is more superior to the existing standard and significantly prolongs the network lifetime.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.6
• /
• pp.139-144
• /
• 2019

For recent decades, Non-volatile Memory (NVM) technologies have been drawing a high attention both in industry and academia due to its high density and short latency comparable to that of DRAM. However, NVM devices has write endurance problem and thus the current data structures that have been built around DRAM-specific features including unlimited program cycles is inadequate for NVM, reducing the device lifetime significantly. In this paper, we revisit a red-black tree extensively adopted for data indexing across a wide range of applications, and make it to better fit for NVM. Specifically, we observe that the conventional red-black tree wears out the specific location of memory because of its rebalancing operation to ensure fast access time over a whole dataset. However, this rebalancing operation frequently updates the long-lived nodes, which leads to the skewed wear out across the NVM cells. To resolve this problem, we present a new swapping wear-leveling red-black tree that periodically moves data in the worn-out node into the young node. The performance study with real-world traces demonstrates the proposed red-black tree reduces the standard deviation of the write count across nodes by up to 12.5%.