Cluster-based Routing Algorithm Research Articles

Enhancement of Network Lifetime by Improving the Leach Protocol for Large Scale WSN

Background: Wireless Sensor Network (WSN) is a network of self-configurable nodes. Nodes are operated using irreplaceable and small energy source. Node's operation includes sensing and transferring of data towards base station. Methods: Network Lifetime depends on lifespan of nodes in that network. LEACH is the basic protocol for cluster based routing algorithm. Many proposals with modification of LEACH are proposed and have some suggestion for future work. Optimized Far-Zone LEACH and EAR are few of that and tried to modify the LEACH to augment the network lifetime. Findings: The proposed work covers the efficient usage of energy, nodes mobility, hidden zone issues and routing in WSN design. Nodal contact probability and Weighted moving average concepts are used to reduce the impact on mobility issue. Residual energy of the sensing node, distance towards base and adaptive sleep scheduling algorithm are used to reduce the node early dead issue and also improve the lifespan of the network. Multi-hop communication and uneven clustering concepts are used to provide energy efficient transmission and routing. Improvements/Applications: The proposed work is developed to cover all these issues with the consideration of above mentioned parameters. Simulation results show the 10-15% improvement in lifetime of network and average delay.

A power efficient cluster-based routing algorithm for wireless sensor networks: Honeybees swarm intelligence based approach

The design of low-power scalable wireless sensor networks remains a key challenge of the research. Clustering and routing have been widely studied for extending the lifetime of a network, which is a critical issue in sensor networks. Routing involves non-negligible operations, which considerably affect the network lifetime and the throughput. The clustering technique with data aggregation on cluster heads has an influence on the overall performance of the network since it is favoring a maximum network lifetime. This paper presents a novel cluster-based routing protocol called ABC-SD. The proposed protocol exploits the biologically inspired fast and efficient searching features of the Artificial Bee Colony metaheuristic to build low-power clusters. For the choice of cluster heads, a multi-objective fitness function is designed by using a Linear Programming formulation. The routing problem is addressed by a cost-based function that makes a trade-off between the energy efficiency and the number of hops of the path. The clustering process is achieved at the Base Station with a centralized control algorithm, which exploits energy levels and the neighborhood information of location-unaware sensors. As for the routing of gathered data, it is realized in a distributed manner. Furthermore, unlike the existing protocols in the literature, a realistic energy model is adopted in the considered network model. The proposed protocol is intensively experimented with a number of topologies in various network scenarios and the results are compared with the well-known cluster-based routing protocols that include the swarm intelligence based protocols. The obtained results demonstrate the effectiveness of the proposed protocol in terms of network lifetime, network coverage and the amount of packets delivered to the Base Station.

A New Routing Algorithm for Hierarchical Wireless Sensor Networks

Wireless sensor networks (WSNs) have become an interesting area to researchers in recent years due to the lowcost of sensor nodes, wide application areas and with low or no cost of maintenance after deployment in a target area. In some sensor system applications, the nodes are hard to reach and it is impossible to replace their batteries. So the nodes must operate without battery replacement for a long time. Such conditions make the system power consumption a very crucial parameter. Thus, Clustering is an energy efficient way that divides sensor nodes into many clusters, each of which has a cluster head. In this paper a new cluster-based routing algorithm for hierarchical WSNs has been proposed to select an alternative node to get replaced in place of node which loses its energy such that it extends the lifetime of entire network and avoids data loss. The simulation results show that, for large scale WSNs, our proposed algorithm performs better than the typical existing routing algorithms in terms of network lifetime.

An Energy Aware Distributed Clustering Algorithm Using Fuzzy Logic for Wireless Sensor Networks with Non-uniform Node Distribution

Clustering routing protocols are more adequate for Wireless Sensor Networks (WSNs) due to the higher energy utilization rate and scalability. However, non-uniform node deployment makes the cluster-based routing protocols less efficient, since the energy consumption of the nodes is more imbalanced. In this paper, an Energy Aware Distributed Clustering using Fuzzy Logic (EADC-FL) routing algorithm is proposed for the network with non-uniform node distribution. EADC-FL selects the most appropriate nodes as the cluster heads to save more energy in data transmission phase. It considers the energy of the sensor nodes as the primary parameter to elect the candidate cluster heads. Afterwards, it takes into consideration the node degree and node centrality of the sensor nodes by using Fuzzy Logic to identify the final cluster heads. EADC-FL constructs the clusters in equal sizes to make the energy consumption of cluster members balanced and uses a cluster-based routing algorithm to balance the energy consumption among the cluster heads. Moreover, the proposed algorithm performs clustering on demand instead of each round in order to reduce the energy dissipation of the network due to the overhead of consecutive clustering phases. The results demonstrate that EADC-FL significantly decreases the energy consumption and extends the network lifetime of network with non-uniform node distribution .

A decentralized energy efficient hierarchical cluster-based routing algorithm for wireless sensor networks

Load balancing using clustering method is one of the most practical solutions, regarding to energy limitation in wireless sensor networks. Clustering protocols have to ensure reliability and connectivity in WSNs even in large scale environments. In this paper, a new decentralized hierarchical cluster-based routing algorithm for WSNs is proposed. The most of energy consumption occurs due to transmission of messages, such as data and control packets. In our new approach clustering and multi hop routing algorithms are performing at the same stage to decrease control packets. According to non-uniform energy consumption among nodes, clusters are formed in such a way that cluster heads have the most competency in forwarding task of intra-cluster and inter-cluster transmission tree. Energy consumption, adjustment degree and the exact distance that each data traverses to reach the base station are three main adjustment parameters for cluster heads election. Simulation results show that the proposed protocol leads to reduction of sensor nodes’ energy consumption and prolongs the network lifetime, significantly.

Cluster-Based Context-Aware Routing Protocol for Mobile Environments

Mobile environment has many issues due to mobility, energy limitations and status changing over time. Routing method is an important issue and has a significant impact in mobile networks, whereas selecting the optimum routing path will reduce the wasting in network resources, reduce network overhead and increase network reliability and lifetime. To decide which path will achieve the networks objectives, we need to construct a new routing algorithm that uses context attributes of a mobile device such as available bandwidth, residual energy, connection number and mobility value. In this paper, we propose a new mobile nodes ranking scheme based on the combination of two multi-criteria decision making approaches, the analytic hierarchy process (AHP) and the technique for order performance by similarity to ideal solution (TOPSIS) in Fuzzy environments. The Fuzzy AHP is used to analyze the structure of the clusterhead selection problem and to determine weights of the criteria, while the Fuzzy TOPSIS method is used to obtain the final mobile node ranking value. By basing on node ranking, we propose a new cluster based routing algorithm select the optimal clusterheads and the best routing path. Our simulation results show that the proposed method increases the network accuracy and lifetime and reduces network overhead.

Comparison on Energy-efficient Cluster Based Routing Algorithms in Wireless Sensor Network

Abstract Wireless sensor networks(WSNs) nowadays considered as a hot research topic because of its wide range of applications in various fields. Recently, advancement in electronic communications has led to multi-purpose sensor nodes with low-cost and power consumption. Wireless sensor networks are composed of limited power sensors, which their power supply could not be replaced or recharged. So, less power consumption will increase the lifetime of these networks. Therefore, providing efficient routing algorithms with less energy consumption is desirable. Among many routing algorithms, approaches based on clustering, result less energy consumption. In this article, all well-known routing algorithms based on clustering which focus on saving energy got reviewed. Each algorithm is described in detail and its pros and cons are discussed explicitly. Then some important metrics such as scalability, message overhead and algorithm complexity are used for comparing cluster-based algorithms and give an insight to challenges in this field.

Fuzzy Weight Cluster-Based Routing Algorithm for Wireless Sensor Networks

Cluster-based protocol is a kind of important routing in wireless sensor networks. However, due to the uneven distribution of cluster heads in classical clustering algorithm, some nodes may run out of energy too early, which is not suitable for large-scale wireless sensor networks. In this paper, a distributed clustering algorithm based on fuzzy weighted attributes is put forward to ensure both energy efficiency and extensibility. On the premise of a comprehensive consideration of all attributes, the corresponding weight of each parameter is assigned by using the direct method of fuzzy engineering theory. Then, each node works out property value. These property values will be mapped to the time axis and be triggered by a timer to broadcast cluster headers. At the same time, the radio coverage method is adopted, in order to avoid collisions and to ensure the symmetrical distribution of cluster heads. The aggregated data are forwarded to the sink node in the form of multihop. The simulation results demonstrate that clustering algorithm based on fuzzy weighted attributes has a longer life expectancy and better extensibility than LEACH-like algorithms.

Zone-Based Routing Protocol for Wireless Sensor Networks.

Extensive research happening across the globe witnessed the importance of Wireless Sensor Network in the present day application world. In the recent past, various routing algorithms have been proposed to elevate WSN network lifetime. Clustering mechanism is highly successful in conserving energy resources for network activities and has become promising field for researches. However, the problem of unbalanced energy consumption is still open because the cluster head activities are tightly coupled with role and location of a particular node in the network. Several unequal clustering algorithms are proposed to solve this wireless sensor network multihop hot spot problem. Current unequal clustering mechanisms consider only intra- and intercluster communication cost. Proper organization of wireless sensor network into clusters enables efficient utilization of limited resources and enhances lifetime of deployed sensor nodes. This paper considers a novel network organization scheme, energy-efficient edge-based network partitioning scheme, to organize sensor nodes into clusters of equal size. Also, it proposes a cluster-based routing algorithm, called zone-based routing protocol (ZBRP), for elevating sensor network lifetime. Experimental results show that ZBRP out-performs interims of network lifetime and energy conservation with its uniform energy consumption among the cluster heads.

An Efficient Gateway Election Algorithm for Clusters in MANET

The dynamic nature of Mobile ad hoc network brought several constraints like scalability, robust connectivity, limited power constraints etc. Several cluster based routing algorithms have been proposed for large scale ad hoc networks. In cluster-based routing, the network is logically divided into groups called clusters. The aim of this grouping is to sustain a steady and effective network topology. The election of gateways during inter cluster routing is a critical issue. In this paper, an optimized gateway election algorithm, have been proposed which aims at minimizing the control overhead required in the set up and maintenance of the network, while maintaining robust connectivity. This technique is a unique way of addressing the issues of dynamic adaptation through a hierarchical cluster based approach along with Virtual Identifier. The simulation results show that the proposed technique gives better performance over various gateway election algorithms in terms of packet delivery ratio, routing overhead, end to end delay, and throughput. General Terms Clustering, gateway election

Clustering-based Routing Algorithm in Wireless Sensor Networks with Mobile Sink

Most of the existing data gathering strategies are based on the structure of stationary Sink in Wireless Sensor Networks, which will lead to rapidly energy consumption of sensor nodes near the sink for the reason that these nodes burden the data transmission from the whole network. This paper proposes a clustering-based routing algorithm in wireless sensor networks with mobile sink (CRA) to solve this kind of problem. In the CRA, sink node moves in a circle around the regional center and the circular area near this trajectory is set as buffer area, in which nodes are connected as backbone datalink. Data is transmitted to the annular buffer area and then reach the sink through the backbone datalink. This paper figures out the optimal location and size of the buffer area in order to minimize the average load of the nodes in the area. Furthermore, this paper proposes CRA-1, which improves the original algorithm by density controlling, for the purpose of balancing the energy consumption of the whole network

Cluster-Based Multipath Routing Algorithm of Ant Colony System for Wireless Sensor Networks

Due to the special demand of energy control and balancing the energy of nodes in wireless sensor networks，multipath routing based on ant colony system(MACS)was proposed. The algorithm utilizes the self-organization，self-adaptability and dynamic optimization capabilities of the ant colony to find the optimal routing and suboptimal routing from sources to Sink．Simulation results show the algorithm balances energy consumption of nodes and extends network lifetime effectively．

An Adaptive Energy Aware Clustering Based Reliable Routing for in-Network Aggregation in Wireless Sensor Network

Wireless Sensor Network (WSN) consists of spatially distributed autonomous devices that cooperatively sense physical or environmental conditions. Due to the non-uniform node deployment, the energy consumption among nodes are more imbalanced in cluster-based wireless sensor networks this factor will affect the network life time. Cluster-based routing and EADC algorithm through an efficient energy aware clustering algorithm is employed to avoid imbalance network distribution. Our proposed protocol EADC aims at minimizing the overall network overhead and energy expenditure associated with the multi hop data retrieval process while also ensuring balanced energy consumption among SNs and prolonged network life time .A optimal one-hop based selective node in building cluster structures consisted of member nodes that route their measured data to their assigned cluster head is identified to ensure efficient communication. The proposed routing algorithm increases forwarding tasks of the nodes in scarcely covered areas by forcing cluster heads to choose nodes with higher energy and fewer member nodes and finally, achieves imbalanced among cluster head and improve the network life time.

A Statistical Analysis and Temporary Cluster Based Routing Algorithm for Delay Tolerant Networks

Delay Tolerant Networks are characterized by frequent network topology partition, limited resource, extremely high latency, etc. Consequently successful deliveries of messages in such networks face great challenges. In this paper, by capturing the temporary clusters, we timely use the temporary end-to-end paths to directly and successfully deliver messages. Besides, by collecting a large number of encounter history information as the samples, we use the methods of statistical analysis to objectively and accurately evaluate encountered nodes, thus selecting fewer but better relay nodes to spread messages. Finally based on the above schemes, a Statistical Analysis and Temporary Cluster based routing algorithm (SATC) is proposed to improve the routing performance. Extensive simulations have been conducted and the results show that SATC can achieve a higher delivery ratio and a fewer hop count compared to Epidemic and PRoPHET. Furthermore, its overhead ratio is 70% and 65% less than Epidemic and PRoPHET respectively.

A QoS-aware routing algorithm based on ant-cluster in wireless multimedia sensor networks

QoS-aware routing algorithm is important in wireless multimedia sensor networks. This paper formulates a generalized QoS-aware routing model on the basis of multiple routing metrics and priorities of packets. We first introduce a 2D plain-based routing algorithm IPACR which improves the standard ant colony algorithm by optimizing the initial distribution of artificial pheromone in order to accelerate the algorithm convergence rate. Then a clustering-based routing algorithm ICACR is presented which can be well applied in a large scale network. ICACR is a variation of IPACR because it can be suitable for clustering cases to satisfy the larger scale situations. Both the numerical algorithm performance analysis and simulation of IPACR and ICACR are given. The results show that ICACR outperforms IPACR in terms of both network lifetime and QoS-aware routing metrics in large scale wireless multimedia sensor networks. Moreover, the simulation based on the real video traces shows that by extending the multi-path to ICACR for different priorities of video frames better performance can be achieved.

Time Synchronized High Performing Cluster-Based Routing Algorithm for Wireless Sensor Networks

In this paper, we investigated the data fusion routing algorithm and the time synchronization algorithm for the wireless sensor networks. First, we proposed a new data fusion routing algorithm - Low Energy Consumption Cluster-Based Routing Algorithm (LECCBRA). Simulation results show that the total energy can be effectively saved, and the balance in energy consumption between clusters can be achieved with LECCBRA, thus the network lifetime is extended. Second, we proposed a time synchronization algorithm - Clustering-based Time Synchronization (CBTS), which is suitable for LECCBRA. Performance analysis and simulation results show that the total energy can be effectively saved, and the accuracy can be improved.

A Survey of Cluster-based Routing Schemes for Wireless Sensor Networks

In recent times, wireless sensor networks (WSNs) have become progressively more attractive and have found their way into a wide variety of applications and systems because of their low cost, self-organizing behavior, and sensing ability in harsh environments. A WSN is a collection of nodes organized into a network. Routing is a vital technology in WSNs and can be roughly divided into two categories: flat routing and hierarchical routing. In a flat routing topology, all nodes have identical functionality and carry out the same task in the network. Nodes in a hierarchical topology do different tasks in WSNs and are usually arranged into clusters. In this paper, a survey on cluster-based routing schemes for WSNs has been done and comparisons made on the basis of performance factors such as latency, scalability, and energy awareness. Strengths and limitations of each scheme are presented, and open issues that must be addressed in the design of cluster-based routing algorithms are discussed.

A Cluster-based Routing Algorithm for WSN based on Residual Energy of the Nodes

Wireless sensor networks can be said as the latest development or improvement in the field of wireless communication. However the advantages of the WSN become limited due to the limited resources, especially low-capacity battery of the sensor nodes. Thus, energy aware routing is an important issue for prolonging the lifetime of the WSN. Among all the basic routing protocols based on the network structure, clustering algorithms have been the much researched upon because of their scalable and energy efficient nature. In this paper, a clustering routing algorithm has been proposed to increase the sensor network lifetime by choosing the cluster heads based on their residual energy and the distance between the cluster members and corresponding cluster heads.

Performance Evaluation of a Simple Cluster-Based Aggregation and Routing in Wireless Sensor Networks

In future ubiquitous networks, sensor nodes should collect various environmental data and parameters. Because sensor nodes tend to have small and often irreplaceable batteries with limited power capacity, energy-efficient aggregation and routing are essential to achieve to a prolonged network lifetime. We propose a simple cluster-based data aggregation and routing algorithm (SCAR) that decreases the incurred overhead during the selection of cluster heads in wireless sensor networks. The performance results show that SCAR can prolong network lifetime via energy conservation and achieve energy-balancing when nodes are fixed or have limited mobility.

LOAD BALANCING PROTOCOL FOR ENERGY ACCOMPLISHED ROUTING IN WSN

Wireless sensor networks (WSNs) have been considered as a promising method for reliably monitoring both civil and military environments under hazardous or dangerous conditions. Due to such environments ,the power supplies for sensors in the network are not usually rechargeable or replaceable. Therefore, the energy efficiency is critical for the lifetime and cost of WSN. Numerous mechanisms have been proposed to reduce the impact of communication protocols on the overall energy dissipation of WSN and communicating it with other nodes, moving on to the sink via transceiver. Efficiency of protocol can only be beneficial if the network is alive otherwise what to do for the novel ideas with the dead network. In this paper, Our proposed cluster based routing algorithm has exploited threshold level based load balancing and role transfer techniques along with multi-assistant cluster heads to cope with the aforementioned power hungry issues. Combination of multi hop and direct routing has improved our protocol energy utilization.