An optimistic concurrency control algorithm for mobile ad-hoc network databases

Authors:
Zhaowen Xing;Le Gruenwald;Seokil Song
Affiliations:
University of Oklahoma, Norman, OK;University of Oklahoma, Norman, OK;Chungju National University, Chungbuk, Republic of Korea
Venue:
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Year:
2010

Citing 11
Cited 0

Simulation with Visual Slam and Awesim

Simulation with Visual Slam and Awesim
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

Cluster Computing
Database Systems Concepts

Database Systems Concepts
Using Look-Ahead Protocol for Mobile Data Broadcast

ICITA '05 Proceedings of the Third International Conference on Information Technology and Applications (ICITA'05) Volume 2 - Volume 02
Managing real-time database transactions in mobile ad-hoc networks

Distributed and Parallel Databases
Pervasive Software Environments for Supporting Disaster Responses

IEEE Internet Computing
Introducing self-adaptability into transaction processing

Proceedings of the 2008 ACM symposium on Applied computing
SODA: An Algorithm to Guarantee Correctness of Concurrent Transaction Execution in Mobile P2P Databases

DEXA '08 Proceedings of the 2008 19th International Conference on Database and Expert Systems Application
Scheduling Real-Time Nested Transactions in Mobile Broadcast Environments

ICYCS '08 Proceedings of the 2008 The 9th International Conference for Young Computer Scientists
Two-phase mobile transaction validation in wireless broadcast environments

Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
A system supporting nested transactions in DRTDBSs

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.