Energy‐efficient multihop routing in WSN using the hybrid optimization algorithm

The technical growth in the field of the wireless sensor networks (WSNs) has resulted in the process of collecting and forwarding the massive data between the nodes, which was a major challenge to the WSNs as it is associated with greater energy loss and delay. This resulted in the establishment of a routing protocol for the optimal selection of the multipath to progress the routing in WSNs. This paper proposes an energy‐efficient routing in WSNs using the hybrid optimization algorithm, cat–salp swarm algorithm (C‐SSA), which chooses the optimal hops in progressing the routing. Initially, the cluster heads (CHs) are selected using the low‐energy adaptive clustering hierarchy (LEACH) protocol that minimizes the traffic in the network. The CHs are engaged in the multihop routing, and the selection of the optimal paths is based on the proposed hybrid optimization, which chooses the optimal hops based on the energy constraints, such as energy, delay, intercluster distance, intracluster distance, link lifetime, delay, and distance. The simulation results prove that the proposed routing protocol acquired minimal delay of 0.3165 with 50 nodes and two hops, maximal energy of 0.1521 with 50 nodes and three hops, maximal number of the alive nodes as 39 with 100 nodes and two hops, and average throughput of 0.9379 with 100 nodes and three hops.     

An Improved Fuzzy Unequal Clustering Algorithm for Wireless Sensor Network

This paper introduces IFUC, which is an Improved Fuzzy Unequal Clustering scheme for large scale wireless sensor networks (WSNs).It aims to balance the energy consumption and prolong the network lifetime. Our approach focuses on energy efficient clustering scheme and inter-cluster routing protocol. On the one hand, considering each node’s local information such as energy level, distance to base station and local density, we use fuzzy logic system to determine each node’s chance of becoming cluster head and estimate the cluster head competence radius. On the other hand, we use Ant Colony Optimization (ACO) method to construct the energy-aware routing between cluster heads and base station. It reduces and balances the energy consumption of cluster heads and solves the hot spots problem that occurs in multi-hop WSN routing protocol to a large extent. The validation experiment results have indicated that the proposed clustering scheme performs much better than many other methods such as LEACH, CHEF and EEUC.     

An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks

In this paper we consider a multipath extension to the dynamic source routing (DSR) protocol proposed by Johnson and Maltz, an on-demand routing protocol for ad hoc wireless networks. This extension keeps two node-disjoint paths between the source and destination of a routing process without introducing extra overhead. Unlike other multipath extensions where node-disjoint paths are selected at the destination or at the reply phase, our approach generates two node-disjoint paths during the query phase of the route discovery process by restricting the way the query packet is flooded. Several optimization options are also considered. Simulation is conducted to determine the success rate of finding node-disjoint paths.     

IBLEACH: intra-balanced LEACH protocol 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. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of routing protocols for WSNs. In this paper, the low-energy adaptive clustering hierarchy (LEACH) routing protocol is considered and improved. We propose a clustering routing protocol named intra-balanced LEACH (IBLEACH), which extends LEACH protocol by balancing the energy consumption in the network. The simulation results show that IBLEACH outperforms LEACH and the existing improvements of LEACH in terms of network lifetime and energy consumption minimization.     

An Improved LEACH Routing Algorithm for Wireless Sensor Network

Optimization of energy consumption is major concern for the design and planning of wireless sensor networks (WSNs). Recent research has demonstrated that organizing nodes in clusters has higher energy efficiency. LEACH is the most popular routing protocol for cluster-based in WSNs, and FCM algorithm is used for the optimum number of the clusters and their location. Aiming at the shortcomings of LEACH and FCM-LEACH, which including inaccurate cluster centers, unreasonable clustering and sole data transmission mode. This paper proposes a new energy efficient routing algorithm (NF-LEACH). In the new algorithm, There are many factors have considered to prolong the network life cycle that they are the degree of membership, residual energy, base station distance and data transmission mode. Finally, the comparison among LEACH, FCM-LEACH, and NF-LEACH has been done. The results show that the NF-LEACH has the longest lifetime and the most evenly distributed amongst three algorithms.     

Energy Efficient QoS Aware Hierarchical KF-MAC Routing Protocol in Manet

The paper proposes an energy efficient quality of services (QoS) aware hierarchical KF-MAC routing protocol in mobile ad-hoc networks. The proposed KF-MAC (K-means cluster formation firefly cluster head selection based MAC routing) protocol reduces the concentration of QoS parameters when the node transmits data from source to destination. At first, K-means clustering technique is utilized for clustering the network into nodes. Then the clustered nodes are classified and optimized by the firefly optimization algorithm to find cluster heads for the clustered nodes. The transmission of data begins in the network nodes and TDMA based MAC routing does communication. The observation on KF-MAC protocol performs well for QoS parameters such as bandwidth, delay, bit error rate and jitter. The evaluation of proposed protocol based on a simulation study concludes that the proposed protocol provides a better result in contrast to the existing fuzzy based energy aware routing protocol and modified dynamic source routing protocol. With KF-MAC protocol, the collision free data transmission with low average energy consumption is achieved.     

Double Cluster Based Energy Efficient Routing Protocol for Wireless Sensor Network

Reducing the energy consumption of sensor nodes and prolonging the life of the network is the central topic in the research of wireless sensor network (WSN) protocol. The low-energy adaptive clustering hierarchy (LEACH) is one of the hierarchical routing protocols designed for communication in WSNs. LEACH is clustering based protocol that utilizes randomized rotation of local cluster-heads to evenly distribute the energy load among the sensors in the network. But LEACH is based on the assumption that each sensor nodes contain equal amount of energy which is not valid in real scenarios. A developed routing protocol named as DL-LEACH is proposed. The DL-LEACH protocol cluster head election considers residual energy of nodes, distance from node to the base station and neighbor nodes, which makes cluster head election reasonable and node energy consumption balance. The simulation results of proposed protocols are compared for its network life time in MATLAB with LEACH protocol. The DL-LEACH is prolong the network life cycle by 75 % than LEACH.     

Collaboration of Trusted Node and QoS Based Energy Multi Path Routing Protocol for Vehicular Ad Hoc Networks

In the recent past information transmission through the vehicular ad hoc network (VANET) playing a vital role due to increase in accident statistics. There are numerous networking and VANET protocols helpful to control the trust while transmitting the data from source to destination nodes in traffic environment. In spite of many existing protocols for analyzing the trust in the network, the challenge of routing overhead, high energy consumption and malicious attacks issues still continue in the communication. This research introduces the trust collaboration nodes and Quality of Service (QoS) with energy multipath routing protocol for transmitting the information through VANET. Initially, the trusted nodes have been collected for analyzing the neighbouring nodes and the information are transmitted using the proposed QoS based energy efficient multipath routing protocol. During this transmission, the multi path protocol eliminates the intermediate attacks effectively when compared with the other existing protocols. The Proposed protocol maintains the QoS while routing the information from source to destination and further the efficiency has been analyzed through simulation experiments and Montgomery multiplier based Elliptic Curve Cryptography (ECC) will be used in future for better security and privacy.     

A cluster‐based fault‐tolerant routing protocol for wireless sensor networks

Energy conservation and fault tolerance are two critical issues in the deployment of wireless sensor networks (WSNs). Many cluster‐based fault‐tolerant routing protocols have been proposed for energy conservation and network lifetime maximization in WSNs. However, these protocols suffer from high frequency of re‐clustering as well as extra energy consumption to tolerate failures and consider only some very normal parameters to form clusters without any verification of the energy sufficiency for data routing. Therefore, this paper proposes a cluster‐based fault‐tolerant routing protocol referred as CFTR. This protocol allows higher energy nodes to become Cluster Heads (CHs) and operate multiple rounds to diminish the frequency of re‐clustering. Additionally, for the sake to get better energy efficiency and balancing, we introduce a cost function that considers during cluster formation energy cost from sensor node to CH, energy cost from CH to sink, and another significant parameter, namely, number of cluster members in previous round. Further, the proposed CFTR takes care of nodes, which have no CH in their communication range. Also, it introduces a routing algorithm in which the decision of next hop CH selection is based on a cost function conceived to select routes with sufficient energy for data transfer and distribute uniformly the overall data‐relaying load among the CHs. As well, a low‐overhead algorithm to tolerate the sudden failure of CHs is proposed. We perform extensive simulations on CFTR and compare their results with those of two recent existing protocols to demonstrate its superiority in terms of different metrics.     

Fuzzy chessboard clustering and artificial bee colony routing method for energy‐efficient heterogeneous wireless sensor networks

Energy is an extremely critical resource for battery‐powered wireless sensor networks (WSNs), thus making energy‐efficient protocol design a key challenging problem. However, uneven energy consumption is an inherent problem in WSNs caused by multi‐hop routing and many‐to‐one traffic pattern among sensors. In this paper, we therefore propose a new clustering method called fuzzy chessboard clustering (FFC), which is capable to overcome the bottleneck problem and addressing the uneven energy consumption problem in heterogeneous WSNs. We also propose an energy‐efficient routing method called artificial bee colony routing method (ABCRM) to find the optimal routing path for the heterogeneous WSNs. ABCRM seeks to investigate the problems of balancing energy consumption and maximization of network lifetime. To demonstrate the effectiveness of FCC‐ABCRM in terms of lessening end‐to‐end delay, balancing energy consumption, and maximization of heterogeneous network lifetime, we compare our method with three approaches namely, chessboard clustering approach, PEGASIS, and LEACH. Simulation results show that the network lifetime achieved by FCC‐ABCRM could be increased by nearly 25%, 45%, and 60% more than that obtained by chessboard clustering, PEGASIS, and LEACH, respectively. Copyright © 2013 John Wiley & Sons, Ltd.     

AMR:一个基于网络最大流的Ad-Hoc多路径路由算法

移动Ad-Hoc网路研究中,路由是一个关键问题.现有的Ad-Hoc路由算法大多为单路径算法.但是多路径方法可以更好地支持QoS,最近也受到较大关注.在没有精确的网络拓扑结构情况下,找出多条不相交路径是比较困难的.本文提出了一个基于网络最大流的Ad-Hoc多路径路由算法AMR(Aggregated multipath routing).该算法可以有效地找出多条节点不相交的路径,较大幅度地提高网络传输性能、减少网络拥塞.经过性能测试,表明AMR算法比DSR算法在数据传输率方面提高20%—60%,端对端平均延迟降低40%—60%.     

MiniTE: data acquisition routing for wireless sensor networks

Routing is one of the most important supporting parts in wireless sensor networks (WSNs) application that directly affects the application efficiency. Routing time and energy consumption are two major factors used to evaluate WSNs routing. This article proposes a minimum routing time and energy consumption (MiniTE) routing, which can ensure feasibility of the routing protocol both in routing time and energy consumption. Based on the MiniTE, WSNs can be partitioned into different regions according to the received signal strength indication (RSSI). Messages are sent by nodes in the region to their parent node and again up to their parent node until finally to the sink node. Theoretic evaluation and simulation results are given to verify the features of the protocol.     

Flower pollination algorithm‐based energy‐efficient stable clustering approach for WSNs

The advances in the size, cost of deployment, and user‐friendly interface of wireless sensor devices have given rise to many wireless sensor network (WSN) applications. WSNs need to use protocols for transmitting data samples from event regions to sink through minimum cost links. Clustering is a commonly used method of data aggregation in which nodes are organized into groups to reduce energy consumption. Nonetheless, cluster head (CH) has to bear an additional load in clustering protocols to organize different activities within the cluster. Proper CH selection and load balancing using efficient routing protocol is therefore a critical aspect for WSN's long‐term operation. In this paper, a threshold‐sensitive energy‐efficient cluster‐based routing protocol based on flower pollination algorithm (FPA) is proposed to extend the network's stability period. Using FPA, multihop communication between CHs and base station is used to achieve optimal link costs for load balancing distant CHs and energy minimization. Analysis and simulation results show that the proposed algorithm significantly outperforms competitive clustering algorithms in terms of energy consumption, stability period, and system lifetime.     

DACOR: A distributed ACO-based routing protocol for mitigating the hot spot problem in fog-enabled WSN architecture

Ant colony optimization (ACO) and unequal clustering algorithms in wireless sensor networks (WSNs) prove their efficiency in protracting the network lifetime. However, the existing ACO and unequal clustering algorithms, respectively, do not consider jointly energy efficiency and reliability and focus only on some normal parameters to adjust the cluster radius, then neglecting the cluster head (CH) neighborhood information as it is wise to reduce the cluster radius when there are more neighbor CHs in order to balance the load and energy consumption. To resolve these problems, we propose a fault-tolerant distributed ACO-based routing (DACOR) protocol for mitigating the hot spot problem in fog-enabled WSN architecture. To improve the performance of the network, we propose a multiple fog nodes (FNs) and unequal clustering-based network model. The proposed model is energy efficient as it avoids repetitive clustering and affects CHs to FNs based on distance. Also, unlike the existing works which use either single FN/sink-based unequal clustering or multiple FNs/sinks to mitigate hot spot problem, we propose to distribute unequal clustering to multiple FNs (partitions). Additionally, we formulate a different rule to calculate the cluster radius based on significant parameters ensuring energy efficiency and balancing. To route data from source to destination, we devise a new probabilistic formula which considers not only energy efficiency but also reliability. The performance of the proposed DACOR protocol has been investigated under different scenarios through simulations. The results show that the proposed DACOR protocol outperforms the existing protocols in terms of various main metrics.     

PRIN: A Priority-Based Energy Efficient MAC Protocol for Wireless Sensor Networks Varying the Sample Inter-Arrival Time

Wireless sensor networks (WSNs) are used in a variety of applications to sense and transfer information to the centralized node with energy efficiency increasing the network’s lifespan. Other factors, such as quality of service (QoS) is also important to improve the performance of the WSNs, by increasing throughput and reducing end-to-end delay. In this paper, we evaluate the importance of QoS in the Medium Access Control (MAC) protocol for WSNs using different metrics and parameters such as energy efficiency, throughput, delay, and the network lifespan. We propose a new QoS MAC protocol, “PRIority in Node” (PRIN), using static priority in the source and the intermediate node and priority among the node which is one hop from the sink node to achieve QoS in WSNs. Simulation results are compared with those of the synchronous MAC protocol in terms of QoS parameters to show the improved performance of the proposed MAC protocol.     

A Centralized Balance Clustering Routing Protocol for Wireless Sensor Network

Routing protocol plays a role of great importance in the performance of wireless sensor networks (WSNs). A centralized balance clustering routing protocol based on location is proposed for WSN with random distribution in this paper. In order to keep clustering balanced through the whole lifetime of the network and adapt to the non-uniform distribution of sensor nodes, we design a systemic algorithm for clustering. First, the algorithm determines the cluster number according to condition of the network, and adjusts the hexagonal clustering results to balance the number of nodes of each cluster. Second, it selects cluster heads in each cluster base on the energy and distribution of nodes, and optimizes the clustering results to minimize energy consumption. Finally, it allocates suitable time slots for transmission to avoid collision. Simulation results demonstrate that the proposed protocol can balance the energy consumption and improve the network throughput and lifetime significantly.     

Load balancing clustering and routing for IoT-enabled wireless sensor networks

Internet of things (IoT) devices are equipped with a number of interconnected sensor nodes that relies on ubiquitous connectivity between sensor devices to optimize information automation processes. Because of the extensive deployments in adverse areas and unsupervised nature of wireless sensor networks (WSNs), energy efficiency is a significant aim in these networks. Network survival time can be extended by optimizing its energy consumption. It has been a complex struggle for researchers to develop energy-efficient routing protocols in the field of WSNs. Energy consumption, path reliability and Quality of Service (QoS) in WSNs became important factors to be focused on enforcing an efficient routing strategy. A hybrid optimization technique presented in this paper is a combination of fuzzy c-means and Grey Wolf optimization (GWO) techniques for clustering. The proposed scheme was evaluated on different parameters such as total energy consumed, packet delivery ratio, packet drop rate, throughput, delay, remaining energy and total network lifetime. According to the results of the simulation, the proposed scheme improves energy efficiency and throughput by about 30% and packet delivery ratio and latency by about 10%, compared with existing protocols such as Chemical Reaction Approach based Cluster Formation (CHRA), Hybrid Optimal Based Cluster Formation (HOBCF), GWO-based clustering (GWO-C) and Cat Swarm Optimization based Energy-Efficient Reliable sectoring Scheme with prediction algorithms (P_CSO_EERSS). The study concludes that the protocol suitable for creating IoT monitoring system network lifetime is an important criteria.     

Upstream congestion control in wireless sensor networks through cross-layer optimization

Congestion in wireless sensor networks not only causes packet loss, but also leads to excessive energy consumption. Therefore congestion in WSNs needs to be controlled in order to prolong system lifetime. In addition, this is also necessary to improve fairness and provide better quality of service (QoS), which is required by multimedia applications in wireless multimedia sensor networks. In this paper, we propose a novel upstream congestion control protocol for WSNs, called priority-based congestion control protocol (PCCP). Unlike existing work, PCCP innovatively measures congestion degree as the ratio of packet inter-arrival time along over packet service time. PCCP still introduced node priority index to reflect the importance of each sensor node. Based on the introduced congestion degree and node priority index, PCCP utilizes a cross-layer optimization and imposes a hop-by-hop approach to control congestion. We have demonstrated that PCCP achieves efficient congestion control and flexible weighted fairness for both single-path and multi-path routing, as a result this leads to higher energy efficiency and better QoS in terms of both packet loss rate and delay.     

A Genetic‐Algorithm‐Based Optimized Clustering for Energy‐Efficient Routing in MWSN

With the increasing demands for mobile wireless sensor networks in recent years, designing an energy‐efficient clustering and routing protocol has become very important. This paper provides an analytical model to evaluate the power consumption of a mobile sensor node. Based on this, a clustering algorithm is designed to optimize the energy efficiency during cluster head formation. A genetic algorithm technique is employed to find the near‐optimal threshold for residual energy below which a node has to give up its role of being the cluster head. This clustering algorithm along with a hybrid routing concept is applied as the near‐optimal energy‐efficient routing technique to increase the overall efficiency of the network. Compared to the mobile low energy adaptive clustering hierarchy protocol, the simulation studies reveal that the energy‐efficient routing technique produces a longer network lifetime and achieves better energy efficiency.     

基于BWAS的无线传感器网络静态分簇路由算法

为提高路径搜索效率,避免动态分簇较多的能量消耗,提出了基于最优-最差蚂蚁系统(BWAS)的无线传感器网络静态分簇路由算法.BWAS是对蚁群算法的改进,在路径搜寻过程中评价出最优最差蚂蚁,引入奖惩机制,加快了路径搜索速度.通过无线传感器网络静态分簇、簇内动态选举簇头,在簇头节点间运用BWAS算法搜寻从簇头节点到汇聚节点的多跳最优路径,能减少路径寻优能量消耗,实现均衡能量管理,延长网络寿命,且具有较强的鲁棒性.通过与基于BWAS的动态分簇和基于蚁群算法的动态分簇路由的仿真实验相比较,证实了本算法的有效性.