论文信息 - Mobility Tolerant Broadcast in Mobile Ad Hoc Networks

Mobility Tolerant Broadcast in 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].

Pradip K. Srimani | Bhabani P. Sinha

[1] Elena Pagani,et al. Reliable broadcast in mobile multihop packet networks , 1997, MobiCom '97.

[2] Imrich Chlamtac,et al. Tree-Based Broadcasting in Multihop Radio Networks , 1987, IEEE Transactions on Computers.

[3] Mostafa H. Ammar,et al. Improved randomized broadcast protocols in multi-hop radio networks , 1993, 1993 International Conference on Network Protocols.

[4] Imrich Chlamtac,et al. A mobility-transparent deterministic broadcast mechanism for ad hoc networks , 1999, TNET.

[5] H. T. Mouftah,et al. Collision Detection and Multitone Tree Search for Multiple-Access Protocols on Radio Channels , 1987, IEEE J. Sel. Areas Commun..

[6] Danilo Bruschi,et al. Lower bounds for the broadcast problem in mobile radio networks , 1997, Distributed Computing.

[7] Reuven Bar-Yehuda,et al. On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..