An Uneven Probabilistic Flooding Algorithm for Small-World Wireless Multi-Hop Networks
Concept of small-world is applied in the context of wireless multi-hop networks in this paper. We build a network model by selecting a small part of nodes and magnifying their communication distance. It is proved that this model behaves small-world character, mainly in average path length and clustering coefficient. Based on this model we put forward an uneven probabilistic flooding algorithm. Simulation results show that small-world model outperforms general multi-hop wireless network model greatly in both network coverage and hop count.