The Research Of Cache Data Consistency In Mobile Ad Hoc Networks

As the development of wireless communication and mobile communication. The technique of Ad hoc networks gets a big development due to its characters of MSS-LESS and self-organization. How to distribute or share the data among nodes in Ad hoc become one of the biggest problems. Coordinate cache technique is used to achieve distributing and sharing data in Ad hoc networks broadly. The consistency of caching copy must be mantained properly to make sure an effective accession of data.Firstly, this paper presents a detailed introduction of the research background, research purpose and research status of cooordinate caching consistency.Secondly, under the research status at home and abroad, considering the existing algorithms are not fit for the dynamic topology and low bandwidth. This paper presents an algorithm MWCC based on GWSP algorithm which uses mobile windows to predict the cache nodes. MWCC algorithm is an algorithm which is stateful, and uses distributed push method to push data updates. MWCC algorithm push data updates to the chosen nodes, through which MWCC algorithm can pull down the cost to maintain the data consistency.Finally, this paper simulates the process of producing clusters in JAVA lanaguage. The performances of two cluster algorithms(Threshold Based Cluster:tbc and Aera Based Cluster:abc) are compared in this experiment. After that, this paper compares the performances of GWSP and MWCC algorithms on communicate congestion and query delay in NS-2. Results of the simulation tell us that MWCC algorithm is prior to GWSP algorithm in these performances.