CONTENT BASED MULTICAST

IN AD HOC NETWORK

B.E. COMPUTER SEMINAR

Content Based Multicast (CBM) in Ad Hoc Networks

Hu Zhou and Suresh Singh Department of ECE Oregon State University
Presented by Christine Julien

B.E. COMPUTER SEMINAR

Overview
Introduction Related Work The CBM Multicast Protocol Performance Evaluation Future Work

B.E. COMPUTER SEMINAR

The CBM Model

the receiver set for information changes dynamically based on the content of the information being multicast as well as on the mobility of the receivers themselves.

B.E. COMPUTER SEMINAR

Example Application Areas

Disaster Relief Networks
Contain a variety of threats to relief personnel (e.g. gas, fires, riots, etc.) Locations of other personnel and resources are also important

Battlefield Networks

Soldiers need to be informed of time-to-threat, distance-to-threat, and type-of-threat

B.E. COMPUTER SEMINAR

Collection and Dissemination

Autonomous sensors dropped into the field collect threat information Information about allies is readily available Network protocols (i.e. CBM) must deliver the information in a timely manner

B.E. COMPUTER SEMINAR

Model Overview
The model assumes that nodes are interested in information about threats and resources that are:
t time away from the current location, and/or d distance away

B.E. COMPUTER SEMINAR

Example Scenario

B.E. COMPUTER SEMINAR

Effects of Mobility
The direction of movement of a threat influences the conduct of the multicast Personal personnel specifications influence distance of multicast

B.E. COMPUTER SEMINAR

More Complicated Mobility

Multicast needs to be extended from sensors to ensure that mobile personnel also receive information

B.E. COMPUTER SEMINAR

The CBM Protocol

Sensor-push and Receiver-pull
Sensors detecting a threat send a limited broadcast into a small region in the path of the threat Receivers pull threat warnings from nodes lying in their direction of travel

Reduces the number of warning messages by ensuring that only nodes that need warnings receive them

B.E. COMPUTER SEMINAR

Geographic Regions
The area is divided into regions

The regions are determined based on density of nodes, terrain, and mobility considerations Each region has a leader

B.E. COMPUER SEMINAR

Push Protocol
When a sensor detects the presence of a threat, it generates a limited broadcast message for nodes that will lie in the path of the threat

B.E. COMPUTER SEMINAR

The Push Algorithm

When a sensor detects a threat, it determines the projected velocity vector for the threat (k). The speed of the threat is s Tk represents the time specification used by the sensor to push threat information The sensor sends one THREAT_WARNING message to each block leader within the threat area Each leader broadcast the warning within its group When the threat changes direction or moves, the sensor rebroadcasts

B.E. COMPUTER SEMINAR

The Pull Algorithm

Assume a node wants to be warned of all threats it will encounter within tn Let the nodes speed be sn

In time tn, the node will be in a block tnsn away

The node sends a PULL_REQUEST to the leader of the block it expects to be in The leader sends back information about potential threats

B.E. COMPUTER SEMINAR

The Pull Algorithm (cont.)

The leader also initiates pulls for additional threat information

Let skmax be the max speed of a threat of type k The leader sends a pull request to leaders of blocks that are skmaxtn away These leaders determine if they know about threats that are moving to that area

All pull requests are sticky with a Time To Live field

B.E. COMPUTER SEMINAR

The Pull Algorithm (cont.)

B.E. COMPUTER SEMINAR

Future Work
When the last node leaves a block, what if the neighboring blocks are also empty? How does the protocol account for connectivity losses? What is the correct way to predict threat mobility?

Introduction of a confidence parameter

How should the protocol model gas cloud dispersion? What are the energy/message efficiency tradeoffs in this domain?

B.E. COMPUTER SEMINAR

conclusion
After studying this topic,I conclude that, this is vary useful system for Disaster relief network ,Battle field network

Every nodes are interested in information about threat and resource with time t and distance d.

B.E. COMPUTER SEMINAR BIBILOGRAPHY

Content based multicast in ad hoc network,Hu Zhou and Suresh Singh,cregon state university. Multicast protocol implementation in ad hoc network,Sang Ho Bas,Sung-Jn Lec,los engle.http://www.cs.ucla.edu/nrl/wireless Multicast & Mbone on Linux-Application http://www.teksouth.com/Linux/multicast/application. html

THANKING YOU