• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.911-923
• /
• 2010

In wireless sensor networks (WSNs), cluster based data routing protocols have the advantages of reducing energy consumption and link maintenance cost. Unfortunately, most of clustering protocols have been designed for uniformly distributed sensor networks. However, some urgent situations do not allow thousands of sensor nodes being deployed uniformly. For example, air vehicles or balloons may take the responsibility for deploying sensor nodes hence leading a normally distributed topology. In order to improve energy efficiency in such sensor networks, in this paper, we propose a new cluster formation algorithm named DAEEC (Density Aware Energy-Efficient Clustering). In this algorithm, we define two kinds of clusters: Low Density (LD) clusters and High Density (HD) clusters. They are determined by the number of nodes participated in one cluster. During the data routing period, the HD clusters help the neighbor LD clusters to forward the sensed data to the central base station. Thus, DAEEC can distribute the energy dissipation evenly among all sensor nodes by considering the deployment density to improve network lifetime and average energy savings. Moreover, because the HD clusters are densely deployed they can work in a manner of our former algorithm EEVAR (Energy Efficient Variable Area Routing Protocol) to save energy. According to the performance analysis result, DAEEC outperforms the conventional data routing schemes in terms of energy consumption and network lifetime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2670-2685
• /
• 2020

Flying ad-hoc networks (FANETs) is a vibrant research area nowadays. This type of network ranges from various military and civilian applications. FANET is formed by micro and macro UAVs. Among many other problems, there are two main issues in FANET. Limited energy and high mobility of FANET nodes effect the flight time and routing directly. Clustering is a remedy to handle these types of problems. In this paper, an efficient clustering technique is proposed to handle routing and energy problems. Transmission range of FANET nodes is dynamically tuned accordingly as per their operational requirement. By optimizing the transmission range packet loss ratio (PLR) is minimized and link quality is improved which leads towards reduced energy consumption. To elect optimal cluster heads (CHs) based on their fitness we use k-means. Selection of optimal CHs reduce the routing overhead and improves energy consumption. Our proposed scheme outclasses the existing state-of-the-art techniques, ACO based CACONET and PSO based CLPSO, in terms of energy consumption and cluster building time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.227-230
• /
• 2011

In this paper, we are proposed ECOPS(Energy Conserving optimal Path Schedule) algorithm that according to ALPS(Ad hoc network Localized Positioning System) algorithm the location information is received and the new head node is selected considering the energy efficiency. The proposed algorithm follows RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) structure, that is the hierarchic cluster structure. And by using the location information of the node, it maintains the cluster which the energy is efficient with the production. It increases the life time of the total routing structure.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.2
• /
• pp.61-68
• /
• 2020

Nuclear power plants have a lower cost of power generation, and they are more eco-friendly than other power generation plants. Also, we need to prepare nuclear plant accidents because of their severe damage. In the event of a safety accident, such as a radiation leak, by applying a wireless sensor network to a nuclear power plant, many sensor nodes can be used to monitor radiation and transmit information to an external base station to appropriately respond to the accident. However, applying a wireless sensor network to nuclear power plants requires routing protocols that consider the sensor network size and bypass obstacles such as plant buildings. In general, the hierarchical-based routing protocols are efficient in energy consumption. In this study, we look into the problems that may occur if hierarchical-based routing protocols are applied to nuclear power plants and propose improved routing protocols to solve these problems. Simulation results show that the proposed routing protocol is more effective in energy consumption than the existing LEACH protocol.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.3
• /
• pp.43-51
• /
• 2017

MANET consists of only wireless nodes having limited processing capability. It processes routing and data transmission through cooperation among each other. And it is exposed to many attack threats due to the dynamic topology by movement of nodes and multi-hop communication. Therefore, the reliability of transmitted data between nodes must be improved and security of integrity must be high. In this paper, we propose a method to increase the reliability of transmitted data by providing a secure cryptography protocol. The proposed method used a hierarchical structure to provide smooth cryptographic services. The cluster authentication node issues the cluster authentication key pair and unique key to the nodes. The nodes performs the encryption through two steps of encryption using cluster public key and block encryption using unique key. Because of this, the robustness against data forgery attacks was heightened. The superior performance of the proposed method can be confirmed through comparative experiment with the existing security routing method.

• Journal of information and communication convergence engineering
• /
• v.19 no.2
• /
• pp.67-72
• /
• 2021

Wireless sensor networks (WSNs) require an enormous number of sensor nodes (SNs) to maintain processing, sensing, and communication capabilities for monitoring targeted sensing regions. SNs are generally operated by batteries and have a significantly restricted energy consumption; therefore, it is necessary to discover optimization techniques to enhance network lifetime by saving energy. The principal focus is on reducing the energy consumption of packet sharing (transmission and receiving) and improving the network lifespan. To achieve this objective, this paper presents a novel improved energy-efficient cluster-based routing protocol (IECRP) that aims to accomplish this by decreasing the energy consumption in data forwarding and receiving using a clustering technique. Doing so, we successfully increase node energy and network lifetime. In order to confirm the improvement of our algorithm, a simulation is done using matlab, in which analysis and simulation results show that the performance of the proposed algorithm is better than that of two well-known recent benchmarks.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.2
• /
• pp.373-377
• /
• 2022

Wireless sensor networks are being used in various fields. Wireless sensor networks are applied in many areas, such as security, military detection, environmental management, industrial control, and home automation. There is a problem about the limit of energy that the sensor network basically has. In this paper, we propose the LEACH-CCBD (Low Energy Adaptive Clustering hierarchy - Centrailized with Cluster and Basestation Distance) algorithm that uses energy efficiently by improving network transmission based on LEACH-C among the representative routing protocols. The LEACH-CCBD algorithm is a method of assigning a cluster head to a cluster head by comparing the sum of the distance from the member node to the cluster distance and the distance from the cluster node to the base station with respect to the membership of the member nodes in the cluster when configuring the cluster. The proposed LEACH-CCBD used Matlab simulation to confirm the performance results for each protocol. As a result of the experiment, as the lifetime of the network increased, it was shown to be superior to the LEACH and LEACH-C algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1187-1208
• /
• 2022

One of the main goals of wireless sensor networks (WSNs) is to utilize the energy of sensor nodes effectively and maximize the network lifetime. Thus, this paper proposed a routing protocol for WSNs based on virtual force disturbing mobile Sink node (VFMSR). According to the number of sensor nodes in the cluster, the average energy and the centroid factor of the cluster, a new cluster head (CH) election fitness function was designed. At the same time, a hexagonal fixed-point moving trajectory model with the best radius was constructed, and the virtual force was introduced to interfere with it, so as to avoid the frequent propagation of sink node position information, and reduce the energy consumption of CH. Combined with the improved ant colony algorithm (ACA), the shortest transmission path to Sink node was constructed to reduce the energy consumption of long-distance data transmission of CHs. The simulation results showed that, compared with LEACH, EIP-LEACH, ANT-LEACH and MECA protocols, VFMSR protocol was superior to the existing routing protocols in terms of network energy consumption and network lifetime, and compared with LEACH protocol, the network lifetime was increased by more than three times.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.224-227
• /
• 2012

In the Cluster-Based Routing Protocol (CBRP), a cluster header in each cluster is selected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP selects a cluster header without considering the remaining energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be selected frequently. In this paper, we propose the advanced protocol which prolongs the lifetime of the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining energies of all of nodes are compared with one another, and the node with the highest energy is selected as the cluster header.

• Journal of Convergence Society for SMB
• /
• v.4 no.1
• /
• pp.7-15
• /
• 2014

In this paper, we propose an efficient routing protocol to achieve an optimal route searching process of the network lifetime by balancing power consumption per node. The proposed protocols aim at finding energy-efficient paths at low protocol power. In our protocol, each intermediate node keeps power level and branch number of child nodes and it transmits the data the nearest neighbor node. Our protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of the location of the sink outside or inside the cluster. In the proposed protocol for inter-cluster communication, a cluster head chooses a relay node from its adjacent cluster heads according to the node's residual energy and its distance to the base station. Simulation results show that proposed protocol successfully balances the energy consumption over the network, and achieves a remarkable network lifetime improvement as highly as 7.5%.