Mobility tolerant broadcast in mobile ad hoc networks

作     者：Srimani, Pradip K. Sinha, Bhabani P. 

作者机构：Department of Computer Science Clemson University Clemson SC 29634-0974 United States Advanced Computing and Microelectronics Unit Indian Statistical Institute Calcutta 700108 India 

出 版 物：《Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)》 (Lect. Notes Comput. Sci.)

年 卷 期：2004年第3326卷

页      面：435-446页

核心收录：

基　　金：Srimani’s work was supported by an NSF Award # ANI-0219485 

主　　题：Mobile ad hoc networks 

摘      要：A new deterministic broadcast protocol for an ad hoc network is proposed in this paper which avoids re-computation of the transmission schedule, even when the topology of the network changes due to the mobility of the nodes. The basic idea is to use a successive partitioning scheme by representing the identifier of each node (an integer) in an arbitrarily chosen radix system;the protocol then computes the specific time slots in which a particular node should transmit its message. The proposed protocol is simple, easy to implement and needs lesser broadcast time than that in [BBC99]. © Springer-Verlag Berlin Heidelberg 2004.