Routing Algorithm For Sensor Networks Research Articles

Active Trust and Fuzzy Logic Based Energy Aware Routing Algorithm for Wireless Sensor Networks

Active Trust and Fuzzy Logic Based Energy Aware Routing Algorithm for Wireless Sensor Networks

Fuzzy power‐optimised clustering routing algorithm for wireless sensor networks

Transmission power control is an effective method to reduce energy consumption for wireless sensor networks. However, the current algorithms of power control have relatively low accuracy. At the same time, the parameters cannot be adjusted dynamically. In order to improve the energy utilisation as well as data transmission efficiency and balance the load, therefore, a fuzzy power-optimised clustering routing algorithm is proposed in this study. The algorithm optimises the iteration radius and classifies the sensor nodes into different categories according to their node degree. Then select the cluster head by multi-parameter iteration adaptively among the same category, and optimise the cluster structure with a comprehensive consideration of parameters such as degree of centralisation, distance between node and base station and so on. Finally, fuzzy control is used to adjust the transmission power of cluster nodes dynamically to minimise the energy consumption. Simulation results show that when the average cluster radius , weight of election parameters , adjustment parameter of cluster radius , compared with other similar algorithms, the proposed algorithm prolongs the lifetime by at least 42.2% and increases the amount of data packets by at least 40.1%.

Energy-Aware Routing Algorithm for Wireless Sensor Networks with Optimal Relay Detecting

Efficient and reliable routing plays a key role in wireless sensor networks in which routing design with regard to network availability and node lifetime needs to be deliberately considered. When multi-hop relay transmission is frequently applied to reduce a source node's energy consumption and improve network capacity, a key issue affecting the nodes' participation in the transmission is the problem of suitably determining the next hop in order to prolong each node's lifetime and to maintain the energy-balancing of the whole network. In this study, we propose an energy-aware routing scheme by taking the Cauchy operator, node's residual energy and routing distance into account. Based on Cauchy inequation, we achieve a relationship between the routing distance and the energy usage in the routing. By fixing a relay selection parameter and then identifying the next hop appropriately, we obtain a balancing energy-aware routing algorithm. Numerical results are provided to verify the lifetime and equilibrium of the energy distribution by comparing with them with those of a traditional approach.

DUCR: Distributed unequal cluster‐based routing algorithm for heterogeneous wireless sensor networks

SummaryDesigning energy efficient communication protocols for wireless sensor networks (WSNs) to conserve the sensors' energy is one of the prime concerns. Clustering in WSNs significantly reduces the energy consumption in which the nodes are organized in clusters, each having a cluster head (CH). The CHs collect data from their cluster members and transmit it to the base station via a single or multihop communication. The main issue in such mechanism is how to associate the nodes to CHs and how to route the data of CHs so that the overall load on CHs are balanced. Since the sensor nodes operate autonomously, the methods designed for WSNs should be of distributed nature, i.e., each node should run it using its local information only. Considering these issues, we propose a distributed multiobjective‐based clustering method to assign a sensor node to appropriate CH so that the load is balanced. We also propose an energy‐efficient routing algorithm to balance the relay load among the CHs. In case any CH dies, we propose a recovery strategy for its cluster members. All our proposed methods are completely distributed in nature. Simulation results demonstrate the efficiency of the proposed algorithm in terms of energy consumption and hence prolonging the network lifetime. We compare the performance of the proposed algorithm with some existing algorithms in terms of number of alive nodes, network lifetime, energy efficiency, and energy population.

An Energy-Efficient Routing Algorithm in Three-Dimensional Underwater Sensor Networks Based on Compressed Sensing

Compressed sensing (CS) has become a powerful tool to process data that is correlated in underwater sensor networks (USNs). Based on CS, certain signals can be recovered from a relatively small number of random linear projections. Since the battery-driven sensor nodes work in adverse environments, energy-efficient routing well-matched with CS is needed to realize data gathering in USNs. In this paper, a clustering, uneven-layered, and multi-hop routing based on CS (CS-CULM) is proposed. The inter-cluster transmission and fusion are fulfilled by an improved LEACH protocol, then the uneven-layered, multi-hop routing is adopted to forward the packets fused to sink node for data reconstruction. Simulation results show that CS-CULM can achieve better performances in energy saving and data reconstruction.

An Optimal Clustering Routing Algorithm for Wireless Sensor Networks with Small-World Property

In the wireless sensor networks, deploying a small amount of heterogeneous nodes which directly communicate with the Sink node, can form shortcuts. The shortcuts can make the network to have small-world properties, which can save energy and improve network performance. In the large-scale networks, the optimal deployment of heterogeneous nodes is a NP-hard problem. Considering the total energy consumption of the network and the uniformity of each node energy consumption, this paper presents a clustering heterogeneous network routing algorithm which based on mixed integer programming (CHNMIP). Firstly, the algorithm supposes that the heterogeneous nodes can only be placed in the position of the common nodes and converts the optimal deployment of heterogeneous nodes into a mixed integer programming problem, and finds out the approximate optimal solution using Lagrangian relaxation and Benders decomposition algorithm. Then, it dynamically divides common nodes into clusters, and sets the appropriate transmission. Finally, it theoretically analyzes the performance of CHNMIP routing algorithm, and the simulation results also show that CHNMIP routing algorithm can better improve the network performance in different simulation environment.

Gravitation Theory Based Routing Algorithm for Active Wireless Sensor Networks

In order to guarantee the quality of service of various communication services as much as possible and reduce the energy consumption of the network, this paper proposes a routing algorithm for active wireless sensor networks by merging the spatial relationship and the traffic load of sensor nodes: based on the gravitation theory, the gravitation model of nodes is established, then the “space gravitation” considering the spatial relationship of nodes and the “time gravitation” which takes into account the waiting time of data packets are proposed. The gravitation is the result of the interaction of the two, which depends on the degree of dependence on the space gravitation or the time gravitation, the data packet is sent to the sink node under the influence of gravitation. In order to test the effectiveness of the algorithm, this paper analyzes the performance of the algorithm and compares it with other algorithms. The simulation results show that the algorithm can not only effectively avoid the congestion, but also satisfies the good network time delay and energy consumption demand.

A Dynamic Energy Savvy Routing Algorithm for Mobile Ad-Hoc and Sensor Networks

Mobile Ad-hoc and Sensor Networks (MASNETs) are energy constrained networks which have been the focus of many recent research and development efforts. In MASNETs, the network topologies are frequently change due to the moving sensor nodes that have low radio frequency coverage which make the design and implementation of a routing protocol in this networks very challenging. Thus, the Dynamic Energy Savvy (DES-AODV) routing algorithm is proposed to enhance the performance of Ad-hoc On Demand Distance Vector (AODV) by changing the routing metric from hop count to estimated distance that is based on the Received Signal Strength Indicator (RSSI) values. The performance of DES-AODV is evaluated and compared with the existing AODV in terms of the average percentage of packet loss and energy consumption with the density of mobile nodes. The simulation results show that the proposed DES-AODV outperforms the existing AODV in both percentage of packet loss and energy consumption. © 2017 American Scientific Publishers All rights reserved.

An Improved Ant Colony Algorithm in Wireless Sensor Network Routing

In order to make the energy consumption of network nodes relatively balanced, we apply ant colony optimization algorithm to wireless sensor network routing and improve it. In this paper, we propose a multi-path wireless sensor network routing algorithm based on energy equalization. The algorithm uses forward ants to find the path from the source node to the destination node, and uses backward ants to update the pheromone on the path. In the route selection, we use the energy of the neighboring nodes as the parameter of the heuristic function. At the same time, we construct the fitness function, and take the path length and the node residual energy as its parameters. The simulation results show that the algorithm can not only avoid the problem of local optimal solution, but also prolong the life cycle of the network effectively.

An Energy Aware Multipath Routing Algorithm for Wireless Sensor Networks

Wireless sensor network is a new field of computer science and technology research. It has a very broad application prospects. In order to improve the network survival time, it is very important to design efficient energy-constrained routing protocols. In this paper, we studied the characteristics of wireless sensor networks, and analyzed the design criteria of sensor network routing algorithms. In view of the shortcomings of traditional algorithms, we proposed an energy-aware multi-path algorithm. When selecting a data transmission path, the energy-aware multi-path algorithm can avoid nodes with low energy levels. At the same time, it takes the remaining energy of the node and the number of hops as one of the measures of the path selection. The multi-path routing algorithm realized the low energy consumption of the data transmission path, thus effectively prolonging the network lifetime. Compared with the traditional algorithm, the results show that our method has high reliability and energy efficiency.

A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks.

With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR). This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service.

Developing a Gradient-Based Clustering Algorithm for Energy-Efficient Routing in Wireless Sensor Networks

Appropriate clustering and routing algorithms in multi-hop wireless sensor networks considerably affect the energy consumption and prolong the network lifetime. Besides, the required inter-cluster communications in these networks may lead to imbalanced energy consumption among cluster-heads that in turn decreases the network lifetime. In this paper, a gradient-based clustering algorithm for energy-efficient routing (GCER) in wireless sensor networks is proposed. The main idea is based on partitioning the sensing region in such a way that the total energy consumption of the network is minimized. The algorithm uses unequal clustering structure which balances the energy consumption among the cluster-heads and lessens the effect of hotspot problem. Furthermore, a distributed protocol for choosing cluster-heads and routing is deployed to balance the energy among all sensor nodes. Simulation results show that the proposed scheme balances the energy consumption among the cluster-heads and increases the network lifetime compared to some recent reported clustering schemes in the literature.

On energy efficiency in underwater wireless sensor networks with cooperative routing

In this paper, we exploit cooperative communication for designing an energy-efficient routing algorithm in underwater wireless sensor networks (UWSNs). Each network node is equipped with a single omnidirectional antenna and multiple node coordinates while taking advantage of spatial diversity. This research work is limited in scope to amplify-and-forward (AF) scheme at the relay node and fixed ratio combining (FRC) strategy at the receiver node. Cooperative diversity at the physical layer and multi-hop routing at the network layer enable us to formulate minimum energy routing as a joint optimization of the transmission power at physical layer and link selection at the network layer. Simulations results show that our proposed cooperative energy-efficient routing for UWSN (Co-EEUWSN) performs better than the selected non-cooperative routing protocols (depth-based routing (DBR) and energy-efficient DBR (EEDBR)) and cooperative DBR (Co-DBR) in terms of packet delivery ratio, end-to-end delay, and energy efficiency.

An Energy Efficient Routing and Fault Tolerant Data Aggregation (EERFTDA) algorithm for wireless sensor networks

An Energy Efficient Routing and Fault Tolerant Data Aggregation (EERFTDA) algorithm for wireless sensor networks

A self-organised routing algorithm for cognitive radio-based wireless sensor networks using biologically-inspired method

Wireless sensor networks area collection of a large number of unattended sensor nodes. The sensor nodes are dynamically deployed in the region. In wireless sensor networks, the unlicensed sensor nodes use their temporarily available vacant licensed channels or spectrum band in a telecommunication network. The many open challenges with issues such as adaptive in self-organisation, fault-tolerance and network scalability with cooperative spectrum sensing and sharing are identifying new challenges in wireless sensor networks. In this paper, we proposed the bio-inspired adaptive routing algorithm for cognitive radio wireless sensor networks. The utilisation of the foraging approach of ANTs and BEEs for making the decision of using the available spectrum sensing and sharing of channels over multi-hops communication, provides the method to utilise idle channel and decrease the delay for communication in wireless sensor network. In this paper, we design the algorithm to solve the issue of wireless sensor network and performance of classical routing protocol LEACH and cognitive radio sensor networks (CRSN) evaluates the parameters which proof the self-organisation routing algorithm.

A self-organised routing algorithm for cognitive radio-based wireless sensor networks using biologically-inspired method

A self-organised routing algorithm for cognitive radio-based wireless sensor networks using biologically-inspired method

Effective Chain-Based Routing Algorithm for Wireless Sensor Networks

Wireless sensor networks (WSNs) are composed of many low cost, low power devices with sensing, local processing and wireless communication capabilities. Recent advances in wireless networks have led to many new protocols specifically designed for WSNs where energy awareness is an essential consideration. In this paper, we propose a new routing algorithm for WSNs called Chain-based Routing (CRA). CRA solves the main problems in Power Efficient Gathering in Sensor Information Systems (PEGASIS) algorithm. CRA minimizes the energy dissipation and maximizes the network lifetime of WSNs by introducing new chain construction method and new chain leader election algorithm. The simulation results show that our proposed algorithm outperforms the existing algorithms LEACH, PEGASIS, COSEN, and IECBSN in terms of network lifetime and energy consumption minimization.

A comparative study of chain based routing algorithms in wireless sensor networks

Many routing algorithms for Wireless Sensor Networks (WSNs) are designed and presented in the literature. The main target of these algorithms is to improve the performance of WSNs. In this paper, a comparative study of chain-based routing algorithms has been done. In this study, we compare the performances of PEGASIS [3], COSEN [6], IECBSN [8], CHAIN-BASED [15], CRA [12] and EAPHRN [9] algorithms when the mobile base station (BS) is used. We perform analytical simulations in terms of network lifetime and average energy consumption.

Multi-criteria Routing in a Partitioned Wireless Sensor Network

Energy efficiency is one of the key challenges for designing routing algorithms for wireless sensor networks (WSN). Fast data delivery from source node to sink node is also required for many applications. Sometimes data transmission towards the sink may be interrupted because of failure of nodes in a particular area. The various such requirements of routing data in a WSN are sometimes contradictory and routing algorithms must be designed keeping in mind all these requirements. In this paper three routing algorithms are proposed for multi-sink partitioned network. In these three algorithms, the source nodes or intermediate nodes select a next node to forward the data to the destination or sink. This process repeats until the data reaches the sink. In the first technique, the next node is chosen considering its distance from sink node as a criterion. In the second technique, remaining energy of the neighboring nodes is used as a criterion for selection of the next node. The combination of these two criteria is considered in the third technique and a multiple criteria decision analysis technique is used. A recovery technique from area failure is also proposed and incorporated in the above mentioned algorithms. The algorithms are designed and implemented in multi-sink environment for partitioned wireless sensor networks. Performances of the algorithms are studied in a simulation environment and compared with other well-known algorithms to understand their effectiveness.

Improved algorithm of cluster-based routing protocols for agricultural wireless multimedia sensor networks

Low Energy Adaptive Clustering Hierarchy (LEACH) is a routing algorithm in agricultural wireless multimedia sensor networks (WMSNs) that includes two kinds of improved protocol, LEACH_D and LEACH_E. In this study, obstacles were overcome in widely used protocols. An improved algorithm was proposed to solve existing problems, such as energy source restriction, communication distance, and energy of the nodes. The optimal number of clusters was calculated by the first-order radio model of the improved algorithm to determine the percentage of the cluster heads in the network. High energy and the near sink nodes were chosen as cluster heads based on the residual energy of the nodes and the distance between the nodes to the sink node. At the same time, the K-means clustering analysis method was used for equally assigning the nodes to several clusters in the network. Both simulation and the verification results showed that the survival number of the proposed algorithm LEACH-ED increased by 66%. Moreover, the network load was high and network lifetime was longer. The mathematical model between the average voltage of nodes (y) and the running time (x) was concluded in the equation y=−0.0643x+4.3694, and the correlation coefficient was R2=0.9977. The research results can provide a foundation and method for the design and simulation of the routing algorithm in agricultural WMSNs. Keywords: wireless sensor networks, routing protocol, LEACH algorithm, improved algorithm, cluster head, K-means clustering DOI: 10.3965/j.ijabe.20160904.2261 Citation: Zhang F, Liu H M, Wang J, Qiu Z M, Mao P J, Zhang Y K. Improved algorithm of cluster-based routing protocols for agricultural wireless multimedia sensor networks. Int J Agric & Biol Eng, 2016; 9(4): 132－140.