• ETRI Journal
• /
• v.43 no.3
• /
• pp.427-435
• /
• 2021

Data filtering is an essential task for improving the energy efficiency of radiofrequency identification (RFID) networks. Among various energy-efficient approaches, clustering-based data filtering is considered to be the most effective solution because data from cluster members can be filtered at cluster heads before being sent to base stations. However, this approach quickly depletes the energy of cluster heads. Furthermore, most previous studies have assumed that readers are fixed and interrogate mobile tags in a workspace. However, there are several applications in which readers are mobile and interrogate fixed tags in a specific area. This article proposes a model for dynamic clustering-based data filtering (DCDF) in mobile RFID networks, where mobile readers are re-clustered periodically and the cluster head role is rotated among the members of each cluster. Simulation results show that DCDF is effective in terms of balancing energy consumption among readers and prolonging the lifetime of the mobile RFID networks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1039-1042
• /
• 2008

Wireless sensor networks enable pervasive, ubiquitous, and seamless communication with the physical world. In this paper, we are concerned for clustering sensors into groups, so that sensors communicate information only to cluster heads and then the cluster heads communicate the aggregated information to the sink node, that the network can save energy. In this paper, we propose the algorithm for electing the cluster head and fuzzy registration of cluster head in a dynamic cluster wireless sensor networks. For making decision for clustering we will use fuzzy logic system. In simulation, we could achieve power regulation of total consumption and also the stabilization of the networks energy efficiency.

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

As found in research on constraint satisfaction problems, the choice of variable ordering heuristics is crucial for effective solving of constraint optimization problems. For the special problems such as energy-efficient clustering in heterogeneous wireless sensor networks, in which cluster heads have an inclination to be near a base station, we propose a new approach based on the static preferences variable orderings and provide a pnode heuristic algorithm for a specific application. The pnode algorithm selects the next variable with the highest Preference. In our problem, the preference becomes higher when the cluster heads are closer to the optimal region, which can be obtained a Priori due to the characteristic of the problem. Since cluster heads are the most dominant sources of Power consumption in the cluster-based sensor networks, we seek to minimize energy consumption by minimizing the maximum energy dissipation at each cluster heads as well as sensor nodes. Simulation results indicate that the proposed approach is more efficient than other methods for solving constraint optimization problems with static preferences.

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

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.384-389
• /
• 2012

In this paper, we examine the problems of the low energy adaptive clustering hierarchy (LEACH) protocol and present ideas for improvement by selecting the cluster head node. The main problem with LEACH lies in the random selection of cluster heads. There exists a probability that the formed cluster heads are unbalanced and may remain in one part of the network, which makes some part of the network unreachable. In this paper, we present a new version of the LEACH protocol called the improved LEACH (ILEACH) protocol, which a cluster head is selected based on its ratio between the current energy level and an initial energy level, and multiplies by the root square of its number of neighbor nodes. The simulation results show that the proposed ILEACH increases the energy efficiency and network lifetime.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.5
• /
• pp.405-411
• /
• 2015

In this paper, we propose routing protocol for mobile wireless sensor networks with a mobile sink in cluster configuration. The proposed protocol extends LEACH-ME by introducing a mobile sink. The mobile sink moves to the cluster head with the highest number of member nodes to collect sensed data from cluster heads within its vicinity, which results in reducing energy consumption in forwarding packets to the sink. The simulation results show that the proposed protocol outperform LEACH-ME in terms of energy efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.608-614
• /
• 2009

In wireless sensor networks, there are hundreds to thousands of small battery powered devices which are called sensors. As sensors have a limited energy resources, there is a need to use it effectively. A clustering based routing protocol forms clusters by distributed algorithm. Member nodes send their data to their cluster heads then cluster heads integrate data and send to sink node. In this paper we propose an energy efficient cluster-head selection algorithm. We have used some factors(a previous cluster head experience, a existence of data to transmit and an information that neighbors have data or not) to select optimum cluster-head and eventually improve network lifetime. Our simulation results show its effectiveness in balancing energy consumption and prolonging the network lifetime compared with LEACH and HEED algorithms.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.180-190
• /
• 2011

Efficient energy consumption is a critical factor for deployment and operation of wireless sensor networks (WSNs). To achieve energy efficiency there have been several hierarchical routing protocols that organize sensors into clusters where one sensor is a cluster-head to forward messages received from its cluster-member sensors to the base station of the WSN. In this paper, we propose a self-organized clustering method for cluster-head selection and cluster based routing for a WSN. To select cluster-heads and organize clustermembers for each cluster, every sensor uses only local information and simple decision mechanisms which are aimed at configuring a self-organized system. By these self-organized interactions among sensors and selforganized selection of cluster-heads, the suggested method can form clusters for a WSN and decide routing paths energy efficiently. We compare our clustering method with a clustering method that is a well known routing protocol for the WSNs. In our computational experiments, we show that the energy consumptions and the lifetimes of our method are better than those of the compared method. The experiments also shows that the suggested method demonstrate properly some self-organized properties such as robustness and adaptability against uncertainty for WSN's.

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

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.213-220
• /
• 2015

Wireless sensor network(WSN) is made up of a lot of battery operated inexpensive sensors that, once deployed, can not be replaced. Therefore, energy efficiency of WSN is essential. Among the methods for energy efficiency of the network, clustering algorithms, which divide a WSN into multiple smaller clusters and separate all sensors into cluster heads and their associated member nodes, are very energy efficient routing technique. The first cluster-based routing protocol, LEACH, randomly elects the cluster heads in accordance with the probability. However, if the distribution of selected cluster heads is not good, uniform energy consumption of cluster heads is not guaranteed and it is possible to decrease the number of active nodes. Here we propose a new routing scheme that, by comparing the remaining energy of all nodes in a cluster, selects the maximum remaining energy node as a cluster head. Because of decrease in energy gap of nodes, the node that was a cluster head operates as a member node much over. As a result, the network lifespan is increased and more data arrives at base station.