Skip to main content

Advertisement

SpringerLink
Log in

GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks

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

Abstract

In infrastructure-less opportunistic networks (Oppnets), the routing of messages is a challenging task since nodes are not aware of the network topology and they look for an opportunity to send the message by finding or predicting a best temporary path at each hop towards the destination. As nodes perform various computations for next hop selection, a lot of battery power gets consumed, which in turn reduces the network lifetime. Thus, there is a clear demand for routing protocols for such networks which are energy-efficient and consume lesser power of nodes in forwarding a message. In this paper, a novel routing protocol named genetic algorithm-based energy-efficient routing (GAER) protocol for infrastructure-less Oppnets is proposed. This protocol uses a node’s personal information, and then applies the genetic algorithm (GA) to select a better next hop among a group of neighbour nodes for the message to be routed to the destination. With the application of GA, optimal results are obtained that help in the selection of the best possible node as the next hop, which in turn, leads to prolonged battery life. Simulation results show that GAER outperforms the Epidemic, PROPHET, and Spray and Wait protocols in terms of messages delivered, overhead ratio, average residual energy, and number of dead nodes. The results obtained for average latency and average buffer time using GAER are comparable to those obtained for the aforementioned protocols.

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

Similar content being viewed by others

References

  1. 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 insecurity and privacy for mobile and wirelessnetworks (WSPWN 2006), Miami, March 2006, pp 134–147

  2. Toh C-K (2002) Ad hoc mobile wireless networks: protocols and systems. Prentice Hall PTR, Englewood Cliffs

    Google Scholar 

  3. 3G, The third generation (3G) wireless technologies. http://www.agilent.com/cm/wireless/pdf/3G-Seminar2001_02.pdf. Last visited 20 Jan 2014

  4. Bluetooth, The Bluetooth Specification. http://www.bluetooth.com/Pages/Bluetooth-Home.aspx. Last visited 20 Jan 2014

  5. WiFi. http://www.wifinotes.com. Last visited 20 Jan 2014

  6. 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, 5–9 Dec 2011, pp 1067–1071

  7. 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

  8. Goodman DJ, Borras J, Mandayam NB, Yates RD (1997) INFOSTATIONS: a new system model for data and messaging services. In: IEEE vehicular technology conference 1997(VTC’97), vol 2, May 1997, pp 969–973

  9. Cellular networks. http://www.ccs.neu.edu/home/rraj/Courses/6710/S10/Lectures/CellularNetworks.pdf. Last visited 20 Jan 2014

  10. Fall K (2003) A delay-tolerant network architecture for challenged internets. In: Proceedings of ACM SIGCOMM 2003, Karlsruhe, Germany, 25–29 Aug 2003, pp 27–34

  11. Jain S, Fall K, Patra R (2004) Routing in a delay tolerant network. In: Proceedings of ACM SIGCOMM 2004, 30 Aug, 3 Sept. 2004, pp 145–158

  12. 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 

  13. Zhao W, Ammar M, Zegura E (2004) A message ferrying approach for data delivery in sparse mobile ad hoc networks. In: Proceedings of 5th ACM int’l. symp. mobile ad hoc networking and computing 2004 (MobiHoc ‘04). ACM Press, Tokyo, 24–26 May 2004, pp 187–198

  14. Jain S, Shah RC, Bbrunette W, Borriello G, Roy S (2006) Exploiting mobility for energy efficient data collection in wireless sensor networks. ACM/Kluwer Mobile Netw Appl (MONET) 11(3):327–339

    Article  Google Scholar 

  15. Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks. Technical report CS-2000-06. Dept. of Computer Science, Duke University, Durham

    Google Scholar 

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

    Article  Google Scholar 

  17. Spyropoulos T, Psounis K, Raghavendra CS (2005) Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of ACM SIGCOMM workshop on delay-tolerant networking (wdtn ’05). Philadelphia, PA, USA, 22–26 Aug 2005, pp 252–259

  18. 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

  19. Patil A, Goti A (2013) Green computing in communication networks. Proc Int J Comput Appl 68(23): 1–5

  20. Melanie M (1998) An introduction to genetic algorithms. First MIT Press paperback edition

  21. Huang TK, Lee CK, Chen LJ (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

  22. Spyropoulos T, Psounis K, Raghavendra CS (2007) Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility. In: Proceedings of the fifth IEEE international conference on pervasive computing and communications workshops (PerComW ’07), White Plains, NY, 19–23 March 2007, pp 79–85

  23. Spyropoulos T, Psounis K, Raghavendra CS (2004) Single-copy routing in intermittently connected mobile Networks. In: Proceedings of first annual IEEE Communications Society conference on sensor and ad hoc communications and networks (SECON 2004), Santa Clara, CA, USA, 4–7 Oct 2004, pp 235–244

  24. Makhlouta J, Harkous H, Hutayt F, Artail H (2011) Adaptive fuzzy spray 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 Oct 2011, pp 64–69

  25. Musolesi M, Hailes S, Mascolo C (2005) Adaptive routing for intermittently connected mobile ad hoc network. In: Proceeding of sixth IEEE international symposium on world of wireless mobile and multimedia network (WOWMOM ’05), Taormina-Giardini Naxos, Italy, 13–16 June 2005, pp 183–189

  26. 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

  27. 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

  28. McNeff JG (2002) The global positioning system. In: Proceedings of IEEE transactions on microwave theory and techniques, vol 50, Issue 3, Mar 2002, pp 645–652

  29. Keranen A (2008) Opportunistic network environment simulator. Special assignment report. Helsinki University of Technology, Dept. of Communications and Networking, May 2008

Download references

Author information

Authors and Affiliations

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

    Sanjay K. Dhurandher

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

    Deepak Kumar Sharma, Rohan Gupta & Sanjay Garg

  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. Rohan Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sanjay Garg
    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

Dhurandher, S.K., Sharma, D.K., Woungang, I. et al. GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks. J Supercomput 69, 1183–1214 (2014). https://doi.org/10.1007/s11227-014-1195-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-014-1195-9

Keywords

Search

Navigation