an optimistic concurrency control algorithm for mobile ad-hoc network databases
With the rapid growth of database applications, wireless networking technology and mobile computing devices, there is a demand for processing mobile transactions in Mobile Ad-hoc Network (MANET) databases, so that mobile users can access and manipulate data anytime and anywhere. However, in order to guarantee timely and correct results for multiple concurrent transactions, concurrency control (CC) techniques become critical. Due to the characteristics of MANET databases, existing CC algorithms cannot work effectively. In this paper, we propose a CC algorithm called Sequential Order with Dynamic Adjustment (SODA) for MANET databases. In the design of SODA, the major characteristics of MANET databases are taken into consideration. SODA is based on optimistic CC to offer high concurrency and avoid unbounded blocking time, utilizes the sequential order of committed transactions to improve response time, and dynamically adjusts the sequential order of committed transactions to reduce aborts. The simulation results confirm that SODA has lower abort rate than other existing techniques.
optimistic concurrency control mobile ad-hoc networks mobile transaction processing