A flooding algorithm is an algorithm for distributing material to every part of a connected network. They are used in systems such as Usenet and peer-to-peer file sharing systems and as part of some routing protocols. There are several variants of flooding algorithm: most work roughly as follows: each node acts as both a transmitter and a receiver, and each node tries to forward every message to every one of its neighbors except the source node. This results in every message eventually being delivered to all reachable parts of the network.
Published in Chapter:
On the Use of Discrete-Event Simulation in Computer Networks Analysis and Design
Hussein Al-Bahadili (The Arab Academy for Banking & Financial Sciences, Jordan)
Copyright: © 2010
|Pages: 25
DOI: 10.4018/978-1-60566-774-4.ch019
Abstract
This chapter presents a description of a newly developed research-level computer network simulator, which can be used to evaluate the performance of a number of flooding algorithms in ideal and realistic mobile ad hoc network (MANET) environments. It is referred to as MANSim. The simulator is written in C++ programming language and it consists of four main modules: network, mobility, computational, and algorithm modules. This chapter describes the philosophy behind the simulator and explains its internal structure. The new simulator can be characterized as: a process-oriented discrete-event simulator using terminating simulation approach and stochastic input-traffic pattern. In order to demonstrate the effectiveness and flexibility of MANSim, it was used to study the performance of five flooding algorithms, these as: pure flooding, probabilistic flooding, LAR-1, LAR-1P, and OMPR. The simulator demonstrates an excellent accuracy, reliability, and flexibility to be used as a cost-effective tool in analyzing and designing wireless computer networks in comparison with analytical modeling and experimental tests. It can be learned quickly and it is sufficiently powerful, comprehensive, and extensible to allow investigation of a considerable range of problems of complicated geometrical configuration, mobility patterns, probability density functions, and flooding algorithms.