Dynamic Counter-Based Broadcast in MANETs Sara Omar al-Humoud 1 - - PowerPoint PPT Presentation

dynamic counter based broadcast in manets
SMART_READER_LITE
LIVE PREVIEW

Dynamic Counter-Based Broadcast in MANETs Sara Omar al-Humoud 1 - - PowerPoint PPT Presentation

Dynamic Counter-Based Broadcast in MANETs Sara Omar al-Humoud 1 Introduction Contribution DCB Related Stochastic Deterministic work Flooding Broadcasting Background Routing Wireless MANET Outline MANETs Broadcasting Fixed


slide-1
SLIDE 1

1

Dynamic Counter-Based Broadcast in MANETs

Sara Omar al-Humoud

slide-2
SLIDE 2

Introduction

Routing Broadcasting Wireless MANET Flooding

Deterministic Stochastic

DCB

Background Related work Contribution

slide-3
SLIDE 3

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

Outline

MANETs Broadcasting Fixed Counter-Based Broadcast Dynamic Counter-Based Broadcast Simulation and Results Questions

xtreemos summer school 2010

slide-4
SLIDE 4

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

3

MANETs

MANETs? Decentralised Dynamic topology Radio communication Energy constrained

(b)

Wireless Local Area Networks. (a) Infrastructure-based wireless network (b) ad hoc wireless network.

slide-5
SLIDE 5

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

4

MANET Applications

Military applications Collaborative and distributed computing Inter-Vehicle Communications Emergency operations

slide-6
SLIDE 6

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Outline

MANETs Broadcasting Fixed Counter-Based Broadcast Dynamic Counter-Based Broadcast Simulation and Results Questions

xtreemos summer school 2010

slide-7
SLIDE 7

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

5

Broadcasting

Broadcasting is the process by which a given node sends a packet to all other nodes in the network:

Discovering neighbours Collecting global information Addressing Helping in multicasting and Unicast Route discovery, route reply, in on-demand routing protocols like DSR, AODV to broadcast control messages

Conventionally broadcast is done through flooding

slide-8
SLIDE 8

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

6

Broadcast by Flooding

Flooding may lead to

Redundancy

x Consume limited bandwidth

Contention

x Increase in delay

Collision

x High packet loss rate

Broadcast storm problem!

23 45 68 90 1 2 3 4 5 6 7 8 9 10 Number of Messages Number of Nodes

f(n) = n2 – 2n + 1

slide-9
SLIDE 9

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

7

Stochastic Broadcasting Methods

Probability-based

Rebroadcast with probability P

Counter-based

Rebroadcast if the node received less than Cth copies of the msg

Location-based

Rebroadcast if the area within the node’s range that is yet to be covered by the broadcast > Ath

Distance-based

Rebroadcast if the node did not receive the msg from another node at a distance less than Dth

Simple Implementation RD based on instantaneous information from broadcast msgs

xtreemos summer school 2010

slide-10
SLIDE 10

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010 8

Deterministic Broadcasting Methods

Self-pruning Scalable broadcasting Dominant Pruning Cluster-based

Elaborate Implementation Rebroadcast decision based on neighbourhood study

slide-11
SLIDE 11

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Outline

MANETs Broadcasting Fixed Counter-Based Broadcast Dynamic Counter-Based Broadcast Simulation and Results Questions

slide-12
SLIDE 12

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Counter-Based Broadcast

When receiving a message:

counter c is set to keep track of number of duplicate messages received. Random Assessment Delay (RAD) timer is set. When the RAD timer expires the counter is tested against a fixed threshold value C, broadcast is inhibited if c > C.

slide-13
SLIDE 13

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Outline

MANETs Broadcasting Fixed Counter-Based Broadcast Dynamic Counter-Based Broadcast Simulation and Results Questions

slide-14
SLIDE 14

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Dynamic Counter-Based Broadcast

combines both techniques Stochastic: counter threshold Deterministic: neighbour-knowledge

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 ... 28 29 30 31 32 33 34 ... ... ... ... ... ... 250

Drop Don’t count Don’t wait

Low C High C

Rebroadcast Don’t count Don’t wait long

Very Sparse Normal

  • V. Dense
slide-15
SLIDE 15

Flooding

Get the Broadcast ID c = 1 Set RAD [0..Tmax]

While (RAD) same packet heard

c = c + 1 End while C < c

drop packet Trans packet

Get the Broadcast ID

same packet heard drop packet Trans packet

yes yes yes No No No

Counter-based

Dynamic Counter-based

slide-16
SLIDE 16

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

Outline

MANETs Broadcasting Fixed Counter-Based Broadcast Dynamic Counter-Based Broadcast Simulation and Results Questions

xtreemos summer school 2010

slide-17
SLIDE 17

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Simulation Environment

Traffic Generator Traffic Pattern Mobility Generator Mobility Traces Output Traces

ns2 simulator Results Analysis

slide-18
SLIDE 18

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Simulation Parameters

Simulation parameter Value Simulator ns-2 (version 2.33) Network Area 1000x1000 meters2 Transmission range 100 meters Simulation Time 900 sec Number of Trials 30 MAC layer protocol IEEE 802.11b Maximum Nodal Speed 8 (m / sec) = 28.8 km / hour Confidence interval 95% Mobility Models Random Way Point Manhattan Mobility Model Reference Point Group Mobility Model

slide-19
SLIDE 19

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Mobility Models

How it works? at every instant, a node randomly chooses a destination and moves towards it with a velocity chosen uniformly randomly from [0,Vmax]

Random Way Point 50 nodes

slide-20
SLIDE 20

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Mobility Models

Geographic restrictions on node mobility Depend on maps Map: horizontal and vertical streets At an intersection of a horizontal and a vertical street, the mobile node can turn left, right or go straight

Manhattan Mobility Model 75 nodes 50 nodes

slide-21
SLIDE 21

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Mobility Models

  • Military, touring groups
  • Group: has a logical centre

(group leader) that determines the group's motion behaviour

  • Each node deviates its velocity

(both speed and direction) randomly from that of the leader.

– Number of groups – Speed Deviation – Angle Deviation – Leader mobility trace

Reference Point Group Mobility Model

V_{member}(t) = V_{leader}(t) + random() * SDR * max_speed theta_{member}(t) = theta_{leader}(t) + random() * ADR * max_angle SDR: Speed Deviation Ratio ADR: is the Angle Deviation Ratio.

10

slide-22
SLIDE 22

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Mobility Models

  • Military, touring groups
  • Group: has a logical centre

(group leader) that determines the group's motion behaviour

  • Each node deviates its velocity

(both speed and direction) randomly from that of the leader.

– Number of groups – Speed Deviation – Angle Deviation – Leader mobility trace

Reference Point Group Mobility Model

V_{member}(t) = V_{leader}(t) + random() * SDR * max_speed theta_{member}(t) = theta_{leader}(t) + random() * ADR * max_angle SDR: Speed Deviation Ratio ADR: is the Angle Deviation Ratio.

30

slide-23
SLIDE 23

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Performance metrics

Saved Rebroadcast

(r t)/r : how much a node saves packets (not rebroadcast)?

  • r = number of hosts receiving the broadcast message
  • t = number of hosts that actually transmitted the message.

Reachability

r/e: what is the percentage of nodes delivering packets successfully?

  • r = number of hosts receiving the broadcast packet
  • e = number of reachable mobile hosts, directly or indirectly, from the

source host .

Average latency how long it takes a packet to be delivered?

the interval from the time the broadcast was initiated to the time the last host finished its rebroadcasting.

slide-24
SLIDE 24

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Simulation results

slide-25
SLIDE 25

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Simulation results

slide-26
SLIDE 26

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Simulation results

slide-27
SLIDE 27

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

Conclusions and Future Directions

DCB broadcasting scheme gain in SRB (+62%) slight loss in reachability (-14%) some gain (+8%) in average latency investigate more on achieving higher reachability in accord to some acceptable loss in SRB values.

slide-28
SLIDE 28

Dynamic Counter-Based Broadcast in MANETs

Sarah Al-Humoud

xtreemos summer school 2010

http://dcs.gla.ac.uk/~sara/

Questions Thank you!

slide-29
SLIDE 29