NCPR-PSO neighborhood coverage probabilistic rebroadcast with particle swarm optimization

A Mobile Ad hoc Network (MANET) comprises nodes which are wireless. These nodes communicate via radio waves. MANET has a dynamic topology due to which there is a random movement of nodes. When two nodes move out of range of each other, the link between them fails, leading to the need of finding new routes. To find the route, broadcasting is the basic and effective technique used. But there is a broadcast storm problem [1] associated with it. Broadcast storm problem occurs as a result of frequent rebroadcast of the request thereby increasing the routing overhead. To reduce the routing overhead is the need of the hour. In our implementation we have proposed a scheme which combines the advantages of neighbor knowledge, probabilistic rebroadcast and particle swarm optimization. A rebroadcast delay is calculated to decide the order of forwarding. The neighbor covered set helps to determine the rebroadcast probability. The rebroadcast probability in comparison to the value of particle swarm optimization function helps to determine the probability of broadcasting the request. The simulation is done in MATLAB 2010.