Information Dissemination: Minimizing the number of messages under probabilistic flooding

Konstantinos Skiadopoulos, Marios Magioladitis


This paper presents a method with respect to information dissemination that tends to minimize the number of needed messages. Assuming flooding as the information dissemination algorithm, a new general way to determine the forwarding probability is proposed here so that full coverage is achieved, while the number of needed messages tends to be minimized independently of the network density. Simulation results support the claims and expectations of the analytical results.

Full Text:


Copyright (c) 2016 International Journal of Information Dissemination and Technology

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.