Efficient communication strategies for ad-hoc wireless networks (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Fundamental control algorithms in mobile networks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Analysis of TCP performance over mobile ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
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
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 Adaptive Compulsory Protocol for Basic Communication in Highly Changing Ad hoc Mobile Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
An Efficient Communication Strategy for Ad-hoc Mobile Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
| Hi-index | 0.00 |
We investigate basic communication protocols in ad-hoc mobile networks. We follow the semi-compulsory approach according to which a small part oft he mobile users, the support Σ, thatmoves in a predetermined way is used as an intermediate pool for receiving and delivering messages. Under this approach, we present a new semi-compulsory protocol called the runners in which the members of Σ perform concurrent and continuous random walks and exchange any information given to them by senders when they meet. We also conduct a comparative experimental study ofthe runners protocol with another existing semi-compulsory protocol, called the snake, in which the members of Σ move in a coordinated way and always remain pairwise adjacent. The experimental evaluation has been carried out in a new generic framework that we developed to implement protocols for mobile computing. Our experiments showed that for both protocols only a small support is required for efficient communication, and that the runners protocol outperforms the snake protocol in almost all types ofi nputs we considered.