Skip to main content

Advertisement

SpringerLink
Log in

Social group detection based routing in Delay Tolerant Networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

When implementing Mobile Ad Hoc Networks, a key characteristic of the network is the mobility pattern of the nodes. Based on the application, nodes can follow semi-predictable patterns, such as the routes followed by Vehicular Ad Hoc Networks, or the more strict schedules followed by aerial reconnaissance. Optimal routing schemes tend to take advantage of information regarding these patterns. In social environments, such as wildlife tracking or sending messages between humans, the devices and/or users will follow regular contact habits, tending to encounter social groups in which they participate. By identifying these groups, the patterns are used to optimize routing through a social environment. Dynamic Social Grouping (DSG), used to route messages strictly from a node to a basestation, is ideal for gathering sensor data and updating a shared data cache. In contrast, Dynamic Social Grouping-Node to Node (DSG-N2) is used to route messages between nodes, generally conventional communications. Both of these algorithms can be implemented ad null, meaning the devices initially have no information about their environment, and they work to reduce bandwith and delivery time while maintaining a high delivery ratio. In addition to presenting these two routing schemas, this article compares and contrasts two methods for estimating nodes’ delivery probabilities. The Contact Based Probability is based on encounters with other nodes, and the Performance Based Probability is based on the behavior of previous messages. The probability estimates were then validated with the Oracle analysis, which is based on knowledge of future events. This analysis indicated that DSG-N2 probability estimates are comparable to the ideal.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Chen, W., Guha, R. K., Kwon, T. J., Lee, J., & Hsu, Y.-Y. (2011). A survey and challenges in routing and data dissemination in vehicular ad hoc networks. Wireless Communications and Mobile Computing, 11(7), 787–795.

    Article  Google Scholar 

  2. Cheng, C.-M., Hsiao, P.-H., Kung, H. T., & Vlah, D. (2007). Maximizing throughput of UAV-relaying networks with the load-carry-and-deliver paradigm. In Proceedings of the 2007 IEEE wireless communications and networking conference (WCNC 2007), Kowloon, China, March, 2007, pp. 4417–4424. [Online]. Available: http://dx.doi.org/10.1109/WCNC.2007.805 .

  3. Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L.S., & Rubenstein, D. (2002). Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. SIGOPS Operating Systems Review, 36(5), 96–107, October, 2002. [Online]. Available: http://doi.acm.org/10.1145/635508.605408 .

  4. Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. SIGCOMM Comput. Commun. Rev., 34(4):145–158, August, 2004. [Online]. Available: http://doi.acm.org/10.1145/1030194.1015484 .

    Google Scholar 

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

    Article  Google Scholar 

  6. Song, C., Qu, Z., Blumm, N., & Barabási, A.-L. (2010). Limits of predictability in human mobility. Science, 327(5968), 1018–1021, February, 2010. [Online]. Available: http://dx.doi.org/10.1126/science.1177170 .

    Google Scholar 

  7. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks, Duke University, Tech. Rep.

  8. Daly, E. M., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant manets, New York, NY, USA, pp. 32–40.

  9. Jones, E. P., & Ward, P. A. (2006) Routing strategies for delay-tolerant networks. ACM Computer Communication Review (CCR), 2006.

  10. Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). Maxprop: Routing for vehicle-based disruption-tolerant networks. In INFOCOM.

  11. Lindgren, A., Doria, A., & Schelen, O. (2004) Probabilistic routing in intermittently connected networks. In SIGMOBILE Mobile Computing and Communication Review, p. 2003.

  12. Hui, P., Crowcroft, J., & Yoneki, E. (2008). Bubble rap: Social-based forwarding in delay tolerant networks, pp. 241–250.

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

    Article  Google Scholar 

  14. Bitsch Link, J. A., Viol, N., Goliath, A., & Wehrle, K. (2009). Simbetage: utilizing temporal changes in social networks for pocket switched networks. In U-NET ’09: Proceedings of the 1st ACM workshop on user-provided networking: Challenges and opportunities (pp. 13–18). New York, NY, USA: ACM.

  15. Dang, H., & Wu, H. (2010). Clustering and cluster-based routing protocol for delay-tolerant mobile networks. IEEE Transactions on Wireless Communications, 9(6), 1874–1881.

    Article  MathSciNet  Google Scholar 

  16. Cabaniss, R., Madria, S., Rush, G., Trotta, A., & Vulli, S. S. (2010). Dynamic social grouping based routing in a mobile ad-hoc network. In HiPC (pp. 1–8).

  17. Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., & Chaintreau, A. (2009). CRAWDAD data set cambridge/haggle (v. 2009-05-29), Downloaded from http://crawdad.cs.dartmouth.edu/cambridge/haggle, May.

  18. Perla, E., Catháin, A. O., Carbajo, R. S., Huggard, M., & Mc Goldrick, C. (2008). Powertossim z: Realistic energy modelling for wireless sensor network environments. In PM2HW2N ’08: Proceedings of the 3nd ACM workshop on performance monitoring and measurement of heterogeneous wireless and wired networks (pp. 35–42). New York, NY, USA: ACM.

  19. Eagle, N., Pentland, A., & Lazer, D. (2009). Inferring social network structure using mobile phone data, Downloaded from http://reality.media.mit.edu/download.php, pp. 15,274–15,278.

  20. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2004). Single-copy routing in intermittently connected mobile networks. In IEEE SECON (pp. 235–244).

Download references

Acknowledgments

We would like to thank James M. Bridges, Andrew Wilson, George Rush and Abbey Trotta for their hard work on implementing the simulations.

Author information

Authors and Affiliations

  1. Department of Computer Science, Missouri University of Science and Technology, Rolla, MO, 65401, USA

    Roy Cabaniss, Srinivasa S. Vulli & Sanjay Madria

Authors
  1. Roy Cabaniss
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Srinivasa S. Vulli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sanjay Madria
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sanjay Madria.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cabaniss, R., Vulli, S.S. & Madria, S. Social group detection based routing in Delay Tolerant Networks. Wireless Netw 19, 1979–1993 (2013). https://doi.org/10.1007/s11276-013-0580-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-013-0580-2

Keywords

Search

Navigation