Speaker: Chadi Kari
Day:  Wednesday, 4/09/2008
Room: ITEB 336
Time: 1:00-2:00pm

Title: Deterministic Broadcast protocols for Ad Hoc Networks

Abstract: Broadcast is a fundamental problem in distributed computing. In Ad Hoc networks broadcast protocols that are mobility transparent and give delivery guarantees are desired. In this talk we will go over a deterministic broadcast algorithm that fulfills the above properties and broadcasts a message in polylogarithmic time. We show that this algorithm is optimal for graphs whose max degree is bounded.  

Reference: S. Basagni, D. Bruschi, and I. Chlamtac. A mobility transparent deterministic broadcast mechanism for ad hoc networks. ACM/IEEE Transactions on Networking, 7(6):799-807, December 1999.