Brief Announcement: Solvability of Geocasting in Mobile Ad-Hoc Networks
نویسندگان
چکیده
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.
منابع مشابه
Obstacle-free geocasting protocol for ad hoc wireless networks
Mobile Ad Hoc networks (MANET) comprise mobile hosts in a network bereft of base stations and characterized by a highly dynamic network topology. The MANET environment contains unpredictable obstacles, such as mountains, lakes, buildings, or regions without any hosts, impeding or blocking message relay. This study proposes geocasting protocol for sending short message from a source host to a ge...
متن کاملObstacle-Free Geocasting Protocols for Single/Multi-Destination Short Message Services in Ad Hoc Networks
Mobile ad hoc networks (MANET) comprise mobile hosts in a network bereft of base stations and characterized by a highly dynamic network topology. The MANET environment contains unpredictable obstacles, such as mountains, lakes, buildings, or regions without any hosts, impeding or blocking message relay. This study proposes geocasting protocols for sending short message from a source host to sin...
متن کاملPerformance Evaluation of Geocasting Protocols in Mobile Ad Hoc Networks
In this paper we have evaluated the performance of VDGEDIR, CH-MFR, R-DIR, DREAM and LAR geocasting protocol proposed for mobile ad hoc networks. The performance has been compared in both static and mobile environment. In the static environment we have also considered SP algorithm to compare performance of geocasting algorithms with SP. Mobility is introduced using random walk mobility model. I...
متن کاملFlooding-Based Geocasting Protocols for Mobile Ad Hoc Networks
Geocasting is a variation on the notion of multicasting. A geographical area is associated with each geocast, and the geocast is delivered to the nodes within the specified geographical area. Thus, geocasting may be used for sending a message that is likely to be of interest to everyone in a specified area. In this paper, we propose three geocasting protocols for ad hoc networks, obtained as va...
متن کاملGeocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
This paper addresses the problem of geocasting in mobile ad hoc network (MANET) environments. Geocasting is a variant of the conventional multicasting problem. For multicasting, conventional protocols define a multicast group as a collection of hosts which register to a multicast group address. However, for geocasting, the group consists of the set of all nodes within a specified geographical r...
متن کامل