Localized disjoint multipath routing protocol in irregular 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

Geographic routing has been considered as an attractive approach for resource-constrained wireless sensor networks (WSNs) since it exploits local location information instead of global topology information to route data. However, this routing approach often suffers from the routing hole (i.e., an area free of nodes in the direction closer to destination) in various environments such as buildings and obstacles during data delivery, resulting in route failure. Currently, existing geographic routing protocols tend to walk along only one side of the routing holes to recover the route, thus achieving suboptimal network performance such as longer delivery delay and lower delivery ratio. Furthermore, these protocols cannot guarantee that all packets are delivered in an energy-efficient manner once encountering routing holes. In this paper, we focus on addressing these issues and propose an energy-aware dual-path geographic routing (EDGR) protocol for better route recovery from routing holes. EDGR adaptively utilizes the location information, residual energy, and the characteristics of energy consumption to make routing decisions, and dynamically exploits two node-disjoint anchor lists, passing through two sides of the routing holes, to shift routing path for load balance. Moreover, we extend EDGR into threedimensional (3D) sensor networks to provide energy-aware routing for routing hole detour. Simulation results demonstrate that EDGR exhibits higher energy efficiency, and has moderate performance improvements on network lifetime, packet delivery ratio, and delivery delay, compared to other geographic routing protocols in WSNs over a variety of communication scenarios passing through routing holes. The proposed EDGR is much applicable to resource-constrained WSNs with routing holes.

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

Several problems are required to be fixed in order to apply geographical routing protocol greedy perimeter stateless routing (GPSR) in wireless sensor networks. First, GPSR is designed under the assumption of symmetric links (i.e., bidirectional reachability), which is not realistic for many practical sensor networks, since wireless links in sensor networks often are asymmetric. Second, in sensor networks, packet destinations are often marked with locations instead of identifiers like IP address. Therefore, packets are routed to the home node, which is the node geographically closest to the destined location. Under GPSR, when the target location is outside the exterior perimeter of the sensor network, each packet has to visit all nodes on the boundary of the sensor network topology before it identifies the home node, which results in energy inefficiency. Third, due to the dynamic nature of sensor networks, maintaining data consistency, that is, data retrieved from the home node for a location should be consistent with the data sent to the same location, becomes a challenge when home nodes change. We propose on-demand GPSR (OD-GPSR), a data driven geographical routing protocol customized for sensor networks with solutions to the above three problems. Simulation results show that OD-GPSR performs well in terms of energy efficiency and packet delivery rate at the cost of a little bit more packet delivery delay.

Minimizing latency is a major issue for data aggregation in wireless sensor networks (WSNs). Hence, the proposed algorithms must achieve the minimum delay in data delivery while decreasing the energy consumption. In this paper, we propose a new version of the prefix frequency filtering technique (PFF) proposed by [1], which aims to minimize aggregation latency. PFF finds similar sets of data generated by nodes in order to reduce redundancy in data over the network, thus, nodes consume less energy. While in the enhanced version of the PFF technique, called PPSFF, we propose a positional filtering that exploits the order of readings both in the prefix and the suffix of a set and leads to upper bound estimations of similarity scores. Experiments on real sensor data show that our enhancement can significantly improve the latency of the PFF technique without affecting its performance.

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.

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

Amid the rapid development of information and communication technologies, there is an increasing demand for efficient and reliable data routing in next-generation computer and telecommunication systems. Wireless Sensor Networks (WSNs), which are widely applied across various domains – from environmental monitoring to healthcare and industrial automation – require a customized approach to routing strategy selection due to their constrained energy resources, dynamic topologies, and high node densities. Given the growing diversity of network architectures and the rising performance requirements, it becomes essential to identify optimal routing mechanisms capable of balancing delivery latency, throughput, energy consumption, and fault tolerance. This paper presents a structured review and analysis of recent studies dedicated to data transmission characteristics in WSNs. Particular attention is given to the importance of routing strategy classification in the context of designing an efficient WSN architecture, as it enables not only the systematization of existing solutions but also the justification of the most appropriate approach based on the network parameters. A comprehensive classification of routing strategies is shown, including: by route discovery method (proactive, reactive, hybrid), by network architecture (flat, hierarchical, location-based); by operational model (multipath, query-based, negotiation-based, QoS-based, and data-centric (further categorized into coherent and non-coherent approaches); by communication initiator (source-based and destination-based). The study explores the implementation specifics of each strategy, highlighting their advantages and potential limitations in the context of WSNs operating under energy and computational constraints. It has been found that the choice of an appropriate routing strategy significantly affects data transmission efficiency, network stability, delivery delays, and energy expenditure – key parameters for the practical deployment of WSNs across application areas ranging from environmental monitoring to industrial systems. The results obtained in this review may be used to improve routing algorithms and adapt them to specific operational conditions of sensor networks.

Active data dissemination for mobile sink groups in wireless sensor networks

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.

The real-time data dissemination schemes exploit the spatiotemporal commuication approach which forwards data at the delivery speed calculated with the desired time deadline and the end-to-end distance in wireless sensor networks (WSNs). In practical environments, however, the performance of the real-time data dissemination might be degraded by additional and inevitable delay due to some holes. Namely, the holes lengthen the data delivery path and the spatiotemporal approach could not estimate a distance of the data delivery path. To deal with this, we propose A Hole Self-Organization Real-time Routing Protocol for Irregular Wireless Sensor Networks. In proposed protocol, nodes around holes could detect them at deploying phase. A hole is represented as a circle with center point and radius. This hole information is processed and provided as a form of location service. When a source queries a destination location, location provider replies certain points for avoiding holes as well as destination location. Thus, the source could set desired speed toward the destination via the points. Performance evaluation shows that provides better real-time service in practical environments. 논문 14-39B-05-04 The Journal of Korea Information and Communications Society '14-05 Vol.39B No.05 http://dx.doi.org/10.7840/kics.2014.39B.5.281 281 ※ 이 논문은 2012년도 정부(교육과학기술부)의 재원으로 한국연구재단의 지원을 받아 수행된 기초연구사업임(NRF-2012R1A1A2044460) First Author : Chungnam National Univ. Department of Computer Engineering, sdkim@cclab.cnu.ac.kr, 정회원 ° Corresponding Author : Chungnam National Univ. Department of Computer Engineering, shkim@cnu.ac.kr, 종신회원 * 충남대학교 컴퓨터 공학과 네트워크 연구실 ({sdkim, cykim, hccho, ybyim}@cclab.cnu.ac.kr, shkim@cnu.ac.kr) 논문번호:KICS2014-02-063, Received February 20, 2014; Revised May 8, 2014; Accepted May 8, 2014 The Journal of Korea Information and Communications Society '14-05 Vol.39B No.05

In wireless sensor networks, a clustering-based technique is considered as an efficient approach for supporting mobile sinks without using position information. It exploits a Backbone-based Virtual Infrastructure (BVI) which uses only cluster heads (CHs) to construct routing structures. Since sensor nodes have constrained energy and are failure-prone, the effective design of both a clustering structure to construct a BVI and a routing protocol in the BVI is an important issue to achieve energy-efficient and reliable data delivery. However, since previous studies use one-hop clustering for a BVI, they are not robust against node and link failures and thus leading low data delivery ratio. They also use flooding-based routing protocols in a BVI and thus leading high energy consumption. Thus, in this paper, we propose a rendezvous-based data dissemination protocol based on multi-hop clustering (RDDM). Since RDDM uses a multi-hop clustering to provide enough backup sensor nodes to substitute a CH and enough backup paths between neighbor CHs, it can provide high robustness against node and link failures. By using a rendezvous CH, RDDM constructs routing paths from source nodes to mobile sinks without flooding in our BVI and thus can save energy of sensor nodes. By considering movement types of sinks, RDDM finds out a shorter path between a source node and a mobile sink through signaling only between neighbor CHs and thus can reduce the energy consumption. Analysis and simulation results show that RDDM provides better performance than previous protocols in terms of energy consumption and data delivery ratio.

In this paper, we propose a fault-tolerant routing protocol, called Sensor On-demand Multi-path Distance Vector Reliable (SOMDV-R) routing protocol, for wireless sensor networks to support reliable data delivery. Instead of selecting a shortest path, SOMDV-R takes into account both reliability demand and link quality to determine the number of desired paths. Beside, to improve packet delivery rate upon band channel condition, SOMDV-R supports multipath data delivery. We evaluate our proposed protocol via simulations. The results show that compared with Ad hoc On-demand Multi-path Distance Vector (AOMDV) and AODV, SOMDV-R can achieve higher packet delivery rate, lower routing overhead and lower mean latency, upon different channel conditions.