Skip to main content
SpringerLink
Log in

Efficient routing based on past information to predict the future location for message passing in infrastructure-less opportunistic networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Opportunistic network (OppNet) is the recent evolution of mobile ad-hoc networks that has emerged as an active research subject in recent times. High mobility, frequent disconnections, sparse connectivity, no infrastructure, and limited resources are considered to be norms rather than hindrances. Hence, the challenges that one is likely to face while routing in opportunistic networks are very different from those faced in traditional wireless networks. Routing being the biggest challenge in such networks leads us to propose a new history-based prediction routing (HBPR) protocol for infrastructure-less OppNets which uses the behavioral information of the nodes to make predictions about their movements in the network. This helps to find and select a better next hop for the message to be routed to the destination. It also incorporates a method for the acknowledgment of the received messages, which helps in the buffer management of the intermediate nodes. Through simulations, the performance of HBPR is compared against popular solutions such as epidemic routing and Probabilistic routing protocol using history of encounters and transitivity, using the custom human mobility model. The HBPR performs fairly well in terms of number of messages delivered, average residual energy, overhead ratio, and average latency.

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

Similar content being viewed by others

References

  1. Chen TT, Lee M (2008) Ubiquitous Computing in Prospect: A bibliographic study. In: Preceedings of International Symposium on Ubiquitous Multimedia Computing (UMC ’08). Hobart, ACT 13–15, pp 57–62

  2. Lilien L, Kamal ZH, Bhuse V, Gupta A (2006) Opportunistic networks: the concept and research challenges in privacy and security.In: Proceedings Of NSF Intl. Workshop on research challenges in security and privacy for mobile and wirelessnetworks (WSPWN 2006), Miami, March 2006, pp 134–147

  3. Mangrulkar RS, Atique M (2010) Routing protocol for delay tolerant network: a survey and comparison. In: Proceedings of IEEE International Conf. on Communication Control and Computing Technologies, Ramanathapuram, India, 7–9 Oct. 2010, pp 210–215

  4. Dhurandher SK, Sharma DK, Woungang I, Chao HC (2011) Performance evaluation of various routing protocols in opportunistic networks. In: Proceedings of IEEE GLOBECOM Workshop 2011, Houston, Texas, USA, 5–9 December, 2011, pp 1067–1071

  5. Huang C-M, Lan K-C, Tsai C-Z (2008) A survey of opportunistic networks. In: proceedings of the 22nd Intl. Conference on advanced information networking and applications—workshops, 2008 (AINAW 2008), Okinawa, Japan, 25–28 March, 2008, pp 1672–1677

  6. Okasha S (December 2005) Altruism, group selection and correlated interaction. Br J Philos Sci 56(4):703–725

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

    Article  Google Scholar 

  8. Vahdat, Becker D (2000) Epidemic routing for partially connected ad hoc networks. Technical Report CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000

  9. Lindgren A, Doria A, Schelen O (2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE. Mob Comput Commun Rev 7(3):19–20

    Article  Google Scholar 

  10. Huang T-K, Lee C-K, Chen L-Jyh (2010) PRoPHET+: an adaptive PRoPHET-based routing protocol for opportunistic network. In: proceedings of 24th IEEE International Conference on Advanced Information Networking and Applications (AINA 2010), Perth, Australia, 20–13 April 2010, pp 112–119

  11. 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, 2007 (WoWMoM 2007), Espoo, Finland, 18–21 June 2007, pp 1–12

  12. Kathiravelu T, Ranasinghe N, Pears A (2010) A robust proactive routing protocol for intermittently connected opportunistic networks. In proceedings of Seventh IEEE International Conference on Wireless And Optical Communications Networks (WOCN 2010), Colombo, Sri Lanka, 6–8 Sept. 2010, pp 1–6

  13. Spyropoulos T, Psounis K, Raghavendra CS (2005) Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: proceedings of SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia, USA 22–26: pp 252–259

  14. Makhlouta J, Harkous H, Hutayt F, Artail H (2011) Adaptive fuzzy apray and wait: efficient routing for opportunistic networks. In: proceedings of IEEE International Conference on Selected Topics in Mobile and Wireless Networking (iCOST), Shanghai, China, 10–12 October, 2011, pp 64–69

  15. McNeff JG (2002) The global positioning system. Proc IEEE Trans Microw Theor Tech 50(3):645–652

    Article  Google Scholar 

  16. Ross SM (2006) Introduction to probability models. Academic Press, 2006, ISBN: 0123756871, 9780123756879

  17. Chen I-CK, Coffey JT, Mudge TN (1996) Analysis of branch prediction via data compression. In: proceedings of the seventh international conference on Architectural support for programming languages and operating systems (ASPLOS VII). Cambridge, Massachusetts, USA 1–4: pp 128–137

  18. Keranen (2008) Opportunistic network environment simulator. Special Assignment Report, Helsinki University of Technology, Department of Communications and Networking, May 2008

  19. Dhurandher SK, Sharma DK, Woungang I, Bhati S (2013) HBPR: history based prediction for routing in infrastructure-less opportunistic networks. In: Proceedings of IEEE 27th International Conference on Advanced Information Networking and Applications (AINA 2013), Barcelona, Spain, 25–28 March, 2013, pp 931–936

Download references

Author information

Authors and Affiliations

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

    Sanjay K. Dhurandher & Aakanksha Saini

  2. Division of Computer Engineering, Netaji Subas Institute of Technology, University of Delhi, New Delhi, India

    Deepak Kumar Sharma

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

    Isaac Woungang

Authors
  1. Sanjay K. Dhurandher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deepak Kumar Sharma
    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. Aakanksha Saini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Isaac Woungang.

Additional information

An abridged version of this work has been published at the AINA-2013 conference.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dhurandher, S.K., Sharma, D.K., Woungang, I. et al. Efficient routing based on past information to predict the future location for message passing in infrastructure-less opportunistic networks. J Supercomput 71, 1694–1711 (2015). https://doi.org/10.1007/s11227-014-1243-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-014-1243-5

Keywords

Search

Navigation