Clustering routing protocol based on improved PSO algorithm in WSN

Aiming at the problem that the location distribution of cluster head nodes filtered by wireless sensor network clustering routing protocol was unbalanced and the data transmission path of forwarding nodes was unreasonable,which would increase the energy consumption of nodes and shorten the network life cycle,a clustering routing protocol based on improved particle swarm optimization algorithm was proposed.In the process of cluster head election,a new fitness function was established by defining the energy factor and position equalization factor of the node,the better candidate cluster head node was evaluated and selected,the position update speed of the candidate cluster head nodes was adjusted by the optimized update learning factor,the local search and speeded up the convergence of the global search was expanded.According to the distance between the forwarding node and the base station,the single-hop or multi-hop transmission mode was adopted,and a multi-hop method was designed based on the minimum spanning tree to select an optimal multi-hop path for the data transmission of the forwarding node.Simulation results show that the clustering routing protocol based on improved particle swarm optimization algorithm can elect cluster head nodes and forwarding nodes with more balanced energy and location,which shortened the communication distance of the network.The energy consumption of nodes is lower and more balanced,effectively extending the network life cycle.     

A simple void node and loop‐free three‐dimensional routing protocol for multi‐hop wireless networks

Wireless networks are now very essential part for modern ubiquitous communication systems. The design of efficient routing and scheduling techniques for such networks have gained importance to ensure reliable communication. Most of the currently proposed geographic routing protocols are designed for 2D spatial distribution of user nodes, although in many practical scenarios user nodes may be deployed in 3D space also. In this paper, we propose 3D routing protocols for multihop wireless networks that may be implemented in two different ways depending on how the routing paths are computed. When the routing paths to different user nodes from the base station in the wireless network are computed by the base station, we call it centralized protocol (3DMA‐CS). A distributed routing (3DMA‐DS) protocol is implemented when respective routing path of each user node to the base station is computed by the user node. In both of these protocols, the user (base station) selects the relay node to forward packets in the direction of destination, from the set of its neighbours, which makes minimum angle with the reference line drawn from user (base station) to the base station (user), within its transmission range. The proposed protocols are free from looping problem and can solve the void node problem (VNP) of multihop wireless networks. Performance analysis of the proposed protocol is shown by calculating end‐to‐end throughput, average path length, end‐to‐end delay, and energy consumption of each routing path through extensive simulation under different network densities and transmission ranges.     

Adaptive energy aware cluster-based routing protocol for wireless sensor networks

Wireless sensor networks (WSNs) have grown excessively due to their various applications and low installation cost. In WSN, the main concern is to reduce energy consumption among nodes while maintaining timely and reliable data forwarding. However, most of the existing energy aware routing protocols incur unbalanced energy consumption, which results in inefficient load balancing and compromised network lifetime. Therefore, the main target of this research paper is to present adaptive energy aware cluster-based routing (AECR) protocol for improving energy conservation and data delivery performance. Our proposed AECR protocol differs from other energy efficient routing schemes in some aspects. Firstly, it generates balance sized clusters based on nodes distribution and avoids random clusters formation. Secondly, it optimizes both intra-cluster and inter-cluster routing paths for improving data delivery performance while balancing data traffic on constructed forwarding routes and at the end, in order to reduce the excessive energy consumption and improving load distribution, the role of Cluster Head (CH) is shifted dynamically among nodes by exploit of network conditions. Simulation results demonstrate that AECR protocol outperforms state of the art in terms of various performance metrics.

     

Fuzzy-Based Secure Authentication and Clustering Algorithm for Improving the Energy Efficiency in Wireless Sensor Networks

Wireless Sensor Networks are categorized by the improved energy consumption parameters. The nodes are deployed in challenging surroundings and they are not communicated for a long time with lacking of energy level. These kinds of nodes will be the victim of security attacks, the conciliation nodes are guided all the data packets send to the base station of the network. In this paper proposes, The Fuzzy-based Secured Authentication and Clustering (FSAC) Algorithm observes the different kinds of the data packets transmitted within the sensors to avoid the attacks. The FSAC is implemented to use the proficient routing path to diminish the energy consumption. This method finds the adjacent transmitting node to improve the proficient path setup for the data packet routing using the fuzzy logic method. The simulation results specify that the proposed method increases the energy up to 12% compared to the related methods.

     

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.     

An improved cluster formation process in wireless sensor network to decrease energy consumption

Wireless sensor network has special features and many applications, which have attracted attention of many scientists. High energy consumption of these networks, as a drawback, can be reduced by a hierarchical routing algorithm. The proposed algorithm is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) and Quadrant Cluster based LEACH (Q-LEACH) protocols. To reduce energy consumption and provide a more appropriate coverage, the network was divided into several regions and clusters were formed within each region. In selecting the cluster head (CH) in each round, the amount of residual energy and the distance from the center of each node were calculated by the base station (including the location and residual energy of each node) for all living nodes in each region. In this regard, the node with the largest value had the highest priority to be selected as the CH in each network region. The base station calculates the CH due to the lack of energy constraints and is also responsible for informing it throughout the network, which reduces the load consumption and tasks of nodes in the network. The information transfer steps in this protocol are similar to the LEACH protocol stages. To better evaluate the results, the proposed method was implemented with LEACH LEACH-SWDN, and Q-LEACH protocols using MATLAB software. The results showed better performance of the proposed method in network lifetime, first node death time, and the last node death time.

     

Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios

Disasters create emergency situations and the services provided must be coordinated quickly via a communication network. Mobile adhoc networks (MANETs) are suited for ubiquitous communication during emergency rescue operations, since they do not rely on infrastructure. The route discovery process of on-demand routing protocols consumes too much bandwidth due to high routing overhead. Frequent route changes also results in frequent route computation process. Energy efficiency, quick response time, and scalability are equally important for routing in emergency MANETs. In this paper, we propose an energy efficient reactive protocol named Weighted-CDSR for routing in such situations. This protocol selects a subset of network nodes named Maximum Weighted Minimum Connected Dominating Set (MWMCDS) based on weight, which consists of link stability, mobility and energy. The MWMCDS provides the overall network control and data forwarding support. In this protocol, for every two nodes u and v in the network there exists a path between u and v such that all intermediate nodes belong to MWMCDS. Incorporating route stability into routing reduces the frequency of route failures and sustains network operations over an extended period of time. With fewer nodes providing overall network control and data forwarding support, the proposed protocol creates less interference and consumes less energy. The simulation results show that the proposed protocol is superior to other protocols in terms of packet delivery ratio, control message overhead, transmission delay and energy consumption.     

A Novel Energy Efficient and Lifetime Maximization Routing Protocol in Wireless Sensor Networks

The energy consumption is a key design criterion for the routing protocols in wireless sensor networks (WSN). Some of the conventional single path routing schemes may not be optimal to maximize the network lifetime and connectivity. Thus, multipath routing schemes is an optimal alternative to extend the lifetime of WSN. Multipath routing schemes distribute the traffic across multiple paths instead of routing all the traffic along a single path. In this paper, we propose a multipath Energy-Efficient data Routing Protocol for wireless sensor networks (EERP). The latter keeps a set of good paths and chooses one based on the node state and the cost function of this path. In EERP, each node has a number of neighbours through which it can route packets to the base station. A node bases its routing decision on two metrics: state and cost function. It searches its Neighbours Information Table for all its neighbours concerned with minimum cost function. Simulation results show that our EERP protocol minimizes and balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime.     

Survey on Wireless Sensor Network Applications and Energy Efficient Routing Protocols

Wireless sensor network (WSN) is a group of small power-constrained nodes that sense data and communicate it to the base station (BS). These nodes cover a vast region of interest (ROI) for several purposes according to the application need. The first challenge encountered in WSNs is how to cover the ROI perfectly and send the monitored data to the BS. Although the energy introduced during setup phase and the violation of energy fairness constraint of dynamic routing topologies, they achieve high network performance in terms of coverage and connectivity. In this paper, we categorize the applications of WSN based on different aspects to show the major protocol design issues. Thus, the energy efficiency of the recent proactive routing protocols is studied from different angles. The energy overhead and energy fairness of each protocol were carefully analyzed. The most energy efficient routing protocols for homogeneous proactive networks were studied and compared to highlight the research challenges and existing problems in this area. The results proved that energy overhead and route selection are the most effective aspects of network lifetime and network efficiency.

     

A quadtree-based hierarchical data dissemination for mobile sensor networks

The envisioned sensor network architecture where some of the nodes may be mobile poses several new challenges to this special type of ad hoc wireless network. Recently, researchers have proposed several data dissemination protocols based on either some hierarchical structure mainly constructed by a source node or source/sink oriented dissemination tree to support mobile sinks. However, such a source-initiated hierarchical structure results in significant resource consumption as the number of source-sink pairs are increased. Additionally, stimulus mobility aggravates the situation, where several sources may build a separate data forwarding hierarchy along the stimulus moving path. In this paper, we propose a new data dissemination protocol that exploits “Quadtree-based network space partitioning” to provide more efficient routing among multiple mobile stimuli and sink nodes. A common hierarchy of cluster-head nodes is constructed where the data delivery to mobile sinks is independent of the current position of mobile stimuli. Therefore, the overhead needed for hierarchy (route) maintenance is lower. Simulation results show that our work significantly reduces average energy consumption while maintaining comparably higher data delivery ratio.     

Optimal Query-Driven Data Forwarding for Delay-Sensitive Wireless Sensor Networks

Most of existing works on the topic of real-time routing for wireless sensor networks suffer from void forwarding paths (cannot reach the destination, but have to backtrack) and time overhead of handling isolated nodes. Designing a desired real-time data forwarding protocol as well as achieving a good tradeoff between real time and energy efficiency (as well as energy balance) for delay-sensitive wireless sensor networks remains a crucial and challenging issue. In this paper, we propose an optimal query-driven data forwarding framework that each sensor gets its optimal data forwarding paths (directed acyclic graphs) based on the query messages flooded by the base station without extra overhead. Furthermore, First Forwarding Nodes and Second Forwarding Nodes schemes are developed for data forwarding. In addition, two greedy distributed data forwarding algorithms are provided base on hybrid link cost model trying to achieve energy balance and congestion avoidance in data forwarding. Our framework is fully distributed and practical to implement, as well as robust and scalable to topological changes. The extensive simulations show that our framework has significantly outperformed the existing routing protocols in terms of real time and energy efficiency.     

An Optimal Emperor Penguin Optimization Based Enhanced Flower Pollination Algorithm in WSN for Fault Diagnosis and Prolong Network Lifespan

With unmanned aerial vehicles (UAVs) being widely used, the rapidly changing network topology and vertical height changes of UAVs have been bottlenecks for many wild applications, such as battlefield communication. These problems lead to the frequent communication interruptions and poor stability of 3D UAV networks. Facing these challenges, we propose deep neural network routing (DNNR) that is characterized by a dynamic 3D two-subspace division (i.e., vertical-axis cylinder and horizontal-plane divisions) and deep neural network (DNN) forwarding. With the trajectories of base station and nodes changing, vertical-axis cylinder and horizontal-plane divisions also change dynamically according to the broadcast information. Different from multi subspace division, this kind of two subspace divisions could reduce the complexity of routing discovery and make full use of the dynamic adaptability of 3D space division against the rapidly changing network topology. Due to the DNN flexibility, DNN forwarding is a promising scheme to improve the probability of recognizing the available links and select the rational next-hop node. We implement four compared protocols and DNNR in NS3 network simulator and test them for various application scenarios, when changing base station speed, node speed, horizontal plane size, and vertical height. Comparing with four protocols, DNNR achieves better performance in terms of packet delivery rate and energy-saving performance. These indicate that 3D space division is a concise and feasible scheme in flight ad hoc networks which may be extended to other fields. Besides, owing to the flexibility and prevalent availability, machine learning routing protocols are becoming a popular technology.

     

基于CMRA路由协议改进算法

为了延长无线传感网络的生存时间,需要设计满足高效率、低功耗的路由算法。一种CMRA（intercluster head multi-hop routing algorithm）算法被提出来,这种算法通过节点通信能量消耗模型建立最小能量路径树,但CMRA对于簇头选择的能量分配不均衡,造成簇头结点负载过重。提出一种新的路由算法CMRA-EE（CMRA-energy efficient）,在簇头选举阶段引入节点能量参数,同时将簇头节点能量与距离作为代价参数,从而平衡了网络节点能耗。通过仿真对CMRA-EE算法进行性能分析与评价,结果显示,CMRA-EE算法在延长无线传感网有效生存时间方面比CMRA算法有了明显的改善。     

An energy-aware routing protocol for wireless sensor network based on genetic algorithm

Energy saving and effective utilization are an essential issue for wireless sensor network. Most previous cluster based routing protocols only care the relationship of cluster heads and sensor nodes but ignore the huge difference costs between them. In this paper, we present a routing protocol based on genetic algorithm for a middle layer oriented network in which the network consists of several stations that are responsible for receiving data and forwarding the data to the sink. The amount of stations should be not too many and not too few. Both cases will cause either too much construction cost or extra transmission energy consumption. We implement five methods to compare the performance and test the stability of our presented methods. Experimental results demonstrate that our proposed scheme reduces the amount of stations by 36.8 and 20% compared with FF and HL in 100-node network. Furthermore, three methods are introduced to improve our proposed scheme for effective cope with the expansion of network scale problem.     

A Privacy Protection Strategy for Source Location in WSN Based on Angle and Dynamical Adjustment of Node Emission Radius

We propose two novel methods to improve the source location privacy security protection and the node energy utilization in Wireless sensor networks (WSN).A privacy preservation protocol for source location in WSN based on angles(APS) and an Enhanced protocol for source location (EAPS),which dynamically adjusts emission radius during routing.The APS protocol produces geographically dispersed phantom source nodes and utilizes the energy from the energy-abundant regions to make the routing path versatile among the entire network.In the EAPS protocol,according to the number of its own adjacent nodes,residual energy and the distance to the base station,a node adjusts its radius adaptively.Experiments show that the two novel protocols can improve the security and take advantage of the residual energy in the network balance the network life and energy consumption in comparison with the existing routing protocols based on the phantom sources.     

Actor-oriented directional anycast routing in wireless sensor and actor networks with smart antennas

Current routing protocols in wireless sensor and actor networks (WSANs) shows a lack of unification for different traffic patterns because the communication for sensor to actor and that for actor to actor are designed separately. Such a design poses a challenge for interoperability between sensors and actors. With the presence of rich-resource actor nodes, we argue that to improve network lifetime, the problem transforms from reducing overall network energy consumption to reducing energy consumption of constrained sensor nodes. To reduce energy consumption of sensor nodes, especially in challenging environments with coverage holes/obstacles, we propose that actor nodes should share forwarding tasks with sensor nodes. To enable such a feature, efficient interoperability between sensors and actors is required, and thus a unified routing protocol for both sensors and actors is needed. This paper explores capabilities of directional transmission with smart antennas and rich-resource actors to design a novel unified actor-oriented directional anycast routing protocol (ADA) which supports arbitrary traffic in WSANs. The proposed routing protocol exploits actors as main routing anchors as much as possible because they have better energy and computing power compared to constraint sensor nodes. In addition, a directional anycast routing approach is also proposed to further reduce total delay and energy consumption of overall network. Through extensive experiments, we show that ADA outperforms state-of-the-art protocols in terms of packet delivery latency, network lifetime, and packet reliability. In addition, by offer fault tolerant features, ADA also performs well in challenging environments where coverage holes and obstacles are of concerns.     

An Energy-Aware Routing Protocol for Mobile Ad Hoc Networks Based on Route Energy Comprehensive Index

The design of energy-aware routing protocols has always been an important issue for mobile ad hoc networks (MANETs), because reducing the network energy consumption and increasing the network lifetime are the two main objectives for MANETs. Hence, this paper proposes an energy-aware routing protocol that simultaneously meets above two objectives. It first presents Route Energy Comprehensive Index (RECI) as the new routing metric, then chooses the path with both minimum hops and maximum RECI value as the route in route discovery phase, and finally takes some measures to protect the source nodes and the sink nodes from being overused when their energies are low so as to prolong the life of the corresponding data flow. Simulation results show that the proposed protocol can significantly reduce the energy consumption and extend the network lifetime while improve the average end-to-end delay compared with other protocols.     

A reliable and energy‐efficient routing protocol for underwater wireless sensor networks

Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention to support various applications for pollution monitoring, tsunami warnings, offshore exploration, tactical surveillance, etc. However, because of the peculiar characteristics of UWSNs, designing communication protocols for UWSNs is a challenging task. Particularly, designing a routing protocol is of the most importance for successful data transmissions between sensors and the sink. In this paper, we propose a reliable and energy‐efficient routing protocol, named R‐ERP²R (Reliable Energy‐efficient Routing Protocol based on physical distance and residual energy). The main idea behind R‐ERP²R is to utilize physical distance as a routing metric and to balance energy consumption among sensors. Furthermore, during the selection of forwarding nodes, link quality towards the forwarding nodes is also considered to provide reliability and the residual energy of the forwarding nodes to prolong network lifetime. Using the NS‐2 simulator, R‐ERP²R is compared against a well‐known routing protocol (i.e. depth‐based routing) in terms of network lifetime, energy consumption, end‐to‐end delay and delivery ratio. The simulation results proved that R‐ERP²R performs better in UWSNs.Copyright © 2012 John Wiley & Sons, Ltd.     

Congestion Aware Geographic Routing Protocol for Wireless Ad Hoc and Sensor Networks

Geographic routing protocols forward packets according to the geographical locations of nodes. Thus, the criteria used to select a forwarding node impacts on the performance of the protocols such as energy efficiency and end-to-end transmission delay. In this paper, we propose a congestion aware forwarder selection (CAFS) method for a geographic routing protocol. To design CAFS, we devise a cost function by combining not only the forward progress made to a packet but also the amount of energy required for packet forwarding, forwarding direction, and congestion levels of potential forwarders. Among the potential forwarders, CAFS selects the next forwarder having the minimum cost. In our simulation studies, we compare the performance of CAFS with those of the maximum progress (MP) method and the cost over progress (CoP) method in various network conditions. The results show that compared with MP, the length of a routing path in terms of the number of hops becomes longer when CAFS is used. However, the shorter hop distance helps to avoid unnecessary retransmissions caused by packet loss in a wireless channel. In addition, since CAFS considers congestion levels of candidate forwarders, it reduces the queuing delay in each forwarder. Therefore, CAFS is superior to the MP and the CoP in terms of the energy consumption, end-to-end packet transfer delay, and the successful packet delivery rate.     

Distributed and Energy Efficient Self-Organization for On–Off Wireless Sensor Networks

In this paper, we utilize clustering to achieve energy efficiency for the on–off wireless sensor network, whose member nodes alternate between active and inactive states. In the proposed Distributed and Energy Efficient Self Organization (DEESO) scheme, the head election is adjusted adaptively to the remaining battery levels of local active nodes, which is a completely distributed approach compared to LEACH that relying on other routing schemes to access global information. Furthermore, we apply the Adaptive Channel Assignment (ACA) to address the on-off topology changes. Simulation results show that DEESO delivers 184% amount of data to the base station as LEACH for the same amount of energy consumption and the effective network lifetime is extended by around 50%.