This paper discusses several channel allocation methods for data dissemination in mobile computing systems. We suggest that the broadcast and on-demand channels have different access performance under different system parameters and that a mobile cell should use a combination of both to obtain optimal access time for a given workload and system parameters. We study the data access efficiency of...

An Efficient Interaction Framework for Mobile Web Services Abdullah Abdullatif Almuaibid Supervising Professor: Xumin Liu, Ph.D. Having the latest technological devices is becoming more of a necessity these days rather than a luxury as it was only a decade ago. Among these advancements, the smart phone has grown in popularity significantly. This is due to a variety of reasons but it would have ...

A multiple access protocol that is particularly suitable for cellular Internet access and satellite-based networks with on-board processing is developed in this paper. The basic idea is that when a user wishes to send a message, it transmits with a probability paccess that depends on the load on the channel. Under conditions of low load, the probability paccess approaches 1, while at high load ...

We derive the capacity region for a broadcast channel with intersymbol interference (ISI) and colored Gaussian noise under an input power constraint. The region is obtained by first defining a similar channel model, the circular broadcast channel, which can be decomposed into a set of parallel degraded broadcast channels. The capacity region for parallel degraded broadcast channels is known. We...

Byzantine broadcast is a distributed primitive that allows a specific party to consistently distribute a message among n parties in the presence of potential misbehavior of up to t of the parties. The celebrated result of [PSL80] shows that broadcast is achievable from point-to-point channels if and only if t < n/3. The following two generalizations have been proposed to the original broadcast ...

Absfroct-This paper generalizes Cover’s results on broadcast channels with two binary symmetr ic channels (BSC) to the class of degraded channels with N components. A random code, and its associated decoding scheme, is shown to have expected probability of error going to zero for all components simultaneously as the codeword length goes to infinity, if the point representing the rates to the va...