QoS-Aware and Heterogeneously Clustered Routing Protocol for 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.

QoSNET: An integrated QoS network for routing protocols in large scale 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.

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.

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.

Wireless sensor networks are a new emerging area where swarm intelligence can be applied with interesting implications. In fact, a strong analogy between unicellular organism colonies and wireless sensor networks can be emphasized: a sensor network can be viewed as a “colony” of simple, scarce resource nodes that, autonomously, are able only to perform simple tasks, but all together can accomplish very complex problems. In this paper we propose a routing protocol for multisink Wireless Sensor Networks with interesting properties: self organization, fault tolerance and environmental adaptation. The proposed protocol was inspired by the well known behavior (in artificial life studies) of “Slime Mold”. Such colony of unicellular organisms organizes itself in clusters by pheromone generation and evaporation mechanisms. In a similar manner our protocol manages the data traffic towards multiple sink nodes using the gradient concept and reaching high levels of autonomy and fault tolerance. We analyze the proposed protocol to examine the performances, the signalling overhead and the adaptation properties to environmental changes or nodes faults using simulation techniques.

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.

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.

Energy saving to prolong the network life is an important design issue while developing a new routing protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a homogeneous network architecture, in which all sensors have the same capabilities in terms of battery power, communication, sensing, storage, and processing. Recently, there has been an interest in heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal nodes are elected with the help of a probability scheme based on residual and average energy of the normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a round. Advanced nodes use a separate probability based scheme for cluster head election and they will further act as a gateway for normal cluster heads and transmit their data load to base station when they are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during cluster formation phase to save network energy. The performance of EACP is compared with SEP and simulation result shows the better result for stability period, network life and energy saving than SEP.

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.

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

Clustered routing protocols in wireless sensor networks (WSN) provide significant advantages in energy saving and data preprocessing. However, the communication greatly depends on cluster heads, which leads to severe security problems. In order to solve this problem, a clustered routing protocol with distributed intrusion detection for WSN (WSN_DID) is proposed in this paper. In WSN_DID all nodes are organized to identify intruding cluster heads in a distributed way by predistributed random keys. The experiments demonstrate that compared with classic cluster-based routing protocol in WSN, energy dissipation in WSN_DID is rather less and the toleration of intrusion is elevated.

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.

Routing protocol in wireless sensor network (WSN) has always been a frequently adopted topic of research in WSN owing to many unsolved issues in it. This paper discusses about the multicast routing protocols in WSN and briefs up different forms of standard research contribution as well as significant recent research techniques toward leveraging the performance of multicast routing. The paper then discusses the beneficial factor and limiting factor in existing multicast techniques and highlights the research gap in this. In order to overcome the research gap, a novel architecture to address the optimization as a cost minimization problem associated with multicast routing in WSN is proposed. This paper contributes to show a present scenario of multicast routing performance in WSN and thereby assists the readers about the possible direction of future with clear visualization of system architecture.

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.