Giuseppe Corrente
ABSTRACT
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.
- M. Aly, A. Gopalan, J. Zhao, and A. Youssef. STDCS: A spatio-temporal data-centric storage scheme for real-time sensornet applications. SECON, pages 377--385, June 2008.Google Scholar
Cross Ref
- C. Avin, Y. Lando, and Z. Lotker. Simple random walks on radio networks (simple random walks on hyper-graphs). Arxiv preprint arXiv:0907.1678, 2009.Google Scholar
- E. Candes and T. Tao. Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Transactions on Information Theory, 52(12):5406--5425, 2006. Google ScholarDigital Library
- Y.-J. Choi and C.-W. Chung. Selectivity estimation for spatio-temporal queries to moving objects. In Proceedings of the ACM international conference on Management of data, SIGMOD, pages 440--451, 2002. Google ScholarDigital Library
- R. Choudhury. Brownian gossip: exploiting node mobility to diffuse information in ad hoc networks. In IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing, 2005.Google ScholarCross Ref
- D. Donoho. Compressed sensing. Information Theory, IEEE Transactions on, 52(4):1289--1306, 2006. Google ScholarDigital Library
- M. Fiore, F. Mininni, C. Casetti, and C. Chiasserini. To cache or not to cache? In IEEE INFOCOM, pages 235--243, 2009.Google ScholarCross Ref
- S. Gaito, E. Pagani, and G. P. Rossi. Strangers help friends to communicate in opportunistic networks. Computer Networks, 55(2):374 -- 385, 2011. Google ScholarDigital Library
- M. Garetto, P. Giaccone, and E. Leonardi. On the capacity of ad hoc wireless networks under general node mobility. In INFOCOM . 26th IEEE International Conference on Computer Communications, pages 357--365, 2007.Google Scholar
- P. Hui, J. Crowcroft, and E. Yoneki. BUBBLE rap: Social-based forwarding in delay tolerant networks. IEEE Transactions on Mobile Computing, 99(PrePrints), 2010. Google ScholarDigital Library
- P. Jacquet, B. Mans, and G. Rodolakis. Information propagation speed in mobile and delay tolerant networks. Information Theory, IEEE Transactions on, 56(10):5001--5015, 2010. Google ScholarDigital Library
- S. Jain, R. C. Shah, W. Brunette, G. Borriello, and S. Roy. Exploiting mobility for energy efficient data collection in wireless sensor networks. Mobile Network and Applications, 11(3):327--339, 2006. Google ScholarDigital Library
- J. Kim, V. Sridhara, and S. Bohacek. Realistic mobility simulation of urban mesh network. Ad Hoc Networks, 7(2):411--430, 2009. Google ScholarDigital Library
- A. Krifa, C. Barakat, and T. Spyropoulos. Optimal buffer management policies for delay tolerant networks. In IEEE SECON, pages 16--20, 2008.Google ScholarCross Ref
- F. Kuhn and R. Oshman. Dynamic networks: models and algorithms. ACM SIGACT News, 42(1):82--96, 2011. Google ScholarDigital Library
- S.-B. Lee, S. H. Y. Wong, K.-W. Lee, and S. Lu. Content management in a mobile ad hoc network: Beyond opportunistic strategy. In IEEE INFOCOM mini-conf, 2011.Google Scholar
- J. Leguay, A. Lindgren, J. Scott, T. Friedman, and J. Crowcroft. Opportunistic content distribution in an urban setting. In Proceedings of the 2006 SIGCOMM workshop on Challenged networks, pages 205--212, 2006. Google ScholarDigital Library
- C. Lu, G. Xing, O. Chipara, C. liang Fok, and S. Bhattacharya. A spatiotemporal query service for mobile users in sensor networks. In IEEE International Conference on Distributed Computing Systems, pages 381--390, 2005. Google ScholarDigital Library
- M. Luby, M. Mitzenmacher, M. Shokrollahi, and D. Spielman. Efficient erasure correcting codes. Information Theory, IEEE Transactions on, 47(2):569--584, 2001. Google ScholarDigital Library
- H. Morcos, G. Atia, A. Bestavros, and I. Matta. An information-theoretic framework for field monitoring using autonomously mobile sensors. Ad Hoc Networks, 9(6):1049 -- 1058, 2011. Google ScholarDigital Library
- H. Morcos, A. Bestavros, and I. Matta. Amorphous placement and informed diffusion for timely field monitoring by autonomous, resource-constrained, mobile sensors. In 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, pages 469--477, 2008.Google ScholarCross Ref
- A. Pettarin, A. Pietracaprina, G. Pucci, and E. Upfal. Tight bounds on information dissemination in sparse mobile networks. In 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2011. Google ScholarDigital Library
- A. Sarwate and A. Dimakis. The impact of mobility on gossip algorithms. In IEEE INFOCOM, pages 2088--2096, 2009.Google ScholarCross Ref
- V. Sridhara and S. Bohacek. Realistic propagation simulation of urban mesh networks. Computer Networks: The International Journal of Computer and Telecommunications Networking, 51(12):3392--3412, 2007. Google ScholarDigital Library
Index Terms
- Local data gathering using opportunistic networking in a urban scenario
Recommendations
Multi-metric Opportunistic Routing for VANETs in Urban Scenario
CYBERC '11: Proceedings of the 2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge DiscoveryVehicular Ad hoc Networks (VANETs) have received great attention in recent years, and multi-hop routing becomes an important issue for VANETs-based applications. This paper introduces an routing protocol based on opportunistic forwarding called Multi-...
Opportunistic networking in OMNeT++
Simutools '08: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshopsWe describe mechanisms for simulating opportunistic and delay-tolerant networks in the OMNeT++ discrete event simulator. The mechanisms allow for simulating open systems of wireless mobile nodes where mobility- or contact traces are used to drive the ...
Practical privacy-aware opportunistic networking
BCS-HCI '11: Proceedings of the 25th BCS Conference on Human-Computer InteractionOpportunistic networks have been the study of much research --- in particular on making end-to-end routing efficient. Users' privacy concerns, however, have not been the subject of much research. What privacy concerns might opportunistic network users ...
Comments