Skip to main content

DSG-PC: Dynamic Social Grouping Based Routing for Non-uniform Buffer Capacities in DTN Supported with Periodic Carriers

  • Conference paper
Quality, Reliability, Security and Robustness in Heterogeneous Networks (QShine 2013)

Abstract

Routing a message in networks that are dynamic in nature with time varying partially connected topology has been a challenge. The heterogeneity of the types of contacts available in such a network also adds to complexity. In this paper we present an approach to transfer messages in disruption/delay tolerant network when there is only intermittent connectivity between the nodes. Most of the existing approaches exploit either the opportunistic contacts and transfer messages using the probabilities of delivering a message or use periodic contacts. In addition to opportunistic contacts, we also have scheduled carriers that are available periodically. Scheduled carriers guarantee delivery of the messages to the base station, however, it may have an added delay. If a message can tolerate the delay through the scheduled carrier, it waits else it may be forwarded to an opportunistic contact. We define a utility function for a node to decide whether to forward the message to an opportunistic contact or to a scheduled contact.

This is an improvement over routing through opportunistic contacts that exploits social behavior of the nodes as in [2]. We compare performance of our approach with [2] on message delivery ratio, message delay and message traffic ratio (number of messages forwarded / number of messages delivered) and found that our algorithm outperforms [2] on all the three metrics. We also studied the impact of initializing the probabilities of the nodes proportional to the varying buffer size in [2]. It was found that delivery ratio increased significantly without increasing the message traffic ratio and delay.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cabaniss, R., Bridges, J.M., Wilson, A., Madria, S.: Dsg-n2: A group-based social routing algorithm. In: 2011 IEEE Wireless Communications and Networking Conference (WCNC), pp. 504–509 (March 2011)

    Google Scholar 

  2. Cabaniss, R., Madria, S., Rush, G., Trotta, A., Vulli, S.S.: Dynamic social grouping based routing in a mobile ad-hoc network. In: Proceedings of the 2010 Eleventh International Conference on Mobile Data Management, MDM 2010, pp. 295–296. IEEE Computer Society, Washington, DC (2010)

    Chapter  Google Scholar 

  3. Cerf, V., Burleigh, S., Hooke, A., Torgerson, L., Durst, R., Scott, K., Travis, E., Weiss, H.: Status of this memo interplanetary internet (ipn): Architectural definition

    Google Scholar 

  4. Costa, P., Mascolo, C., Musolesi, M., Picco, G.P.: Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. IEEE Journal on Selected Areas in Communications 26(5), 748–760 (2008)

    Article  Google Scholar 

  5. Daly, E.M., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant manets. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2007, pp. 32–40. ACM, New York (2007)

    Google Scholar 

  6. Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2003, pp. 27–34. ACM, New York (2003)

    Chapter  Google Scholar 

  7. Hui, P., Crowcroft, J., Yoneki, E.: Bubble rap: social-based forwarding in delay tolerant networks. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, pp. 241–250. ACM, New York (2008)

    Google Scholar 

  8. Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. SIGCOMM Comput. Commun. Rev. 34(4), 145–158 (2004)

    Article  Google Scholar 

  9. Jones, E.P.C., Li, L., Schmidtke, J.K., Ward, P.A.S.: Practical routing in delay-tolerant networks. IEEE Transactions on Mobile Computing 6(8), 943–959 (2007)

    Article  Google Scholar 

  10. Keränen, A., Ott, J., Kärkkäinen, T.: The ONE Simulator for DTN Protocol Evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, SIMUTools 2009, New York, NY, USA, ICST (2009)

    Google Scholar 

  11. Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev. 7(3), 19–20 (2003)

    Article  Google Scholar 

  12. McNamara, L., Mascolo, C., Capra, L.: Media sharing based on colocation prediction in urban transport. In: Proceedings of the 14th ACM International Conference on Mobile Computing and Networking, MobiCom 2008, pp. 58–69. ACM, New York (2008)

    Google Scholar 

  13. Nelson, S.C., Bakht, M., Kravets, R., Harris III, A.F.: Encounter: based routing in dtns. SIGMOBILE Mob. Comput. Commun. Rev. 13(1), 56–59 (2009)

    Article  Google Scholar 

  14. (Sandy) Pentland, A., Fletcher, R., Hasson, A.: Daknet: Rethinking connectivity in developing nations. Computer 37(1), 78–83 (2004)

    Article  Google Scholar 

  15. Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., Chaintreau, A.: CRAWDAD trace (January 31, 2006), http://crawdad.cs.dartmouth.edu/cambridge/haggle/imote/intel

  16. Shah, R.C., Roy, S., Jain, S., Brunette, W.: Data mules: modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Networks 1(2-3), 215–233 (2003)

    Article  Google Scholar 

  17. Vahdat, A., Becker, D., et al.: Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University (2000)

    Google Scholar 

  18. Vu, L., Do, Q., Nahrstedt, K.: Comfa: Exploiting regularity of people movement for message forwarding in community-based delay tolerant networks

    Google Scholar 

  19. Wang, Y., Wu, H.: Delay/fault-tolerant mobile sensor network (dft-msn): A new paradigm for pervasive information gathering. IEEE Transactions on Mobile Computing 6(9), 1021–1034 (2007)

    Article  Google Scholar 

  20. Yuan, Q., Cardei, I., Wu, J.: Predict and relay: an efficient routing in disruption-tolerant networks. In: Proceedings of the Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2009, pp. 95–104. ACM, New York (2009)

    Google Scholar 

  21. Zhao, W., Ammar, M., Zegura, E.: A message ferrying approach for data delivery in sparse mobile ad hoc networks. In: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2004, pp. 187–198. ACM, New York (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Johari, R., Gupta, N., Aneja, S. (2013). DSG-PC: Dynamic Social Grouping Based Routing for Non-uniform Buffer Capacities in DTN Supported with Periodic Carriers. In: Singh, K., Awasthi, A.K. (eds) Quality, Reliability, Security and Robustness in Heterogeneous Networks. QShine 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37949-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37949-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37948-2

  • Online ISBN: 978-3-642-37949-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics