Browse Prior Art Database

DYNAMIC ALLOCATION OF SCAN SEARCH TIME

IP.com Disclosure Number: IPCOM000008669D
Original Publication Date: 1998-Jun-01
Included in the Prior Art Database: 2002-Jul-02
Document File: 2 page(s) / 97K

Publishing Venue

Motorola

Related People

Steven M. Goetz: AUTHOR [+3]

Abstract

Activity, in this article, is defined as calls to which a scanning radio will unmute. These are calls where the talkgroups match one of the talkgroup IDS in the subscriber scan list.

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 2

0 M

MOTOROLA Technical Developments

DYNAMIC ALLOCATION OF SCAN SEARCH TIME

by Steven M. Goetz, Steven E. Van Swol and Gary R. Gutknecht

1 PROBLEM

  Activity, in this article, is defined as calls to which a scanning radio will unmute. These are calls where the talkgroups match one of the talkgroup IDS in the subscriber scan list.

  In current trunking scan operation, the radio looks for relevant activity on a system for program- mable length of time. When this time expires, the radio moves on to the next system with no guarantee that it has examined all ongoing activity. The search time is the same regardless of the system's activity level. Excess time is thus being spent on inactive systems while active systems may not he given enough time. Consequently, relevant scan activity can be missed. A second problem occurs with out of range (OOR) systems. These systems are removed from the list of valid systems and queued. Each time the radio makes it through the list of valid systems, one of the OOR systems is scanned for activity. On radios with large scan lists, or in cases where there are several OOR systems, a system can spend an excessive amount of time in the OOR state, making errant OOR determinations potentially disastrous.

2 SOLUTION

  Both of these problems can be solved by dynamically determining the scan search time based on the relative level of activity on a system. Such an algorithm optimizes a subscriber's search time so a greater proportion of time is spent on system which have call activity. In addition, the OOR condition becomes transparent since a OOR system simply

appears as a very inactive system.

3 IMPLEMENTATION

  After initiating scan, the radio will begin by searching for activity on each system for a default length of time. Each time a system is scanned, the radio will keep track of the number of times it becomes active on a member of that system. After each pass through the scan list, the radio will dynamically determine the search time given to a system as a function of the call activity a...