This paper considers the multiple access of mobile users to a common wireless channel. The channel is slotted and the binary feedback (empty slot/nonempty slot) is sent to all accessing users. If a slot was not empty and only one user transmitted in it, the transmission is considered successful. Only the user, which had the successful transmission, receives information about its success. In the Introduction, the paper gives a review of known multiple-access algorithms for such a channel. Then our algorithm is constructed that has none of the weaknesses of the algorithms discussed in the Introduction. The algorithm is stable, in contrast to the ALOHA algorithm. It can work in a channel with capture and multiple reception. Without them, the algorithm has a throughput of 0.2891. It is shown how capture and multiple reception can increase the algorithm throughput to 0.6548 and decrease the packet delay for some fading models. The average packet delay and variance are found for two fading models. The models are Rayleigh fading with incoherent and coherent combining of joint interference power. The accessing traffic is Poisson.

The third-generation code division multiple access (3G CDMA) mobile communication networks are designed to transmit voice and data over wireless channels. Fundamental problems need to be solved for such mobile communication networks to operate efficiently. One of the problems is finding optimal scheduling algorithms for file transmission over the fading downlink channel from a base station to mobile users. Here, the problem is solved in the case of transmission of a given number of files. Optimal algorithms that minimize the delay and the transmission time are found. Also, specific nonoptimal algorithms are considered and compared numerically with the optimal ones. We consider a slotted downlink with channels to the mobile users that are dependent in the same slot but independent for different slots. Additionally, some generalizations are presented.

A discrete-argument stochastic process is presented. The process is a generalization of the Cinlar (1975) semiregenerative process and process /spl eta/(t) given in Tsybakov (1993). For this process, the theorem, which is similar to the Smith regenerative process theorem, is given. We use this theorem to find the transmission rate and mean packet delay for stack and part-and-try random multiple access algorithms in their supercritical regions. For the part-and-try algorithm, the results are new. For the stack algorithm, we give a new method of finding the rate and delay.

This paper reviews and discusses the known definitions and properties of second-order self-similar discrete-time processes and supplements them with some more general conditions of self-similarity. A model for ATM cell traffic is presented and self-similarity conditions of this model are found. This study is motivated by observations that traffic in many real communication networks is self-similar in nature.

Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic processes. Measurements have also shown that, with increasing buffer capacity, the resulting cell loss is not reduced exponentially fast as it is predicted by Markov-model-based queueing theory but, in contrast, decreases very slowly. Presenting a theoretical understanding to those experimental results is still a problem. The paper presents mathematical models for self-similar cell traffic and analyzes the overflow behavior of a finite-size ATM buffer fed by such a traffic. An asymptotical upper bound to the overflow probability, which decreases hyperbolically, h/sup -a/, with buffer-size-h is obtained. A lower bound is also described, which demonstrates the same h/sup -a/ asymptotical behavior, thus showing an actual hyperbolical decay of overflow probability for a self-similar-traffic model.

Recent traffic measurements in corporate local-area networks (LANs), variable-bit-rate video sources, ISDN control-channels, and other communication systems, have indicated traffic behaviour of self-similar nature. This paper first discusses some definitions and properties of (second-order) self-similarity and gives simpler criteria for it. It then gives a model of self-similar traffic suitable for queuing system analysis of an asynchronous transfer mode (ATM) queue. A lower bound to the overflow probability of a finite ATM buffer is obtained, as also a lower bound to the cell loss probability. Finally, the stationary distribution of the cell delay in an infinite ATM buffer is obtained.

Random multiple access (RMA) protocols comprise an important class for the accessing/signaling stage in multimedia ATM wireless networks. Within the RMA class, the ALOHA algorithm is most widely used at this point in time, while, as is well known, the latter algorithm becomes unstable, as the user population increases. In this paper, we consider the part-and-try algorithm, instead, for a system with different priorities. Based on this algorithm, we construct a mixed priority protocol whose total throughput-for all priorities combined-equals 0.487. In the special and important for ATM case of two, low, and high priorities, with respective Poisson intensities /spl lambda//sub L/ and /spl lambda//sub H/. We also present an analytical methodology which allows the computation of the average packet delays as functions of the rates /spl lambda//sub L/ and /spl lambda//sub H/.>

A cellular network with base stations forming a rectangular lattice is considered. Frequency band utilization depends on the chosen spatial frequency reuse scheme. Two fixed channel assignment schemes are suggested for the network under consideration. Characterization and comparison of the schemes are made.

Random multiple access (RMA) protocols comprise an important class for the accessing/signaling stage in multimedia ATM wireless networks. Within the RMA class, the ALOHA algorithm is most widely used, while, as is well known, the latter algorithm becomes unstable, as the user population increases. We consider the part-and-try algorithm, instead, for a system with different priorities. Based on this algorithm, we construct a mixed priority protocol whose total throughput for all priorities combined equals 0.487. In the special and important ATM case of two, low- and high-priorities, with respective Poisson intensities /spl lambda//sub L/ and /spl lambda//sub H/. We also present an analytical methodology which allows the computation of the average packet delays as the functions of the rates /spl lambda//sub L/ and /spl lambda//sub H/.

The effect that large propagation delay has on the problem of network access is explored for the infinite population model with success-idle-collision feedback information, where the feedback information suffers a large propagation delay N. A simple lower bound is given on the probability that a packet is not successfully transmitted within N/2 time units (not including the forward propagation delay), where N is the station-to-station propagation delay. The bound implies a lower bound on the mean access delay. We also display an algorithm for which the transmission delay is within a factor of three of the lower bound, for moderate traffic loads and asymptotically large propagation delay.>

A survey is presented of most of the principal results on random multiple-access (RMA) theory obtained in the USSR up to the end of 1983. Relevant background material is provided on the various RMA algorithms discussed.