An uneven probabilistic flooding algorithm for small-world wireless multi-hop networks

Yan Tao Liu*, Jianping An, Heng Liu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008
DOIs
Publication statusPublished - 2008
Event2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008 - Dalian, China
Duration: 12 Oct 200814 Oct 2008

Publication series

Name2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008

Conference

Conference2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008
Country/TerritoryChina
CityDalian
Period12/10/0814/10/08

Keywords

  • Multi-hop
  • Probabilistic flooding
  • Small-world

Fingerprint

Dive into the research topics of 'An uneven probabilistic flooding algorithm for small-world wireless multi-hop networks'. Together they form a unique fingerprint.

Cite this