A New Approach to the Fault Detection Problem for Mobile P2P Network

Abstract

To improve the performance of mobile P2P network systems, all the faulty-free peers must be able to function collaboratively. Regrettably, some peers may be untrustworthy and unwilling to cooperate with others. Some peers may even attack the network resulting in the performance degrades. For this reason, it is very important to provide a reliable protocol to detect and remove faulty peers. In the past, there have some traditional BA protocols been proposed for fault detection, in which all peers require to exchange 2 * (ë(n-1)/3û +1) rounds of message to collect messages; and the complexity of messages is O(n^{ë(n-1)/3û*ë(n-1)/3û}). However, the previous protocols are inefficient and unsuitable for the mobile P2P network because most of the protocols do not concern the mobility issue, and can cause large number of message results in a large protocol overhead. In this study, we proposed a new fault detection protocol to detect/locate faulty peers by using only three rounds of message exchange. Furthermore, the complexity of protocol we proposed can be reduced to O(n²) even if some peers move around the network. Since, our proposed protocol is more suitable and efficient for mobile P2P network.

DOI: http://dx.doi.org/10.5755/j01.itc.41.2.913