Abstract
In Delay-Tolerant Network(DTN), certain malicious node might generate congestion in attack to reduce the overall performance of the whole network, especially the target of message successful delivery ratio. In this paper, a novel Nash equilibrium based congestion control routing algorithm with the function of security defense (NESD) is proposed. In the process of message delivery, node can use Nash equilibrium to compute the largest proportion of transfer messages occupancy to node memory capacity. This mechanism constrains the attack from malicious node and guarantees the message transfer of regular node. This congestion control routing algorithm for security defense is evaluated by experiment. It is important application in the field of homeland defense. The results show that related key parameters are significantly improved in DTN scenario.
Chapter PDF
Similar content being viewed by others
References
DTNRG: Delay-tolerant networking research group, http://www.dtnrg.org
Pentland, A.S., Fletcher, R., Hasson, A.: DakNet: Rethinking Connectivity in Developing Nations. Computer 37, 78–83 (2004)
Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: Maxprop: Routing for Vehicle-Based Disruption-tolerant Networks. In: Proceedings of INFOCOM, Barcelona, Spain, pp. 1–11 (2006)
Burleigh, S., Hooke, A., Torgerson, L., Fall, K., Cerf, V., Durst, B., Scott, K.: Delay-tolerant Networking: an Approach to Interplanetary Internet. IEEE Communications Magazine 41(6), 128–136 (2003)
Scott, K., Burleigh, S.: Bundle Protocol Specification. Internet RFC 5050 (2007)
Fall, K., Hong, W., Madden, S.: Custody Transfer for Reliable Delivery in Delay Tolerant Networks. Technical Report, IRB-TR-03-030, Intel Research at Berkeley (2003)
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical Report, CS-2000-06, Duke University (2000)
Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computing Communications Review 7(3), 19–20 (2003)
Jain, R., Ramakrishnan, K.K.: Congestion Avoidance in Computer Networks with a Connectionless Network Layer: Concepts, Goals, and Methodology. In: Proc. IEEE Comp. Networking Symp., Washington, D.C., pp. 134–143 (1988)
Seligman, M., Fall, K., Mundur, P.: Storage routing for DTN congestion control. Wireless Communications and Mobile Computing, 1183–1196 (2007)
Hollot, C.V., Misra, V., Towsley, D., Gong, W.B.: A Control Theoretic Analysis of RED. In: IEEE INFOCOM (2001)
Feng, L., Jie, W., Avinash, S.: Thwarting Blackhole Attacks in Distruption-Tolerant Networks using Encounter Tickets. In: IEEE INFOCOM (2009)
Vivek, N., Yi, Y., Sencun, Z.: Resource-Misuse Attack Detection in Delay-Tolerant Networks. In: 2011 IEEE 30th International Performance Computing and Communications Conference, IPCCC (2011)
Martin, J.O.: An Introduction to Game Theory. Oxford University Press (2004)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking (WDTN 2005), pp. 252–259. ACM, New York (2005)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Efficient routing in intermittently connected mobile networks: the multiple-copy case. IEEE/ACM Trans. on Network 16(1), 77–90 (2008)
Zhao, W., Ammar, M., Zegura, E.: A message ferrying approach for data delivery in sparse mobile ad hoc networks. In: Proc. of the ACM Mobihoc, pp. 187–198 (2004)
Costa, P., Mascolo, C., Musolesi, M., Picco, G.P.: Socially-Aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. IEEE Journal of Selected Areas in Communication 26(5), 748–760 (2008)
Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking (1993)
Seligman, M., Fall, K., Mundur, P.: Alternative Custodians for Congestion Control in Delay Tolerant Networks. In: SIGCOMM Workshops, Pisa, Italy (2006)
Nishiyama, H., Ansari, N., Kato, N.: Wireless Loss-tolerant Congestion Control Protocol Based on Dynamic Aimd Theory. IEEE Wireless Communications, 1536–1284 (2010)
Chiu, D.M., Jain, R.: Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks. Comput. Networks ISDN Sys. 17, 1–14 (1989)
Godfrey, P.B., Schapira, M., Zohar, A., Shenker, S.: Incentive Compatibility and Dynamics of Congestion Control. In: SIGMETRICS, New York, USA (2010)
Firoiu, V., Borden, M.: A Study of Active Queue Management for Congestion Control. In: IEEE INFOCOM (2000)
Paganini, F., Wang, Z.K., Doyle, J.C., Low, S.H.: Congestion Control for High Performance, Stability, and Fairness in General Networks. IEEE/ACM Transactions on Networking 13, 43–56 (2005)
Andersson, K.: Interworking Techniques and Architectures for Heterogeneous Wireless Networks. Journal of Internet Services and Information Security 2, 22–48 (2012)
Charles, J.Z., Turgay, K.: A Comparative Review of Connectivity-Based Wireless Sensor Localization Techniques. Journal of Internet Services and Information Security 2, 59–72 (2012)
Sun, J., Wang, Y., Si, H., et al.: Aggregate Human Mobility Modeling Using Principal Component Analysis. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications 1, 83–95 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Wang, C., Zhao, B., Yu, W., Wu, C., Gong, Z. (2012). Routing Algorithm Based on Nash Equilibrium against Malicious Attacks for DTN Congestion Control. In: Quirchmayr, G., Basl, J., You, I., Xu, L., Weippl, E. (eds) Multidisciplinary Research and Practice for Information Systems. CD-ARES 2012. Lecture Notes in Computer Science, vol 7465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32498-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-32498-7_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32497-0
Online ISBN: 978-3-642-32498-7
eBook Packages: Computer ScienceComputer Science (R0)