This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9
Big Island, Hawaii
January 06-January 09
ISBN: 0-7695-1874-5
Julien Cartigny, Universit? de Lille
David Simplot, Universit? de Lille
In this paper, we propose some improvements to the flooding protocols that aim to efficiently broadcast a given information through the whole ad-hoc network. These improve-ments are based on probabilistic approach and decrease the number of emitted packets and hence, the medium occupation. Indeed, it is more interesting to privilege the re-transmission by nodes that are located at the radio border of the sender. We observe that the distance between two nodes with full duplex communication can be approximated by comparing their neighbor lists. This leads to broadcasting schemes that do not require position or signal strength information of nodes. Moreover, proposed broadcast protocols require only knowledge of one hop neighborhood and thus need only short hello message. Such protocols are more able to support high mobility networks than protocols that need knowledge of two or more hops neighborhood and then need longer hello messages. We compare our new schemes with variable density and experiments show that the probabilistic approach is efficient.
Citation:
Julien Cartigny, David Simplot, "Border Node Retransmission Based Probabilistic Broadcast Protocols in Ad-Hoc Networks," hicss, vol. 9, pp.303, 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9, 2003
Usage of this product signifies your acceptance of the Terms of Use.