Fuzzy logic based multihop topology control routing protocol in 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

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

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.

The optimized link state routing (OLSR) protocol is widely used in wireless ad hoc networks. With OLSR, only one routing path from source to destination is established at a time. However, links of wireless networks are very unreliable, and network topologies might vary rapidly. These features may cause frequent data retransmissions or the route rebuilding. Hence, improving the network throughput becomes a big challenge. This paper designs a new high-throughput routing protocol (HTRP) for wireless sensor networks, which combines the OLSR protocol with opportunistic routing and network coding. Opportunistic routing is able to leverage the wireless channel's characteristic of broadcasting and opportunistically deliver data through multiple routing paths. And OLSR can provide the information about network topologies and other parameters that opportunistic routing needs but cannot gain by itself. We evaluate the performance through both simulation and empirical experiments. The throughput of the HTRP is more than 10× and 2× of the OLSR protocol respectively in simulation and experiments.

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

In view of the routing protocols for wireless sensor networks with mobile sink, the paper classifies the protocols from the network structure and the node mobility pattern respectively. This paper analyzes the design requirements of routing protocols, introduces the characteristics of various protocols and the typical protocols, and analyzes the research ideas of the routing protocols for wireless sensor networks with mobile sink.

Wireless sensor networks contains small sensor node and processor which have several issues and challenges with regards to Limited Computational Capacity, Energy Efficiency, Path Planning Overhead and many more. Entire lifetime of network depends on efficient energy consumption in sensor network so it is a challenging task to design an Energy Efficient Routing Protocol for wireless sensor networks. Wireless sensor nodes dynamically self-organize themselves without utilizing preexisting infrastructure. Problem becomes more complex if some sensor node having mobility for some particular instance. In this paper we proposed an energy efficient routing protocol for WSN motivated by swarm intelligence of rummage behavior of ant and also covered mobility behavior of node. Furthermore we have combined the fuzzy logic with behavior of ant to take a better decision to find optimal path with less energy consumption. Our proposed algorithm utilize the principle of Fuzzy logic in addition of Ant Colony Optimization to develop energy efficient routing. The performance of our proposed work is evaluated on QualNet 7.4 Network Simulator. The simulation result shows that the proposed technique optimize the energy consumption, decrease RREQ packet and increase the lifetime of network as compare to existing routing protocol.

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.

Increasingly, the services operations which perform data sensing and data propagation in a dynamic environment are important tasks of wireless sensor networks. Therefore, increasing the network lifetime is the main contribution of this investigation. We propose a novel power-aware chessboard-based adaptive routing (PCAR) protocol to support immobility management in wireless sensor networks. The paramount design challenge in this work is to scale-down the network energy consumption, thus maximizing the network lifetime. Our PCAR protocol utilizes vector-oriented propagation, power-consideration decision, and multi-path routing protocols to guide the propagating data to its destination. Moreover, the properties of the clusters are combined in the PCAR to form the cluster-plates in a chessboard-based clustered sensor network. The alternate usage of cluster-head nodes and sleep nodes increases energy efficiency. The opportune divide-and-conquer multi-path fusion mechanism slows down and balances energy consumption. Finally, a performance analysis shows that energy efficiency is achieved by the PCAR protocol.

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.

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.

In wireless sensor networks, prolonging the life time is an important research topic. Based on the study of LEACH protocol and EEUC protocol, a novel zone-divided and energy-balanced clustering routing protocol for wireless sensor networks (ZECR) is brought up. The protocol divides the area into several zones according to the distance, and uses the unequal clustering method among these zones to solve the hot spots problem caused by multi-hop mechanism. In the cluster head election phase, only the nodes that meet the energy standard can participate in the competition; in the inter-cluster multi-hop routing phase, the cluster heads with high residual energy in high energy region will be selected as the relay node based on the advantages of zone-divided. Simulation results show that the protocol can effectively balance the energy consumption of each part of the network, solve the hot spots problem, apply to the energy heterogeneous network and prolong the network life time obviously.

One of the most important topics in the field of wireless sensor networks is the development of approaches to improve network lifetime. In this paper, an energy-efficient control and routing protocol for wireless sensor networks is presented. This algorithm is based on reinforcement learning for energy management in the network. This protocol seeks to optimize routing policies to maximize the long-term reward received by each node, using reinforcement learning, which is a machine learning approach. In order to improve the lifetime of wireless sensor network, three energy management approaches have been proposed. The first approach is to navigate correctly using reinforcement learning to reduce the length of the routes and to improve energy consumption. The second approach is to exploit a sleep scheduling technique to improve node energy consumption. The last approach is used to restrict data transmission of each node based on the received data change rate. Simulation results show that in terms of network lifespan, the proposed method significantly outperforms previous reported methods.