Residual energy based multipath routing protocol (REBM) in wireless sensor network

Wireless sensor networks congestion occurs easily due to its centralized traffic pattern. Normally, mono-sync wireless sensor network experiences multiple traffic flow congestion in the dense environment of the network, which leads to excess energy consumption and severe packet loss. To overcome these issues, a congestion detection and alleviation mechanism using cluster based heuristic optimized hierarchical routing protocol is proposed in this paper. Here, congestion detection and alleviation utilize the features of sensor nodes. The congestion is categorized into two types: (i) node level congestion and (ii) link level congestion. The node level congestion is detected by assessing the buffer utilization and the interval amid the consecutive data packets. The link level congestion is considered with computing link usage utilizing back-off step of round robin carrier sense multi-access with collision avoidance. Congestion detection and alleviation reactively affected node/link through cuckoo hosted rider search multi-hop routing algorithm. It has two phases: the cluster head selection and multi-path routing. Cluster head selection is performed through Taylor multiple random forest kernel fuzzy C-means clustering algorithm and multi-path routing is performed through cuckoo hosted rider search multi-hop routing algorithm. The simulation of the proposed method is done in network simulator tool. Here, the performance metrics, like packet delivery ratio, delay, energy consumption, packet drop, overhead, network lifetime and throughput are calculated. The experimental outcomes of the proposed technique shows 11.6%, 18.4% and 28.1% lower delay, 78.2%, 65.4% and 52.6% higher packet delivery ratio, and 29.2%, 37.4% and 40.8% lower packet drop compared with the existing methods, like congestion detection and alleviation using multi-attribute decision-making in optimization-based hybrid congestion alleviation routing protocol in wireless sensor networks, congestion detection and alleviation using hybrid K-means with greedy best first search algorithms in packet rate reduction utilizing adaptive weight firefly algorithm ant colony optimization based routing protocol in wireless sensor networks and congestion detection and alleviation using multi-input time on task optimization algorithm for altered gravitational search algorithm routing protocol in wireless sensor networks.

Wireless Sensor Networks (WSNs) play a necessary position in todays actual world applications. WSNs are a team of autonomous sensor nodes that are geographically distributed to accumulate information and monitor events. WSNs are similarly sense that they rely on wireless connectivity and spontaneous formation of networks so that sensor information can be transported via wireless. Sometimes called dust network, minute sensors as small as dust referring to smart dust. WSNs are spatially distributed two to screen or bodily temperature, sound, pressure, etc. and to cooperatively ignore their data via the network to different locations. Each such sensor network node has typically various parts. Routing in WSNs in one of the important technique, because all node executes its battery power, if may be one node failure it collapse entire networks. Routing in WSNs is in reality difficult due to the intrinsic characteristics that differentiate these networks from different networks. The plan of routing protocols in WSN is affected via number of exigent factors. In this paper, a review on routing protocols for Wireless Sensor Networks (WSNs) and performance of its execution.

The existing routing protocols for wireless sensor networks were not reasonable in design, which limited their application. Most of the existing studies did not take into account the energy consumption of the network and the balanced use of the energy of sensor nodes, which led to the unsatisfactory application effect of wireless sensor networks in some fields. Therefore, from the perspective of energy balance in wireless sensor networks, this paper proposed a construction method of an energy balance routing protocol in wireless sensor networks based on a fuzzy control strategy. Firstly, based on the analysis of the basic composition of wireless sensor networks and the structure of sensor nodes, this paper expounded the basic process of wireless data transmission and summarized the classification and characteristics of routing protocols in wireless sensor networks from different angles. Secondly, according to the node data transmission characteristics of wireless sensor networks, the energy balance use model of sensor nodes was established, and the design method of the energy balance routing protocol based on fuzzy control strategy was proposed, and the data transmission link was optimized. Finally, through experimental comparative analysis, the results showed that the energy balanced routing protocol proposed in this paper can effectively realize the energy balanced use of the network data transmission process. Compared with other common routing protocols, the wireless sensor network routing protocol proposed in this paper can not only improve the data transmission efficiency and reduce the data redundancy but also save energy consumption and prolong the network running time. The design method of routing protocol proposed in this paper will be conducive to the optimization and application of routing protocol in wireless sensor networks and provide a theoretical basis for the related research of wireless sensor networks.

A new localized quality of service (QoS) routing protocol for wireless sensor networks (WSN) is proposed in this paper. The proposed protocol targets WSN's applications having different types of data traffic. It is based on differentiating QoS requirements according to the data type, which enables to provide several and customized QoS metrics for each traffic category. With each packet, the protocol attempts to fulfill the required data-related QoS metric(s) while considering power efficiency. It is modular and uses geographical information, which eliminates the need of propagating routing information. For link quality estimation, the protocol employs distributed, memory and computation efficient mechanisms. It uses a multisink single-path approach to increase reliability. To our knowledge, this protocol is the first that makes use of the diversity in data traffic while considering latency, reliability, residual energy in sensor nodes, and transmission power between nodes to cast QoS metrics as a multiobjective problem. The proposed protocol can operate with any medium access control (MAC) protocol, provided that it employs an acknowledgment (ACK) mechanism. Extensive simulation study with scenarios of 900 nodes shows the proposed protocol outperforms all comparable state-of-the-art QoS and localized routing protocols. Moreover, the protocol has been implemented on sensor motes and tested in a sensor network testbed.

Sensor networks are one of the fastest growing areas in broad wireless ad hoc networking field. A sensor node, typically, contains signal-processing circuits, micro-controllers and a wireless transmitter/receiver antenna. Energy saving is one of the critical issue for sensor networks since most sensors are equipped with non-rechargeable batteries that have limited lifetime. Routing schemes are used to transfer data collected by sensor nodes to base stations. In the literature many routing protocols for wireless sensor networks are suggested. In this work, four routing protocols for wireless sensor networks viz. flooding, Gossiping, GBR and LEACH have been simulated using TinyOS and their power consumption is studied using PowerTOSSIM. A realization of these protocols has been carried out using Mica2 Motes.

QoSNET: An integrated QoS network for routing protocols in large scale wireless sensor networks

In this paper, we consider the problem of unbalanced energy consumption for nodes in wireless sensor networks (WSN). Current routing protocols divide the network into clusters and route data packets by electing cluster heads, but ineffective network energy utilization leads to the death of nodes very soon. We show that the behavior of sensor networks becomes very unstable once the first node dies. We propose NSEEAR - network stability enhancement by energy aware routing, an adaptive routing protocol which leads to a better energy utilization of the network to prolong its stability period (the time interval before the death of the first node) and the significant network lifetime (the time interval before half of the network is dead) which is crucial for many sensing applications in which the feedback from the network should be reliable. NSEEAR organizes the network into concentric tiers around the base station and routes aggregated data packets by forwarding them from one tier to another in the direction of the base station. Relaying nodes are elected by considering their distance from the transmitting node and the base station, as well as their residual energy. We evaluate NSEEAR through analysis and simulations and show that NSEEAR results in much longer stability periods compared to those obtained by the current clustering protocols.

While traditional routing protocols try to minimize the end-to-end delay or maximize the throughput, most energy-aware routing protocols for wireless sensor networks try to extend the life time of the network by minimizing the energy consumption sacrificing other performance metrics. We introduce a new energy-aware routing protocol that tries to minimize the energy consumption and, at the same time, maintain good end-to-end delay and throughput performance. The new algorithm is based on a constrained shortest-path algorithm. We compare the new algorithm with some traditional routing and energy-aware routing algorithms. The results show that the new algorithm performance is acceptable under all performance metrics and presents a performance balance between the traditional routing algorithms and the energy-aware routing algorithms. The constraint value can be chosen to achieve different performance objectives for different sensor network missions.

In this paper, the optimization strategies of routing protocols are analysed with respect to energy utilization of sensor nodes in Wireless Sensor Networks (WSNs). Routing Protocols are in charge of discovering and maintaining the routes in the network. Different routing mechanisms have been proposed to address energy optimization problem in sensor nodes. Clustering mechanism is one of the most efficient mechanisms which cater to the requirements of energy conservation in wireless sensor networks. To check the efficiency of different clustering scheme against modelled constraints, we select five cluster based routing protocols; Low Energy Adaptive Clustering Hierarchy (LEACH), Threshold Sensitive Energy Efficient sensor Network (TEEN), Stable Election Protocol (SEP), Distributed Energy Efficient Clustering (DEEC), and Hybrid Energy Efficient Distributed protocol. To validate our mathematical framework, we perform analytical simulations in MATLAB by choosing number of alive nodes, number of dead nodes, number of packets, number of cluster heads, as performance metrics.

There are different applications of Wireless Sensor Networks (WSNs). It can be deployed in various application areas such as monitoring of environment, surveillance, industrial automation, health-care, agriculture etc. A sensor node is usually a resource constrained device which has limited energy, processing power and memory. One of the important aspects of QoS aware routing protocols in WSNs is to send the delay sensitive data to a control station known as sink. In this paper, a delay sensitive cluster based routing protocol for wireless sensor networks is proposed. The purpose of clustering is to reduce energy consumption among the sensor nodes. The data forwarding mechanism of the protocol attempts to reduce end to end delay of delay sensitive traffic in reaching the sink. The protocol is evaluated through simulation using NS2.

This paper is a performance survey on the residual energy of nodes in a wireless sensor network (WSN). Wireless sensor nodes are limited in application due to constraints in energy of nodes’ battery and addressing the problem of energy management is essential to lengthen the life of a deployed network of wireless sensors. In the method used, Sensor nodes were equally distributed on the complete border of the network field. An exclusive cluster, six hierarchical, and eighteen hierarchical clusters were formed based on even partition of the border of the network field. The choice of Cluster Head (CH) within each cluster formed was based on selection of a sensor node with minimal transmission distance to the Base Station. A comparison of the various hierarchical scenarios was simulated in MATLAB. The mean residue energies (MREs) after the network lifetime are 3%, 52%, and 35% of the initial node energy for single, six and eighteen hierarchical clusters respectively. The residual energies of sensor nodes above the recorded MREs were taken on a class interval of 50’s of the node identity (nid) and respective averages of residual energies of sensor nodes (AEr) of each selected class interval were evaluated. Based on the result, certain categories of sensor nodes at a section of the network field indicated that the battery energy of the affected nodes was not maximally utilized thereby leading to enormous residual energy. It was concluded that the residual energy of nodes in a WSN could be optimized to extend the lifetime.

Due to miniaturization of hardware and availability of low-cost, low-power sensors, Wireless Sensor Network and Multimedia Sensor Network applications are increasing day by day. Each application has a specific quality of service and experience requirements. The design of routing and MAC protocol which can fulfill the requirements of the application is challenging given the constrained nature of these devices. Considerable efforts are directed towards the design of energy efficient QoS-aware routing protocols. In this article, we present state of the art review of routing protocols for Wireless Multimedia Sensor Networks while addressing the challenges and providing insight into research issues.

In the era of New Generation Networks (NWGN) many emerging and future enable technologies accomplish the requirements of ubiquitous communication networks. Mobile wireless sensor network (mWSN) is one of the rising and emerging technologies for various application of NWGN, the enormous concerns of these networks are data gathering with energy efficiency. Routing protocol act as middleware, which is responsible to enhance the network performance with less energy consumption. In this paper we propose, analyze and validate mobile data collector (MDC) based LEACH routing protocol for environmental application which is based on multi-hop routing strategy. MDC based LEACH routing protocol utilizes self-organized sensor nodes with distributed cluster formation technique, randomly selection of cluster heads to equally balance the energy consumption among the sensor nodes and finally forward the data to base station by the support of MDC. Moreover, our approach shows the significant improvement in terms of energy consumption of sensor nodes, enhance network lifetime and data gathering at base station are outperform when compared with LEACH protocol. Key words: Mobile wireless sensor networks, wireless sensor networks, network protocol, cluster based routing, data gathering technique.

A genetic algorithm based distance-aware routing protocol for wireless sensor networks

<span lang="EN-US">Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.</span>