Dynamic Allocation of Abundant Data Along Update Sub-Cycles To Support Update Transactions In Wireless Broadcasting
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2014, Vol 5, Issue 4
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.
Authors and Affiliations
Ahmad al-Qerem
Keywords
Related Articles
- EP ID EP126407
- DOI 10.14569/IJACSA.2014.050404
- Views 83
- Downloads 0
Software Effort Prediction using Statistical and Machine Learning Methods
Accurate software effort estimation is an important part of software process. Effort is measured in terms of person months and duration. Both overestimation and underestimation of software effort may lead to risky conseq...
Query Expansion based on Explicit-Relevant Feedback and Synonyms for English Quran Translation Information Retrieval
Search engines are commonly present as information retrieval applications that help to retrieve relevant information from different domain areas. The crucial part of improving the quality of search engine is based on que...
A New Algorithm for Balancing Group Population in Collaborative Leaning Sessions
Proper group formation is essential in conducting a productive collaborative learning session. It specifies the internal structure that the collaborating groups should have based on roles. The Group formation is a dynami...
An Efficient Density based Improved K- Medoids Clustering algorithm
Clustering is the process of classifying objects into different groups by partitioning sets of data into a series of subsets called clusters. Clustering has taken its roots from algorithms like k-medoids and k-medoids. H...
A Review on Scream Classification for Situation Understanding
: In our living environment, a non-speech audio signal provides a significant evidence for situation awareness. It also compliments the information obtained from a video signal. In non-speech audio signals, screaming is...