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
Introduction to Algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Wearable Computers as Packet Transport Mechanisms in Highly-Partitioned Ad-Hoc Networks
ISWC '01 Proceedings of the 5th IEEE International Symposium on Wearable Computers
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Integrated routing and storage for messaging applications in mobile ad hoc networks
Mobile Networks and Applications
User Mobility for Opportunistic Ad-Hoc Networking
WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
Analyzing the impact of mobility in ad hoc networks
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Exploiting mobility for energy efficient data collection in wireless sensor networks
Mobile Networks and Applications
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
| Hi-index | 0.00 |
Mobile objects can be equipped with hardware enabling them to collect data, as well as answer queries remotely and in real-time. For the latter, one needs to be able to effectively route queries from a base station to the queried object in an efficient way, i.e., with minimum energy-cost or minimum delay. A complicating factor is that in many domains the mobile objects may not form a single connected component at all times. In this paper we take advantage of periodically repeating movements to establish encounter patterns, where an encounter is defined as a time-period long enough so that sensors can communicate with each other. Possessing such encounter patterns, we show how to model the query routing problem as a shortest path problem in a graph with domain-oriented constraints, and we also present polynomial time algorithms to find the guaranteed minimal delay and minimal energy routes. Furthermore, our experiments show that the minimal energy routes found by our algorithm have a cost of less than 1% of the cost obtained when using a flooding-based protocol.