1. / 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

2. / 22 2 Outline Introduction Related Work Flooding Scheme Simulation Conclusion

3. / 22 3 Background a b

4. / 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

5. / 22 5 Related Work Pure Flooding Edge Forwarding CDS-Based

6. / 22 6 Edge Forwarding i j A B C D E

7. / 22 7 CDS-Based

8. / 22 8 Flooding Scheme Computing Minimal Forwarding Nodes Forwarding Node Optimization

9. / 22 9 Computing Minimal Forwarding Nodes a

10. / 22 10 Computing Minimal Forwarding Nodes a b c d e f Neighbor’s Boundary

11. / 22 11 Forwarding Node Optimization a c b d e f id(c) < id(b)

12. / 22 12 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 meter 2 Network Load: 1Pkts/~25Pkts

13. / 22 13 Simulation

14. / 22 14 Simulation

15. / 22 15 Simulation

16. / 22 16 Simulation

17. / 22 17 Simulation

18. / 22 18 Simulation

19. / 22 19 Simulation

20. / 22 20 Simulation

21. / 22 21 Conclusion The proposed flooding scheme – The number of forwarding nodes is the minimal – 100% delivery ratio – Keep only 1-hop neighbor information

22. / 22 22 Thank You !