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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Baldoni, R., Ioannidou, K., & Milani, A. (2007). Mobility versus the cost of geocasting in mobile ad-hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4731 LNCS, pp. 48–62). Springer Verlag. https://doi.org/10.1007/978-3-540-75142-7_7
Mendeley helps you to discover research relevant for your work.