Examining basic probabilistic, time-to-live, kill time and Passive Cure problems in flooding
Mtech student CSE Aits, Rajampet, S.I.S. Jaffarvalli, Guna sekhar · IOSR Journal of Computer Engineering · 2014
Mobile adhoc networks are dyanamic in nature hence it is difficult to predict the toplogy of manets.basically in manets flooding is simple routjng algorithm in which every incoming packet is sent through every outgoing link except except the one it arrived on.The broadcast storm problem is so common in flooding algorithms that it has engendered a whole area of research flooding schemes over large-scale, sparse mobile networks.Traditional flooding suffers from the problem of redundant message reception, once per neighbour.Even in a reasonably connected network, the same message is received multiple times by every node, which is inefficient, wastes valuable resources, and can create contention in the transmission medium.In this paper, we focus on the evaluation of different controlled messages.