Paper Info
Title
Solvability of geocasting in mobile ad-hoc networks
Abstract
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.
Year
DOI
Venue
2007
10.1145/1281100.1281186
PODC
Keywords
Field
DocType
topological stability,one-dimensional case,exact bound,stable connection,nodes move,bounded speed,geocast problem,mobile ad-hoc network,distributed systems,mobile ad hoc networks,distributed system,geocast,lower bound,mobile ad hoc network
Mobile ad hoc network,Upper and lower bounds,Computer science,Correctness,Computer network,Geocast,Bounded function,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
8
Authors
3
Name
Order
Citations
PageRank
Roberto Baldoni11606132.37
Kleoni Ioannidou21076.70
Alessia Milani318715.54