Zone-based routing protocol with mobility consideration for wireless sensor networks

Hierarchical routing and clustering mechanisms in Wireless Sensor Networks (WSN) help to reduce the energy consumptions and the overhead created when all the sensor nodes in the network are sending information to the central data collection point. Most of the routing and clustering protocols proposed for WSN assume that the nodes are stationary. However, in applications like habitat monitoring or search and rescue, that assumption makes those clustering mechanisms invalid, since the static nature of sensors is not real. In this paper, we propose Zone-based Routing Protocol for Mobile Sensor Networks (ZoroMSN) that considers the design aspects such as mobility of sensors, zones and routes maintenance, information update and communication between sensor nodes. Simulation results show the effectiveness and strengths of the ZoroMSN protocol such as a low routing and mobility overhead, while achieving a good performance in WSN using small zone sizes and sensors with low speed. Simulation results also show that ZoroMSN outperforms existing LEACH-ME and LEACH-M protocols in terms of network lifetime and energy consumptions.     

A gradient‐based multiple‐path routing protocol for low duty‐cycled wireless sensor networks

Routing in a low duty‐cycled wireless sensor network (WSN) has attracted much attention recently because of the challenge that low duty‐cycled sleep scheduling brings to the design of efficient distributed routing protocols for such networks. In a low duty‐cycled WSN, a big problem is how to design an efficient distributed routing protocol, which uses only local network state information while achieving low end‐to‐end (E2E) packet delivery delay and also high packet delivery efficiency. In this paper, we study low duty‐cycled WSNs wherein sensor nodes adopt pseudorandom sleep scheduling for energy saving. The objective of this paper is to design an efficient distributed routing protocol with low overhead. For this purpose, we design a simple but efficient hop‐by‐hop routing protocol, which integrates the ideas of multipath routing and gradient‐based routing for improved routing performance. We conduct extensive simulations, and the results demonstrate the high performance of the proposed protocol in terms of E2E packet delivery latency and packet delivery efficiency as compared with existing protocols. Copyright © 2014 John Wiley & Sons, Ltd.     

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.

     

Dynamic Relationship-Zone Routing Protocol for Ad Hoc Networks

A new dynamic relationship-zone routing protocol (DRZRP) for ad hoc networks is proposed. In this protocol, each node in the network establishes a neighboring-zone with a radius of ρ hops, and activates a relationship-zone according to the service request frequency and service hotspot condition. DRZRP establishes proactive routing for neighboring-zone and relationship-zone of the node, and the relationship-zone of the node can be dynamically maintained, including: initialization, relationship-zone activation, and relationship-zone inactivation. The simulation results are compared with LSR, ZRP and ZHLS protocols, and DRZRP greatly reduces the communication overhead of routing control messages and significantly improves the average delay of routing requests. The new protocol matches the service relationship among nodes in the network, and has comprehensive performance advantage in communication overhead and routing request delay, which improves the quality of network service.

     

A hybrid approach for the optimization of quality of service metrics of WSN

The core objective behind this research paper is to implement a hybrid optimization technique along with proactive routing algorithm to enhance the network lifetime of wireless sensor networks (WSN). The combination of two soft computing techniques viz. genetic algorithm (GA) and bacteria foraging optimization (BFO) techniques are applied individually on destination sequence distance vector (DSDV) routing protocol and after that the hybridization of GA and BFO is applied on the same routing protocol. The various simulation parameters used in the research are: throughput, end to end delay, congestion, packet delivery ratio, bit error rate and routing overhead. The bits are processed at a data rate of 512 bytes/s. The packet size for data transmission is 100 bytes. The data transmission time taken by the packets is 200 s i.e. the simulation time for each simulation scenario. Network is composed of 60 nodes. Simulation results clearly demonstrates that the hybrid approach along with DSDV outperforms over ordinary DSDV routing protocol and it is best suitable under smaller size of WSN.

     

Lightweight distributed geographical: a lightweight distributed protocol for virtual clustering in geographical forwarding cognitive radio sensor networks

Recent literature characterizes future wireless sensor networks (WSN) with dynamic spectrum capabilities. When cognitive radio is introduced as a main component of a network, a network management protocol is needed to ensure network connectivity and stability especially in highly dynamic environments. Implementing such protocols in WSN opens more challenges because of the resource constraints in sensor networks. We propose a distributed lightweight solution that fulfills this need for WSN. With this protocol, a node in a multichannel environment is quickly able to establish a control channel with neighboring nodes. Lightweight distributed geographical either increases or reduces the coverage area of the control channel based on perceived interference and adequately takes care of intersecting nodes with minimal overhead. By identifying local minima nodes, it also has the potentiality of reducing route failure by 70% further reducing the time and energy overhead incurred by switching to angle routing or maximum power transmission schemes usually used to solve the local minima issue. The work shows best operating values in terms of duty cycle and signal to noise ratio threshold frequencies and the lightweight nature of lightweight distributed geographical in terms of energy and communication overhead, which suits network management protocols for cognitive radio sensor networks. Copyright © 2013 John Wiley & Sons, Ltd.     

Routing Algorithms for MANET-IoT Networks: A Comprehensive Survey

With the powerful evolution of wireless communication systems in recent years, mobile ad hoc networks (MANET) are more and more applied in many fields such as environment, energy efficiency, intelligent transport systems, smart agriculture, and IoT ecosystems, as well as expected to contribute role more and more important in the future Internet. However, due to the characteristic of the mobile ad hoc environment, the performance is dependent mainly on the deployed routing protocol and relative low. Therefore, routing protocols should be more flexible and intelligent to enhance network performance. This paper surveyed and analysed a series of recently proposed routing protocols for MANET-IoT networks. Results have shown that these protocols are classified into four main categories: performance improvement, quality of service (QoS-aware), energy-saving, and security-aware. Most protocols are evolved from these existing traditional protocols. Then, we compare the performance of the four traditional routing protocols under the different movement speeds of the network node aim determines the most stable routing protocol in smart cities environments. The experimental results showed that the proactive protocol work is good when the movement network nodes are low. However, the reactive protocols have more stable and high performance for high movement network scenarios. Thus, we confirm that the proposal of the routing protocols for MANET becomes more suitable based on improving the ad hoc on-demand distance vector routing protocol. This study is the premise for our further in-depth research on IoT ecosystems.

     

A boolean spider monkey optimization based energy efficient clustering approach for WSNs

Wireless sensor network (WSN) consists of densely distributed nodes that are deployed to observe and react to events within the sensor field. In WSNs, energy management and network lifetime optimization are major issues in the designing of cluster-based routing protocols. Clustering is an efficient data gathering technique that effectively reduces the energy consumption by organizing nodes into groups. However, in clustering protocols, cluster heads (CHs) bear additional load for coordinating various activities within the cluster. Improper selection of CHs causes increased energy consumption and also degrades the performance of WSN. Therefore, proper CH selection and their load balancing using efficient routing protocol is a critical aspect for long run operation of WSN. Clustering a network with proper load balancing is an NP-hard problem. To solve such problems having vast search area, optimization algorithm is the preeminent possible solution. Spider monkey optimization (SMO) is a relatively new nature inspired evolutionary algorithm based on the foraging behaviour of spider monkeys. It has proved its worth for benchmark functions optimization and antenna design problems. In this paper, SMO based threshold-sensitive energy-efficient clustering protocol is proposed to prolong network lifetime with an intend to extend the stability period of the network. Dual-hop communication between CHs and BS is utilized to achieve load balancing of distant CHs and energy minimization. The results demonstrate that the proposed protocol significantly outperforms existing protocols in terms of energy consumption, system lifetime and stability period.     

Analysis of energy-tax for multipath routing in wireless sensor networks

Recently, multipath routing in wireless sensor networks (WSN) has got immense research interest due to its capability of providing increased robustness, reliability, throughput, and security. However, a theoretical analysis on the energy consumption behavior of multipath routing has not yet been studied. In this paper, we present a general framework for analyzing the energy consumption overhead (i.e., energy tax) resulting from multipath routing protocol in WSN. The framework includes a baseline routing model, a network model, and two energy consumption schemes for sensor nodes, namely, periodic listening and selective wake-up schemes. It exploits the influence of node density, link failure rates, number of multiple paths, and transmission environment on the energy consumption. Scaling laws of energy-tax due to routing and data traffic are derived through analysis, which provide energy profiles of single-path and multipath routing and serve as a guideline for designing energy-efficient protocols for WSN. The crossover points of relative energy taxes, paid by single-path and multipath routing, reception, and transmission, are obtained. Finally, the scaling laws are validated and performance comparisons are depicted for a reference network via numerical results.     

Energy optimized micro genetic algorithm based LEACH protocol for WSN

This article presents the design, analyses and implementation of the novel routing protocol for energy optimization based on LEACH for WSN. Network Lifetime is the major problem in various routing protocols used in WSN. In order to overcome that problem, our proposed routing protocol is developed, which is a combination of Micro Genetic algorithm with LEACH protocol. Our proposed µGA-LEACH protocol, strengthen the cluster head (CH) selection and also reduce the energy consumption of the network when compared to existing protocols. This paper shows the improvement of network lifetime and energy consumption with the optimal CH selection based on a micro genetic algorithm and also compared the results with an existing hierarchical routing protocol like LEACH, LEACH-C, LEACH GA and GADA LEACH routing protocol with various packet sizes, and initial energy.

     

Geographical awareness hybrid routing protocol in Mobile Ad Hoc Networks

This paper proposes a geographical awareness routing protocol based on a hybrid routing protocol, the Zone Routing Protocol (ZRP), in Mobile Ad Hoc Networks (MANETs). ZRP is created from combining proactive routing protocol and on-demand routing protocol; therefore, it inherits the advantages of both these routing protocols. The long delay time of the on-demand routing protocol and the huge routing overhead of the proactive routing approach are reduced in ZRP. However, ZRP still produces a large amount of redundant routing overhead in the route discovery process, which not only wastes energy but also increases the workload of the network, while limited bandwidth is a challenge for MANETs. To mitigate routing overhead, a geographical awareness approach that is applied to limit the discovered route area in ZRP is proposed and is called the Geographical awareness ZRP (GeoZRP). Simulation results confirm that the proposed algorithm alleviates routing overhead and end-to-end delay with only a slightly decrease in the packet delivery ratio.     

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.     

Clustering Based Two Dimensional Motion of Sink Node in Wireless Sensor Networks

The wireless sensor network (WSN) is always known for its limited-energy issues and finding a good solution for energy minimization in WSNs is still a concern for researchers. Implementing mobility to the sink node is used widely for energy conservation or minimization in WSNs which reduces the distance between sink and communicating nodes. In this paper, with the intention to conserve energy from the sensor nodes, we designed a clustering based routing protocol implementing a mobile sink called ‘two dimensional motion of sink node (TDMS)’. In TDMS, each normal sensor node collects data and send it to their respective leader node called cluster head (CH). The sink moves in the two dimensional direction to collect final data from all CH nodes, particularly it moves in the direction to that CH which has the minimum remaining energy. The proposed protocol is validated through rigorous simulation using MATLAB and comparisons have been made with WSN’s existing static sink and mobile sink routing protocols over two different geographical square dimensions of the network. Here, we found that TDMS model gives the optimal result on energy dissipation per round and increased network lifetime.

     

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.     

OCR-MAC：一种新的基于CSMA的无线传感器网络MAC协议

传感器网络被认为是21世纪最重要的技术之一,它将对人类未来的生活产生深远影响,其中MAC协议是WSN通信协议中最为突出也是最为重要的关键协议之一。无线传感器网络具有节点的电源能量和硬件资源受限的特点,因此设计高能效的MAC协议是MAC协议研究中具有挑战性的研究课题。基于以上目的,本文采用了CSMA机制和分簇路由协议的优点,改进了传统的MAC协议提出了OCR-MAC协议,并利用MATLAB进行了仿真,仿真结果表明,改进后的OCR-MAC协议在节能和网络数据传输方面性能更加优越。     

Research on routing protocol facing to signal conflicting in link quality guaranteed WSN

Wireless sensor networks (WSN), as a new type of environment monitoring system, has became a hot research topic in recent years. This paper mainly focuses on the problem of signal conflicting in WSN. The link quality (quality between two neighboring nodes) can be guaranteed by the layout of network, but, the end-to-end routing quality can not be guaranteed in the same way because of random signal conflicting (even if CSMA/CA is used in WSN). The end-to-end routing will have higher performance if the routing has lower signal conflicting probability. So, the main work of this paper is designing a routing protocol to find out the routing with the lowest signal conflicting probability. This paper proposed a Minimum conflicting probability routing protocol (MCR) in link quality guaranteed WSN. Firstly, MCR combines the degree value with workload of nodes, forming a new degree and cache based routing metric (DBM). Secondly, MCR finds out the best routing by the Random Walk theory on basis of DBM. The simulation results show that, MCR protocol is more effective to avoid the signal conflicting, it has a higher end-to-end reliability and a more stable network throughput than other routing protocols in the same link quality guaranteed WSN.

     

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.     

ECRP: an energy-aware cluster-based routing protocol for wireless sensor networks

Energy conservation is the main issue in wireless sensor networks. Many existing clustering protocols have been proposed to balance the energy consumption and maximize the battery lifetime of sensor nodes. However, these protocols suffer from the excessive overhead due to repetitive clustering resulting in high-energy consumption. In this paper, we propose energy-aware cluster-based routing protocol (ECRP) in which not only the cluster head (CH) role rotates based on energy around all cluster members until the end of network functioning to avoid frequent re-clustering, but also it can adapt the network topology change. Further, ECRP introduces a multi-hop routing algorithm so that the energy consumption is minimized and balanced. As well, a fault-tolerant mechanism is proposed to cope up with the failure of CHs and relay nodes. We perform extensive simulations on the proposed protocol using different network scenarios. The simulation results demonstrate the superiority of ECRP compared with recent and relevant existing protocols in terms of main performance metrics.

     

A Novel Heterogeneous Clustering Protocol for Lifetime Maximization of Wireless Sensor Network

The network lifetime of Wireless Sensor Network (WSN) is one of the most challenging issues for any network protocol. The nodes in the network are densely deployed and are provided with limited power supply. The routing strategy is treated as an effective solution to improve the lifetime of the network. The cluster based routing techniques are used in the WSN to enhance the network lifespan and to minimize the energy consumption of the network. In this paper, an energy efficient heterogeneous clustering protocol for the enhancement of the network lifetime is proposed. The proposed protocol uses the sensor energy for the clustering process in a well-organized manner to maximize the lifetime of network. The MATLAB simulator is used for implementing the clustering model of proposed protocol and for measuring the effectiveness of the proposed technique the comparison is performed with the various existing approaches such as Stability Election Protocol, Distributed Energy Efficient Clustering and Adaptive Threshold Energy Efficient cross layer based Routing.

     

Energy Efficient Layered Cluster Head Rotation Based Routing Protocol for Underwater Wireless Sensor Networks

Energy efficiency is of paramount concern in underwater sensor networks. The very nature of underwater environment makes it difficult to deploy an energy efficient network that enhances network lifetime. The existing protocols of terrestrial networks cannot be implemented directly to underwater scenarios and as such new protocols have to be designed because of speed of signal propagation under water. Improving the energy efficiency in UWSNs is an active area of research and many protocols to that end have been proposed. The routing protocol that this paper proposes is Energy Efficient Layered Cluster Head Rotation (EE-LCHR) routing protocol. This protocol makes use of the multi sink architecture and creates virtual layers containing a number of sensor nodes such that the hop count from the sensor nodes in a particular layer to the surface sink is the same. Also each layer has a number of clusters with a cluster head that keeps on rotating depending on the fitness value of the sensor nodes. The proposed protocol as compared to other extant protocols like EE-DBR and DBR improves network lifetime. The presence of virtual layers and rotation of cluster heads together ensure that energy balance is better achieved in our proposed protocol which leads to an enhanced network lifetime.