qos constraint routing protocols for mobile ad hoc n.
Skip this Video
Download Presentation
QoS Constraint Routing Protocols for Mobile Ad Hoc

Loading in 2 Seconds...

play fullscreen
1 / 16

QoS Constraint Routing Protocols for Mobile Ad Hoc - PowerPoint PPT Presentation

  • Uploaded on

QoS Constraint Routing Protocols for Mobile Ad Hoc. Igli Tafaj. Introduction. Which is the aim of this paper…? What is MANET? Classification of Multicast Routing Protocol? What is MAODV?. Some QoS Multicast Routing Protocols. QAMNet QMR QMRP AQM. The dynamism of Routing Protocols.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
Download Presentation

PowerPoint Slideshow about 'QoS Constraint Routing Protocols for Mobile Ad Hoc' - ardice

Download Now An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
  • Which is the aim of this paper…?
  • What is MANET?
  • Classification of Multicast Routing Protocol?
  • What is MAODV?
the dynamism of routing protocols
The dynamism of Routing Protocols


  • Path selection depend on:
  • Stability of neighbours node
  • Power level (batery)
  • Buffer Level (overhead)

Each forwarding packet should have a reply, in which could determine the appropriate selected path

maodv extension
  • Route Discovery
  • Path Selection
  • Hop Count
  • Power Level
  • Buffer Level
  • Stability Level
  • Cost
  • Class
  • The selection of path based on QoS metrics
  • The metrics depends entirely on MAC Sub layer (Layer_2)
  • On these metrics supported MAODV
  • MAODV – Extended based on some featuring of Network and Application metrics mixed
  • Network Metrics depends on maximum hop count metric
  • Application Metrics depends on cost of some concave and additive metrics like: Bandwidth, Delay etc
experiment envirement
Experiment Envirement
  • Operating System: Linux Red Hat 9.0
  • NS2 version: ns-allinone-2.26
  • The simulation environment is:
  • 1) Area: 1500 x 300 meters;
  • 2) Number of nodes: 60;
  • 3) Simulation duration: 900 seconds;
  • 4) Number of repetitions: 4;
  • 5) Physical/Mac Layer: IEEE 802.11 at 2Mbps, 250 meter transmission range;
experiment envirement1
Experiment Envirement
  • 6) Mobility model: random waypoint model with no pause time, and node movement speed 0m/s, 1m/s or 20m/s.
  • 7) Each sender sends 2 multicast data packets per second with each packet 256 bytes long;
experiment envirement2
Experiment Envirement
  • 8) All receivers join a single multicast group at the beginning of the simulation, and the senders start sending data 30 seconds later. After 900 seconds, all senders stop transmitting data;
  • 9) Only multicast traffic exists in the simulation.
  • Network Layer Metrics:
  • Power: power=min(path.power, power)
  • Buffer: path.buffer=hop*path.buffer+buffer/hop+1
  • Stability: path.stab=max(path.stab,stab)
  • Application Layer Metric:
  • Throughput=total no.of bit*8 (from the Start time-End time)
simulation graphs
Simulation Graphs

Average end-to-end delay vs speed

PDR vs Speed

simulation graphs1
Simulation Graphs

PDR vs Nr of Nodes

Average end-to-end delay vs speed

simulation graphs2
Simulation Graphs

Throughput vs Nr of Nodes

PDR vs Nr of Nodes

  • QoS-MAODV, the multicast routing protocol is the extension of MAODV with the QoS support
  • The network layer metrics is involved in the path discovery to find a QoS path to the destination.
  • The path with the highest stability is the preferred path. If more than one path is found the destination node selected the path with the highest power level.
  • Regarding the application requirements, if the application is delay sensitive then the path with the minimum delay is chosen
  • For the application with throughput constrained the path with maximum bandwidth is selected
  • With no constraint any path is chosen by the destination.
  • The protocol balanced the routing load and also minimized the consumption of resources.
  • As a future work, different number of flows can be analyzed with different network scenarios.