• International journal of advanced smart convergence
• /
• v.9 no.2
• /
• pp.185-194
• /
• 2020

Designing of a hierarchical clustering algorithm is one of the numerous approaches to minimize the energy consumption of the Wireless Sensor Networks (WSNs). In this paper, a homogeneous and randomly deployed sensor nodes is considered. These sensors are energy constrained elements. The nominal selection of the Cluster Head (CH) which falls under the clustering part of the network protocol is studied and compared to Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. CHs in this proposed process is the function of total remaining energy of each node as well as total average energy of the whole arrangement. The algorithm considers initial energy, optimum value of cluster heads to elect the next group of cluster heads for the network as well as residual energy. Total remaining energy of each node is compared to total average energy of the system and if the result is positive, these nodes are eligible to become CH in the very next round. Analysis and numerical simulations quantify the efficiency and Average Energy Ratio (AER) of the proposed system.

• Journal of Communications and Networks
• /
• v.18 no.6
• /
• pp.902-912
• /
• 2016

Recent advances in energy harvesting (EH) technology have motivated the adoption of rechargeable mobile devices for communications. In this paper, we consider a point-to-point (P2P) wireless communication system in which an EH transmitter with a non-ideal rechargeable battery is required to send a given fixed number of bits to the receiver before they expire according to a preset delay constraint. Due to the possible energy loss in the storage process, the harvest-use-and-store (HUS) architecture is adopted. We characterize the properties of the optimal solutions, for additive white Gaussian channels (AWGNs) and then block-fading channels, that maximize the energy efficiency (i.e., battery residual) subject to a given rate requirement. Interestingly, it is shown that the optimal solution has a water-filling interpretation with double thresholds and that both thresholds are monotonic. Based on this, we investigate the optimal double-threshold based allocation policy and devise an algorithm to achieve the solution. Numerical results are provided to validate the theoretical analysis and to compare the optimal solutions with existing schemes.

• Journal of Ocean Engineering and Technology
• /
• v.20 no.4 s.71
• /
• pp.24-30
• /
• 2006

Different methods exist for the estimation of thermaldeformation of plates in the line heating process. These are based on the assumption of residual strains in the heat-affected zone, known as the method of inherent strains, or simulated relations between heating conditions and residual deformations. The purpose of this paper is to develop a simulator of thermal deformation in the line heating, using the artificial neural network. Curvature deformations for the plate-forming are investigated, which can be used as a prime deformation parameter in the process. The curvature of plates are calculated using the approximation of plate surface by NURBS. Line heating experiments for 11 specimens of different thickness and heating conditions were performed. Two neural networks predicting the maximum temperature and curvature deformations at the heating line are studied. It was concluded that the thermal deformations predicted by the neural network can be used in a line heating simulator, which is considered an attractive and practical alternative to the existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3841-3861
• /
• 2017

Virtualized small cell network is a promising architecture which can realize efficient utilization of the network resource. However, conventional full duplex self-backhauls lead to residual self-interference, which limits the network performance. To handle this issue, this paper proposes a virtual resource allocation, in which the residual self-interference is fully exploited by employing a physical-layer network coding (PNC) aided self-backhaul scheme. We formulate the features of PNC as time slot and information rate constraints, and based on that, the virtual resource allocation is formulated as a mixed combinatorial optimization problem. To solve the problem efficiently, it is decomposed into two sub problems, and a two-phase iteration algorithm is developed accordingly. In the algorithm, the first sub problem is approximated and transferred into a convex problem by utilizing the upper bound of the PNC rate constraint. On the basis of that, the convexity of the second sub problem is also proved. Simulation results show the advantages of the proposed scheme over conventional solution in both the profits of self-backhauls and utility of the network resource.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.242-253
• /
• 2019

We devise a layer-wise hint training method to improve the existing hint-based knowledge distillation (KD) training approach, which is employed for knowledge transfer in a teacher-student framework using a residual network (ResNet). To achieve this objective, the proposed method first iteratively trains the student ResNet and incrementally employs hint-based information extracted from the pretrained teacher ResNet containing several hint and guided layers. Next, typical softening factor-based KD training is performed using the previously estimated hint-based information. We compare the recognition accuracy of the proposed approach with that of KD training without hints, hint-based KD training, and ResNet-based layer-wise pretraining using reliable datasets, including CIFAR-10, CIFAR-100, and MNIST. When using the selected multiple hint-based information items and their layer-wise transfer in the proposed method, the trained student ResNet more accurately reflects the pretrained teacher ResNet's rich information than the baseline training methods, for all the benchmark datasets we consider in this study.

• ETRI Journal
• /
• v.44 no.3
• /
• pp.389-399
• /
• 2022

Wireless sensor networks (WSNs) are one of the basic building blocks of Internet of Things (IoT) systems. However, the wireless sensing nodes in WSNs suffer from energy constraint issues because the replacement/recharging of the batteries of the nodes tends to be difficult. Furthermore, a number of realistic IoT scenarios, such as habitat and battlefield monitoring, contain mobile sensing elements, which makes the energy issues more critical. This research paper focuses on realistic WSN scenarios that involve mobile sensing elements with the aim of mitigating the attendant energy constraint issues using the concept of radio-frequency (RF) energy extraction. The proposed technique incorporates a cluster head election workflow for WSNs that includes mobile sensing elements capable of RF energy harvesting. The extensive simulation analysis demonstrated the higher efficacy of the proposed technique compared with the existing techniques in terms of residual energy, number of functional nodes, and network lifetime, with approximately 50% of the nodes found to be functional at the 4000th, 5000th, and 6000th rounds for the proposed technique with initial energies of 0.25, 0.5 and 1 J, respectively.

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

• Geophysics and Geophysical Exploration
• /
• v.23 no.3
• /
• pp.117-130
• /
• 2020

Noises can distort acquired geophysical data, leading to their misinterpretation. Potential noises sources include anthropogenic activity, natural phenomena, and instrument noises. Conventional denoising methods such as wavelet transform and filtering techniques, are based on subjective human investigation, which is computationally inefficient and time-consuming. Recently, many researchers attempted to implement neural networks to efficiently remove noise from geophysical data. This study aims to review and analyze different types of neural networks, such as artificial neural networks, convolutional neural networks, autoencoders, residual networks, and wavelet neural networks, which are implemented to remove different types of noises including seismic, transient electromagnetic, ground-penetrating radar, and magnetotelluric surveys. The review analyzes and summarizes the key challenges in the removal of noise from geophysical data using neural network, while proposes and explains solutions to the challenges. The analysis support that the advancement in neural networks can be powerful denoising tools for geophysical data.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.6
• /
• pp.41-49
• /
• 2022

The Internet Engineering Task Force (IETF) has standardized RPL (IPv6 Routing Protocol for Low-power Lossy Network) as a routing protocol for Low Power and Lossy Networks (LLNs), a low power loss network environment. RPL creates a route through an Objective Function (OF) suitable for the service required by LLNs and builds a Destination Oriented Directed Acyclic Graph (DODAG). Existing studies check the residual energy of each node and select a parent with the highest residual energy to build a DODAG, but the energy exhaustion of the parent can not avoid the network disconnection of the children nodes. Therefore, this paper proposes EC-RPL (Enhanced Connectivity-RPL), in which ta node leaves DODAG in advance when the remaining energy of the node falls below the specified energy threshold. The proposed protocol is implemented in Contiki, an open-source IoT operating system, and its performance is evaluated in Cooja simulator, and the number of control messages is compared using Foren6. Experimental results show that EC-RPL has 6.9% lower latency and 5.8% fewer control messages than the existing RPL, and the packet delivery rate is 1.7% higher.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.131-140
• /
• 2008

In this paper, we present a data dissemination protocol that guarantees energy-efficient data transmission and maximizes network lifetime. SPMS that outperforms the well-known protocol SPIN uses the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path, maximizing the network lifetime is impossible. In this paper, we propose a protocol for data dissemination called the protocol Considering Between Energy and Distance (ConBED). It solves the network lifetime problem using the residual energy and the distance between nodes to determine a path for data dissemination. The simulation results show that ConBED guarantees energy-efficient transmission and increases the network lifetime by approximately 69% than that of SPMS.