/ 22 1 A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks Hai Liu Xiaohua Jia Peng-Jun Wan Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon IEEE Transactions on Parallel and Distributed Systems 2007
/ 22 2 Outline Introduction Related Work Flooding Scheme Simulation Conclusion
/ 22 3 Background a b
/ 22 4 Goals Minimizes the number of forwarding nodes in each step Requires each node to keep only 1-hop neighbor information Guarantees 100% deliverability
/ 22 5 Related Work Pure Flooding Edge Forwarding CDS-Based
/ 22 6 Edge Forwarding i j A B C D E
/ 22 7 CDS-Based
/ 22 8 Flooding Scheme Computing Minimal Forwarding Nodes Forwarding Node Optimization
/ 22 9 Computing Minimal Forwarding Nodes a
/ Computing Minimal Forwarding Nodes a b c d e f Neighbor’s Boundary
/ Forwarding Node Optimization a c b d e f id(c) < id(b)
/ Simulation Simulator: NS2 MAC Layer: IEEE Data Packet Size: 256 Bytes Bandwidth: 2Mb/s Transmission Range: 100~300 Meter Number of Nodes: 200~1000 Size of Square Area: ~ meter 2 Network Load: 1Pkts/~25Pkts
/ Simulation
/ Simulation
/ Simulation
/ Simulation
/ Simulation
/ Simulation
/ Simulation
/ Simulation
/ Conclusion The proposed flooding scheme – The number of forwarding nodes is the minimal – 100% delivery ratio – Keep only 1-hop neighbor information
/ Thank You !