Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-27T07:43:55.966Z Has data issue: false hasContentIssue false
  • English
  • Français

BOUNDS AND PERFORMANCE LIMITS OF CHANNEL ASSIGNMENT POLICIES IN CELLULAR NETWORKS

Published online by Cambridge University Press:  11 January 2002

Nicole Bäuerle  and
Anja Houdek
Nicole Bäuerle
Affiliation:
Department of Mathematics VII, University of Ulm, 89069 Ulm, Germany, E-mail: [email protected]
Anja Houdek
Affiliation:
Department of Mathematics VII, University of Ulm, 89069 Ulm, Germany, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We investigate the performance of channel assignment policies for cellular networks. The networks are given by an interference graph which describes the reuse constraints for the channels. In the first part, we derive lower bounds on the expected (weighted) number of blocked calls under any channel assignment policy over finite time intervals as well as in the average case. The lower bounds are solutions of deterministic control problems. As far as the average case is concerned, the control problem can be replaced by a linear program. In the second part, we consider the cellular network in the limit, when the number of available channels as well as the arrival intensities are linearly increased. We show that the network obeys a functional law of large numbers and that a fixed channel assignment policy which can be computed from a linear program is asymptotically optimal. Special networks like fully connected and star networks are considered.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 16 , Issue 1 , January 2002 , pp. 85 - 100
Copyright
© 2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)