A new paradigm for multi-path routing protocol for data delivery in wireless sensor networks

2021 ◽  
pp. 1-14
Author(s):  
Lakhdar Kanouni ◽  
Fouzi Semchedine
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Wireless Sensor ◽  
Data Delivery ◽  
New Paradigm

scholarly journals MQoSR: A Multiobjective QoS Routing Protocol for Wireless Sensor Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Hind Alwan ◽  
Anjali Agarwal
Keyword(s):  
Wireless Sensor Networks ◽  
Quality Of Service ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Data Transmission ◽  
Qos Routing ◽  
Wireless Sensor ◽  
Data Delivery

With the growing demand for quality-of-service (QoS) aware routing protocol in wireless networks, QoS-based routing has emerged as an interesting research topic. Quality of service guarantee in wireless sensor networks (WSNs) is difficult and more challenging due to the fact that the available resources of sensors and the various applications running over these networks have different constraints in their nature and requirements. In this paper, we present a heuristic neighbor selection mechanism in WSNs that uses the geographic routing mechanism combined with the QoS requirements to provide multiobjective QoS routing (MQoSR) for different application requirements. The problem of providing QoS routing is formulated as link, and path-based metrics. The link-based metrics are partitioned in terms of reliability, delay, distance to sink, and energy, and the path-based metrics are presented in terms of end-to-end delay, reliability of data transmission, and network lifetime. The simulation results demonstrate that MQoSR protocol is able to achieve the delay requirements, and due to optimum path selection process, the achieved data delivery ratio is always above the required one. MQoSR protocol outperforms the existing model in the literature remarkably in terms of reliable data transmission, time data delivery, and routing overhead and underlines the importance of energy-efficient solution to enhance network lifetime.

A Routing Protocol for Solar Energy Harvesting Wireless Sensor Networks

2013 ◽  
Vol 734-737 ◽  
pp. 2903-2906
Author(s):  
He Pei Li ◽  
Ling Tao Zhang ◽  
Su Bo He
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Harvesting ◽  
Solar Energy ◽  
Routing Protocol ◽  
Average Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Data Delivery ◽  
Solar Energy Harvesting

Energy and lifetime issues are crucial to the wide applications of wireless sensor networks. This paper proposes a routing protocol, SEHRP (Solar Energy Harvesting Routing Protocol), for solar energy harvesting wireless sensor networks. This protocol classifies all the sensor nodes into various regions for which each region has been assigned its transmission priority, and the data can only be delivered from lower priority regions to higher priority region. SEHRP can also detect the sensor nodes which are under the charging state, then avoid choosing those charging nodes to ensure the successful data delivery. Simulation results show that, compared to the baseline protocol, SEHRP can achieve significant performance improvements in terms of average energy consumption and average data delivery rate.

scholarly journals Data Collection About Rare Plant Species by Wireless Sensor Networks through Congestion Aware Routing

2013 ◽  
Vol 21 (1-2) ◽  
pp. 195-204
Author(s):  
MM Bhuiyan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Base Station ◽  
Wireless Sensor ◽  
Control Algorithms ◽  
Data Delivery ◽  
Efficiency And Reliability ◽  
Congestion Aware

Agricultural monitoring is an important application of wireless sensor networks (WSNs) where energy-efficiency and reliability are two essential performance measures. The extended lifetime of a network is of limited use if the acquired reliability does not meet the application requirement. In order to improve the reliability, it is necessary to reduce congestion because of the inherent correlation between reliability and congestion. Existing Congestion control algorithms, found in WSN literature, are reactive. After formation and detection of congestion, these algorithms try to reduce the congestion. In this paper, we present a congestion aware routing protocol that avoids congestion formation proactively and as a result, it improves data delivery success rate in WSNs deployed to gather agricultural data. Appropriate routes are selected based on location, energy and congestion information of neighbours as well as based on the location information of the base station. Experimental results show that the proposed method is energy-efficient and at the same time, it achieves high packet success.DOI: http://dx.doi.org/10.3329/pa.v21i1-2.16768 Progress. Agric. 21(1 & 2): 195 - 204, 2010

Independent Grid Structure-Based Routing Protocol in Wireless Sensor Networks

2013 ◽  
Vol E96.B (1) ◽  
pp. 309-312 ◽  
Author(s):  
Euisin LEE ◽  
Soochang PARK ◽  
Hosung PARK ◽  
Sang-Ha KIM
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Wireless Sensor ◽  
Grid Structure

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

SPREAD - A Routing Protocol to Meet End-to-end Adjusted Deadline in Real Time Wireless Sensor Networks

2020 ◽  
Vol 10 (1) ◽  
pp. 63-78
Author(s):  
Neetika Jain ◽  
Sangeeta Mittal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Resource Constraints ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Packet Delivery ◽  
High Data ◽  
Hard Real Time

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.

Sign in / Sign up

Export Citation Format

Share Document