/ 221

A Distributed and Efficient Flooding Scheme Using 1-hop Information in

Mobile Ad Hoc Networks

Hai Liu Xiaohua JiaPeng-Jun WanDept. of Comput. Sci., City Univ. of Hong Kong, Kowloon

IEEE Transactions on Parallel and Distributed Systems 2007

/ 222

Outline

Introduction

Related Work

Flooding Scheme

Simulation

Conclusion

/ 223

Background

a

b

/ 224

Goals

Minimizes the number of forwarding nodes in each step

Requires each node to keep only 1-hop neighbor information

Guarantees 100% deliverability

/ 225

Related Work

Pure Flooding

Edge Forwarding

CDS-Based

/ 226

Edge Forwarding

i

j

A

B

CD

E

/ 227

CDS-Based

/ 228

Flooding Scheme

Computing Minimal Forwarding Nodes

Forwarding Node Optimization

/ 229

Computing Minimal Forwarding Nodes

a

/ 2210

Computing Minimal Forwarding Nodes

a

b

c

d

e

f

Neighbor’s Boundary

/ 2211

Forwarding Node Optimization

a

c

b

d

e

fid(c) < id(b)

/ 2212

Simulation

Simulator: NS2

MAC Layer: IEEE 802.11

Data Packet Size: 256 Bytes

Bandwidth: 2Mb/s

Transmission Range: 100~300 Meter

Number of Nodes: 200~1000

Size of Square Area: 200000~1000000 meter2

Network Load: 1Pkts/~25Pkts

/ 2213

Simulation

/ 2214

Simulation

/ 2215

Simulation

/ 2216

Simulation

/ 2217

Simulation

/ 2218

Simulation

/ 2219

Simulation

/ 2220

Simulation

/ 2221

Conclusion

The proposed flooding scheme

– The number of forwarding nodes is the minimal

– 100% delivery ratio

– Keep only 1-hop neighbor information

/ 2222

Thank You !