Effect of gossiping on some basic wireless sensor network protocols

It has been found that almost all routing protocols can induce network congestion due to control message complexity. To overcome this overhead various optimization processes are used. One such process is gossiping, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. In this paper, we show how gossiping can be used to improve the performance of the protocols like Angular Routing and Spanning Tree Protocol. It can be seen that when using gossiping the best performance is obtained when the probability of gossiping is 0.6 to 0.9. It can also be seen that there is a reduction of around 25% in the message generation during the execution of the protocols for 100 nodes random or grid based networks.