Department of Informatics, Ionian University, Corfu, Greece
*Corresponding Author Konstantinos Skiadopoulos, kskiado@greenlab.di.ionio.gr
Online published on 3 April, 2017.
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.
Information Dissemination, Flooding, Forwarding Probability, Number of Messages
