Probabilistic Broadcasting in Wireless Ad Hoc Networks
Bharadwaj Kadiyala · InTech eBooks · 2009
4GEGPV #FXCPEGU KP 6GEJPQNQIKGUformidable constraints such as network organization, link scheduling, power management, security and routing are a few to mention.This chapter would present an overview of Broadcasting, a very prominent issue existing in design and deployment of wireless ad hoc networks today.Broadcasting plays a major role in successful communication in wireless networks such as manets, sensor networks etc. essentially because nodes in these networks do not have information about the topology of the network instead have to discover it.Although broadcasting happens to be a very useful mechanism, it also presents to us a lot of challenges.Some of these are grouped under what is popularly known as the Broadcast Storm problems (Sze-Yao et al., 1999) .As one would imagine, optimizing broadcasting operation would indeed bring down the energy consumption of the entire network.This however does not have very straight forward answers.A lot of algorithms such as counter based, location based, area based etc (Williams & Camp, 2002).have been proposed in the past and each of them incorporate a different approach to optimize this operation.This chapter would provide an introduction to some of these broadcasting schemes.In particular, the probability based scheme (Sasson et al., 2002) would be talked about in more detail.To understand the probability scheme better, understanding the key concepts in percolation theory would be necessary.Although this theory forces us to develop a very theoretical perspective of the topic at hand, it is useful as it gives us an idea of the bounds.However, we will verify these bounds by discussing some of the results obtained from simulations.