The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

A layer assignment and resource reservation scheme for hierarchical cell structures

På svenska

Author

Summary, in English

To provide for a high QoS in a cellular network, each call should be assigned to its preferred cell and priority given to already ongoing calls. Herein, a combined speed-sensitive layer selection method and dynamic guard channel scheme, called CLARR, for use in hierarchical networks, is introduced. To reduce the complexity, partially the same speed estimation and measurement procedures are applied for both tasks. The main features of CLARR are the use of dwell time feedback control in the layer selection method and the grouping of calls depending on previous movement patterns. The measurements needed for making mobility predictions are performed separately for calls of different groups.

Publishing year

2004

Language

English

Pages

1508-1513

Publication/Series

NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications. Proceedings (Lecture Notes in Computer Science)

Volume

3042

Document type

Conference paper

Publisher

Springer

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering
  • Communication Systems

Keywords

  • dynamic guard channel scheme
  • speed-sensitive layer selection method
  • cellular network
  • quality of service
  • QoS
  • resource reservation scheme
  • dwell time feedback control

Conference name

Third International IFIP-TC6 Networking Conference

Conference date

2004-05-09 - 2004-05-14

Conference place

Athens, Greece

Status

Published

ISBN/ISSN/Other

  • ISSN: 0302-9743
  • ISSN: 1611-3349
  • ISBN: 978-3-540-21959-0