Reliable Computing in Ad Hoc Networks

Download Now Date Added: Jun 2013
Format: PDF

Most of the existing techniques for network reliability evaluation are based on assumptions that all the nodes are perfect and the communication links are static and irreplaceable. However, these assumptions are not applicable for mobile ad hoc networks because of the rapid changes in connectivity and link characteristics due to nodes' mobility. Reliability computations in mobile ad hoc networks should consider the failures of nodes and links in addition to the dynamic of network connectivity caused by nodes' mobility. This paper studies three common approaches for achieving scalable reliable broadcast in ad-hoc networks, namely probabilistic flooding, counter based broadcast, and lazy gossip.