• ETRI Journal
• /
• v.34 no.3
• /
• pp.330-340
• /
• 2012

In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

• Journal of the Semiconductor & Display Technology
• /
• v.7 no.2
• /
• pp.19-22
• /
• 2008

In this paper, the cell balance of secondary battery using a large number of MOSFETs is discussed. We can balance the cells by controlling battery charging current with help of MOSFETs. If the cells are not balanced, we can not use the whole energy of the battery while charging and discharging, therefore, the energy efficiency is decreased. To increase the energy efficiency, we propose the MOSFET control algorithm which will perform cell balancing by controlling the charging current.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.11
• /
• pp.1241-1248
• /
• 2014

An efficient battery usage of sensor nodes is main goal in a sensor network, which is the substructure of Internet of Things. Maximizing the battery usage of sensor nodes makes the lifetime of sensor network increase as well as the reliability of the network improved. The previous solutions to solve these problems are mainly focused on the cluster head selection based on the remaining energy. In this paper, we consider both the head selection and the replacement interval which is determined by a threshold that is based on the remaining energy, density of alive nodes, and location. Our simulation results show that the proposed scheme has outstanding contribution in terms of maximizing the life time of the network and balancing energy consumption of all nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.952-973
• /
• 2021

In recent years, mobile devices have become an essential part of daily life. More and more applications are being supported by mobile devices thanks to edge computing, which represents an emergent architecture that provides computing, storage, and networking capabilities for mobile devices. In edge computing, heavy tasks are offloaded to edge nodes to alleviate the computations on the mobile side. However, offloading computational tasks may incur extra energy consumption and delays due to network congestion and server queues. Therefore, it is necessary to optimize offloading decisions to minimize time, energy, and payment costs. In this article, different offloading models are examined to identify the offloading parameters that need to be optimized. The paper investigates and compares several optimization techniques used to optimize offloading decisions, specifically Swarm Intelligence (SI) models, since they are best suited to the distributed aspect of edge computing. Furthermore, based on the literature review, this study concludes that a Cuckoo Search Algorithm (CSA) in an edge-based architecture is a good solution for balancing energy consumption, time, and cost.

• Steel and Composite Structures
• /
• v.44 no.4
• /
• pp.473-488
• /
• 2022

A high-speed railway (HSR) bridge may undergo long-term deformation due to the degradation of material stiffness, or foundation settlement during its service cycle. In this study, an analytical model is set up to evaluate the influence of this long-term vertical bridge deformation on the track geometry. By analyzing the structural characteristics of the HSR track-bridge system, the energy variational principle is applied to build the energy functionals for major components of the track-bridge system. By further taking into account the interlayer's force balancing requirements, the mapping relationship between the deformation of the track and the one of the bridge is established. In order to consider the different behaviors of the interlayers in compression and tension, an iterative method is introduced to update the mapping relationship. As for the validation of the proposed mapping model, a finite element model is created to compare the numerical results with the analytical results, which show a good agreement. Thereafter, the effects of the interlayer's different properties of tension and compression on the mapping deformations are further evaluated and discussed.

• Nuclear Engineering and Technology
• /
• v.56 no.8
• /
• pp.3315-3329
• /
• 2024

Small Modular Reactors (SMRs) adopt the Helically Coiled Once-Through Steam Generators (OTSG) extensively for its compactness and higher heat transfer efficiency. As a heat exchanger between the primary side (reactor coolant system) and the secondary side (feedwater and steam system) of nuclear steam supply system, the inlet/outlet conditions both of shell side and tube side of OTSGs have significant impacts on overall system response. Considering the flexible operation of SMRs and heat application by extracting steam, a simulation tool for accurate prediction of the OTSG dynamic behaviors would be required for optimizing design and control. In this study, the OTSG dynamic simulation model has been developed. Mathematical governing equation has been derived by using moving boundary approach and a simulation module has been developed by using Modelica Language. The developed module has been compared with publicly available experimental results and benchmarked with MARS-KS calculation results. Also, it has been incorporated into the integrated SMR model (i.e., reactor core, primary side, secondary side) and dynamic behaviors with reactivity feedback and heat balancing have been investigated. In both of steady-state and transient conditions, it shows the promising accuracy.

• Journal of KIISE:Information Networking
• /
• v.33 no.5
• /
• pp.395-406
• /
• 2006

In ad hoc networks, the limited battery capacity of nodes affects a lifetime of network Recently, a large variety of power-aware routing protocols have been proposed to improve an energy efficiency of ad hoc networks. Existing power-aware routing protocols basically consider the residual battery capacity and transmission power of nodes in route discovery process. This paper proposes a new power-aware routing protocol, TDPR(Traffic load & lifetime Deviation based Power-aware Routing protocol), that does not only consider residual battery capacity and transmission power, but also the traffic load of nodes and deviation among the lifetimes of nodes. It helps to extend the entire lifetime of network and to achieve load balancing. Simulations using ns-2[14] show the performance of the proposed routing protocol in terms of the load balancing of the entire network, the consumed energy capacity of nodes, and an path's reliability TDPR has maximum 72% dead nodes less than AODV[4], and maximum 58% dead nodes less than PSR[9]. And TDPR consumes residual energy capacity maximum 29% less than AODV, maximum 15% less than PSR. Error messages are sent maximum 38% less than PSR, and maximum 41% less than AODV.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.763-770
• /
• 2014

In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4B
• /
• pp.207-214
• /
• 2008

Under future internet environment, wireless sensor networks will be used in a wide range of applications. A major problem for designing sensor protocol is developing the most energy efficient technique to monitor an area of interest for a long time since sensors have some constraints such as small and a limited energy level. In addition, data latency is often a critical issue since sensory data is transmitted via multi hop fashion and need to be delivered timely for taking an appropriate action. Our motivation for designing a data forwarding protocol is to minimize energy consumption while keeping data latency bound in wireless sensor networks. In this paper, we propose a data forwarding protocol that consists of wakeup scheduling and MAC protocols, the latter of which is designed to achieve load balancing. Simulation results show that the proposed framework provides more energy-efficient delivery than other protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.3 s.357
• /
• pp.18-25
• /
• 2007

In sensor networks, sensor nodes have limited computational capacity, power and memory. Thus energy efficiency is one of the most important requirements. How to extend the lifetime of wireless sensor networks has been widely discussed in recent years. However, one of the most effective approaches to cope with power conservation, network scalability, and load balancing is clustering technique. The function of a cluster head is to collect and route messages of all the nodes within its cluster. Cluster heads must be changed periodically for low energy consumption and load distribution. In this paper, we propose an energy-aware cluster head selection algorithm and Distance Estimation-based distributed Clustering Algorithm (DECA) in wireless sensor networks, which exchanges cluster heads for less energy consumption by distance estimation. Our simulation result shows that DECA can improve the system lifetime of sensor networks up to three times compared to the conventional scheme.