Mobility tolerant broadcast in mobile ad hoc networks

Authors:
Pradip K Srimani;Bhabani P Sinha
Affiliations:
Department of Computer Science, Clemson University, Clemson, SC;Advanced Computing & Microelectronics Unit, Indian Statistical Institute, Calcutta, India
Venue:
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Year:
2004

Citing 5
Cited 2

Tree-Based Broadcasting in Multihop Radio Networks

IEEE Transactions on Computers
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
Reliable broadcast in mobile multihop packet networks

MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
A mobility-transparent deterministic broadcast mechanism for ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Lower bounds for the broadcast problem in mobile radio networks

Distributed Computing

Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks

Journal of Parallel and Distributed Computing
Gossiping in one-dimensional synchronous ad hoc wireless radio networks

Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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].