GeoCast—geographic addressing and routing
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
GPS-based geographic addressing, routing, and resource discovery
Communications of the ACM
Flooding-based geocasting protocols for mobile ad hoc networks
Mobile Networks and Applications
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
GeoTORA: a protocol for geocasting in mobile ad hoc networks
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Reliable broadcast in radio networks: the bounded collision case
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We present a model of a mobile ad-hoc network in which nodes can move arbitrarily on the plane with some bounded speed. We show that without any assumption on some topological stability, it is impossible to solve the geocast problem despite connectivity and no matter how slowly the nodes move. Even if each node maintains a stable connection with each of its neighbours for some period of time, it is impossible to solve geocast if nodes move too fast. Additionally, we give a tradeoff lower bound which shows that the faster the nodes can move, the more costly it would be to solve the geocast problem. Finally, for the one-dimensional case of the mobile ad-hoc network, we provide an algorithm for geocasting and we prove its correctness given exact bounds on the speed of movement.