Hierarchical Clustering Routing Research Articles

Fuzzy-based cluster routing in wireless sensor network.

The wireless sensor network is of great interest due to its special features and applications. Due to the computational limitation and power supply of these networks, hierarchical cluster routing is mentioned as a solution to improve the problem of energy consumption and network lifetime. In our study, a fuzzy-based clustering routing protocol was proposed that uses network zoning and node residual energy parameters, node distance to the center of each zone, and node-to-base station angle as fuzzy input for cluster head selection. In the proposed method with the aim of reducing network energy consumption, the responsibility of choosing CHs in each area, determining the area of each node, calculating the distance of each node to the center and calculating the angle of each node was assigned to the BS. The proposed method was carried out with Farahzadi, LEACH, MSCR protocols in terms of network lifetime evaluation criteria, stability period, selection and number of CH and average residual energy in MATLAB environment. The comparison of the results showed that the proposed method has performed better in terms of criteria, so that the network lifetime as one of the important indicators, the proposed method has improved by 50%, 40% and 20%, respectively, compared to LEACH, Farahzadi and MSCR methods.

A Novel Algorithm for Redundant Data Filtering in WSN and RFID Integrated Networks

Wireless sensor networks (WSN) and radio frequency identification (RFID) are base technologies employed in decentralised dynamic environments. In the hybrid network formed by integrating RFID and WSN, RFID data can be used applying WSN protocols for multi-hop communications. However, RFID data contain excessive duplication, which increases time delay and energy consumption, resulting in wastage of different resources. There exist four popular RFID–WSN integration architectures: hierarchical RFID-sensor topology, network RFID-sensor topology, reader-sensor nodes topology, and mixed topology. In this paper, we propose a new plan for a WSN–RFID integrated network. The entire network is divided into clusters, and the clustering hierarchical routing algorithm is employed to send data from the head nodes to the base station. Further, we propose two algorithms to overcome redundant data on the hybrid network. Our simulation results demonstrate that the proposed method reduces redundant data and processing time compared with existing methods.

Fault-Tolerant Backup Clustering Algorithm for Smart Connected Underwater Sensor Networks

This paper addresses poor cluster formation and frequent Cluster Head (CH) failure issues of underwater sensor networks by proposing an energy-efficient hierarchical topology-aware clustering routing (EEHTAC) protocol. In this paper, fault-tolerant backup clustering (FTBC) algorithms and multi-parameter cluster formation (MPCF) model were developed for the EEHTAC operation. The MPCF model tackles the issue of poor cluster formation performance by integrating multiple parameters to achieve effective clustering process. The FTBC algorithms tackle the issue of frequent CH failures to avoid interruption in data transmission. Performance of the MPCF model was evaluated using normal, high-fault, and high routing overhead network scenarios. Performance metrics employed for this analysis are temporal topology variation ratio (TTVR), CH load distribution (CLD), and cluster stability (STB). Obtained results show that operating with a CH retention period of 90s achieves better CH duty cycling per round and improves the MPCF process with values of 25.69%, 55.56%, and 60% for TTVR, CLD, and STB respectively. Performance of the FTBC-based EEHTAC was evaluated relative to Energy-balanced Unequal Layering Clustering (EULC) protocol. Performance indicators adopted for this evaluation are routing overhead (Ω), end to end delay (Δ), CH failures recovered (CFR), CH failures detected (CFD), received packets (θ), and energy consumption (Σ). With reference to the best obtained values, EEHTAC demonstrated performance improvement of58.40%, 29.94%,81.33%, 28.02%, 86.65%, and 54.35% over EULC variants in terms of Ω, Δ,CFR, CFD, θ, and Σ respectively. Obtained results displayed that the MPCF model is efficient for cluster formation performance and the FTBC-based EEHTACprotocolcan perform effectively well against an existing CBR protocol.

Overlapped hierarchical clusters routing protocol for improving quality of service

The rapid development in communications and sensors technologies make wireless sensor networks (WSNs) as essential key in several advanced applications such as internet of things (IoT). The increasing demands on using WSNs required high quality of services (QoS) because most WSNs applications have critical requirements. This work aims to offer a routing protocol to improve the QoS in WSNs, taking in consideration its ability to prolong the lifetime of the network, optimize the utilization of the limited bandwidth available, and decrease the latency that accompanies the packets transmitted to the gateway. The proposed protocol is called overlapped hierarchical cluster routing protocol (OHCRP). OHCRP is compared with the traditional routing protocols such as SPEED, and THVR. The results show that OHCRP reduces latency effectively and achieve high energy conservation, which lead to increase the network lifetime and insure network availability.

Digital Media Art Communication Based on Wireless Cooperative Routing with Minimum Energy Consumption

Wireless cooperative routing algorithm transmits the data collected in the target area to users, so that users can obtain monitoring information timely and accurately. In the traditional low‐power adaptive clustering hierarchical routing protocol, the process of building clusters is random, the resources of nodes are not fully utilized, the node death speed is fast, the network life cycle is short, and the performance is not stable enough. In addition, the route maintenance process is cumbersome and will occupy a lot of bandwidth. In order to solve the problems of real‐time transmission of digital media art communication data and network lifetime optimization, a wireless cooperative routing algorithm based on minimum energy consumption is proposed. The facts of transmission strength consumption, node residual strength, and minimal information transmission extension are analyzed, a new weight feature is proposed, and a multipath statistics routing scheme is developed by using the usage of the minimal strength consumption. All digital media art propagation sensor nodes transmit data to sink nodes along multiple transmission paths. Simulation results show that the algorithm can prolong the network lifetime, reduce and balance the node energy consumption, reduce the data transmission delay, reduce the energy consumption of wireless cooperative routing based on the minimum energy consumption by 64.5%, and increase the number of compressed images by 182%.

Efficient Energy Utilization Using Ant Lion Optimization in WSN

In wireless sensing element networks (WSNs),sensing element nodes or operated by little batteries, therefore they need restricted energy resources which require careful utilization. The planned algorithmic rule is associate degree vitality economical so as to handle trade –off between packet delay and transmission power, and delay economical we have a tendency to develop 3 ANTLION schemes supported power-delay limitations of the heterogeneous WSN. We have a tendency to devise a theoretical framework to figure the common delay and stability region for every planned theme and compare the performance of ANTLION and traditional Clustering. A new hybrid routing protocol is proposed by incorporating the routing concept of adhoc network into the hierarchical clustering routing protocol LEACH of the wireless sensor networks namely Quadrant Based LEACH (ANTLION)..

A novel efficient clustering protocol for energy harvesting in wireless sensor networks

The utilization of wireless sensor networks (WSNs) is proliferating in our daily life. It depends on the environmental monitoring such as weather tracking, battled field, etc. However, the main challenge of WSNs is energy management. Generally, traditional nodes of the sensor network were powered by non-rechargeable batteries with limited energy capacity. The alternative solution has been discovered to resolve the limitation of the sensor battery called energy harvesting (EH). EH offers effective and an alternative solution to recharge the battery of the sensor node. It assists with the environment, and EH technique can be possible different kinds such as solar, wind, thermal and mechanical. In this paper, we propose a novel energy harvesting clustering protocol (NEHCP). The NEHCP is based on the hierarchical clustering routing algorithm, and this protocol uses solar EH. The collection of information from the sensor nodes is sent to the base station through the cluster head. The NEHCP algorithm is categorized into three sections, such as the initial phase, set-up phase and data transmission phase. Moreover, the unique feature of EH-WSNs is giving more efficient result in term of network lifetime. The simulation part of this method shows a strong ability to balance energy consumption and increases the network efficiency for the EH-WSNs.

Quantitative Invulnerability Analysis of Artificial Spider-Web Topology Model Based on End-to-End Delay

This paper presents an artificial spider-web topology model inspired by the structure and invulnerability of a spider web. A hierarchical clustering routing rule is accordingly established using the vibration transmission features of the natural spider web as a reference. Furthermore, the end-to-end delay is applied as the quantitative indicator of invulnerability for analyzing the communication performance and characteristics of the artificial spider-web topology. The simulation tests of a one-layer and 3-layer artificial spider-web model are implemented to obtain the importance and destructive tolerance of network components based on OPNET, with the change of communication conditions and fault types. This paper can provide a practical analysis method for the invulnerability of the artificial spider-web topology and offer important implications for the construction and maintenance of wireless sensor networks based on the topology.

E 2CL, HC: Energy Efficient Cooperative Localized & Hierarchical Cluster Routing in CRN

With the advancement of Cognitive Radio Network (CRN), localization of primary users progress the improvement of network performance with respect to power adoption and reliability. Moreover, CRN localization is essential because storage energy of CR devices is limited and causes increased network lifetime. By considering these issues, we propose an Energy Efficient Cooperative Localization approach (EE-CL) in CRN, which is used for placing Primary User (PU) position with the help of mobile a aided CR. Moreover, communication among CRs cooperation which leads to demand of more energy, a mobile CR is allowed to manage the overall positional accuracy and wake up minimum number of CR to collaborate CR manager. In order to investigate influence of accurate location knowledge, a location-aware CR (LaCR) routing protocol employed and to improve the network life time a Hierarchical clustering approach is applied. We evaluated the simulation results for the proposed Energy Efficient Cooperative Localization (EE-CL) Routing approach which achieves better performance compared to existing Cooperative Localization (CL) with respect to energy efficiency. Furthermore, remarkable performance is accomplished by LaCR protocol in terms of PUs collision risk with the help of localization knowledge obtained from EE-CL approach. Also Hierarchical Cluster Routing protocol acheives significant performance in enhancing the network life time.

IBEECP: Improved Biogeography Optimization Based Energy Efficient Clustering Protocol for Wireless Sensor Networks

Biogeography-based Optimization (BBO) is a new nature inspired computing algorithm for solving optimization problems. Cluster head selection is a well-known optimization problem in wireless sensor networks (WSN). The life of network is depends on selecting the cluster head (CH) for transferring the data to the base station in Wireless Sensor Network. This paper proposes Improved Biogeography Optimization Based Energy Efficient Clustering Protocol (IBEECP) for Wireless sensor networks for cluster head selection. The concept of IBCEEP is by using efficient CH selection inspired by biogeography-based optimization for efficient energy utilization of WSNs. The performance of simulation results through MATLAB shows IBEECP enhance the network lifetime, quality of network, network stability period and throughput compared with heterogeneous protocols in WSN are stable election protocol (SEP), evolutionary routing protocol (ERP), intelligent hierarchical clustering routing protocol (IHCR) and biogeography based energy efficient cluster protocol (BEECP).

Performance Evaluation of Zone-Based Routing with Hierarchical Routing in Wireless Sensor Networks

Routing remains a most challenging task in sensor networks because of constrained resources like battery power, processing, and memory. Many energy efficiency techniques for the sensor networks have been proposed, among which hierarchical routing is considered the most energy-efficient and extended network lifetime technique. This technique has a lesser number of transmissions in the network. On the contrary, zone-based routing claims lesser control and routing overhead on the overall network lifetime. In this research, a simulation-based comparison of zone-based routing with static clustering hierarchical routing is conducted. The simulation results show that the zone-based routing outperforms hierarchical routing with static clustering in terms of energy efficiency, network lifetime, and throughput.

Energy Efficient Chain Based Routing Protocol for Orchard Wireless Sensor Network

Wireless sensor network nodes have limited energy, how to employ limited energy efficiently to realize effective data transmission has become a hot topic. Considering the characteristics of orchard planting in rows and shade caused by sparse random features, to improve energy efficiency of the orchard wireless sensor network and prolong network lifetime, we propose an improved chain-based clustering hierarchical routing (ICCHR) algorithm based on LEACH algorithm. The ICCHR algorithm investigates the formation of clusters, cluster head election, chain formation as well as the data transmission process, and further simulated with E-LEACH, PEGASIS-E, LEACH-1R PEGASIS and P-LEACH algorithms through MATLAB. The simulation results show that for BS at (50, 175), from the point of view of all sensor nodes death metric, the network lifetime for ICCHR algorithm prolongs about 3.29, 8.78, 35.53, and 43.11% compared with E-LEACH, PEGASIS-E, LEACH-1R PEGASIS and P-LEACH algorithms. The average energy consumption per round of the ICCHR algorithm is lower than E-LEACH, PEGASIS-E, LEACH-1R PEGASIS and P-LEACH algorithms about 4.73, 9.04, 35.60, and 43.31%. This research can provide theoretical references for the orchard complex environment wireless networking.

Analysing salesmen itinerary with agglomerative hierarchical clustering and vehicle routing algorithm - a case study of a confectionery supplier in Indonesia

The study analysed salesmen itinerary of a confectionery supplier in Indonesia. Channel management and robust product distribution are important elements for confectionery business, since growth heavily depends on healthy product distribution. To support product distribution, optimising salesmen itinerary plays an important role in the firm's sales operation. The study was limited to optimising salesmen schedule for its wholesalers' outlet type, since it contributed to 78% of its revenue. The analyses were carried out using 'cluster first-route second' approach. For clustering the customer nodes, it recommended agglomerative hierarchical clustering (AHC) method. For routing within each customer's cluster, it tested two algorithms, i.e., Clarke-Wright and weighted-serving time-visual approach. The result showed that AHC-weighted-serving-time-visual algorithm was as good as AHC-Clarke-Wright with 2.1% cheaper variable cost. The proposed algorithm was adapted from practical insight and easier to be understood.

Analysing salesmen itinerary with agglomerative hierarchical clustering and vehicle routing algorithm - a case study of a confectionery supplier in Indonesia

Analysing salesmen itinerary with agglomerative hierarchical clustering and vehicle routing algorithm - a case study of a confectionery supplier in Indonesia

K-CHRA: A Clustering Hierarchical Routing Algorithm for Wireless Rechargeable Sensor Networks

Routing technology is an indispensable part of wireless sensor networks (WSNs) in contemporary studies. Considerable attention is being given to the energy problem and the delay of data transmission. However, a few studies have explored routing algorithms in wireless rechargeable sensor networks (WRSNs) using mobile charging equipment. In this paper, we propose a clustering hierarchical routing algorithm for WRSNs based on $K$ -means method (K-CHRA), which takes the energy distribution and data transmission into consideration under the influence of mobile equipment (ME) while combining mobile sink and mobile charger in WRSNs. The mobile sink is responsible for data collection and mobile charger replenishes energy for sensor nodes. The simulations demonstrate that K-CHRA can reduce energy consumption and the data transmission delay. Thus, K-CHRA has excellent equilibrium characteristics with balanced energy dissipation throughout all sensor nodes in the networks. Finally, a large number of experiments demonstrate that our proposed algorithm K-CHRA suits for many kinds of scenarios of networks.

Performance Analysis of LEACH-GA over LEACH and LEACH-C in WSN

A wireless sensor network (WSN) is a collection of sensor nodes that has an ability to support Sensing, Signal processing, Embedded Computing, Communications and Connectivity for data processing and transmit the information to far located sink nodes through intermediate nodes with the help of energy source namely batteries. However, the lifetime of the network can be analyzed with the available node energy while transmitting a data from source to destination. But the batteries used in WSN neither to be recharged nor be replaced. So it is necessary to improve the lifetime of the network for better performance. For the past few decades, researchers developed many new Hierarchical routing protocols to improve the network lifetime by minimizing the node energy consumption, which includes Genetic Algorithm based Low Energy Adaptive Clustering Hierarchical Routing Protocol (LEACH-GA). In this paper, we analyzed a network lifetime of LEACH, LEACH-C and LEACH GA by varying its Initial Energy and Cluster Probability.

Routing Algorithm of Wireless Sensor Network and Robustness Analysis Based on Fuzzy Mathematics

In order to reduce the energy consumption and enhance the robustness of wireless sensor network (WSN), this paper proposes a hierarchical clustering routing algorithm based on fuzzy mathematics (HCRAFM). To make a comprehensive analysis of WSN, it is also necessary to detect the robustness of the network. Facing the multiple random variables, the traditional robustness detection models assume that all nodes have the same weight, making it impossible to quantify the analysis indices or obtain accurate results. Thus, the fuzzy mathematics theory was introduced to the WSN robustness detection, forming a fuzzy comprehensive evaluation method. The simulation results show that the HCRAFM strikes a load balance between WSN nodes, extends the life cycle of each node, and prolongs the service life of the network. In addition, the proposed algorithm is proved to have sound robustness and strong applicability.

Improving the Connectivity of Community Detection-based Hierarchical Routing Protocols in Large-scale WSNs

The recent growth in the use of wireless sensor networks (WSNs) in many applications leads to the raise of a core infrastructure for communication and data gathering in Cyber-Physical Systems (CPS). The communication strategy in most of the WSNs relies on hierarchical clustering routing protocols due to their ad hoc nature. In the bulk of the existing approaches some special nodes, named Cluster-Heads (CHs), have the task of assembling clusters and intermediate the communication between the cluster members and a central entity in the network, the Sink. Therefore, the overall efficiency of such protocols is highly dependent on the even distribution of CHs in the network. Recently, a community detection-based approach, named RLP, have shown interesting results with respect to the CH distribution and availability that potentially increases the overall WSN efficiency. Despite the better results of RLP regarding the literature, the adopted CH election algorithm may lead to a CH shortage throughout the network operation. In line with that, in this paper, we introduce an improved version of RLP, named HRLP. Our proposal includes a hybrid CH election algorithm which relies on a computationally cheap and distributed probabilistic-based CH recovery procedure to improve the network connectivity. Additionally, we provide a performance analysis of HRLP and its comparison to other protocols by considering a large-scale WSN scenario. The results evince the improvements achieved by the proposed strategy by means of the network connectivity and lifetime metrics.

The Cluster Head Preferred Hierarchical Clustering Routing Protocol Based on G-Means in Wireless Sensor Networks

In hierarchical structures determined by traditional routing protocols of wireless sensor networks, clustering is not structured and the networks prone to generate scatters, leading to some nodes die quickly. So this paper presents a cluster head preferred hierarchical clustering routing protocol based on G-Means (GHPHC). It uses G-Means algorithm to detect each clustering structure, so that each cluster is Gaussian distribution and it avoids the generation of scatters. At the same time, the cluster head preferred algorithm proposed in this paper gives the corresponding weight for each node of all clusters, thus select a suitable cluster head node for every cluster. Experimental results show that compared to traditional routing protocols, the death rate of nodes in a wireless sensor network which uses GHPHC protocol is more slow, and has a longer life cycle.

Apply R<sup>+</sup> Tree to Make Hierarchical Cluster Routing with QOS Guarranteed by Multiple Paths and Multicast Routing

In the new era of communication and network technologies, a routing protocol not only operates on some lower levels of a network protocol. It also operates on the application layer the highest-level layer in network protocol stack. So we call this is upper layer routing protocol. But it must be based on lower layers to make routing decisions. But normal routing protocols are used for most static network or rather small wireless networks or not high mobility networks. In mobile ad-hoc networks, nodes move very often and fast, so bandwidth of connection between them can be reduced. Therefore the transmission delay may be increased. The paper aims at purpose to increate QOS routing by hierarchical clustering routing by using R⁺ tree in addition with some advanced techniques multicast routing, multiple paths, use GEN/ BEE/ ANT to optimize routes to transmit data.