Parsimonious flooding in geometric random-walks

作者：

Highlights：

• We analyze parsimonious-flooding on MANETs yielded by random-walks.

• We provide analytical bounds on its completion time. Such bounds are optimal for a wide range of the inputs.

• Departing from previous analysis, our technique determines the dynamic shape of the information-spreading process.

摘要

•We analyze parsimonious-flooding on MANETs yielded by random-walks.•We provide analytical bounds on its completion time. Such bounds are optimal for a wide range of the inputs.•Departing from previous analysis, our technique determines the dynamic shape of the information-spreading process.

论文关键词：Information/virus spreading,Broadcasting protocols,Geometric random-walks,Mobile ad-hoc networks

论文评审过程：Received 3 June 2014, Accepted 5 June 2014, Available online 18 June 2014.

论文官网地址：https://doi.org/10.1016/j.jcss.2014.06.002