Strong uniform times and finite random walks
Advances in Applied Mathematics
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Randomized algorithms
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
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
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
Intrusion detection in wireless ad-hoc 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
An Efficient Communication Strategy for Ad-hoc Mobile Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Mobile Networks and Applications
Mobile Networks and Applications
Routing protocols for efficient communication in wireless ad-hoc networks
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
A mobility sensitive approach for efficient routing in ad hoc mobile networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Discrete Applied Mathematics
Fast and energy efficient sensor data collection by multiple mobile sinks
Proceedings of the 5th ACM international workshop on Mobility management and wireless access
A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast track article: Gradient-based target localization in robotic sensor networks
Pervasive and Mobile Computing
Efficient information propagation algorithms in smart dust and nanopeer networks
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Hi-index | 0.00 |
An ad hoc mobile network is a collection of mobile hosts, with wireless communication capabilities, forming a temporary network without the aid of any established fixed infrastructure. In such networks, topological connectivity is subject to frequent, unpredictable change. Our work focuses on networks with high rate of such changes to connectivity. For such dynamically changing networks we propose protocols which exploit the co-ordinated (by the protocol) motion of a small part of the network. We show that such protocols can be designed to work correctly and efficiently even in the case of arbitrary (but not malicious) movements of the hosts not affected by the protocol. We also propose a methodology for the analysis of the expected behavior of protocols for such networks, based on the assumption that mobile hosts (those whose motion is not guided by the protocol) conduct concurrent random walks in their motion space. In particular, our work examines the fundamental problem of communication and proposes distributed algorithms for it. We provide rigorous proofs of their correctness, and also give performance analyses by combinatorial tools. Finally, we have evaluated these protocols by experimental means.