An optimistic concurrency control algorithm for mobile ad-hoc network databases
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
An energy-efficient concurrency control algorithm for mobile ad-hoc network databases
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Distributed and Parallel Databases
| Hi-index | 0.00 |
In this paper, we propose an efficient approach to maintaining data consistency of broadcast data in mobile computing environments. At the server a special read-only transaction, the broadcast transaction, is scheduled to read data entities from the database for broadcasting data. Obviously, traditional concurrency control algorithms are inadequate and inefficient as the broadcast transaction creates numerous data conflicts with other update transactions which are concurrently accessing the same set of data entities. Some algorithms for global-reading of databases, Shade Test and Color Test [2, 3, and 4], could be a solution. However, we observe that they have also some deficiencies. Therefore, we devise a new and efficient algorithm called Look-Ahead Protocol (LAP) to address this problem. The simulation results show that our algorithm outperforms all existing algorithms.