Skip to main content

Improving Packet Queues Using Selective Epidemic Routing Protocol in Opportunistic Networks (SERPO)

  • Conference paper
  • First Online:
Advances in Computing and Data Sciences (ICACDS 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1244))

Included in the following conference series:

  • 1255 Accesses

Abstract

Opportunistic networks are an extension of Adhoc networks and subclass of MANET wherein network possess intermittent connectivity and store – carry – forward mechanism. During routing, if a packet transmission has been initiated by a node through Epidemic to all its neighboring nodes by producing a multiple copy resulting in the network resource consumption early. In Epidemic routing mechanism a multiple copy of a message packet has been created in the direction of inflate the message packet delivery ratio contrary it also enhances additional buffer capacity of a network. By proposing a SERPO approach the packet transmission happens only on a selected route which find out with the help of Dijkstra’s algorithm and for minimizing the packet congestion using Weighted Fair Queuing. In this paper we propose an outline to improve the delivery ratio, transmission delay and access delay of a packet in a network using SERPO. We broadly simulate the proposed scheme in ONE simulator and compared it with Epidemic variants using the network performance metrics message transmission (packet delivery), message relaying time (transferring time) and access delay ratio respectively.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Rinne, J., Keskinen, J., Berger, P., Lupo, D., Valkama, M.: Wireless energy harvesting and communications: limits and reliability. In: 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW) (2017). https://ieeexplore.ieee.org/document/7919070

  2. Malarkodi, B., Gopal, P., Venkataramani, B.: Performance evaluation of adhoc networks with different multicast routing protocols and mobility models. In: 2009 International Conference on Advances in Recent Technologies in Communication and Computing (2009). https://ieeexplore.ieee.org/document/5328071

  3. Ukey, N., Kulkarni, L.: Energy based recent trends in delay tolerant networks. In: Mishra, D., Nayak, M., Joshi, A. (eds.) Information and Communication Technology for Sustainable Development. LNNS, vol. 9, pp. 141–150. Springer, Singapore (2018). https://doi.org/10.1007/978-981-10-3932-4_15

    Chapter  Google Scholar 

  4. Maratha, B.P., Sheltami, T.R., Salah, K.: Performance study of MANET routing protocols in VANE. Arab. J. Sci. Eng. 42, 3115–3126 (2017). https://doi.org/10.1007/s13369-016-2377-y

    Article  Google Scholar 

  5. Huang, C.M., Lan, K.C., Tsai, C.Z.: A survey of opportunistic networks. In: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (WAINA), 25–28 March. Biopolis, Okinawa, Japan (2008)

    Google Scholar 

  6. Kim, B., Park, H., Kim, K., Godfrey, D., Kim, K.: A Survey on real-time communications in wireless sensor networks. Wireless Commun. Mobile Comput. 2017, 1–14 (2017). https://www.hindawi.com/journals/wcmc/2017/1864847/

  7. Al-Sultan, S., Al-Doori, M., Al-Bayatti, A., Zedan, H.: A comprehensive survey on vehicular Ad Hoc network. J. Netw. Comput. Appl. 37, 380–392 (2014). https://dl.acm.org/citation.cfm?id=2565407

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

    Google Scholar 

  9. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Single – copy routing in intermittently connected mobile networks. In: Proceedings of the Sensor and Ad Hoc Communications and Networks (SECON), pp. 235–244, October 2004

    Google Scholar 

  10. Lu, X., Hui, P.: An energy-efficient n-epidemic routing protocol for delay tolerant networks. In: Networking, Architecture and Storage (NAS), 2010 IEEE Fifth International Conference (IWCMC), 2013 9th International, pp. 731–735, July 2013

    Google Scholar 

  11. Yamazaki, T., Yamamoto, R., Miyoshi, T., Asaka, T., Tanaka, Y.: PRIOR: prioritized forwarding for opportunistic routing. IEICE Trans. Commun. 100(1), 28–41 (2017)

    Article  Google Scholar 

  12. Bista, B.: Improving energy consumption of epidemic routing in delay tolerant networks. In: 2016 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS) (2016). https://ieeexplore.ieee.org/document/7794476

  13. Fuhao, Z., Jiping, L.: An algorithm of shortest path based on Dijkstra for huge data. In: 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery (2009). https://ieeexplore.ieee.org/document/5359145

  14. Singh, A.K, Meenu: A survey on congestion control mechanisms in packet switch networks. In: 2015 International Conference on Advances in Computer Engineering and Applications (2015). https://ieeexplore.ieee.org/document/7164833

  15. Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: Proceedings of the ACM SIGCOMM, pp. 145–158 (2004)

    Google Scholar 

  16. Spyropoulos, T., Psounis, L., Raghavendra, C.S.: Spray-and-wait: an efficient routing scheme for intermittently connected networks. In: Internet Request for Comments, RFC Editor, RFC 6693, August 2012. http://www.rfc-editor.org/rfc/rfc6693.txt, http://www.rfc-editor.org/rfc/rfc6693.txt

  17. Cerf, V., et al.: Delay-tolerant network architecture, April 2007. Internet RFC 4838

    Google Scholar 

  18. Tanyer, S.: The cumulative distribution function for a finite data set. In: 2012 20th Signal Processing and Communications Applications Conference (SIU) (2012). https://ieeexplore.ieee.org/document/6204462?section=abstract

  19. Keranen, A., Ott, J., Karkkainen, T.: The ONE simulator for DTN protocol evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, ser (Simutools 2009), pp. 55:1–55:10. ICST, Brussels, Belgium, Belgium: ICST (Institute for Computer Sciences, Social – Informatics and Telecommunications Engineering) 2009

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tanvi Gautam .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gautam, T., Dev, A. (2020). Improving Packet Queues Using Selective Epidemic Routing Protocol in Opportunistic Networks (SERPO). In: Singh, M., Gupta, P., Tyagi, V., Flusser, J., Ören, T., Valentino, G. (eds) Advances in Computing and Data Sciences. ICACDS 2020. Communications in Computer and Information Science, vol 1244. Springer, Singapore. https://doi.org/10.1007/978-981-15-6634-9_35

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-6634-9_35

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-6633-2

  • Online ISBN: 978-981-15-6634-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics