Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

A layer assignment and resource reservation scheme for hierarchical cell structures

Författare

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.

Publiceringsår

2004

Språk

Engelska

Sidor

1508-1513

Publikation/Tidskrift/Serie

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

Volym

3042

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

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

Nyckelord

  • 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/Övrigt

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