Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

FAST AUTO DEAFFILIATION

IP.com Disclosure Number: IPCOM000006783D
Original Publication Date: 1993-Mar-01
Included in the Prior Art Database: 2002-Jan-31
Document File: 2 page(s) / 125K

Publishing Venue

Motorola

Related People

Guy Romano: AUTHOR [+2]

Abstract

The purpose of fast auto deatliliation is to enable a trunked system to quickly deafiliate radios. This will allow the trunked system to use its resources more effectively. This is achieved by monitoring the number of talkgroup members afliliated at each site. When the number of talkgroup members drops below a prede- termined level, the tixed end will frequently request aflili- ation from each of the talkgroup members. Once all members have deatsliated, the resources that were being used by that talkgroup can be freed up.

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 INC. Technical Developments Volumela March 1993

FAST AUTO DEAFFILIATION

by Guy Roman0 and Bill Felderman

ABSTRACT

  The purpose of fast auto deatliliation is to enable a trunked system to quickly deafiliate radios. This will allow the trunked system to use its resources more effectively. This is achieved by monitoring the number of talkgroup members afliliated at each site. When the number of talkgroup members drops below a prede- termined level, the tixed end will frequently request aflili- ation from each of the talkgroup members. Once all members have deatsliated, the resources that were being used by that talkgroup can be freed up.

  A wide area trunked radio system that incorporates dynamic site assignment di5ers from the current trunked radio systems in several ways. One difference is the allo- cation of resources. This system will only allocate resources on an as needed basis. For example, if there are no members of a talk-group at a particular site and a call is made for that talkgroup, no channels will be assigned for that call at that site. This leads to a more efficient use of resources.

  In order to achieve an optimum use of resources, each site must have an accurate accounting of radios. In particular each site must have an accurate accounting of radios in each talkgroup. This is a problem in current trunked radio systems.

  Currently when a radio is turned on it will affiate to a site. When the radio travels into the coverage of another site of a multiple site system it will affiliate to the new site. It will then become dea!Xliated from the old site by the controller. A problem comes in when instead of traveling into another site's coverage area the radio travels into an area where there is no coverage. Since the radio has not &ilk&d to a new site, it will not be quickly deatliliated from its old site.

  A mechanism is in place where each radio is requested to affiliate in a specified period of time. If the futed end has determined that a radio &iliation timer has expired for a particular radio, it will request afilia-

e Motorola. Inc. 1993

tion from that radio. The futed end will do this by send- ing an affiliation request Outbound Signalling Word (OSW) to the radio. Ifthe radio responds with an tilia- tion Inbound Signalling Word @SW) then the radio will remain affiated and the &ilk&ion request timer will be reset.

  The radio is de&hated by the fuced end if it does not respond to the affiliation request with an affiliation ISW. If the radio cannot respond to the a5liation request then it is assumed that the radio has traveled outside the fixed end's coverage area. This is currently done in trunked systems.

  The problem here is the length of time between the affiliation requests. If the site frequently requests afIXa- tion from all radios, the amount of traffic will increase dramatically. If the site requests z&ilk&ion infrequently, then it is possible that som...