Skip to main content

Advertisement

Log in

On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Transmission opportunity in delay tolerant network (DTN) is uncertain. To improve the routing performance, DTN tries to use every contact between nodes, and one classic policy is epidemic routing algorithm (ER). Due to much energy consumption, L-hop limited ER algorithm is proposed. However, such method does not consider the energy constraint for a specific node. To overcome this problem, we propose the L-count limited ER algorithm, in which each node forwards at most \(L\) times. Numerical results show that this new algorithm can get better performance. Both of above algorithms need nodes to work in a cooperative way. However, due to selfish nature of nodes (individual selfishness and social selfishness), they may not be willing to help others. This paper proposes an accurate theoretical framework to evaluate the impact of these behaviors based on nonlinear differential equations (ODE). Simulations based on both synthetic and real motion traces show the accuracy of our theoretical model. Numerical results show that selfish nature can decrease the flooding performance in both algorithms. Under the same selfish behaviors, the performance is decreasing with the number of communities. The deviation of the performance between two algorithms is decreasing with the value of \(L\).

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In: Proceedings of ACM SIGCOMM.

  2. Papastergious, G., Psaras, I., & Tsaoussidis, V. (2009). Deep-space transport protocol: A novel transport scheme for space DTNs. Computer Communications, 32(16), 1757–1767.

    Article  Google Scholar 

  3. Ott, J., Hyytiä, E., Lassila, P., Vaegs, T., & Kangasharju, J. (2011). Floating content: Information sharing in urban areas. In: Proceedings of IEEE PerCom.

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

  5. Ntareme, H., Zennaro, M., & Pehrson, B. (2011). Delay tolerant network on smartphones: Applications for communication challenged areas. In: Proceedings of 3 rd extreme conference on communication (ExtremeCom).

  6. Resta, G., & Santi, P. (2011). A framework for routing performance analysis in delay tolerant networks with application to noncooperative networks. IEEE Transactions on Parallel and Distributed Systems, 23(1), 2–10.

    Article  Google Scholar 

  7. Li, Q., Zhu, S., & Cao, G. (2010). Routing in socially selfish delay tolerant networks. In: Proceedings of IEEE INFOCOM.

  8. Xu, K., Hui, P., Li, V., Crowcroft, J., Latora, V. & Lio, P. (2009). Impact of altruism on opportunistic communications. In: Proceedings of 1st international conference on ubiquitous and future, networks (ICUFN09).

  9. Nguyen, N. P., Dinh, T. N., Xuan, Y., & Thai, M. T. (2011). Adaptive algorithms for detecting community structure in dynamic social networks. In: Proceedings of IEEE INFOCOM, Shanghai, China.

  10. Nguyen, N. P., Dinh, T. N., Tokala, S., & Thai, M. T. (2011). Overlapping communities in dynamic networks: Their detection and mobile applications. In: Proceedings of ACM MobiCom.

  11. Vahdat, A. & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Duke University, Durham. NC, Tech. Rep. CS-200006.

  12. Li, Y., Hui, P., Jin, D., Su, L., & Zeng, L. (2011). Performance evaluation of routing schemes for energy-constraint delay tolerant networks. In: Proceedings of IEEE ICC.

  13. Vojnovic, M., & Proutiere, A. (2011). Hop limited flooding over dynamic networks. In: Proceedings of IEEE INFOCOM (pp. 685–693), Shanghai, China.

  14. Grossglauser, M., & Tse, D. (2002). Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking, 10(4), 477–486.

    Article  Google Scholar 

  15. Altman, E., Basar, T., & Pellegrini, F. D. (2009). Optimal control in two-hop relay routing. In: Proceedings of IEEE CDC.

  16. Altman, E., Neglia, G., Pellegrini, F. D., & Miorandi, D. (2009). Decentralized stochastic control of delay tolerant networks. In: Proceedings of IEEE INFOCOM.

  17. Singh, C., Kumar, A., & Sundaresan, R. (2010). Delay and energy optimal two-hop relaying in delay tolerant networks. In: Proceedings of IEEE WiOpt.

  18. Pellegrini, F. D., Altman, E., & Basar, T. (2010). Optimal monotone forwarding policies in delay tolerant mobile ad hoc networks with multiple classes of nodes. In: Proceedings of IEEE WiOpt.

  19. Li, Y., Hui, P., Jin, D., Su, L., & Zeng, L. (2010). Evaluating the impact of social selfishness on the epidemic routing in delay tolerant networks. IEEE Communications Letters, 14(11), 1026–1028.

    Article  Google Scholar 

  20. Li, Y., Su, G., Wu, D., Jin, D., Su, L., & Zeng, L. (2011). The impact of node selfishness on multicasting in delay tolerant networks. IEEE Transactions on Vehicular Technology, 60(5), 2224–2238.

    Article  Google Scholar 

  21. Chen, X., Shen, J., Groves, T., & Wu, J. (2009). Probability delegation forwarding in delay tolerant networks. In: Proceedings of IEEE computer communications and networks (ICCCN).

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

  23. Baumann, H., Crescenzi, P., & Fraigniaud, P. (2009). Parsimonious flooding in dynamic graphs. In: Proceedings of ACM PODC, pp. 260–269.

  24. Ramanathan, R., Hansen, R., & Basu, P. (2007). Prioritized epidemic routing for opportunistic networks. In: Proceedings of ACM/SIGMOBILE workshop on mobile opportunistic networking.

  25. Zhang, X., Neglia, G., Kurouse, J., & Towsely, D. (2006). Performance modeling of epidemic routing. In: Proceedings of IFIP networking.

  26. Ip, Y. K., Lau, W. -C., & Yue, O. -C. (2008). Performance modeling of epidemic routing with heterogeneous node types. In: Proceedings of IEEE international conference on communications (ICC), pp. 219–224.

  27. Lin, Y., Liang, B. & Li, B. (2007). Performance modeling of network coding in epidemic routing. In: Proceedings of MobiSys workshop on mobile opportunistic networking (MobiOpp), pp. 67–74.

  28. Jacquet, P., Mans, B., & Rodolakis, G. (2010). Information propagation speed in mobile and delay tolerant networks. IEEE Transactions on Information Theory, 56(10), 5001–5015.

    Article  MathSciNet  Google Scholar 

  29. Panagakis, A., Vaios, A. & Stavrakakis, I. (2007). On the effects of cooperation in DTNs. In: Proceedings of COMSWARE, pp. 1–6.

  30. Zhang, S., Qiu, H., Liu, Y., & Zhou, W. (2011). Evolutionary reputation model for node selfishness resistance in opportunistic networks. Concurrency and computation: Practice and experience.

  31. Karaliopoulos, M. (2009). Assessing the vulnerability of DTN data relaying schemes to node selfishness. IEEE Communications Letters, 13(12), 923–925.

    Article  Google Scholar 

  32. Wu, Y., Deng, S., & Huang, H. (2012). Optimal control of two-hop routing in dtns with time-varying selfish behavior. KSII Transactions on Internet and Information Systems, 6(9), 2202–2217.

    Google Scholar 

  33. Dini, G., & Duca, A. L. (2010). A reputation-based approach to tolerate misbehaving carriers in delay tolerant networks. In: Proceedings of IEEE symposium on computers and communications, (pp. 772–777). Riccione, Italy.

  34. Dini, G., & Duca, A. L. (2012). Towards a reputation-based routing protocol to contrast blackholes in a delay tolerant networks. Ad Hoc Networks, 10(7), 1167–1178.

    Article  Google Scholar 

  35. Chen, I. R., Bao, F., Chang, M., & Cho, J. H. (2010). Trust management for encounter-based routing in delay tolerant networks. In: Proceedings of IEEE Globecom (pp. 1–6). Miami, Florida, USA.

  36. Chen, I. R., Bao, F., Chang, M., & Cho, J. H. (2012). Integrated social and QoS trust-based routing in delay tolerant networks. Wireless Personal Communications, 66(2), 443–459.

    Article  Google Scholar 

  37. Mei, A., & Stefa, J. (2010). Give2Get: Forwarding in social mobile wireless networks of selfish individuals. In: Proceedings of IEEE ICDCS. (pp. 488–297) Genoa, Italy.

  38. Shevade, U., Song, H. H., Qiu, L., & Zhang, Y. (2008). Incentive-aware routing in DTNs. In: Proceedings of IEEE conference on network protocols (pp. 238–247). Orlando, FL, USA.

  39. Karagiannis, T., Boudec, L., & Zojnovic, M. (2007). Power law and exponential decay of inter contact times between mobile devices. In: Proceedings of ACM MobiCom.

  40. Mei, A. & Stefa, J. (2009). SWIM: A simple model to generate small mobile worlds. In: Proceedings of IEEE INFOCOM, pp. 2106–2113.

  41. Cai, H., & Eun, D. (2009). Crossing over the bounded domain: from exponential to power-law intermeeting time in mobile ad hoc networks. IEEE/ACM Transactions on Networking.

  42. Gao, W., Li, Q., Zhao, B., & Cao, G. (2009). Multicasting in delay tolerant networks: A social network perspective. In: Proceedings of ACM MobiHoc.

  43. Lee, K., Yi, Y., Jeong, J., Won, H., Rhee, I. & Chong, S. (2010). Max-contribution: on optimal resource allocation in delay tolerant networks. In: Proceedings of IEEE INFOCOM, pp. 1–9.

  44. Zhu, H., Fu, L., Xue, G., Zhu, Y., Li, M., & Ni, L. M. (2010). Recognizing exponential inter-contact time in VANETs. In: Proceedings of IEEE INFOCOM.

  45. Li, Y., Jiang, Y., Jin, D., Su, L., Zeng, L., & Wu, D. (2010). Energy-efficient optimal opportunistic forwarding for delay-tolerant networks. IEEE Transactions on Vehicular Technology, 59(9), 4500–4512.

    Article  Google Scholar 

  46. Keranen, A., Ott, J., & Karkkainen, T. (2009). The ONE simulator for DTN protocol evaluation. In: Proceedings of SIMUTOOLS.

  47. Bettstetter, C. & Wagner, C. (2002), The spatial node distribution of the random waypoint mobility model. In: Proceedings of the first German workshop on mobile Ad-Hoc networks (WMAN), pp. 41–58.

  48. Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J. & Diot, C. (2005). Pocket switched networks and the consequences of human mobility in conference environments. In: Proceedings of WDTN, pp. 244–251.

  49. Phoenix Scaling of Infocom 05 experiment with 1000 nodes [Online], Available: http://swim.di.uniroma1.it/.

  50. S. J. U. Traffic information grid team, Grid Computing Center, Shanghai Taxi Trace Data [Online], Available: http://wirelesslab.sjtu.edu.cn/.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yahui Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, Y., Deng, S. & Huang, H. On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks. Wireless Pers Commun 71, 2759–2782 (2013). https://doi.org/10.1007/s11277-012-0970-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-012-0970-2

Keywords