Vijay Erramilli
Mark Crovella
ABSTRACT
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low costs and delays in such networks is thus challenging. Most forwarding algorithms avoid the cost associated with flooding the network by forwarding only to nodes that are likely to be good relays, using a quality metric associated with nodes. However it is non-trivial to decide whether an encountered node is a good relay at the moment of encounter. Thus the problem is in part one of online inference of the quality distribution of nodes from sequential samples, and has connections to optimal stopping theory. Based on these observations we develop a new strategy for forwarding, which we refer to as delegation forwarding.
We analyse two variants of delegation forwarding and show that while naive forwarding to high contact rate nodes has cost linear in the population size, the cost of delegation forwarding is proportional to the square root of population size. We then study delegation forwarding with different metrics using real mobility traces and show that delegation forwarding performs as well as previously proposed algorithms at much lower cost. In particular we show that the delegation scheme based on destination contact rate does particularly well.
- Ajtai, M., Megiddo, N., and Waarts, O. Improved Algorithms and Analysis for Secretary Problems and Generalizations. In IEEE FOCS (1995), pp. 473--482. Google Scholar
Digital Library
- Balasubramanian, A., Levine, B., and Venkataramani, A. DTN Routing as a Resource Allocation Problem. In ACM SIGCOMM '07. Google ScholarDigital Library
- Broder, A., Kirsch, A., Kumar, R., Mitzenmacher, M., Upfal, E., and Vassilvitskii, S. The Hiring Problem and Lake Wobegon Strategies. In ACM-SIAM SODA 08. Google ScholarDigital Library
- Burgess, J., Gallagher, B., Jensen, D., and Levine, B. N. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks. In Proc. IEEE INFOCOM (April 2006).Google ScholarCross Ref
- Cai, H., and Eun, D. Y. Crossing over the bounded domain: from Exponential to Power-law inter-meeting time in MANET. In ACM MobiCom '07. Google ScholarDigital Library
- Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., and Scott, J. Pocket Switched Networks: Real-world mobility and its consequences for Opportunistic Forwarding. Tech. Rep. UCAM-CL-TR-617, University of Cambridge, 2005.Google Scholar
- Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., and Scott, J. Impact of Human Mobility on Opportunistic Forwarding Algorithms. IEEE Trans. on Mobile Computing 6, 6 (2007), 606--620. Google ScholarDigital Library
- Daly, E. M., and Haahr, M. Social network analysis for routing in disconnected delay-tolerant MANETs. In ACM MobiHoc '07 (2007), pp. 32--40. Google ScholarDigital Library
- Dubois-Ferriere, H., Grossglauser, M., and Vetterli, M. Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In ACM MobiHoc '03, pp. 257--266. Google ScholarDigital Library
- Eagle, N., and Pentland, A. Reality mining: Sensing complex social systems. Journal of Personal and Ubiquitous Computing 10, 4 (2005), 255--268. Google ScholarDigital Library
- Erramilli, V., Chaintreau, A., Crovella, M., and Diot, C. Diversity of forwarding paths in pocket switched networks. In ACM/SIGCOMM IMC (Oct. 2007), pp. 161--174. Google ScholarDigital Library
- Garetto, M., Giaccone, P., and Leonardi, E. Capacity scaling in delay tolerant networks with heterogeneous mobile nodes. In ACM MobiHoc '07 (2007), pp. 41--50. Google ScholarDigital Library
- Jain, S., Fall, K., and Patra, R. Routing in a Delay Tolerant Network. In ACM SIGCOMM '04, pp. 145--158. Google ScholarDigital Library
- Jones, E. P. C., Li, L., and Ward, P. A. S. Practical routing in delay-tolerant networks. In WDTN '05 (2005), pp. 237--243. Google ScholarDigital Library
- Karagiannis, T., Boudec, J.-Y. L., and Vojnovic, M. Power law and Exponential decay of inter contact times between mobile devices. In MobiCom '07 (2007), ACM, pp. 183--194. Google ScholarDigital Library
- Leguay, J., Friedman, T., and Conan, V. DTN routing in a Mobility Pattern Space. In ACM WDTN '05, pp. 276--283. Google ScholarDigital Library
- Lindgren, A., Doria, A., and Schelen, O. Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev. 7, 3 (2003), 19--20. Google ScholarDigital Library
- Liu, C., and Wu, J. Scalable routing in delay tolerant networks. In MobiHoc '07 (2007), ACM, pp. 51--60. Google ScholarDigital Library
- McNett, M., and Voelker, G. M. Access and mobility of wireless pda users. SIGMOBILE Mob. Comput. Commun. Rev. 7, 4 (2003), 55--57. Google ScholarDigital Library
- Sarafijanovic-Djukic, N., Pidrkowski, M., and Grossglauser, M. Island hopping: Efficient mobility assisted forwarding in partitioned networks. In IEEE SECON '06.Google Scholar
- Shiryaev, A. N. Optimal Stopping Rules. Springer, 2008.Google Scholar
- Spyropoulos, T., Psounis, K., and Raghavendra, C. Efficient routing in intermittently connected mobile networks: The multi copy case. IEEE/ACM Trans. Netw. 2, 2 (2008), 477--486. Google ScholarDigital Library
- Vahdat, A., and Becker, D. Epidemic Routing for Partially Connected Ad Hoc Networks. Tech. Rep. CS-200006, Duke University, 2000.Google Scholar
Index Terms
- Delegation forwarding
Recommendations
Forwarding in opportunistic networks with resource constraints
CHANTS '08: Proceedings of the third ACM workshop on Challenged networksEffective forwarding in mobile opportunistic networks is a challenge, given the unpredictable mobility of nodes, short contact durations between nodes, wireless interference and limited buffer sizes.
Most forwarding algorithms aim at decreasing costs (...
Exploiting Contact Spatial Dependency for Opportunistic Message Forwarding
The movement of real users often follows patterns that can be characterized by certain statistical metrics of the contacts. Such metrics are useful for routing decisions, especially in sparse mobile ad hoc networks where node connectivity is ...
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
The increasing penetration of smart devices with networking capability form novel networks. Such networks, also referred as pocket switched networks (PSNs), are intermittently connected and represent a paradigm shift of forwarding data in an ad hoc ...
Comments