Channel allocation schemes in a mobile computing (wireless) environment can be either static or dynamic. Static allocation offers negligible channel acquisition time and zero message complexity and works well at a low system load; the performance steadily decreases as system load increases since man
Distributed traffic adaptive channel allocation
β Scribed by P. P. Demestichas; E. C. Tzifa; M. E. Anagnostou
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 172 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1074-5351
No coin nor oath required. For personal study only.
β¦ Synopsis
Dynamic channel allocation (DCA) schemes adapt to the time variant demand for channels in cellular mobile telephony systems. In this paper we propose a DCA scheme that smoothly changes the channel allocation by solving the following problem. Given a cell structure, a collection of channels, the frequency reuse distance, an allocation of channels to cells, and the number of active connections per cell, accommodate a new call or a new handover by minimally reconfiguring the established allocation of channels to cells. First, this problem is formulated as 0-1 quadratic programming problem. Next, we present a distributed, heuristic solution to the problem, which is based on the observed behaviour of the optimal algorithm. Finally, we present some simulation results on the performance and the feasibility of the distributed algorithm.
π SIMILAR VOLUMES
A fundamental problem in third-generation mobile systems is the adaptation of the channel allocation to the traffic volume variation. Traffic adaptation may be partly achieved by the following (aggregate channel allocation) problem: given the set of channels, the cell structure and the load to be ac
A channel allocation algorithm includes a channel acquisition algorithm and a channel selection algorithm. Most of the previous work concentrates on the channel selection algorithm since early channel allocation algorithms simply use a centralized channel acquisition algorithm, which depends on a mo
Several space sharing policies have been proposed for distributed-memory multicomputer systems. We consider adaptive space sharing policies, as these policies provide a better performance than fixed and static policies by taking system load and user requirements into account. In this paper we propos
This paper presents Faded Environments Effective Distributed Engineering Redundant Signalling (FEEDERS), an access scheme for sharing, in time division multiple access (TDMA) mode, the capacity of a satellite channel among a number of stations, on the basis of user demand. This scheme and its compan