Annals of Telecommunications

, Volume 73, Issue 9–10, pp 559–575 | Cite as

Context-adaptive forwarding in mobile opportunistic networks

  • Radu-Ioan Ciobanu
  • Daniel Gutierrez Reina
  • Ciprian Dobre
  • Sergio L. Toral


When two opportunistic network peers encounter, utility functions are generally employed to select the messages that have to be exchanged, with the purpose of maximizing message delivery probability and reduce congestion. These functions compute weighted sums of various parameters, like centrality, similarity, and trust. Most of the existing solutions statically compute the weights based on offline observations and apply the same values regardless of a node’s context. However, mobile networks are not necessarily constant in terms of behavior and characteristics, so the classic approach might not be suitable. The network might be split into sub-networks, which behave differently from each other. Thus, in this paper, we show that, by dynamically adjusting the behavior of a node based on its context, through the adjustment of the utility function on the fly, the opportunistic forwarding process can be improved. We show that nodes behave differently from each other and have different views of the network. Through real-life trace-based simulations, we prove that our solution is feasible and is able to improve an opportunistic network’s performance from the standpoint of hit rate, latency, and delivery cost.


Opportunistic Networking Dynamic Mobile Social 


  1. 1.
    Pelusi L, Passarella A, Conti M (2006) Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. Comm Mag 44(11):134–141CrossRefGoogle Scholar
  2. 2.
    Ciobanu RI, Dobre C, Cristea V, Pop F, Xhafa F (2015) Sprint-self: social-based routing and selfish node detection in opportunistic networks. Mob Inf Syst, 2015Google Scholar
  3. 3.
    Wei K, Liang X, Xu K (2014) A survey of social-aware routing protocols in delay tolerant networks applications, taxonomy and design-related issues. IEEE Commun Survey Tutor 16(1):556–578CrossRefGoogle Scholar
  4. 4.
    Zhang Z. (2006) Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. IEEE Commun Survey Tutor 8(1):24–37CrossRefGoogle Scholar
  5. 5.
    Khabbaz MJ, Assi CM, Fawaz WF (2012) Disruption-tolerant networking: a comprehensive survey on recent developments and persisting challenges. IEEE Commun Survey Tutor 14(2):607–640CrossRefGoogle Scholar
  6. 6.
    Zhu Y, Xu B, Shi X, Wang Y (2013) A survey of social-based routing in delay tolerant networks positive and negative social effects. IEEE Commun Survey Tutor 15(1):387–401CrossRefGoogle Scholar
  7. 7.
    Vahdat A, Becker D (2000) Epidemic routing for partially-Connectedad hoc networks. Technical report, Duke UniversityGoogle Scholar
  8. 8.
    Hui P, Crowcroft J, Yoneki E (2008) BUBBLE: rap social-based forwarding in delay tolerant networks. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc ’08. ACM, New York, pp 241–250Google Scholar
  9. 9.
    Reina D, Ciobanu RI, Toral SL, Dobre C (2016) A multi-objective optimization of data dissemination in delay tolerant networks. Expert Syst Appl 57(C):178–191CrossRefGoogle Scholar
  10. 10.
    Guo S, Derakhshani M, Falaki MH, Ismail U, Luk R, Oliver EA, Ur Rahman S, Seth A, Zaharia MA, Keshav S (2011) Design and implementation of the kiosknet system. Comput Netw 55(1):264–281CrossRefGoogle Scholar
  11. 11.
    Juang P, Oki H, Wang Y, Martonosi M, Li SP, Rubenstein D (2002) Energy-efficient computing for wildlife tracking Design tradeoffs and early experiences with zebranet. SIGARCH Comput Archit News 30(5):96–107CrossRefGoogle Scholar
  12. 12.
    Reina DG, Askalani M, Toral SL, Barrero F, Asimakopoulou E, Bessis N (2015) A survey on multihop ad hoc networks for disaster response scenarios. In: International Journal of Distributed Sensor Networks, pp 1–16CrossRefGoogle Scholar
  13. 13.
    Ciobanu RI, Reina DG, Dobre C, Toral SL, Johnson P (2014) Jder: a history-based forwarding scheme for delay tolerant networks using jaccard distance and encountered ration. J Netw Comput Appl 40:279–291CrossRefGoogle Scholar
  14. 14.
    Daly EM, Haahr M (2007) Social network analysis for routing in disconnected delay-tolerant manets. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc ’07. ACM, New York, pp 32–40Google Scholar
  15. 15.
    Lindgren A, Doria A, Schelén O (2003) Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Comput Commun Rev 7(3):19–20CrossRefGoogle Scholar
  16. 16.
    Zeng W, Li F, Zhao N (2017) Effective social relationship measurement and cluster based routing in mobile opportunistic networks. SensorsGoogle Scholar
  17. 17.
    Dou W, Li Y, Zeng F (2017) Energy-efficient contact detection model in mobile opportunistic networks. In: International conference on wireless algorithms, systems, and applications, pp 60–70CrossRefGoogle Scholar
  18. 18.
    Boldrini C, Passarella A (2010) Hcmm: modelling spatial and temporal properties of human mobility driven by users’ social relationships. Comput Commun 33(9):1056–1074CrossRefGoogle Scholar
  19. 19.
    Ciobanu R-I, Dobre C, Reina DG, Toral SL (2017) A dynamic data routing solution for opportunistic networks. In: 2017 14Th international conference on telecommunications (conTEL). IEEE, pp 83–90Google Scholar

Copyright information

© Institut Mines-Télécom and Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Faculty of Automatic Control and ComputersUniversity Politehnica of BucharestBucharestRomania
  2. 2.Energía Solar Edificio ELoyola Andalucia UniversitySevillaSpain
  3. 3.National Institute for Research and Development in InformaticsBucharestRomania
  4. 4.University of SevilleSevillaSpain

Personalised recommendations