Skip to main content
SpringerLink
Log in

A multi-objectives based technique for optimized routing in opportunistic networks

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

In the design of routing protocols for opportunistic networks (OppNets), the node’s context information such as number of encounters to destination (EN), distance to destination (DI), delivery probability (PR), to name a few, is used as routing decision patterns when selecting the best next hop candidate to forward the data packets to their destination. Most routing protocols thus far proposed for OppNets have considered either of these patterns or a combination of few of them as design objectives in their next hop selection processes. But none of these work have ever addressed their optimization for the same. In this regard, this paper proposes a novel multi-objectives based technique for optimized routing (MOTOR) in OppNets. This technique involves the use of a weighted function to decide on the next hop selection of a node based on a combination of objectives, namely, maximizing the number of encounters (EN), maximizing the delivery probability (PR), and minimizing the distance to destination (DI). A non-dominated set of solutions is proposed using a Naive and Slow algorithm for forwarding the data packets towards their destination. Simulation results are provided to assess the performance of the MOTOR scheme when the next hop selection process relies on a single objective (EN, PR, or DI), double objectives (EN–DI, EN–PR, or DI–PR), and triple objectives (EN–DI–PR). It is shown that the performance of the proposed routing scheme under the triple objectives option is better than that obtained under all the three double objectives in terms of delivery probability, average latency and number of messages dropped. For instance there is 6%, 41.84% and \(29.26\%\) increase in delivery probability, average latency and number of messages dropped respectively in triple objectives with respect to the double objectives DI–PR.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  • Boldrini C, Conti M, Iacopini I, Passarella A (2007) HiBOp: a history based routing protocol for opportunistic networks. In: Proceedings of IEEE international symposium on world of wireless, mobile and multimedia networks, pp 1–12. doi:10.1109/WOWMOM.2007.4351716

  • Coello CC, Lamont GB, Van Veldhuizen DA (2007) Evolutionary algorithms for solving multi-objective problems. Springer Science & Business Media. ISBN: 978-0-387-33254-3 (Print)

  • Dhurandher SK, Sharma DK, Woungang I (2013a) Energy-based performance evaluation of various routing protocols in infrastructure-less opportunistic networks. J Internet Serv Inf Secur (JISIS) 3:37–48

  • Dhurandher SK, Sharma DK, Woungang I. Bhati S (2013b) HBPR: history based prediction for routing in infrastructure-less opportunistic networks. In: Proceedings of 27th IEEE AINA 2013, pp 931–936. doi:10.1109/AINA.2013.105

  • Dhurandher SK, Sharma DK, Woungang I, Gupta R, Gupta S (2014) GAER: genetic algorithm based energy-efficient routing protocol for infrastructure-less opportunistic networks. J Supercomput Springer 69:1183–1214. doi:10.1007/s11227-014-1195-9

    Article  Google Scholar 

  • Dhurandher SK, Borah SJ, Obaidat MS, Sharma DK, Gupta S, Baruah B (2015a) Probability-based controlled flooding in opportunistic networks. In: Proceedings of international conference on wireless information networks and system (WINSYS), pp 3–8. ISBN: 978-9-8975-8140-3

  • Dhurandher SK, Sharma DK, Woungang I, Saini A (2015b) An energy-efficient history-based routing scheme for opportunistic networks. J Commun Syst Int. doi:10.1002/dac.2989

  • Dhurandher SK, Borah S, Woungang I, Sharma DK, Arora K, Agarwal D (2016) EDR: an encounter and distance based routing protocol for opportunistic networks. In: Proceedings of IEEE AINA 2016, pp 297–302. doi:10.1109/AINA.2016.15

  • Deb K (2001) Multi-objective optimization using evolutionary algorithms: an introduction. KanGAL Report Number 2011003, Indian Institute of Technology Kanpur, India. http://www.iitk.ac.in/kangal/deb.html. Last accessed 9 Nov 2016. doi:10.1007/978-0-85729-652-8-1

  • Keranen A (2008) Opportunistic network environment simulator. Special Assignment Report, Helsinki University of Technology, Dept. of Communications and Networking

  • Keranen A, Ott J (2007) Increasing reality for DTN protocol simulations. Special Technical Report, Helsinki University of Technology, Networking Laboratory

  • Lindgren A, Doria A, Schelen O (2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob Comput Commun 7:19–20. doi:10.1145/961268.961272

    Article  Google Scholar 

  • Palazzo S, Scopigno R, Spirito M, Korpeoglu I (2008) DR.11.1. State of the art of research on opportunistic networks, and definition of a common framework for reference models and performance metrics. Report EU Deliverable, 216715 NEWCOM++, DiVA Portal: diva2:592083

  • Pelusi L, Passarella A, Conti M (2006) Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun Mag 44:134–141. doi:10.1109/MCOM.2006.248176

    Article  Google Scholar 

Download references

Acknowledgements

Funding was provided by Japan Society for the Promotion of Science (Grant No. S15732).

Author information

Authors and Affiliations

  1. CAITFS, Division of Information Technology, Netaji Subhas Institute of Technology, University of Delhi, New Delhi, Delhi, India

    Satya J. Borah & Sanjay K. Dhurandher

  2. Department of Computer Science, Ryerson University, Toronto, ON, Canada

    Isaac Woungang

  3. School of Computer and System Sciences, Jawaharlal Nehru University, New Delhi, Delhi, India

    Vinesh Kumar

  4. Department of Information and Communication Engineering, Faculty of Information Engineering, Fukuoka Institute of Technology (FIT), Fukuoka, Japan

    Leonard Barolli

Authors
  1. Satya J. Borah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanjay K. Dhurandher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Isaac Woungang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vinesh Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Leonard Barolli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Isaac Woungang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Borah, S.J., Dhurandher, S.K., Woungang, I. et al. A multi-objectives based technique for optimized routing in opportunistic networks. J Ambient Intell Human Comput 9, 655–666 (2018). https://doi.org/10.1007/s12652-017-0462-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-017-0462-z

Keywords

Search

Navigation