Update propagation algorithms for supporting disconnected write in mobile wireless systems with data broadcasting capability

We develop and analyze algorithms for propagating updates by mobile hosts in wireless client-server environments that support disconnected write operations, with the goal of minimizing the tuning time for update propagation to the server. These algorithms allow a mobile host to update cached data objects while disconnected and propagate the updates to the server upon reconnection for conflict resolutions. We investigate two algorithms applicable to mobile systems in which invalidation reports/data can be broadcast to mobile hosts periodically. We show that there exists an optimal broadcasting period under which the tuning time is minimized for update propagations. We perform a comparative analysis between these two update propagation algorithms that rely on broadcasting data and an algorithm that does not, and identify conditions under which an algorithm should be applied to reduce the total tuning time for update propagation by the mobile user to save the valuable battery power and avoid high communication cost. For real-time applications, we address the tradeoff between tuning time and access time with the goal to select the best update propagation algorithm that can minimize the tuning time while satisfying the imposed real-time deadline constraint. The analysis result is applicable to file/data objects that mobile users may need to modify while on the move

AN ENERGY-EFFICIENT CONCURRENCY CONTROL ALGORITHM FOR MOBILE AD-HOC NETWORK DATABASES

With the rapid growth of the wireless networking technology and mobile computing devices, there is an increasing demand for processing mobile database transactions in mission-critical applications such as disaster rescue and military operations that do not require a fixed infrastructure, so that mobile users can access and manipulate the database anytime and anywhere. A Mobile Ad-hoc Network (MANET) is a collection of mobile, wireless and battery-powered nodes without a fixed infrastructure; therefore it fits well in such applications. However, when a node runs out of energy or has insufficient energy to function, communication may fail, disconnections may happen, execution of transactions may be prolonged, and thus time-critical transactions may be aborted if they missed their deadlines. In order to guarantee timely and correct results for multiple concurrent transactions, energy-efficient database concurrency control (CC) techniques become critical. Due to the characteristics of MANET databases, existing CC algorithms cannot work effectively.In this dissertation, an energy-efficient CC algorithm, called Sequential Order with Dynamic Adjustment (SODA), is developed for mission-critical MANET databases in a clustered network architecture where nodes are divided into clusters, each of which has a node, called a cluster head, responsible for the processing of all nodes in the cluster. The cluster structure is constructed using a novel weighted clustering algorithm, called MEW (Mobility, Energy, and Workload), that uses node mobility, remaining energy and workload to group nodes into clusters and select cluster heads. In SODA, in order to conserve energy and balance energy consumption among servers so that the lifetime of the network is prolonged, cluster heads are elected to work as coordinating servers. SODA is based on optimistic CC to offer high transaction concurrency and avoid unbounded blocking time. It utilizes the sequential order of committed transactions to simplify the validation process and dynamically adjusts the sequential order of committed transactions to reduce transaction aborts and improve system throughput.Besides correctness proof and theoretical analysis, comprehensive simulation experiments were conducted to study the performance of MEW and SODA. The simulation results confirm that MEW prolongs the lifetime of MANETs and has a lower cluster head change rate and re-affiliation rate than the existing algorithm MOBIC. The simulation results also show the superiority of SODA over the existing techniques, SESAMO and S2PL, in terms of transaction abort rate, system throughput, total energy consumption by all servers, and degree of balancing energy consumption among servers

Uma proposta diferenciada de taxonomia para mecanismos de controle de concorrência de bancos de dados em ambientes sem fio

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.O objetivo fundamental do controle de concorrência em banco de dados é assegurar que a execução concorrente de transações não resulte na perda da consistência do banco de dados, ou seja, é necessário assegurar o isolamento das transações. No que diz respeito aos bancos de dados móveis, os mecanismos de controle de concorrência aplicados em bancos de dados tradicionais, ou até mesmo distribuídos, não satisfazem as restrições impostas pelo ambiente de computação móvel, como mobilidade das unidades, as freqüentes desconexões de rede, a baixa largura de banda e a portabilidade. Baseando-se na referida fundamentação, neste trabalho é feito um estudo bibliográfico dos principais modelos de transações móveis, evidenciando suas arquiteturas, modos de processamento, tipos de transações utilizadas, traçando um comparativo de como é feito o suporte das propriedades ACID (Atomicidade, Consistência, Isolamento e Durabilidade) em cada modelo estudado. Com estas informações é feita uma análise dos mecanismos de controle de concorrência utilizados em cada modelo. De acordo com as necessidades dos modelos de transações investigados na literatura, a taxonomia proposta tem como diferencial a apresentação da abordagem híbrida, onde os modelos de transações móveis poderão obter um melhor desempenho utilizando o modo pessimista, quando a conectado ao banco de dados, e otimista quando desconectado