Jörg Ott
Esa Hyytiä
ABSTRACT
Delay-tolerant and opportunistic networking are widely investigated for information exchange in (sparse) mobile scenarios, in the evaluation of which numerous mobility models and traces have been employed. These networking techniques may also be applied in static and fairly dense scenarios for non-directed information sharing, in which nodes may but need not be connected all the time. We present different information dissemination algorithms for content sharing, taking a network formed by mostly immobile users on a beach as one example and evaluate them through simulations.
- I. F. Akyildiz, Weilian Su, Y. Sankarasubramaniam, and E. Cayirci. A survey on sensor networks. Communications Magazine, IEEE, 40(8):102--114, August 2002. Google Scholar
Digital Library
- P. Dutta and D. Culler. Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications. In Proc. of ACM SenSys, 2008. Google ScholarDigital Library
- Kevin Fall. A Delay-Tolerant Network Architecture for Challenged Internets. In Proc. of ACM SIGCOMM, 2003. Google ScholarDigital Library
- Chih fan Hsin and Mingyan Liu. Network Coverage Using Low Duty-Cycled Sensors: Random & Coordinated Sleep Algorithms. In Proc. of ACM IPSN, 2004. Google ScholarDigital Library
- J. J. Garcia-Luna-Aceves and Ewerton L. Madruga. A multicast routing protocol for ad-hoc networks. In Proc. IEEE INFOCOM, pages 784--792, 1999.Google Scholar
- Martin Gardner. The fantastic combinations of John Conway's new solitaire game "life". Scientific American, pages 120--123, October 1970.Google Scholar
- Olafur Helgason, Emre Yavuz, Sylvia Kouyoumdjieva, Ljubica Pajevic, and Gunnar Karlsson. A mobile peer-to-peer system for opportunistic content-centric networking. In Proc. of ACM MobiHeld, 2010. Google ScholarDigital Library
- Esa Hyytiä, Jorma Virtamo, Pasi Lassila, Jussi Kangasharju, and Jörg Ott. When does content float? characterizing availability of anchored information in opportunistic content sharing. In IEEE INFOCOM, Shanghai, China, April 2011.Google ScholarCross Ref
- A. Kandhalu, K. Lakshmanan, and R. R. Rajkumar. U-connect: a low-latency energy-efficient asynchronous neighbor discovery protocol. In Proc. of IPSN, 2010. Google ScholarDigital Library
- Jussi Kangasharju, Jörg Ott, and Ossi Karkilahti. Floating Content: Information Availability in Urban Environments. In Proc. of IEEE Percom 2010, Work in Progress session, 2010.Google Scholar
- Ari Keränen, Jörg Ott, and Teemu Kärkkäinen. The ONE Simulator for DTN Protocol Evaluation. In Proc. of SIMUTools, 2009. Google ScholarDigital Library
- Santosh Kumar, Ten H. Lai, and Jozsef Balogh. On k-Coverage in a Mostly Sleeping Sensor Networka. In Proc. of ACM MobiCom, 2004. Google ScholarDigital Library
- V. Lenders, M. May, G. Karlsson, and C. Wacha. Wireless ad hoc podcasting. ACM MC2R, Jan. 2008. Google ScholarDigital Library
- Jo Agila Bitsch Link, Christoph Wollgarten, Stefan Schupp, and Klaus Wehrle. Perfect Difference Sets for Neighbor Discovery Energy Efficient and Fair. In Proc. of ACM ExtremeCom, 2011. Google ScholarDigital Library
- Jörg Ott, Esa Hyytiä, Pasi Lassila, Tobias Vaegs, and Jussi Kangasharju. Floating content: Information sharing in urban areas. In Proc. of IEEE PerCom, 2011. Google ScholarDigital Library
- Jörg Ott, Dirk Kutscher, and Christoph Dwertmann. Integrating DTN and MANET Routing. In Proc. of ACM CHANTS workshop, 2006. Google ScholarDigital Library
- C. E. Perkins. Ad Hoc Networking. Addison-Wesley, 2001. Google ScholarDigital Library
- Charles Perkins and Pravin Bhagwat. Highly Dynamic Destination-Sequences Distance-Vector Routing (DSDV) for Mobile Computers. In Proc. of ACM SIGCOMM, 1994. Google ScholarDigital Library
- Charles E. Perkins, Elizabeth M. Belding-Royer, and Samir R. Das. Ad hoc On-Demand Distance Vector (AODV) Routing. Experimental RFC 3561, July 2003. Google ScholarDigital Library
- Marina Petrova, Lili Wu, Matthias Wellens, and Petri Mähönen. Hop of No Return: Practical Limitations of Wireless Multi-Hop Networking. In Proc. of RealMAN workshop, 2005.Google Scholar
- Thomas Repantis and Vana Kalogeraki. Data dissemination in mobile peer-to-peer networks. In Proc. of MDM, 2005. Google ScholarDigital Library
- A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, April 2000.Google Scholar
- A. Villalba Castro, G. Di Marzo Serugendo, and D. Konstantas. Hovering information: Self-organizing information that finds its own storage. Technical Report BBKCS707, School of Computer Science and Information Systems, Birkbeck College, London, UK, November 2007.Google Scholar
- Wei Wang, Vikram Srinivasan, and Mehul Motani. Adaptive contact probing mechanisms for delay tolerant applications. In Proc. of ACM MobiCom, September 2007. Google ScholarDigital Library
- John Whitbeck and Vania Conan. HYMAD: Hybrid DTN-MANET Routing for Dense and Highly Dynamic Wireless Networks. In Proc. of IEEE AOC workshop, 2009.Google Scholar
- Jennifer Yick, Biswanath Mukherjee, and Dipak Ghosal. Wireless sensor network survey. Computer Networks, 52(12):2292--2330, 2008. Google ScholarDigital Library
- Eiko Yoneki, Pan Hui, S. Chan, and Jon Crowcroft. A Socio-Aware Overlay for publish/subscribe communication in delay tolerant networks. In Proc. of ACM MSWiM, 2007. Google ScholarDigital Library
- Wenrui Zhao, Mostafa Ammar, and Ellen Zegura. Multicasting in Delay Tolerant Networks: Semantic Models and Routing Algorithms. In ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN), 2005. Google ScholarDigital Library
Recommendations
A weight-based clustering multicast routing protocol for mobile ad hoc networks
In mobile ad hoc networks, the mobile nodes can move arbitrarily without any centralised management mechanism. The topology of these networks can be very dynamic due to the mobility of mobile nodes. Under such changeable network topology, multicasting ...
A Study of Speed Aware Routing for Mobile Ad Hoc Networks
The flexibility of movement for the wireless ad hoc devices, referred to as node mobility, introduces challenges such as dynamic topological changes, increased frequency of route disconnections and high packet loss rate in Mobile Ad hoc Wireless Network ...
Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks
Network-wide broadcasting is used extensively in mobile ad hoc networks for route discovery and for disseminating data throughout the network. Flooding is a common approach to performing network-wide broadcasting. Although it is a simple mechanism that ...
Comments