Browse Prior Art Database

METHOD FOR EARLY DETECTION OF NON-ADJACENT SITE ROAMING

IP.com Disclosure Number: IPCOM000009742D
Original Publication Date: 2000-Jan-01
Included in the Prior Art Database: 2002-Sep-16
Document File: 1 page(s) / 73K

Publishing Venue

Motorola

Related People

David Forseth: AUTHOR

Abstract

A Motorola subscriber unit (SU) on a multiple site trunked system relies on adjacent site informa- tion for roaming. It uses this information which contains site addressing, state of the site, and chan- nel information to determine when and where to make site switches. The SU also uses a pro- grammed control channel (CC) list if the adjacent site information does not provide a usable site when going out of range of its current site of operation. Inefficient operation can occur when a powered- down SU travels beyond all known adjacent sites and is then powered up. The SU can find a site through its CC list of frequencies, but may not find the best site for its location. This algorithm will improve SU roaming in this scenario.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 50% of the total text.

Page 1 of 1

Technical M-OLA @ Developments

METHOD FOR EARLY DETECTION OF NON-ADJACENT SITE ROAMING

by David Forseth

INTRODUCTION

  A Motorola subscriber unit (SU) on a multiple site trunked system relies on adjacent site informa- tion for roaming. It uses this information which contains site addressing, state of the site, and chan- nel information to determine when and where to make site switches. The SU also uses a pro- grammed control channel (CC) list if the adjacent site information does not provide a usable site when going out of range of its current site of operation. Inefficient operation can occur when a powered- down SU travels beyond all known adjacent sites and is then powered up. The SU can find a site through its CC list of frequencies, but may not find the best site for its location. This algorithm will improve SU roaming in this scenario.

PROBLEM

  Before a SU roams beyond the range of it cur- rent site it should have adjacent site information sent from the site to determine where to roam. However, if a SU moves beyond the range of the current site and adjacent sites while powered down it will power up and be unable to make use of its stored adjacent site information. It will revert to the CC list in the order programmed in the SU. It is possible to select a site other than the best available site. If this occurs the SU should receive adjacent information for a better site and then roam to that site. The problem with this is that it could take approximately 5 - 10 seconds to learn of and switch to a better site. Also, the radio has affiliated on both sites, first when powering up and then on the switch to a...