An Energy-Related Routing Protocol of Minimum-Hop Layer in Wireless Sensor Networks

Recent technological advances in communication sector have resulted in the development and improvement of wireless sensor networks consisting of low cost, low power and smaller multi-functional sensor units. Limited battery life of sensor nodes is one of the critical issues in wireless sensor networks. Energy dissipation for data transfer from nodes to base station is the crucial cause of energy depletion. A wide variety of routing protocols were introduced to increase the lifespan of the network and the most efficient scheme is clustering of nodes within the network that works on the principle of divide & conquer and data aggregation. This paper proposes an energy efficient routing protocol EEM-LEACH that discovers a multi-hop path with minimum communication cost from each node to the base station. If the communication cost for direct data transfer is minimum, nodes close to the base station can send data directly to the base station thereby preventing them from dying soon. Only nodes with maximum residual energy and minimum energy consumption can become cluster heads since each node's residual energy as well as average energy consumption is considered for the selection of cluster heads. No global information is needed because cluster formation and multi-hop path selection are distributed. As communication cost per packet is minimized and relay nodes have more residual energy, the network lifetime can be improved.

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) 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.

Generally, routing techniques are essential for Wireless Sensor Networks (WSNs) to deliver data packets to their destinations (also known as sinks). For a practical application, sensors are deployed to monitor environmental changes and events. Most WSNs detect specific events in their specific environments. But, different WSNs may monitor different events with different sensors in the same area. For example, a smart-home WSN deploys thermal sensors/meters to measure indoor and outdoor temperatures, body-temperature sensors to detect thief intrusion, etc. Also, in the underlying house, there is a health WSN which utilizes physiological sensors to monitor patients’ health condition. In other words, several WSNs of different purposes co-exist in the same geographical area. Currently, each WSN’s data delivery is independent from others’. Basically, if all sensors in such a multi-WSNs environment can share their routing paths/nodes and relay event packets for other WSNs, the delivery efficiency can be enhanced since many more sensors can be found there for packet relay. Consequently, the transmission energy can be reduced since energy consumed for wireless transmission is proportional to d2 where d is the transmission distance between sender and receiver. Therefore, in this study, we propose an energy saving routing mechanism, named Energy-Efficient Cooperative Routing Scheme for Heterogeneous Wireless Sensor Networks (EERH for short), in which several WSNs deployed in the same geographical environment form a heterogeneous sensor network and sensors relay packets for its own WSN and also for other WSNs. Routing paths are dynamically established according to the transmission directions of event packets and the residual energy of the underlying sensors and their neighbors. In addition, the packets routed to the same direction by the same sensors are aggregated to save delivering energy. Moreover, the network parameters of the EERH, like propagation delay of an event packet and the transmission distance of a sensor, are adjustable so as to satisfy the practical environment needs. Simulation results show that the EERH efficiently extends the lifetime of a heterogeneous WSN.

Wide usage of wireless sensor network (WSN) is the reason for development of many routing protocols. Recent advances in WSN observe the increased interest in the potential use in applications like Military, Environmental, Health, Vehicular, Mechanical stress levels on attached objects, disaster management etc. Wireless sensor networks are callously restricted by storage capacity, energy and computing power. So it is essential to design an energy efficient aware protocol in order to augment the network lifetime. WSN also has the influencing features to perform remote communication, it is also shrouded with various loopholes in its precise operation, where majority of the communication issues are raised from deployment of existing standards of routing protocols and algorithm. Sensors are expected to be remotely deployed in unnoticed environments. Routing as one key technologies of wireless sensor network has now become very important research work because the applications of WSN is everywhere, it is impractical that there is a routing protocol suitable for all applications. In this paper, a review on routing protocol in WSNs is carried out which are classified as data-centric, hierarchical and location based depending on the network structure. Then some of the multipath routing protocols which are widely used in WSNs like Multipath Multispeed Protocol (MMSPEED), Braided Multipath Routing Protocol, Energy-Aware Routing to improve network performance are also discussed. Massive research work has already been carried out in past to introduce some of the effective routing protocols to enable robust communication system in WSN. Advantages and disadvantages of each routing algorithm are discussed thereafter. This paper also discusses the critical open issues that are yet to be solved. This paper compares and summarizes the performances of routing protocols.

Wireless Sensor Network (WSN) is an exceptional network which gather information from certain area of applications. Major factor in WSNs is the reliability for transmission of data from source to destination. Constructing path for multi-hop routing and continuous updates of energy level can maximize the lifetime and improve the reliability in the network. A lot of work has been done previously in this regard but previous schemes has limited network scale which consumes more energy in reconfiguration of paths and this energy consumption leads the reduction of network lifetime which results into early death of sensor nodes. In this regard, we propose Multi-hop Advance Heuristic Path-Reconfiguration Algorithm (HPRA) for clustered-based heterogeneous WSNs. Proposed algorithm adopts the opportunistic routing by choosing the appropriate neighbor node for transmission of data packets which improves the multi-hop reliability in order to improve the reliability in each path. This new technique of path-reconfiguration reduces the number of paths and fewer paths reduce energy dissipation and also improve the network lifetime. In simulation results proposed algorithm is compared with state-of-the-art routing protocols which shows the significant performance in network lifetime, network stability, number of paths and energy consumption ratio.

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

The energy issue is an important parameter in the wireless sensor networks and should be managed in the different applications. We propose a new routing algorithm that it is energy efficient and uses different approaches as dynamic clustering, spanning tree, self-configurable routing and controls energy consuming by data-driven and power management schemas. It has two main phases. The first is consisting of the steady cluster, cluster head election and creation-spanning tree in each cluster and the second phase is data transmission. The proposed protocol is compared with four other protocols in network lifetime, network balance, and average packet delay and packet delivery. Simulation results show the proposed protocol performance in the network lifetime is about 6 per cent higher than Improved-LEACH, 21.5 per cent higher than EESR and 5.8 per cent higher than DHCO. Its improvement in packet delivery parameter is about 3.5 per cent higher than Improved-LEACH, 6.5 per cent higher than EESR and 3 per cent higher than DHCO. In addition, the performance or in packet delay is about 17 per cent higher than EESR and 6 per cent higher than DHCO but Improved-LEACH protocol has a good performance than our protocol about 4 per cent.

The lifetime of Wireless Sensor Network (WSN) is based on the energy of each sensor. Therefore, numerous routing protocols have been introduced such as SEP (Stable Election Protocol), LEACH (Low energy adaptive clustering hierarchy) and EAMMH (Energy Aware Multi-hop Multi-path Hierarchical routing protocol) to stable the lifetime of WSN by efficient utilization of energy of the sensors. In WSN networks data is collected and forwarded wirelessly to the base stations. Routing protocols in WSN provide an efficient path for multi-hop communication because the transmission range and battery power storage of nodes is limited. As nodes are usually deployed in remote areas so, they face challenges of long lifetime, network architecture, security issues, and network coverage. Many routing protocols have been developed to increase the efficiency of networks. Out of these clustering algorithms are the best choice to increase the lifetime of the nodes. Each protocol has its limitations in different scenarios. In this paper, we discussed and compared the performance of LEACH, EAMMH and SEP. SEP is an efficient algorithm due to its weighted cluster head (CH) selection method. Simulation results are obtained using MATLAB. Design metrics of energy consumption and network lifetime are under consideration in this research work.

Target localization based on energy considerations in distributed sensor networks

Wireless Sensor Network (WSN) is an emerging wireless communication networks to provide potential secure optimized data routing between source and destination. Presently the performance analysis of the Wireless Sensor Network routing technique and security protocols is the major research issues. A major issue in wireless sensor network (WSN) is the energy constraint in a node and its limited computing resources, which may pose an operational hazard or limitations on the network lifetime. Therefore, analyses of innovative secure routing techniques are required to utilize the resources of WSN to improve the life time of network in WSN. To design & develop any innovative wireless sensor network routing and security protocol, the network characteristics & its design issues are important consideration. The proposed spherical Grid Routing Protocol (SGRP) is designed and developed to enhance Quality of service to improve WSN performance using NS2 simulator compare to compared to modified LEACH techniques. The packet transmitted, packet received, average energy, throughput and packet delivery ratio are the main common performance measures that are used for performance analysis of proposed SGRP protocols.

Energy efficient collaborative proactive routing protocol for Wireless Sensor Network

Wireless sensor network (WSN) can achieve real-time data collection and transmission of environment, soil, meteorology, crop physiology and other information in agriculture. The data provided by WSN could be used for decision making and management, which is very important in precision agriculture. Wheat farmland wireless sensor network has the characteristics of wide coverage area, long planting period, inconvenient energy supply, and serious impact of crop environment on wireless signal transmission. Routing protocol is an important method to achieve long-term WSN monitoring by selecting an appropriate path with low energy consumption for data transmission. According to the phenomenon of uneven environment and channel parameters caused by intensive crop growth in farmland, a non-uniform clustering routing protocol based on effective energy consumption (UCEEC) was proposed in this work. The method combined with the characteristics of multi-path fading of farmland environment signals. The idea of image segmentation was introduced. Nodes with high similarity were divided into a cluster area by the dissimilarity between nodes in order to improve the intracluster communication performance. Meanwhile, a multi-hop path selection method between cluster-heads based on the estimation of two-hop effective energy consumption is designed. The energy consumption cost factor is calculated by the effective energy consumption and the average energy consumption within the cluster to achieve the minimum and balance of the overall energy consumption of the network. Simulation results show that, compared with the existing Maximum Residual Energy Based Routing (MREBR) protocol, minimum Energy Consumption Based Routing (MEC) routing protocols, UCEEC improves the energy balance effect between nodes, prolongs the network life cycle, and realizes efficient energy utilization of wireless sensor network data collection in the complex environment of wheat field. Keywords: farmland, wireless sensor networks, multi-path fading channel, routing protocol, energy optimization DOI: 10.25165/j.ijabe.20211403.6540 Citation: Miao Y S, Zhao C J, Wu H R. Non-uniform clustering routing protocol of wheat farmland based on effective energy consumption. Int J Agric & Biol Eng, 2021; 14(3): 163–170.

In past few years the potential use of wireless sensor network has increased tremendously in a wide range of applications and it has become a hot research area. WSN has two types of routing protocols: flat routing protocols and clustering routing protocols. Low Energy Adaptive Clustering Hierarchy (LEACH) is first major improvements in clustering routing protocols in WSN. This paper presents two modified architectures of LEACH: LEACH-Balanced (LEACH-B) and Two-Level Hierarchy LEACH (TL-LEACH). The main objective of these protocols is to improve the energy efficiency of the sensor nodes and to prolong the lifetime of the wireless sensor network. The performance of LEACH-B and TL-LEACH are compared in terms of Throughput, Packet Delivery Ratio (PDR), Residual Energy and Life-Time of the network.

Towards energy balancing optimization in wireless sensor networks: A novel quantum inspired genetic algorithm based sinks deployment approach