Evaluation Metrics and Optimization Strategies for Routing Protocols in Resource-Constrained Wireless Sensor Networks

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.

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.

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

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.

Wireless Sensor Networks (WSNs) have led to tremendous growth in the development of sensor technology and offer numerous applications, such as wildlife monitoring, environment, healthcare, military surveillance and security systems. In terms of performance, the evolutions of WSN routing protocols play a vital role in extending the lifetime of networking operations. Due to the limited resources of power in sensor nodes, the design and implementation of an energy-efficient routing protocol comprise a key challenge for researchers. Before, in the case of a static sink, nodes at farther areas from the sink transmit their sensed data at a longer transmission range and die early, while nearby nodes face lesser transmission costs and stay alive for a longer period. This unbalanced energy distribution creates energy holes in ares far from the sink in WSNs. Mobility-based sink routing protocols are proposed to minimize the sub-optimal energy consumption in WSNs, as the sink mobility covers the sensor field, which alleviates the overall load-balancing among sensor nodes. In order to overcome the energy hole issue while prolonging the network lifetime, it is important to determine the optimal mobility pattern. In this regard, we propose the Spiral Mobility based on Optimized Clustering (SMOC) routing protocol and the Multiple sink-based SMOC (M-SMOC) routing protocol for large-scale WSNs. Performance evaluations of the proposed protocols are compared with various existing routing protocols based on static sink, random mobility and grid mobility. Different numbers of performance parameters are considered for evaluation, such as network lifetime, network stability, packet drop ratio, packet delivery ratio, end-to-end delay, average energy consumption, network connection time and the impact of different heterogeneity levels. Experimental results show the benefits of the spiral mobility pattern and how it improves the network lifetime and stability period over the existing state-of-the-art routing protocols.

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.

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.

The selection of routing protocols is playing a major role in the device and proper utilization of wireless sensor networks (WSNs) that can help to provide better interconnection networks. On preserving the role of key performance, metric related to routing protocols is also an important and challenging task in the WSNs. Therefore, the sensor nodes life can be improved in efficient manner by using routing protocols that preserve the energy consumption and quality of service (QoS). Three different kinds of categories are used in the design of routing protocols which are data centric, hierarchical, and location-based approaches. Energy consumption can be improved by reducing the effect of redundancy level and transferring the passive motes sleep mode. The data transmission time also impacts on the energy conservation and QoS in WSNs. The surveillance and monitoring-related applications are the demanding research field in the WSNs that has to resolve the issue QoS routing in the manner of reliable data delivery. Energy consumption and QoS constraints are two complementary factors in the routing protocol, but the time delay factor can be involved in such a manner to satisfy both the performance metrics in routing protocol in WSNs.

Wireless sensor networks, a distributed network of sensor nodes perform critical tasks in many application areas such as target tracking in military applications, detection of catastrophic events, environment monitoring, health applications etc. The routing protocols developed for these distributed sensor networks need to be energy efficient and scalable. To create a better understanding of the performance of various routing protocols proposed it is very important to perform a detailed analysis of them. Network simulators enable us to study the performance and behavior of these protocols on various network topologies. Many Sensor Network frameworks were developed to explore both the networking issues and the distributed computing aspects of wireless sensor networks. The current work of simulation study of routing protocols is done on SensorSimulator, a discrete event simulation framework developed at Sensor Networks Research Laboratory, LSU and on a popular event driven network simulator ns2 developed at UC Berkeley. SensorSimulator is a discrete event simulation framework for sensor networks built over OMNeT++ (Objective Modular Network Test-bed in C++). This framework allows the user to debug and test software for distributed sensor networks. SensorSimulator allows developers and researchers in the area of Sensor Networks to investigate topological, phenomenological, networking, robustness and scaling issues, to explore arbitrary algorithms for distributed sensors, and to defeat those algorithms through simulated failure. The framework has modules for all the layers of a Sensor Network Protocol stack. This thesis is focused on the simulation and performance evaluation of various routing protocols on SensorSimulator and ns2. The performance of the simulator is validated with a comparative study of Directed Diffusion Routing Protocol on both ns2 and SensorSimulator. Then the simulations are done to evaluate the performance of Optimized Broadcast Protocols for Sensor Networks, Efficient Coordination Protocol for Wireless Sensor Networks on SensorSimulator. Also a performance study of Random Asynchronous Wakeup protocol for Sensor Networks is done on ns2.

Due to open network nature of wireless sensor networks make them highly vulnerable to a variety of security attacks and easy target for adversaries, which may capture these nodes, analyze and easily insert fake route information. Wireless sensor network is an emerging, cost effective and unsupervised solution for collecting this information from the physical world and sending this information back to centralized authority for further processing. GRPW (Geographic Routing in connected wireless sensor networks based on Multiple Sinks) is one of the basic routing protocols used for Supporting Mobile Sinks in Wireless Sensor Networks. GRPW, a geographical routing protocol for wireless sensor networks, is based on an architecture partitioned by logical levels, on the other hand based on a multipoint relaying flooding technique to reduce the number of topology broadcast. GRPW-MuS uses periodic HELLO packets to neighbor detection. The wormhole attack can form a serious threat in wireless sensor networks, especially against many wireless sensor networks routing protocols and location-based wireless security systems. Here, a trust model to handle this attack in GRPW is provided called GRPW-MuS-s. Using OMNET++ simulation and the MiXiM framework, results show that GRPW-MuS-s protocol only has very small false positives for wormhole detection during the neighbor discovery process (less than GRPW). The average energy usage at each node for GRPW-MuS-s protocol during the neighbor discovery and route discovery is very low than GRPW-MuS, which is much lower than the available energy at each node. The cost analysis shows that GRPW-MuS-s protocol only needs small memory usage at each node, which is suitable for the sensor network.

Wireless sensor networks (WSNs) have gained much attention in today’s research domain for supporting a wide variety of applications including the multimedia applications. Multimedia applications that are regarded as the quality-of-service (QoS)-aware, delay sensitive, and bandwidth hungry applications require enough energy and communication resources. WSNs being the energy-scarce network have now been designed in such a way that they can support these delay-sensitive and time-critical applications. In this paper, we propose an energy-efficient routing protocol for heterogeneous WSNs to support the delay sensitive, bandwidth hungry, time-critical, and QoS-aware applications. The proposed QoS-aware and heterogeneously clustered routing (QHCR) protocol not only conserves the energy in the network, but also provides the dedicated paths for the real-time and delay sensitive applications. The inclusion of different energy-levels for the heterogeneous WSNs also provides the stability in the networks while minimizing the delay for the delay-sensitive applications. Extensive simulations have been performed to validate the effectiveness of our proposed scheme. Our proposed routing scheme outperforms other state-of-the-art schemes in terms of the delay performances.

A Wireless Sensor Network (WSN) is a special kind of ad hoc network with distributed sensing and processing capability. Routing protocols for wireless sensor networks are responsible for maintaining the routes in the network and have to ensure reliable multi-hop communication. Studies from 2006 until early 2015 distinguished three categories of routing protocols i.e., network structure, routing paradigms and initiator of communication. The routing protocols belonging to the first category further classified as flat, hierarchical and location based routing protocols, the routing paradigms classified as single path and multipath and the initiator of communication classified into source initiator and destination initiator routing protocols. The operations of representative members from each category are described and the comparative analyses of the performance of each routing protocol are presented. A literature has been extensively studied to highlight the properties and limitations of existing routing protocols and future research issues, which helps to improve the routing protocols for another domain.

Applying multimedia to Wireless Sensor Network (WSN) adds more challenges due to WSN resource constraints and the strict Quality of Service (QoS) requirements for multimedia transmission. Different multimedia applications may have different QoS requirements, so routing protocols designed for Wireless Multimedia Sensor Network (WMSN) should be conversant of these requirements and challenges in order to ensure the efficient use of resources to transfer multimedia packets in an utmost manner. The majority of solutions proposed for WMSN depends on traditional layered based mechanisms which are inefficient for multimedia transmission. In this paper we propose a cross-layer Ant based Routing Protocol for WMSN (CARPM) by using modified ant colony optimization (ACO) technique to enhance the routing efficiency. The proposed protocol uses an improved ACO to search for the best path that are satisfied with the multimedia traffic requirements. While making best decision the weightage is given to energy consumption, and queuing delay. The proposed cross layer scheme works between the routing, MAC, and physical layers. Since, the remaining power and timestamp metrics are exchanged from physical layer to network layer. Dynamics duty cycle assignment is proposed at MAC layer which changes according to traffic rate. The presented algorithm is simulated using NS2 and is proven to satisfy its goals through a series of simulations.

Throughout the use of the small battery-operated sensor nodes encourage us to develop an energy-efficient routing protocol for wireless sensor networks (WSNs). The development of an energy-efficient routing protocol is a mainly adopted technique to enhance the lifetime of WSN. Many routing protocols are available, but the issue is still alive. Clustering is one of the most important techniques in the existing routing protocols. In the clustering-based model, the important thing is the selection of the cluster heads. In this paper, we have proposed a scheme that uses the bubble sort algorithm for cluster head selection by considering the remaining energy and the distance of the nodes in each cluster. Initially, the bubble sort algorithm chose the two nodes with the maximum remaining energy in the cluster and chose a cluster head with a small distance. The proposed scheme performs hierarchal routing and direct routing with some energy thresholds. The simulation will be performed in MATLAB to justify its performance and results and compared with the ECHERP model to justify its performance. Moreover, the simulations will be performed in two scenarios, gateway-based and without gateway to achieve more energy-efficient results.

Wireless sensor networks are a promising application of the Internet of Things in the sustainable development of smart cities, and have been afforded significant attention since first being proposed. Authentication protocols aim to protect the security and confidentiality of legitimate users when accessing and transmitting data. However, existing protocols may suffer from one or more security flaws. Recently, Butt et al. proposed an energy-efficient three-factor authentication protocol for wireless sensor networks. However, their protocol is vulnerable to several attacks, and lacks certain security properties. In this paper, the causes of these design flaws are analyzed. Furthermore, we propose a novel three-factor authentication protocol (password, smart card, and biometric information) for wireless sensor networks in Internet of Things contexts. A dynamic anonymous strategy is designed to prevent privacy disclosure and to resist sensor node capture attacks, tracking attacks, and desynchronization attacks. The Find–Guess model and random oracle model are combined to prove the security of the proposed protocol. A comparative analysis with related schemes shows that the proposed protocol has higher security and is able to maintain a low computational overhead.