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 coopera...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.展开更多
In this paper,the explicit estimates of central moments for one kind of exponential-type operators are derived.The estimates play an essential role in studying the explicit approximation properties of this family of o...In this paper,the explicit estimates of central moments for one kind of exponential-type operators are derived.The estimates play an essential role in studying the explicit approximation properties of this family of operators.Using the proposed method,the results of Ditzian and Totik in 1987,Guo and Qi in 2007,and Mahmudov in 2010 can be improved respectively.展开更多
基金Projects(61202488, 61070199, 61103182) supported by the National Natural Science Foundation of China
文摘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.
基金Supported by National Natural Science Foundation of China(No.60872161,No.10971251)
文摘In this paper,the explicit estimates of central moments for one kind of exponential-type operators are derived.The estimates play an essential role in studying the explicit approximation properties of this family of operators.Using the proposed method,the results of Ditzian and Totik in 1987,Guo and Qi in 2007,and Mahmudov in 2010 can be improved respectively.
