160 likes | 279 Views
Efficient Flooding Scheme Based on 2-Hop Backward Information in Ad Hoc Networks. Trong Duc Le and Hyunseung Choo School of Information and Communication Engineering Sungkyunkwan University, Korea ICC 2008 Speaker : Zhi-Han Lin. Outline. Introduction
E N D
Efficient Flooding Scheme Based on 2-Hop Backward Information in Ad Hoc Networks Trong Duc Le and Hyunseung Choo School of Information and Communication Engineering Sungkyunkwan University, Korea ICC 2008 Speaker : Zhi-Han Lin
Outline • Introduction • Flooding scheme using 1-Hop Information (1HI) • Flooding scheme using 2-Hop Backward Information (2HBI) • Performance Evaluation • Conclusion
Introduction • Flooding is a basic operation to propagate control messages in most ad hoc routing protocols. • Pure flooding causes severe redundant transmissions, congestions of the wireless media, and collisions in networks.
Each node maintains the 1-hop neighbor information to locally optimize the number of RNs at the next hop. • The number of RNs (retransmitting nodes) is still relatively high. • The RNs are densely distributed along the network border.
Distribution of retransmitting nodes in 1HI Nodes:1000 Radio range:250m Size:1000m*1000m
Distribution of retransmitting nodes in 2HBI Nodes:1000 Radio range:250m Size:1000m*1000m
Performance Evaluation • By using the ns-2 simulator. • Compare the pure flooding, Edge Forwarding, CDS-based flooding and 1HI with 2HBI. • Evaluate the performance of the ‘ratio of retransmissions’ and ‘the number of collisions’.
Nodes:200~1000 transmission range:250m Size:1000m*1000m
Nodes:500 transmission range:100~300m Size:1000m*1000m
Conclusion • The proposed scheme achieves its aim of minimizing the number of RNs and collisions in the network while maintaining the high deliverability of the flooding message. • The proposed scheme is suitable for its application to other ad hoc protocols in order to achieve a better flooding performance.