Stable storage for wireless multi-hop access networks

Abstract

This paper has proposed a method to realize k-resilient distributed stable storage in a checkpoint protocol for a wireless multi-hop access network. By using the method, state information of a mobile computer is stored into storage devices in neighbor mobile computers and less state information is stored into a stable storage in a base station. Hence, communication and storage overhead are reduced. The method is able to be applied to a 3-phase checkpoint protocol without any additional messages. For further reduction of the overhead, not only 1-hop neighbor but also 2-hop neighbor mobile computers are involved into achieving the distributed stable storages. We design a checkpoint protocol by using the proposed method. In simulation evaluation, only 10-20% storage overhead of a naive method storing all state information into a stable storage in a base station is required. Especially in case of sparser mobile computer distribution and higher failure ratio, our extension involving 2-hop neighbor mobile computers works efficiently for reduction of the overhead