Efficient communication strategies for ad-hoc wireless networks (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Fundamental control algorithms in mobile networks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Distributed reconfiguration of metamorphic robot chains
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Sending messages to mobile users in disconnected ad-hoc wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
An efficient communication strategy for ad-hoc mobile networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
Mobile Computing
An Efficient Routing Protocol for Hierarchical Ad-hoc Mobile Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
The capacity of wireless networks
IEEE Transactions on Information Theory
Mobile Networks and Applications
International Journal of Autonomous and Adaptive Communications Systems
Data caching in selfish MANETs
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 0.00 |
In this paper we study the problem of basic communication in ad-hoc mobile networks where the deployment area changes in a highly dynamic way and is unknown. We call such networks highly changing ad-hoc mobile networks.For such networks we investigate an efficient communication protocol which extends the idea (introduced in [4, 6]) of exploiting the co-ordinated motion of a small part of an ad-hoc mobile network (the "runners support") to achieve very fast communication between any two mobile users of the network. The basic idea of the new protocol presented here is, instead of using a fixed sized support for the whole duration of the protocol, to employ a support of some initial (small) size which adapts (given some time which can be made fast enough) to the actual levels of traffic and the (unknown and possibly rapidly changing) network area by changing its size in order to converge to an optimal size, thus satisfying certain Quality of Service criteria.We provide here some proofs of correctness and fault tolerance of this adaptive approach and we also provide analytical results using Markov Chains and random walk techniques to show that such an adaptive approach is, for this class of ad-hoc mobile networks, significantly more efficient than a simple non-adaptive implementation of the basic "runners support" idea.