RQOD: Routing algorithm based on realizing the multiple QoS requirements separately and on-demand in wireless sensor networks

In Wireless sensor networks and ad hoc networks nodes have a freedom to move from one place to another, they are self-configuring this type of the structure fulfil the requirements of several application. A survey on the different MANET protocols will be done in this paper. Mainly this paper will focus on the Quality of Service on the different parameters like Throughput and Delay between different protocols like AODV (Ad Hoc on Demand Distance Vector), DSDV (Destination-Sequenced Distance-Vector Routing), DSR (Dynamic Source Routing), and TORA (Temporary Ordered Routing Algorithm). DSDV is called as proactive protocol because they know everything about the nodes in the network before the communication start. DSR, AODV, TORA protocols are called reactive protocol because nodes in this network do not know anything about network. They are also called ON-DEMAND routing protocols. After this analysis you will come to know which MANET protocol is best for different application.

Download Full-text

A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks

International Journal of Wireless Networks and Broadband Technologies ◽

10.4018/ijwnbt.2011070104 ◽

2011 ◽

Vol 1 (3) ◽

pp. 49-70 ◽

Cited By ~ 2

Author(s):

Martin Brandl ◽

Andreas Kos ◽

Karlheinz Kellner ◽

Christian Mayerhofer ◽

Thomas Posnicek ◽

...

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Routing Algorithm ◽

Wireless Sensor ◽

Data Traffic ◽

Data Forwarding ◽

On Demand ◽

Dynamic Source ◽

Demand Routing ◽

Set Up

Wireless Sensor Networks (WSNs) are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric (Pa) gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm (DSR). The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node’s attractiveness metric.

Download Full-text

A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks

Security, Design, and Architecture for Broadband and Wireless Network Technologies ◽

10.4018/978-1-4666-3902-7.ch016 ◽

2013 ◽

pp. 218-240

Author(s):

Martin Brandl ◽

Andreas Kos ◽

Karlheinz Kellner ◽

Christian Mayerhofer ◽

Thomas Posnicek ◽

...

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Routing Algorithm ◽

Wireless Sensor ◽

Data Traffic ◽

Data Forwarding ◽

On Demand ◽

Dynamic Source ◽

Demand Routing ◽

Set Up

Wireless Sensor Networks (WSNs) are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric (Pa) gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm (DSR). The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node’s attractiveness metric.

Download Full-text