Skip to main content
Log in

HCS: hierarchical cluster-based forwarding scheme for mobile social networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Clustering has been shown to be a highly effective way to reduce network traffic in mobile ad hoc networks. Many clustering schemes have been proposed. However, none of these schemes can be directly applied to a mobile social network because they are designed for well-connected networks and require timely information sharing among the nodes. In this paper, we propose the hierarchical clustering-based forwarding scheme (HCS), which implements hierarchical clustering on social information. Each node constructs hierarchical clusters based on common neighbor similarity at the end of the warm-up period. The nodes then forward a message to other nodes based on the clustering information and similarity scores. HCS exploits the shortcuts on the path toward the destination node with the help of social similarity and node movement patterns. Experiments were performed on an NS-2 network simulator. The results show that HCS reduces network traffic compared to non-clustering schemes, such as Epidemic, SimBet, PRoPHET, and common neighbor similarity schemes, while maintaining acceptable transmission delay compared to the Wait scheme.

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

Access this article

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

Similar content being viewed by others

References

  1. Conti, M., Giordano, S., May, M., & Passarella, A. (2010). From opportunistic networks to opportunistic computing networks. IEEE Communications Magazine, 48(9), 126–139.

    Article  Google Scholar 

  2. Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J., & Diot, C. (2005). Pocket switched networks and human mobility in conference environments. In Proceedings of ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN 2005) (pp. 244–251).

  3. Lindgren, A., & Doria, A. (2007). Experiences from deploying a reallife dtn system. In Proceedings of IEEE Consumer Communications and Networking Conference (CCNC) (pp. 217–221).

  4. Juang, P., Oki, H., Wang, Y., Maronosi, M., Peh, L., & Rubenstein, D. (2002). Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebraNet. In Proceedings of Architectural Support for Programming Languages and Operating Systems (ASPLOS) (pp. 96–107).

  5. Small, T., & Haas, Z. J. (2003). The shared wireless infestation model: A new ad hoc networking paradigm (or where there is a whale, there is a way). In Proceedings of MobiHoc (pp. 234–244).

  6. Zeng, Y., Xiang, K., Li, D., & Vaslakos, A. V. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161–173.

    Article  Google Scholar 

  7. Zafar, H., Alhamahmy, N., Harle, D., & Andonovic, I. (2011). Survey of reactive and hybrid routing protocols for mobile ad hoc networks. Communication Networks and Information Security, 3(3), 193–202.

    Google Scholar 

  8. Spyropoulos, T., Rais, R. N., Turletti, T., Obraczka, K., & Vasilakos, A. (2010). Routing for disruption tolerant networks: Taxonomy and design. Wireless Networks, 16(8), 2349–2370.

    Article  Google Scholar 

  9. Hui, P., Xu, K., Li, V., Crowcroft, J., Latora, V., & Lio, P. (2009). Selfishness, altruism and message spreading in mobile social networks. In Proceedings of IEEE INFOCOM Workshop (pp. 1–6).

  10. Conti, M., & Kumar, M. (2010). Opportunities in opportunistic computing. IEEE Computer, 43(1), 42–50.

    Article  Google Scholar 

  11. C. Bordrini, M. Conti, and A. Passarella (2011). Modeling social-aware forwarding in opportunistic networks. Performance Evaluation of Computer and Communication Systems, 6821 (LNCS), 141–152.

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

  13. Liu, C., & Wu, J. (2009). Scalable routing in delay tolerant networks. In Proceedings of MobiHoc (pp. 51–60).

  14. Cambridge University (2009). Online edition (c), chapter hierarchical clustering, pp. 377–401.

  15. Boldrini, C., & Passarella, A. (2010). HCMM: Modelling spatial and temporal properties of human mobility driven by users’ social relationships. Computer Communications, 33(9), 1056–1074.

    Article  Google Scholar 

  16. Wu, J., Xiao, M., & Huang, L. (2013). Homing spread: Community home-based multi-copy routing in mobile social networks. In Proceedings of IEEE INFOCOM (pp. 138–146).

  17. Kim, J. H., Lee, K. J., Kim, T. H., & Yang, S. B. (2011). Effective routing schemes for double-layered peer-to-peer systems in manet. Journal of Computing Science Engineering, 5(1), 19–31.

    Article  Google Scholar 

  18. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially-connected ad hoc networks. Technical Report CS-2000-06.

  19. Spyropoulos, T., Psounis, K., & Raghavendra, C. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of ACM SIGCOMM (pp. 252–259).

  20. Hua, D., Du, X., Qian, Y., & Yan, S. (2009). A DTN routing protocol based on hierarchy forwarding and cluster control. In Proceedings of IEEE Computational Intelligence and Security (pp. 397–401).

  21. Alresaini, M., Sathiamoorthy, M., Krishnamachari, B., & Neely, M. J. (2012). Backpressure with adaptive redundancy. In Proceedings of IEEE INFOCOM (pp. 2300–2308).

  22. Dvir, A., & Vasilakous, A. V. (2010). Backpressure-based routing protocol for DTNs. In Proceedings of ACM SIGCOMM (pp. 405–406).

  23. Kim,S. K., Choi, J. H., & Yang, S. B. (in press). Hotspot: Location-based forwarding scheme in an opportunistic network. Ad hoc & Sensor Wireless Networks.

  24. Daly,E. H., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant manets. In Proceedings of ACM MobiHoc (pp. 32–40).

  25. Hui, P., Crowcroft, J., & Yoneki, E. (2011). Bubble rap: Social-based forwarding in delay tolerant networks. IEEE Transactions on Mobile Computing, 10(11), 1576–1589.

    Article  Google Scholar 

  26. Mei, A., Morabitto, G., Santi, P., & Stefa, J. (2011). Social-aware stateless forwarding in pocket switched networks. In Proceedings of IEEE INFOCOM (pp. 251–255).

  27. Hui, P., & Crowcroft, J. (2007). How small labels create big improvements. In Proceedings of Pervasive Computing and Communications Workshop (pp. 65–70).

  28. Boldrini, C., Conti, M., & Passarella, A. (2008). Exploiting users’ social relations to forward data in opportunistic networks: The HiBop solution. Pervasive and Mobile Computing, 4(5), 633–657.

    Article  Google Scholar 

  29. Lindgren, A., Doria, A., & Schelen, O. (2004). Probabilistic routing in intermittently connected networks. Service Assurance with Partial and Intermittent Resources, 3126 (LNCS), 239–254.

  30. Mtibaa, A., May, M., Diot, C., & Ammar, M. (2010). PeopleRank: Social opportunistic forwarding. In Proceedings of IEEE INFOCOM (pp. 1–5).

  31. Leguay, J., Friedman, T., & Conan, V. (2007). Evaluating MobySpace based routing strategies in delay tolerant networks. Wireless Communications and Mobile Computing, 7(10), 1171–1182.

    Article  Google Scholar 

  32. Newman, M. E. J. (2001). Clustering and preferential attachment in growing networks. Physical Review Letters, E 64, 025102.

    Article  Google Scholar 

  33. Network simulator-2. http://www.isi.edu/nsnam/ns/

Download references

Acknowledgments

This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2013R1A1A2011114).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sung-Bong Yang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kim, SK., Yoon, JH., Lee, J. et al. HCS: hierarchical cluster-based forwarding scheme for mobile social networks. Wireless Netw 21, 1699–1711 (2015). https://doi.org/10.1007/s11276-014-0876-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-014-0876-x

Keywords

Navigation