CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Solvability of Geocasting in Mobile Ad-Hoc Networks
Authors
Roberto BALDONI
K. IOANNIDOU
Alessia MILANI
Publication date
1 January 2007
Publisher
'Association for Computing Machinery (ACM)'
Doi
Cite
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. Copyright © 2007 ACM
Similar works
Full text
Available Versions
Archivio della ricerca- Università di Roma La Sapienza
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:iris.uniroma1.it:11573/367...
Last time updated on 12/11/2016