Skip to main content
SpringerLink
Log in

FTR: features tree based routing in mobile social networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Mobile social networks are among subsets of delay tolerant networks. The nodes of these networks are mobile and the communication between them is done wireless and all nodes have social characteristics. The connection between these nodes is temporary and there is not end to end route between the source and the destination. Therefore, it is difficult to deliver the packets to the destination. One of the best routing methods in such networks is to use the information about the network context. These methods require the process of information collection and replicate the packets based on the context to increase the delivery ratio and enforce great overhead onto the network. Since the nodes have social characteristics and these features exist within the network, it seems that using them within the routing can be useful. In this paper a community based method of delivering is proposed that uses social characteristics of the individual members for routing the packets. Using the predetermined roles for the members that do not need data collection level can improve routing in these networks. In this method a tree is formed and each group of the members is entitled in one branch of it. The transmission of the packets from the source to the destination is done based on the differences between their characteristics and through the route which has the highest number of the nodes. The simulation results show that the delivery ratio of this method has increased regarding the related works and the overhead ratio has decreased.

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.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Daly, E. M. and Haahr, M. (2007). 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 (pp. 32–40).

  2. Memon, I., Mohammed, M. R., Akhtar, R., Memon, H., Memon, M. H., & Shaikh, R. A. (2014). Design and implementation to authentication over a GSM system using certificate-less public key cryptography (CL-PKC). Wireless Personal Communications,79(1), 661–686.

    Article  Google Scholar 

  3. Heni, M., Bouallegue, A., & Bouallegue, R. (2015). Collision avoidance in a power controller and reactive routing protocol in wireless mobile network. Wireless Personal Communications,85(3), 825–840.

    Article  Google Scholar 

  4. Memon, I., Chen, L., Arain, Q. A., Memon, H., & Chen, G. (2018). Pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks. International Journal of Communication Systems,31(1), 19.

    Article  Google Scholar 

  5. Memon, I., & Arain, Q. A. (2017). Dynamic path privacy protection framework for continuous query service over road networks. World Wide Web,20(4), 639–672.

    Article  Google Scholar 

  6. Benamar, N., Singh, K. D., Benamar, M., El Ouadghiri, D., & Bonnin, J.-M. (2014). Routing protocols in vehicular delay tolerant networks: A comprehensive survey. Computer Communications,48, 141–158.

    Article  Google Scholar 

  7. Kawecki, M., & Schoeneich, R. O. (2016). Mobility-based routing algorithm in delay tolerant networks. EURASIP Journal on Wireless Communications and Networking,2016(1), 1–9.

    Article  Google Scholar 

  8. Akhtar, R., Leng, S., Memon, I., Ali, M., & Zhang, L. (2015). Architecture of hybrid mobile social networks for efficient content delivery. Wireless Personal Communications,80(1), 85–96.

    Article  Google Scholar 

  9. Vastardis, N., & Yang, K. (2013). Mobile social networks: Architectures, social properties, and key research challenges. IEEE Communications Surveys & Tutorials,15(3), 1355–1371.

    Article  Google Scholar 

  10. Kayastha, N., Niyato, D., Wang, P., & Hossain, E. (2011). Applications, architectures, and protocol design issues for mobile social networks: A survey. Proceedings of the IEEE,99(12), 2130–2158.

    Article  Google Scholar 

  11. Javaid, N., Ahmad, A., Nadeem, Q., Imran, M., & Haider, N. (2015). iM-SIMPLE: iMproved stable increased-throughput multi-hop link efficient routing protocol for wireless body area networks. Computers in Human Behavior,51, 1003–1011.

    Article  Google Scholar 

  12. Soares, V. N., Rodrigues, J. J., Dias, J. and Isento, J. N. (2012). Performance analysis of routing protocols for vehicular delay-tolerant networks. In 2012 20th International conference on software, telecommunications and computer networks (SoftCOM) (pp. 1–5).

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

  14. Burgess, J., Gallagher, B., Jensen, D. and Levine, B. N. (2006). MaxProp: Routing for vehicle-based disruption-tolerant networks. In: INFOCOM (pp. 1–11).

  15. Spyropoulos, T., Psounis, K. and Raghavendra, C. S. (2005) Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking (pp. 252–259).

  16. Derakhshanfard, N., Sabaei, M., & Rahmani, A. M. (2015). CPTR: conditional probability tree based routing in opportunistic networks. Wireless Networks,23, 1–8.

    Google Scholar 

  17. Memon, I., Arain, Q. A., Memon, M. H., Mangi, F. A., & Akhtar, R. (2017). Search me if you can: Multiple mix zones with location privacy protection for mapping services. International Journal of Communication Systems,30(16), 18.

    Article  Google Scholar 

  18. Arain, Q. A., Memon, H., Memon, I., Memon, M. H., Shaikh, R. A., & Mangi, F. A. (2017). Intelligent travel information platform based on location base services to predict user travel behavior from user-generated GPS traces. International Journal of Computers and Applications,39(3), 155–168.

    Article  Google Scholar 

  19. Lindgren, A., Doria, A., & Schelén, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review,7, 19–20.

    Article  Google Scholar 

  20. Leontiadis, I. and Mascolo, C. (2007). Geopps: Geographical opportunistic routing for vehicular networks. In IEEE international symposium on a world of wireless, mobile and multimedia networks, 2007 (pp. 1–6)

  21. Soares, V. N., Rodrigues, J. J. and Farahmand, F. (2012) Performance assessment of a geographic routing protocol for vehicular delay-tolerant networks. In Wireless communications and networking conference (WCNC), 2012 IEEE (pp. 2526–2531).

  22. Cao, Y., Sun, Z., Wang, N., Yao, F., & Cruickshank, H. (2013). Converge-and-diverge: a geographic routing for delay/disruption-tolerant networks using a delegation replication approach. IEEE Transactions on Vehicular Technology,62, 2339–2343.

    Article  Google Scholar 

  23. Kang, H. and Kim, D. (2008) Vector routing for delay tolerant networks. In Vehicular Technology Conference, 2008. VTC 2008-Fall. IEEE 68th (pp. 1–5).

  24. Memon, I. (2015). Authentication user’s privacy: An integrating location privacy protection algorithm for secure moving objects in location based services. Wireless Personal Communications,82(3), 1585–1600.

    Article  Google Scholar 

  25. Kang, H. and Kim, D. (2009). Hvr: History-based vector routing for delay tolerant networks. In Proceedings of 18th International conference on computer communications and networks, 2009. ICCCN 2009 (pp. 1–6).

  26. Caleffi, M., Ferraiuolo, G., & Paura, L. (2007). Augmented tree-based routing protocol for scalable ad hoc networks. In IEEE international conference on mobile adhoc and sensor systems, 2007. MASS 2007 (pp. 1–6). IEEE.

  27. Caleffi, M., & Paura, L. (2011). M-DART: multi-path dynamic address routing. Wireless communications and mobile computing,11(3), 392–409.

    Article  Google Scholar 

  28. Yuan, P., & Wang, C. (2016). OPPO: An optimal copy allocation scheme in mobile opportunistic networks. Peer-to-Peer Networking and Applications,19, 1–8.

    Google Scholar 

  29. Li, Q., Zhu, S., & Cao, G. (2010). Routing in socially selfish delay tolerant networks in INFOCOM. Proceedings IEEE,2010, 1–9.

    Google Scholar 

  30. Wu, J., & Wang, Y. (2012). “Social feature-based multi-path routing in delay tolerant networks, in INFOCOM. Proceedings IEEE,2012, 1368–1376.

    Google Scholar 

  31. Keränen, A., Kärkkäinen, T., & Ott, J. (2010). Simulating mobility and DTNs with the one. Journal of Communications,5, 92–105.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran

    Elnaz Nasiri & Nahideh Derakhshanfard

Authors
  1. Elnaz Nasiri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nahideh Derakhshanfard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nahideh Derakhshanfard.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nasiri, E., Derakhshanfard, N. FTR: features tree based routing in mobile social networks. Wireless Netw 26, 283–291 (2020). https://doi.org/10.1007/s11276-018-1809-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-018-1809-x

Keywords

Search

Navigation