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
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
An efficient communication strategy for ad-hoc mobile networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
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
Energy, congestion and dilation in radio networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Analysis of link reversal routing algorithms for mobile ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Worst case mobility in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Distributed communication algorithms for ad hoc mobile networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Randomized pursuit-evasion with limited visibility
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
DAP: A Generic Platform for the Simulation of Distributed Algorithms
ANSS '04 Proceedings of the 37th annual symposium on Simulation
Brief announcement: virtual mobile nodes for mobile ad hoc networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Mobile Networks and Applications
Efficient and robust protocols for local detection and propagation in smart dust networks
Mobile Networks and Applications
Autonomous virtual mobile nodes
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Discrete Applied Mathematics
Fault-resilient sensing in wireless sensor networks
Computer Communications
The role of information in the cop-robber game
Theoretical Computer Science
Coverage-adaptive random walks for fast sensory data collection
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
A simulation environment for ad hoc networks using sector subdivision
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
| Hi-index | 0.00 |
We investigate the problem of communication in an ad-hoc mobile network, that is, we assume the extreme case of a total absense of any fixed network infrastructure (for example a case of rapid deployment of a set of mobile hosts in an unknown terrain). We propose, in such a case, that a small subset of the deployed hosts (which we call the support) should be used for network operations. However, the vast majority of the hosts are moving arbitrarily according to application needs.We then provide a simple, correct and efficient protocol for communication that avoids message flooding. Our protocol manages to establish communication between any pair of mobile hosts in small, a-priori guaranteed expected time bounds even in the worst case of arbitrary motions of the hosts that not in the support (provided that they do not deliberately try to avoid the support). These time bounds, interestingly, do not depend, on the number of mobile hosts that do not belong in the support. They depend only on the size of the area of motions. Our protocol can be implemented in very efficient ways by exploiting knowledge of the space of motions or by adding more power to the hosts of the support.Our results exploit and further develop some fundamental properties of random walks in finite graphs.