Skip to main content

Advertisement

SpringerLink
Log in

Pareto set based optimized routing in opportunistic network

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

Abstract

In opportunistic networks (OppNets), messages are transmitted between nodes in an opportunistic fashion following a store-carry-and-forward approach and a routing protocol, with the hope to reach their destinations. In existing routing protocols for OppNets, different parameters such node’s delivery predictability, node’s mobility, distance with respect to destination, node’s energy consumption, contact duration between nodes, to name a few, are considered in the selection of the best suitable next hop to carry the message toward the destination. This paper proposes a novel routing protocol that uses three parameters, namely the contact duration, the node’s residual energy and the signal- to-noise-plus-interference-ratio (SINR) simultaneously to decide on the selection of the best next forwarder for a message. Simulation results using the Opportunistic Network Environment (ONE) simulator are presented, demonstrating the effectiveness of the proposed technique.

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
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30
Fig. 31
Fig. 32

Similar content being viewed by others

References

  • Bansal A, Gupta A, Sharma DK, Gambhir V (2018) Iicar-inheritance inspired context aware routing protocol for opportunistic networks. J Ambient Intell Hum Comput 1:1–19

    Google Scholar 

  • Boldrini C, Conti M., Jacopini J., Passarella A (2007) Hibop: a history based routing protocol for opportunistic networks. In: 2007 IEEE international symposium on a world of wireless, mobile and multimedia networks, IEEE, pp 1–12

  • Borah SJ, Dhurandher SK, Woungang I, Kumar V, Barolli L (2018) A multi-objectives based technique for optimized routing in opportunistic networks. J Ambient Intell Hum Comput 9:655–666

    Article  Google Scholar 

  • Bylykbashi K, Spaho E, Barolli L, Xhafa F (2017) Impact of node density and ttl in vehicular delay tolerant networks: performance comparison of different routing protocols. Int J Space Based Situat Comput 7:136–144

    Article  Google Scholar 

  • Chilipirea C, Petre AC, Dobre C, (2013) Energy-aware social-based routing in opportunistic networks. In: 2013 27th International Conference on advanced information networking and applications workshops (WAINA), IEEE, pp 791–796

  • Cuka M, Elmazi D, Bylykbashi K, Spaho E, Ikeda M, Barolli L (2018) Implementation and performance evaluation of two fuzzy-based systems for selection of iot devices in opportunistic networks. J Ambient Intell Hum Comput 1:1–11

    Google Scholar 

  • Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley, Hoboken

    MATH  Google Scholar 

  • Dhurandher SK, Sharma DK, Woungang I (2013a) Mobility models-based performance evaluation of the history based prediction for routing protocol for infrastructure-less opportunistic networks. In: International conference on mobile and ubiquitous systems: computing, networking, and services. Springer, pp 757–767

  • Dhurandher SK, Sharma DK, Woungang I, Bhati S (2013b) Hbpr: history based prediction for routing in infrastructure-less opportunistic networks. In: 2013 IEEE 27th international conference on advanced information networking and applications (AINA), IEEE, pp 931–936

  • Dhurandher SK, Sharma DK, Woungang I, Gupta R, Garg S (2014) Gaer: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks. J Supercomput 69:1183–1214

    Article  Google Scholar 

  • Fall K (2003) A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications. ACM, pp 27–34

  • Fall K, Farrell S (2008) Dtn: an architectural retrospective. IEEE J Select Areas Commun 26:828–836

    Article  Google Scholar 

  • Hossmann T, Spyropoulos T, Legendre F (2011) Putting contacts into context: mobility modeling beyond inter-contact times. In: Proceedings of the twelfth ACM international symposium on mobile ad hoc networking and computing, ACM, p 18

  • Huang CM, Lan KC, Tsai CZ (2008) A survey of opportunistic networks. In: 22nd International Conference on advanced information networking and applications-workshops, 2008. AINAW 2008, IEEE, pp 1672–1677

  • Hui P, Crowcroft J, Yoneki E (2008) Bubble rap: social based forwarding in disruption lenient networks. In: Proceedings of the ACM MobiHoc

  • Johnson DB, Maltz DA (1996) Dynamic source routing in ad hoc wireless networks. In: Mobile computing. Springer, pp 153–181

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

  • Keränen A, Kärkkäinen T, Ott J (2010) Simulating mobility and dtns with the one. J Commun 5:92–105

    Article  Google Scholar 

  • Keränen A, Ott J, Kärkkäinen T (2009) The one simulator for dtn protocol evaluation. In: Proceedings of the 2nd international conference on simulation tools and techniques, ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), New York, NY, USA

  • Khalid K, Woungang I, Dhurandher SK, Barolli L, Carvalho GH, Takizawa M (2016) An energy-efficient routing protocol for infrastructure-less opportunistic networks. In: 2016 10th international conference on innovative mobile and internet services in ubiquitous computing (IMIS), IEEE. pp. 237–244

  • Kuchhal P, Dhurandher SK, Borah SJ, Woungang I, Jain S, Gupta S (2017) A* search based next hop selection for routing in opportunistic networks. Int J Sp Based Situat Comput 7:177–186

    Article  Google Scholar 

  • Lilien L, Kamal ZH, Bhuse V, Gupta A (2006) Opportunistic networks: the concept and research challenges in privacy and security. In: Proceedings of the WSPWN, pp 134–147

  • Lindgren A, Doria A, Davies E, Grasic S (2012) Probabilistic routing protocol for intermittently connected networks. Technical Report

  • Lindgren A, Doria A, Schelen O (2004) Probabilistic routing in intermittently connected networks. In: Service assurance with partial and intermittent resources. Springer, pp 239–254

  • Passarella A, Conti M (2011) Characterising aggregate inter-contact times in heterogeneous opportunistic networks. In: International conference on research in networking. Springer, pp 301–313

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

    Article  Google Scholar 

  • Perkins C, Belding-Royer E, Das S (2003) Ad hoc on-demand distance vector (AODV) routing. Technical Report

  • Scott KL, Burleigh S (2007) Bundle protocol specification

  • Sharma DK, Dhurandher SK, Agarwal D, Arora K (2018) krop: k-means clustering based routing protocol for opportunistic networks. J Ambient Intell Hum Comput 1:1–18

    Google Scholar 

  • Song C, Qu Z, Blumm N, Barabási AL (2010) Limits of predictability in human mobility. Science 327:1018–1021

    Article  MathSciNet  Google Scholar 

  • Wennerström H, Rohner C, Smith D (2015) Considering multi-contact encounters in opportunistic networks. In: Proceedings of the 10th ACM MobiCom workshop on challenged networks, ACM, pp 13–18

  • Zhang J, Yang T, Zhao C (2016) Energy-efficient and self-adaptive routing algorithm based on event-driven in wireless sensor network. Int J Grid Utility Comput 7:41–49

    Article  Google Scholar 

  • Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: methods and applications

  • Zitzler E, Laumanns M, Thiele L (2001) Spea2: Improving the strength pareto evolutionary algorithm. TIK-report 103

Download references

Acknowledgements

This work is partially supported by a Grant from the National Science and Engineering Research Council of Canada (NSERC), held by the third author (REF\(\#: RGPIN-2017-04423\)).

Author information

Authors and Affiliations

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

    Pragya Kuchhal & Sanjay K. Dhurandher

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

    Isaac Woungang

  3. Department of Computer Science, Bharati College, University of Delhi, New Delhi, Delhi, India

    Vinesh Kumar

  4. Division of Computer Science, Netaji Subhas Institute of Technology, University of Delhi, New Delhi, Delhi, India

    Satbir Jain

  5. CCIS, Institute of Technology, Rochester, USA

    Sahil Gupta

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

    Leonard Barolli

Authors
  1. Pragya Kuchhal
    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. Satbir Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Sahil Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Leonard Barolli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Isaac Woungang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kuchhal, P., Dhurandher, S.K., Woungang, I. et al. Pareto set based optimized routing in opportunistic network. J Ambient Intell Human Comput 11, 777–797 (2020). https://doi.org/10.1007/s12652-019-01337-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-019-01337-8

Keywords

Search

Navigation