Advertisement

Performance Evaluation of GAER Over Various Crossover Techniques in Opportunistic Networks

  • Deepak Kumar Sharma
  • Sanjay Kumar Dhurandher
  • Aakanksha Saini
Conference paper
First Online:
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 18)

Abstract

Proper message transmission among nodes in a non-topological environment has always been a major concern. As there is no predefined end to end path between sender-destination node pairs, very limited predictable information exists about the network among nodes. Hence this area has been drawing attention and potential research. GAER (genetic algorithm-based energy-efficient routing protocol) (Dhurandher et al. J Supercomput Springer 69(3):1183–1214, 2014) is one of the latest routing protocols to catalyse the ease of message delivery by intelligently predicting delivery locations, using genetic algorithm over nodes’ information available in the network. Genetic algorithm uses crossover mechanism to reproduce new set of chromosomes, which further can be used to predict informative results. In this paper, GAER protocol has been analysed over different crossover techniques with an agenda to increase its efficiency by using optimal technique.

Keywords

Opportunistic network GAER Opportunistic network environment simulator DTN Crossover techniques 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    S.K. Dhurandher, D.K. Sharma, I. Woungang, R. Gupta, S. Garg, GAER: Genetic algorithm based energy-efficient routing protocol for infrastructure-less opportunistic networks. J. Supercomput. Springer 69(3), 1183–1214 (2014)CrossRefGoogle Scholar
  2. 2.
    L. Lilien, Z.H. Kamal, V. Bhuse, A. Gupta, Opportunistic networks: The concept and research challenges in privacy and security, in Proceedings of NSF International Workshop on Research Challenges in Security and Privacy for Mobile and Wireless Networks (WSPWN 2006), Miami, pp. 134–147, March 2006Google Scholar
  3. 3.
    S.K. Dhurandher, D.K. Sharma, I. Woungang, H.C. Chao, Performance evaluation of various routing protocols in opportunistic networks, in Proceedings of IEEE GLOBECOM Workshop 2011, Houston, TX, USA, pp. 1067–1071, 5–9 December 2011Google Scholar
  4. 4.
    L. Pelusi, A. Passarella, M. Conti, Opportunistic networking: Data forwarding in disconnected mobile ad hoc networks. IEEE Commun. Mag. 44(11), 134–141 (2006)CrossRefGoogle Scholar
  5. 5.
    C.-M. Huang, K.-C. Lan, C.-Z. Tsai, A survey of opportunistic networks, in Proceedings of the 22nd International Conference on Advanced Information Networking and Applications- Workshops, 2008 (AINAW 2008), Okinawa, Japan, pp. 1672–1677, 25–28 March 2008Google Scholar
  6. 6.
    S.K. Dhurandher, D.K. Sharma, I. Woungang, S. Bhati, Routing protocols in infrastructure- less opportunistic networks (Chapter 13), in Routing in Opportunistic Networks, (Springer, Springer-Verlag New York), pp. 353–382., ISBN:978-1-4614-3513-6 (Print), 978-1-4614-3514-3 (Online).  https://doi.org/10.1007/978-1-4614-3514-3
  7. 7.
    A. Vahdat, D. Becker, Epidemic routing for partially connected ad hoc networks, Technical Report CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000Google Scholar
  8. 8.
    T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “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 Google Scholar
  9. 9.
    J. Widmer, J. Le Boudec, Network coding for efficient communication in extreme networks, in Proceedings of the ACM SIGCOMM WDTN, 2005Google Scholar
  10. 10.
    A. Lindgren, A. Doria, O. Schelen, Probabilistic routing in intermittently connected networks. ACM SIGMOBILE, Mob. Comput. Commun. Rev 7(3), 19–20 (2003)CrossRefGoogle Scholar
  11. 11.
    B. Burns, O. Brock, B. Levine, MV routing and capacity building in disruption tolerant networks, in Proceedings of the 24th INFOCOM, 2005Google Scholar
  12. 12.
    J. Burgess, B. Gallagher, D. Jensen, B. Levine, MaxProp: Routing for vehicle-based disruption-tolerant networks, in Proceedings of the 25th INFOCOM, 2006 Google Scholar
  13. 13.
    C. Boldrini, M. Conti, I. Iacopini, A. Passarella, 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, pp. 1–12, 18–21 June 2007Google Scholar
  14. 14.
    M. Musolesi, S. Hailes, C. Mascolo, Adaptive routing for intermittently connected mobile ad hoc networks, in Proceedings of WoWMoM, 2005Google Scholar
  15. 15.
    A. Keranen, Opportunistic network environment simulator, Special Assignment Report, Helsinki University of Technology, Department of Communications and Networking, May 2008Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Deepak Kumar Sharma
    • 1
  • Sanjay Kumar Dhurandher
    • 1
  • Aakanksha Saini
    • 1
  1. 1.CAITFS, Division of Information TechnologyNetaji Subhas Institute of Technology, University of DelhiNew DelhiIndia

Personalised recommendations

Cite paper

Buy options