Skip to main content
SpringerLink
Log in

Human Activity Optimal Cooperation Objects Selection Routing Scheme in Opportunistic Networks Communication

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

There are some important features of opportunistic networks such as mobility of nodes, randomness of information transmission and no links in transmission. These features are similar with the information transmission among human beings in social activities in which people choose the objects they need to transmit information according to the situation of information sending and receiving. Traditional methods in opportunistic networks can not receive good result in the application of social network since the neglecting of societal and subjectivity of human beings. Thus, this paper suggests a routing scheme: Optimal Cooperation Objects Selection Routing in opportunistic networks based on the features of the opportunistic network. In this scheme, dependability ratio, usability ratio and weight factor are counted as weight in the human activity topology to get the optimal cooperation objects. This scheme is proved as a better method by the simulation compare with the traditional methods in opportunistic networks.

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
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Wu, J. & Chen, Z. (2016). Reducing energy consumption and overhead based on mobile health in big data opportunistic networks. Wireless Personal Communications, 1–21. doi:10.1007/s11277-016-3610-4.

  2. Wu, J. & Chen, Z. (2016). Data decision and transmission based on mobile data health records on sensor devices in wireless networks. Wireless Personal Communications, 90(4), 2073–2087. doi:10.1007/s11277-016-3438-y.

    Article  Google Scholar 

  3. Huang, T. K., Lee, C. K., & Chen, L. J. (2010). Prophet+: An adaptive prophet-based routing protocol for opportunistic network. In 2010 24th IEEE international conference on advanced information networking and applications (AINA) (pp. 112–119). IEEE.

  4. Yune, T. W., Kim, D., & Im, G. H. (2011). Opportunistic network-coded cooperative transmission with demodulate-and-forward protocol in wireless channels. IEEE Transactions on Communications, 59(7), 1791–1795.

    Article  Google Scholar 

  5. Xu, M., Song, W. Z., & Zhao, Y. (2013). Collaborative data collection with opportunistic network erasure coding. IEEE Transactions on Parallel and Distributed Systems, 24(10), 1941–1950.

    Article  Google Scholar 

  6. Chen, W., Letaief, K., & Cao, Z. (2007). Opportunistic network coding for wireless networks. In IEEE international conference on communications, 2007 (ICC’07) (pp. 4634–4639). IEEE.

  7. Katti, S., Hu, W., Médard, M., et al. (2005). The importance of being opportunistic: Practical network coding for wireless environments. In Proceedings of the annual Allerton conference on communication control and computing.

  8. Yomo, H., & Popovski, P. (2007). Opportunistic scheduling for wireless network coding. IEEE Transactions on Wireless Communications, 8(6), 5610–5615.

    Google Scholar 

  9. Koshiba, M. (2014). Optical waveguide theory by the finite element method. Ieice Transactions on Electronics, 97(7), 625–635.

    Article  Google Scholar 

  10. Kou, T., Toda, T., Neubig, G., et al. (2014). A hybrid approach to electrolaryngeal speech enhancement based on noise reduction and statistical excitation generation. Ieice Transactions on Information & Systems, 92(6), 1429–1437.

    Google Scholar 

  11. Grossglauser, M., & Tse, D. N. C. (2002). Mobility increases the capacity of ad hoc wireless networks. In: IEEE/ACM transactions on networking.

  12. Wang, G., Wang, B., & Gao, Y. (2010). Dynamic spray and wait routing algorithm with quality of node in delay tolerant network. In 2010 international conference on communications and mobile computing (CMC) (Vol. 3, pp. 452–456). IEEE.

  13. Spyropoulos, T., Psounis, K., & 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). ACM.

  14. Leguay, J., Friedman, T., Conan, V. (2005). DTN routing in a mobility pattern space. In Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking (pp. 276–283). ACM.

  15. Burgess, J., Gallagher, B., Jensen, D, et al. (2006). MaxProp: Routing for vehicle-based disruption-tolerant networks. In INFOCOM (Vol. 6, pp. 1–11).

  16. Burns, B., Brock, O., & Levine, B. N. (2008). MORA routing and capacity building in disruption-tolerant networks. Ad Hoc Netw., 6(4), 600–620.

    Article  Google Scholar 

  17. Kavitha, V., & Altman, E. (2010). Analysis and design of message ferry routes in sensor networks using polling models. In 2010 proceedings of the 8th international symposium on modeling and optimization in mobile, ad hoc and wireless networks (WiOpt) (pp. 247–255). IEEE.

  18. Wu, J., Chen, Z., & Yi, X. (2014). Optimal objects of cooperation selection for human activity in opportunistic networks. SmartCR, 4(2), 118–129.

    Article  Google Scholar 

  19. Nekovee, M. (2009). Epidemic algorithms for reliable and efficient information dissemination in vehicular. Intelligent Transport Systems, 3(2), 104–110.

    Article  Google Scholar 

  20. Ramesh, S., & Kumar, P. G. (2013). Spray and wait routing with agents in intermittently connected MANETs. Journal of Artificial Intelligence, 6, 123–133.

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China (61379057, 61309001, 61272149); Doctoral Fund of Ministry of Education of China (20120162130008); Innovation Foundation For Postgraduate (2014zzts043).

Author information

Authors and Affiliations

  1. School of Information Science and Engineering and School of Software, Central South University, Changsha, 410075, China

    Jia Wu & Zhigang Chen

Authors
  1. Jia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhigang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jia Wu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, J., Chen, Z. Human Activity Optimal Cooperation Objects Selection Routing Scheme in Opportunistic Networks Communication. Wireless Pers Commun 95, 3357–3375 (2017). https://doi.org/10.1007/s11277-017-4001-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4001-1

Keywords

Search

Navigation