mobile ad hoc networks for video multicast seminar presentation advanced topics in distributed...

Mobile Ad Hoc Networks for Video Multicast

Seminar Presentation

Advanced Topics in Distributed Systems:

Modern Group Communication Mechanisms

Marleine Mounir Daoud

9th of February, 2009

Outline Introduction

Mobile Ad Hoc Networks Multicast Overview

Video Multicast Multicast Tree and Mesh Approaches ODMRP and MAODV

MT-MAODV

Reason for MAODV and MDC MT-MAODV Algorithm with an Example Evaluation

Conclusion

ReferencesMonday, February 09, 2009 2Marleine Mounir Daoud -


Introduction Mobile Ad Hoc Networks

(MANETs) Are by Definition:

Multi-hop wireless networks

Dynamically reconfigurable

No fixed infrastructure No central administration

Widely Used Important in Future Wireless Communication

Monday, February 09, 2009 3Marleine Mounir Daoud - Seminar Presentation

Introduction Mobile Ad Hoc Networks (MANETs) ctd.

Applications Crowd Control Battlefields Search and Rescue



Problems and Constraints Mobility, No fixed topology Route discovery required frequently Limited Battery Power, Limited Bandwidth Wireless Transmitter Range



Problems and Constraints Links formed and broken due to mobility

Multicast in Ad Hoc Tasks in Groups for better Quality Groups solve some MANETs problems thus

Multicast important in MANETs

A B AB


Multicast Overview

Video Multicast Definition

Delivering video to multiple receivers

Receivers have same multicast address

Applications Group Video Conferencing Video-On-Demand Distance Learning


Multicast Overview

Video Multicast ctd. Requirements or Constraints

Lost Bandwidth Jitter Delay

Problems Available routing protocols are designed more

efficiently for data applications rather than video applications, thus video transmission constraints might not be fulfilled


Multicast Overview Multicast Tree and Mesh Approaches

Multicast General Tree vs. Wireless Wireless Nodes have Broadcasting Nature

Tree Tree Definition:

Only 1 Routebetween treeand receiver

Protocols using Tree Approach: MAODV


Multicast Overview Multicast Tree and Mesh Approaches ctd.

Mesh Mesh Definition:

Multiple Routesbetween sourceand receiver

Protocols using Mesh Approach: ODMRP


Multicast Overview

Multicast Tree and Mesh Approaches ctd. Advantages and Disadvantages

Tree + High forwarding (single path property) - High possibility of dropping (no backup path exists) - Vulnerable to high mobility - Vulnerable to load or large groups

Mesh + Multiple paths (more efficient if a path broke) + Quickly reconfigurable - High number of forwarding nodes - Excessive message overhead (low efficiency)


Multicast Overview Multicast Routing Protocols

MAODV AMRoute

CAMP

WARM

OLAM L-REMiT

DDR

AMRIS

NSMP PUMA

PBM

DCMP

PAST-DM ODMRP

MT-MAODV

G-REMiT

S-REMiT

MZR

STMP

MCEDAR

ADMR

FGMPMANSI


Multicast Overview

On-Demand Multicast Routing Protocol (ODMRP)

Receiver-initiated protocol (On-Demand) Mesh Based Approach (multiple routes) Soft-State (join/leave group) Uses concept of Forwarding Group

Subset of nodes forwards multicast packets using scoped flooding

Shortest path between any pair of nodes


Multicast Overview ODMRP Example


Multicast RT

Forwarding Group

X s

b

ae

X Z

Y

W

d

c

Sender

s

Y, Zs b, cs

a, Ws

d, es

Broadcast

Join ReplyJoin Request

Multicast Overview ODMRP Example


Robustness

Multicast Overview

On-Demand Multicast Routing Protocol (ODMRP)

Advantages and Disadvantages + No explicit leave message (member nodes

refreshed when needed by source) + Multiple path to one destination (mesh

approach) + Backup path if link is broken (Robust) - High Overhead (because broadcast the reply to

many nodes) - Complex Topology


Multicast Overview

Multicast Ad Hoc On-Demand Distance Vector (MAODV)

Extension of the unicast protocol, Ad Hoc On-Demand Distance Vector (AODV)

Receiver-initiated protocol Tree Based Approach Consists of 2 main parts:

Tree Construction Tree Maintenance


Multicast Overview

Multicast Ad Hoc On-Demand Distance Vector (MAODV) ctd.

Each Multicast Group has: Group Leader (First group member) Responsible in maintaining sequence number

that ensures updated routing information GL broadcasts Hello messages to keep track of

tree connectivity


Multicast Overview

Tree Construction Node broadcast

Join Flag Any node sends

back reply Shortest path

selected New node joins Same procedure

d

j k l

ihg

f

A

e

C

BMonday, February 09, 2009 19Marleine Mounir Daoud - Seminar Presentation

Multicast Overview

Tree Maintenance Link breaks GL sends hello

messages Link known to

be down New routes

are discovered d

j k l

ihg

f

A

e

C

BMonday, February 09, 2009 20Marleine Mounir Daoud - Seminar Presentation

Multicast Overview MAODV Example

L

Group Join Process

Broadcast - RREQ

Only GM Responds

Multicast ActivationBroadcast Group Hello

Group member

Multicast Tree member

Ordinary node

Potential Group member

Multicast link

Communication link


Multicast Overview MAODV Example

L

Leaving a Multicast Group

Non leaf NodeMust remain as a Tree member

Leaf NodeCan remove itself from

MTAgain Leaf Node

Remove himself from MT

Group member

Multicast Tree member

Ordinary node

Potential Group member

Multicast link

Communication link


Multicast Overview

Multicast Ad Hoc On-Demand Distance Vector (MAODV)

Advantages and Disadvantages + Low Overhead (because unicast the reply) + Shortest path always chosen (tree approach) - No backup path if link is broken - High percentage of bad frames in video

transmission due to packet loss (link broken) - Multiple interruptions seen in video watched


MT-MAODV

Multiple Tree Multicast Ad Hoc On-Demand Distance Vector (MT-MAODV)

Goal: Provide Improved Video Quality By: Discovering a new routing protocol Using:

Multiple Disjoint Trees MAODV Multiple Description Coding (MDC)


MT-MAODV

Reason for Multicast Ad Hoc On-Demand Distance Vector (MAODV) and Multiple Description Coding (MDC)

MAODV: Have: Mobility, Solution: Fault-Tolerant

Framework Use Many Disjoint Trees (transform MAODV)

MDC: Have: Many Trees, Solution: Dividing the video

into many equally and independent video description possible with MDC


MT-MAODV MT-MAODV Algorithm

Goal: Construction of 2 disjoint trees 5 Statuses for nodes available:

ON_GROUP:multicast group member

ON_TREE_0forwarding node of the 2 trees

ON_TREE_1forwarding node of tree 1

ON_TREE_2forwarding node of tree 2

NOT_ON_TREEnot tree member


MT-MAODV MT-MAODV Algorithm ctd.

6 Steps Algorithm: Send RREQ_J

by node wanting to join multicast group Forward RREQ_J

by NOT_ON_TREE nodes Reply RREQ_J

by group members Forward RREP_J

to the requesting node Store RREP_J

given shortest path Trees Activation

sent by requesting nodeMonday, February 09, 2009 27Marleine Mounir Daoud -


MT-MAODV

MT-MAODV Algorithm Example Multiple trees construction with multicast table

for topology


MT-MAODV

MT-MAODV Algorithm Example Multiple trees construction for node A


Considering GL is Group Leader

Node A sends Join Request

GL replies with 2 upstream nodes available: y and z

Node A receives replies with both Tree fields as Zero so can select any of them for tree-1: node y and the other for tree-2: node z

MT-MAODV

MT-MAODV Algorithm Example Multiple trees construction for node B


Node B sends Join Request

Node A replies with Tree field as Zero and Node z replies with Tree field as 2

Node B receives replies and chooses node A for tree-1 and node z for upstream of tree-2

MT-MAODV

MT-MAODV Algorithm Example Multiple trees construction for node C


Node C sends Join Request

Three replies are returned: Node A replies with Tree field as Zero from node x and node w, Node B replies with Tree field as Zero from node v

Node C receives replies and can chooses node x or w for tree-1 and node v for upstream of tree-2 because connecting to different Tree Members has higher priority

MT-MAODV

MT-MAODV Algorithm Example Multiple trees construction for node D


Node D sends Join Request

As it has only 1 node connected to it, Node u will reply with Tree field as Zero from Node B

Node D receives reply and chooses Node u for upstream of tree-1 and tree-2 because priority is given to tree connectivity rather than disjoint trees

MT-MAODV

MT-MAODV Algorithm Example After multiple trees construction completed,

can fill in the table for topology


MT-MAODV Evaluation

Video Quality Received Percentage of Bad Frames:

- with MAODV and MDC: 2% improvement- with MT-MAODV: addition of 2% improvement

A bad frame occurs when the 2 video descriptions sent on the 2 trees are not decodable at the same time

Number of Interruptions:- with MAODV: more than 50 times- with MT-MAODV: less than 20 times

Great improvement in this point!Monday, February 09, 2009 34Marleine Mounir Daoud -


MT-MAODV Evaluation ctd.

Network View Number of Hops Traversed:

- MT-MAODV has higher number than MAODVMAODV always chooses shortest path while MT-MAODV chooses 2 paths so increase by less than 1 hop

Number Routing Control Packets:- MT-MAODV has higher number than MAODVNecessary in constructing and maintaining 2 trees

Forwarding Efficiency:- MT-MAODV worse than MAODVLarger hops to be traversed in MT-MAODV


Conclusion MT-MAODV

Fault-tolerant video transmission due to MDC Improvement in the field of video multicast on

ad hoc networks from the point of the video quality received

From the network view, can be considered as having open issues and future challenges so that the presented algorithm can be improved


Thank You for Listening

Any Questions?


References

Chee Onn Chow and Hiroshi Ishii. Multiple Tree Multicast Ad Hoc On-Demand Distance Vector (MT-MAODV) Routing Protocol for Video Multicast over Mobile Ad Hoc Networks. IEICE Transactions, 91-B(2):428-436, 2008

B. Xu, S. Hischke, and B. Walke. The role of ad hoc networking in future wireless communications. In Proceedings of International Conference on Communication Technology, ICCT 2003, volume 2, pages 1353-1358, Beijing, China, Apr 2003.

Sung ju Lee, William Su, Julian Hsu, Mario Gerla, and Rajive Bagrodia. A performance comparison study of ad hoc wireless multicast protocols. Pages 565-574, 2000.

Katia Obraczka and Gene Tsudik. Multicast routing issues in ad hoc networks. In In IEEE ICUPC, 1998.


References ctd.

Sung ju Lee, William Su, and Mario Gerla. On-demand multicast routing protocol. Pages 1298-1302, 1999.

C. Siva Ram Murthy and B.S. Manoj. Ad Hoc Wireless Networks: Architectures and Protocols. Prentice Hall PTR, Upper Saddle River, NJ, USA, 2004.

E. Royer and C. Perkins. Multicast Ad hoc On- Demand Distance Vector (MAODV) Routing, 2000.

C. Perkins, E. Belding-Royer, and S. Das. Ad hoc On-Demand Distance Vector (AODV) Routing, 2003.

V. K. Goyal. Multiple description coding: compression meets the network. Signal Processing Magazine, IEEE, 18(5):74-93, September 2001.


References ctd.

Fred Baker, “Mobile Ad Hoc Networks”, Cisco Presentation.

Dewan Tanvir Ahmed, “Multicasting in Ad Hoc Networks”, University of Ottawa.

“On Demand Multicast Routing Protocol”, COSC 6590, 2007.

S.-J. Lee, W. Su, and M. Gerla, “On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks”, IEEE Networks, vol. 13, no. 4, Jul. 1999, pp. 48-54.


mobile ad hoc networks for video multicast seminar presentation advanced topics in distributed...

Documents

mobility multicast

multicast important

mesh mesh definition

video applications

networks manets ctd

tree approach

mesh approaches ctd

manets problems