Dynamic Allocation of Abundant Data Along Update Sub-Cycles To Support Update Transactions In Wireless Broadcasting

Ahmad Al-Qerem

doi:10.14569/ijacsa.2014.050404

Abstract

Supporting transactions processing over wireless broadcasting environment has attracted a considerable amount of research in a mobile computing system. To allow more than one conflicting transactions to be committed within the same broadcast cycle, the main broadcast cycle need to be decompose into a sub cycles. This decomposition contains both the original data to be broadcast in Rcast cycle and the updates come from the committed transactions on these data items called Ucast cycle. Allocation of updated data items along Ucast cycles is highly affecting the concurrency among conflicting transactions. Given the conflicting degree of data items, one can design proper data allocation along Ucast Cycles to increase the concurrency among conflicting transactions. We explore in this paper the problem of adjusting abundant data allocations to respond in effective way to the changes of data conflicting probability, and develop an efficient algorithm ADDUcast to solve this problem. Performance of our adjustment algorithms is analyzed and a system simulator is developed to validate our results. It is shown by our results that the ADDUcast is highly increased the average number of committed transactions within the same broadcast cycle.

Highlights

Data broadcast is becoming a promising way to disseminate information to a large population of mobile clients by mean of transaction
The presence of update transactions in wireless broadcast environment make it more difficult to deal with conflicting transactions within the same broadcast cycle
Many researchers tackle the problem of concurrent executions of these www.ijacsa.thesai.org transactions and many of them suggest that broadcast cycle decomposition is a proper technique to increase the concurrency and the system performance as well

Summary

Introduction

Data broadcast is becoming a promising way to disseminate information to a large population of mobile clients by mean of transaction. There have been many research efforts reported in the literature that tackle the concurrency problems in wireless broadcast environments, such as Update First Ordering (UFO) [5], Multi-Version Broadcast [2, 3], Serialization Graph [2, 3], Broadcast Concurrency Control with Time Stamp Interval (BCC-TI) [6], F-Matrix [4], and Certification Report [7]. The drawbacks of these methods have been analyzed in [12, 13]. Some of these methods only support client read-only transactions, and some of them could have substantial processing overhead

Objectives

Methods

Conclusion