Design and Evaluation of an Efficient Reliable Manycast Protocol for Ad-hoc Networks

摘要

The protocol presented here guarantees that at least a specified number, k, of destinations receive a given message. The guarantees are deterministic and the failure probability is zero. Such a strong delivery assurance provides a more powerful primitive than protocols which attempt to minimize failure probability, and is useful for meeting many user-level requirements. Simulations under a wide range of settings confirm that the overhead is low even when k is high, and that the protocol is scalable. These desirable performance results are due to many design features, in particular, the decentralized delivery management whereby any node - manycast initiator or destination- can take responsibility in a cost-effective manner for achieving the specified delivery ratio. The goal of attaining total reliability is comprehensively addressed: the design considers even the rare, but not impossible, scenarios of the network behaving as an adversary.