The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost
MetadataShow full item record
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 deterministically despite connectivity and no matter how slowly the nodes move. Moreover, even if each node maintains a stable connection with each of its neighbors for some period of time, it is impossible to solve the geocast problem if nodes move too fast. Additionally, we give a tradeoff lower bound which shows that the faster the nodes can move on a monodimensional space, the more costly it would be to solve the geocast problem. We provide geocasting algorithms for the case where nodes move in one dimension and also when they can move on the plane (i.e., in two dimensions). We prove correctness of our algorithms by giving exact bounds on the speed of movement. Our analysis helps understand the impact of speed of nodes, firstly, on geocasting solvability and, secondly, on the cost of geocasting.
SubjectQ Science::Q Science (General)
Q Science::QA Mathematics::QA75 Electronic computers. Computer science
T Technology::T Technology (General)
T Technology::TA Engineering (General). Civil engineering (General)
T Technology::TK Electrical engineering. Electronics Nuclear engineering