• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1735-1755
• /
• 2012

Wireless sensor networks (WSNs) are becoming increasingly attractive for a variety of applications and have become a hot research area. Routing is a key technology in WSNs and can be coarsely divided into two categories: flat routing and hierarchical routing. In a flat topology, all nodes perform the same task and have the same functionality in the network. In contrast, nodes in a hierarchical topology perform different tasks in WSNs and are typically organized into lots of clusters according to specific requirements or metrics. Owing to a variety of advantages, clustering routing protocols are becoming an active branch of routing technology in WSNs. In this paper, we present an overview on clustering routing algorithms for WSNs with focus on differentiating them according to diverse cluster shapes. We outline the main advantages of clustering and discuss the classification of clustering routing protocols in WSNs. In particular, we systematically analyze the typical clustering routing protocols in WSNs and compare the different approaches based on various metrics. Finally, we conclude the paper with some open questions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1419-1436
• /
• 2020

For an energy harvesting sensor network, when the network lifetime is not the only primary goal, maximizing the network performance under environmental energy harvesting becomes a more critical issue. However, clustering protocols that aim at providing maximum information throughput have not been thoroughly explored in Energy Harvesting Wireless Sensor Networks (EH-WSNs). In this paper, clustering protocols are studied for maximizing the data transmission in the whole network. Based on a long short-term memory (LSTM) energy predictor and node energy consumption and supplement models, an uneven clustering protocol is proposed where the cluster head selection and cluster size control are thoroughly designed for this purpose. Simulations and results verify that the proposed scheme can outperform some classic schemes by having more data packets received by the cluster heads (CHs) and the base station (BS) under these energy constraints. The outcomes of this paper also provide some insights for choosing clustering routing protocols in EH-WSNs, by exploiting the factors such as uneven clustering size, number of clusters, multiple CHs, multihop routing strategy, and energy supplementing period.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.122-129
• /
• 2010

Energy conservation is one of the most important issues for evaluating the performance of wireless sensor network (WSN) applications. Generally speaking, hierarchical clustering protocols such as LEACH, LEACH-C, EEEAC, and BCDCP are more efficient in energy conservation than flat routing protocols. However, these typical protocols still have drawbacks of unequal and high energy depletion in cluster heads (CHs) due to the different transmission distance from each CH to the base station (BS). In order to minimize the energy consumption and increase the network lifetime, we propose a new hierarchical routing protocol, distance aware intelligent clustering protocol (DAIC), with the key concept of dividing the network into tiers and selecting the high energy CHs at the nearest distance from the BS. We have observed that a considerable amount of energy can be conserved by selecting CHs at the nearest distance from the BS. Also, the number of CHs is computed dynamically to avoid the selection of unnecessarily large number of CHs in the network. Our simulation results showed that the proposed DAIC outperforms LEACH and LEACH-C by 63.28% and 36.27% in energy conservation respectively. The distance aware CH selection method adopted in the proposed DAIC protocol can also be adapted to other hierarchical clustering protocols for the higher energy efficiency.

• Journal of the Korea Society for Simulation
• /
• v.21 no.4
• /
• pp.47-56
• /
• 2012

In this study, we use a parallel simulator PASENS(Parallel SEnsor Network Simulator) to predict power consumption and data reception rate of the hierarchical routing protocols for sensor network - LEACH (Low-Energy Adaptive Clustering Hierarchy), TL-LEACH (Two Level Low-Energy Adaptive Clustering Hierarchy), M-LEACH (Multi hop Low-Energy Adaptive Clustering Hierarchy) and LEACH-C (LEACH-Centralized). According to simulation results, M-LEACH routing protocol shows the highest data reception rate for the wider area, since more sensor nodes are involved in the data transmission. And LEACH-C routing protocol, where the sink node considers the entire node's residual energy and location to determine the cluster head, results in the most efficient energy consumption and in the narrow area needed long life of sensor network.

• Smart Structures and Systems
• /
• v.21 no.2
• /
• pp.225-234
• /
• 2018

E-Health allows you to supersede the central patient wireless healthcare system. Wireless Body Sensor Network (WBSN) is the first phase of the e-Health system. In this paper, we aim to understand e-Health architecture and configuration, and attempt to minimize energy consumption and latency in transmission routing protocols during restrictive latency in data delivery of WBSN phase. The goal is to concentrate on polling protocol to improve and optimize the routing time interval and schedule communication to reduce energy utilization. In this research, two types of network models routing protocols are proposed - elemental and clustering. The elemental model improves efficiency by using a polling protocol, and the clustering model is the extension of the elemental model that Destruct Supervised Decision Tree (DSDT) algorithm has been proposed to solve the time interval conflict transmission. The simulation study verifies that the proposed models deliver better performance than the existing BSN protocol for WBSN.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.502-504
• /
• 2021

The Mobile Ad-hoc Network (MANET) is a representative mobile sensor network. MANET is used in various areas because it consists of sensors composed of moving nodes that do not depend on existing infrastructure networks. In the mobile sensor field, the mobility characteristic plays an important role in the performance of the network. Researches on routing techniques are being actively developed in terms of energy efficiency of the entire network. Clustering-based routing protocols show excellent performance in terms of energy efficiency. In this paper, the energy performance according to routing protocols is compared in the MANET to which the same mobility model is adopted.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.668-672
• /
• 2010

In wireless sensor networks, a fault-tolerant scheme that detects the failure of sensor nodes and improves the reliability of collected information must be considered. Resource-constraint sensor nodes expose vulnerability and cannot use existing checkpointing schemes that do not consider a feature of sensor networks. In this paper, we propose a fault-tolerant scheme for clustering routing protocols that support the recovery of a head node.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.29-42
• /
• 2011

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 their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. 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 the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1586-1605
• /
• 2012

With the prevalence of multimedia applications and the potential commercial usage of Mobile Ad hoc Networks (MANETs) in group communications, Quality of Service (QoS) support became a key requirement. Recently, some researchers studied QoS multicast issues in MANETs. Most of the existing QoS multicast routing protocols are designed with flat topology and small networks in mind. In this paper, we investigate the scalability problem of these routing protocols. In particular, a Position-Based QoS Multicast Routing Protocol (PBQMRP) has been developed. PBQMRP builds a source multicast tree guided by the geographic information of the mobile nodes, which helps in achieving more efficient multicast delivery. This protocol depends on the location information of the multicast members which is obtained using a location service algorithm. A virtual backbone structure has been proposed to perform this location service with minimum overhead and this structure is utilized to provide efficient packet transmissions in a dynamic mobile Ad hoc network environment. The performance of PBQMRP is evaluated by performing both quantitative analysis and extensive simulations. The results show that the used virtual clustering is very useful in improving scalability and outperforms other clustering schemes. Compared to On-Demand Multicast Routing Protocol (ODMRP), PBQMRP achieves competing packet delivery ratio and significantly lower control overhead.