Selectivity estimation for spatio-temporal queries to moving objects
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A Spatiotemporal Query Service for Mobile Users in Sensor Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Exploiting mobility for energy efficient data collection in wireless sensor networks
Mobile Networks and Applications
Opportunistic content distribution in an urban setting
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Realistic propagation simulation of urban mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Realistic mobility simulation of urban mesh networks
Ad Hoc Networks
Information propagation speed in mobile and delay tolerant networks
IEEE Transactions on Information Theory
Strangers help friends to communicate in opportunistic networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic networks: models and algorithms
ACM SIGACT News
Tight bounds on information dissemination in sparse mobile networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
Efficient erasure correcting codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Opportunistic networking based on hand-held mobile devices is turning into a viable and efficient opportunity to locate, collect, route and share information within a swarm of collaborative nodes. In this paper we consider mobile (pedestrian and cars) and fixed terminals in a urban area that are interested in collecting the information originated from several sources. In particular, each terminal aims at retrieving the data items in a limited region of interest centered around the node position. Since data items may change over time all nodes must strive for having access to the latest version. Furthermore, for mobile terminals the region of interest is a time varying concept due to the dynamic behavior of nodes. The goal of the paper is to evaluate the amount of information each node is able to gather resorting to simple distributed data collection and sharing through opportunistic communications among neighboring nodes. In particular, we analyze the impact of node density, different mix of cars and pedestrian, and amount of node memory. Moreover, we evaluate the improvement of using location aware memory management policies as well as the effect of adding a few ideal nodes whose mobility is described by an unconstrained Brownian motion. To this end we develop a simulator based on mobility and radio propagation traces obtained from the UDelModels tools. The preliminary findings highlight that simple location aware memory management schemes effectively exploit nodes with limited amount of memory. Furthermore, increasing randomness of nodes movement has a beneficial impact on the average performance of all node types.