Discrete Mathematics - Topics on domination
Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
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
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
GeoTORA: a protocol for geocasting in mobile ad hoc networks
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Reliable Broadcast in Wireless Mobile Ad Hoc Networks
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 09
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Distributed Computing - Special issue: DISC 03
Mobility versus the cost of geocasting in mobile ad-hoc networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
DISC'10 Proceedings of the 24th international conference on 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
Hi-index | 0.00 |
In this paper we study the impact of the speed of movement of nodes on the solvability of deterministic reliable geocast in mobile ad-hoc networks, where nodes move in a continuous manner with bounded maximum speed. Nodes do not know their position, nor the speed or direction of their movements. Nodes communicate over a radio network, so links may appear and disappear as nodes move in and out of the transmission range of each other. We assume that it takes a given time T for a single-hop communication to reliably complete. The mobility of nodes may be an obstacle for deterministic reliable communication, because the speed of movements may impact on how quickly the communication topology changes. Assuming the two-dimensional mobility model, the paper presents two tight bounds for the solvability of deterministic geocast. First, we prove that the maximum speed $v_{max} is a necessary and sufficient condition to solve the geocast, where *** is a parameter that together with the maximum speed captures the local stability in the communication topology. We also prove that *** (nT ) is a time complexity lower bound for a geocast algorithm to ensure deterministic reliable delivery, and we provide a distributed solution which is asymptotically optimal in time. Finally, assuming the one-dimensional mobility model, i.e. nodes moving on a line, we provide a lower bound on the speed of movement necessary to solve the geocast problem, and we give a distributed solution. The algorithm proposed is more efficient in terms of time and message complexity than the algorithm for two dimensions.