Directional Broadcast for Mobile Ad Hoc Networks with Percolation Theory
IEEE Transactions on Mobile Computing
Area-based beaconless reliable broadcasting in sensor networks
International Journal of Sensor Networks
Radio propagation-aware distance estimation based on neighborhood comparison
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
Maximizing growth codes utility in large-scale wireless sensor networks
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
A distributed broadcast algorithm for wireless mobile ad hoc networks
MMM'07 Proceedings of the 13th International conference on Multimedia Modeling - Volume Part II
An efficient distributed broadcasting algorithm for ad hoc networks
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
A survey of context data distribution for mobile ubiquitous systems
ACM Computing Surveys (CSUR)
Gossiping: adaptive and reliable broadcasting in MANETs
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
Condensation-based routing in mobile ad-hoc networks
Mobile Information Systems - Advances in Network-Based Information Systems
| Hi-index | 0.00 |
In this paper, we propose some improvements to the floodingprotocols that aim to efficiently broadcast a given informationthrough the whole ad-hoc network. These improve-mentsare based on probabilistic approach and decreasethe number of emitted packets and hence, the medium occupation.Indeed, it is more interesting to privilege the re-transmissionby nodes that are located at the radio borderof the sender. We observe that the distance between twonodes with full duplex communication can be approximatedby comparing their neighbor lists. This leads to broadcastingschemes that do not require position or signal strengthinformation of nodes. Moreover, proposed broadcast protocolsrequire only knowledge of one hop neighborhood andthus need only short hello message. Such protocols are moreable to support high mobility networks than protocols thatneed knowledge of two or more hops neighborhood and thenneed longer hello messages. We compare our new schemeswith variable density and experiments show that the probabilisticapproach is efficient.