CRSG: A congestion control routing algorithm for security defense based on social psychology and game theory in DTN
Cheng-jun Wang , Zheng-hu Gong , Yong Tao , Zi-wen Zhang , Bao-kang Zhao
Journal of Central South University ›› 2013, Vol. 20 ›› Issue (2) : 440 -450.
CRSG: A congestion control routing algorithm for security defense based on social psychology and game theory in DTN
The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and cooperation in delay/disruption tolerant networks (DTN). In particular, the existence of malicious node aggravates this contradiction. To resolve this contradiction, social relationship theory and group theory of social psychology were adopted to do an in-depth analysis. The concrete balancing approach which leveraged Nash equilibrium theory of game theory was proposed to resolve this contradiction in reality. Thus, a new congestion control routing algorithm for security defense based on social psychology and game theory (CRSG) was put forward. Through the experiment, this algorithm proves that it can enhance the message successful delivery ratio by more than 15% and reduce the congestion ratio over 15% as well. This algorithm balances the contradiction relationship between the two key performance targets and made all nodes exhibit strong cooperation relationship in DTN.
delay/disruption tolerant networks / social psychology / game theory / congestion control / routing
| [1] |
DTNRG: Delay-tolerant networking research group [EB/OL] 2012-07-01. http://www.dtnrg.org. |
| [2] |
|
| [3] |
BURGESS J, GALLAGHER B, JENSEN D, LEVINE B N. Maxprop: Routing for vehicle-based disruption-tolerant networks [C]// Proceedings of INFOCOM, Barcelona, 2006: 1–11. |
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
JAIN R, RAMAKRISHNAN K K. Congestion avoidance in computer networks with a connectionless network layer: Concepts, goals, and methodology[C]// IEEE Comp Networking Symp, Washington DC, 1988, 134–143. |
| [10] |
|
| [11] |
HOLLOT C V, MISRA V, TOWSLEY D, GONG W B. A control theoretic analysis of RED [C]// IEEE INFOCOM, Anchorage, 2001: 1510–1519. |
| [12] |
FENG L, JIE W, AVINASH S. Thwarting black hole attacks in disruption-tolerant networks using encounter tickets [C]// IEEE INFOCOM, Rio de Janeiro, 2009: 2428–2436. |
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
SPYROPOULOS T, PSOUNIS K, RAGHAVENDRA C S. Spray and wait: An efficient routing scheme for intermittently connected mobile networks [C]// Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant Networking(WDTN’ 05), 2005, New York, NY, USA: ACM, 252–259. |
| [17] |
|
| [18] |
ZHAO W, AMMAR M, ZEGURA E. A message ferrying approach for data delivery in sparse mobile ad hoc networks [C]// Proc of the ACM Mobihoc, Roppongi, 2004, 187–198. |
| [19] |
|
| [20] |
|
| [21] |
SELIGMAN M, FALL K, MUNDUR P. Alternative custodians for congestion control in delay tolerant networks [C]//. SIGCOMM Workshops, Pisa, Italy. 2006: 229–236. |
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
GODFREY P B, SCHAPIRA M, ZOHAR A, SHENKER S. Incentive compatibility and dynamics of congestion control [C]// SIGMETRICS, New York, USA, 2010: 95–106. |
| [26] |
FIROIU V, BORDEN M. A Study of active queue management for congestion control [C]// IEEE INFOCOM, Tel Aviv, 2000: 1435–1444. |
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
| [41] |
|
| [42] |
|
| [43] |
|
| [44] |
|
| [45] |
|
| [46] |
|
| [47] |
|
| [48] |
|
/
| 〈 |
|
〉 |