United States Patent [19]
`Zdunek et a1,
`
`[11] Patent Number:
`[45] Date of Patent:
`
`4,870,408
`Sep. 26, 1989
`
`[54] METHOD FOR DYNAMICALLY
`ALLOCATING DATA CHANNELS ON A
`TRUNKED COMMUNICATION SYSTEM
`Inventors: Kenneth J. Zdunek, Schaumburg;
`Garry C. Hess, Hanover Park;
`Richard A“ Comroe, Dundee, all of
`I11,
`Assignee: Motorola, Inc., Schaumburg, Ill.
`Appl. No.: 44,525
`Filed:
`Apr. 30, 1987
`Int° Cl.4 ...................... .. H0413 7/14; H04Q 11/00
`US. Cl. .......................... .. 340/825.030; 370/ 95.1;
`455/ 34
`Field of Search .................. .. 340/ 825.030, 825.01;
`370/95, 17; 455/ 17, 33, 34, 54, 56, 62
`References Cited
`U.S. PATENT DOCUMENTS
`
`[73]
`[21]
`[22]
`[5 1]
`[52]
`
`[581
`
`[56]
`
`4,012,597 3/ 1977 Lynk, Jr. et a1. ................... .. 455/53
`4,197,500 4/1980 Klein et a1.
`455/62
`4,352,183 9/1982 Davis et a1.
`371/33
`4,551,852 11/1985 Gravel et al.
`455/33
`4,553,262 ll/l985 Coe ....... ..
`455/15
`4,556,972 12/1985 Chan et al. .
`370/94
`4,573,206 2/1986 Grauel et al.
`..... .. 455/33
`4,574,163 3/1986 Zato .................................... .. 379/62
`
`4,578,815 3/1986 Persinotti ............................ .. 455/33
`4,593,389 6/1986 Wurzburg et a1.
`. ave/110.1
`4,609,778 9/1986 Franklin et al. .
`379/243
`
`4,679,187 7/1987 Irvin . . . . . . . . . . . . . . . .
`
`. . . . .. 370/17
`
`.... .. 455/17
`4,698,805 10/1987 Sasuta et al. .
`4,707,832 ll/l987 Glenn et al. ...................... .. 370/124
`
`Primary Examiner-Donald J. Yusko
`Assistant Examiner-Edwin C. Holloway, III
`Attorney, Agent, or Firm-Wayne J. Egan; Thomas G.
`Berry
`ABSTRACT
`[57]
`Disclosed is a method to dynamically allocate a number
`of data channels on a trunked radio system (100). The
`data activity is monitored during a predetermined time
`interval. If activity is above a predetermined maximum,
`an additional channel may be reserved for data use.
`Conversely, if datav traffic is low, a data channel may be
`reallocated for voice message use. Moreover, should
`the amount of data traf?c among the available data
`channels be unbalanced, the present method contem
`plates reassigning subscriber units (114 or 116) to the
`available data channels to balance the data traf?c load,
`thereby providing superior access time and system per
`formance.
`
`14 Claims, 6 Drawing Sheets
`
`INTERFACE
`
`i
`122
`
`NETWORK '
`comaouza
`
`108
`
`ARRIS883IPRI0000962
`
`

`
`U.S. Patent
`
`Sep. 26, 1989
`
`Sheet 1 of 5
`
`4,870,408
`
`SE28N.oz
`
`
`
`4<Ezm_o~m:<mnm~_
`
`mzmzmfi
`
`Eo<z<:
`
`
`
`_.oz~_E<H._nm_m
`
`
`
`:mzz<_._oSE29;
`
`
`
` .n.02-AmoEmHz_mflfinma
`
`EjoEzoo
`éoamzI
`
`Go:
`
`.~m_S%oo
`
`
`
`mo<.._mEz_mflfimmm
`
`z.02
`
`<.~<Q
`
`$>momz<E
`
`pmo:
`
`@328..
`
`:2055>
`
`Emaommpm
`
`<Eo\uo_o>
`
`mfimommaw
`
`>420<55
`
`Emaommsw
`
`ARRIS883IPRI0000963
`
`

`
`US. Patent
`
`eS
`
`90091652D...
`
`Sheet 2 of 5
`
`4,370,403
`
`mom
`
`
`
` moo.mo<mmm_zmo<mmm_:mo<mwH.__2m_._m:<mE
`
`
`
`
`
`
`
`<._<Q<3.<.c<d
`
`
`
`mm:mom2dzzfia_dzz<:omdzz<:u<75:<zo:n_8
`
`
`m._m.§_<><<.—<Q.._o<35non_m_._.<oo._._<EmhioBmmmon.:m_)_<mE
`
`
`
`
`»ozH,5EE»ozm58E.._OEmzszmofimmzEpmfi
`
`IIPII
`
`ENNON
`
`N E K
`
`ARRIS883IPRI0000964
`
`

`
`US. Patent
`
`Sep. 26, 1989
`
`Sheet 3 of 5
`
`4,870,408
`
`FIXED-END
`
`INITIALIZE
`
`I
`®———>—
`RESET / START TIMER I
`
`I 4-00
`
`f 402
`
`MEASURE VOICE/DATA
`ACTIVITY
`
`f 404
`
`41D
`
`YES
`
`CURRENT
`CHANNEL-1
`< MIN
`'?
`
`NO
`
`DROP ONE DATA
`CHANNEL
`
`DATA
`CHAN NEL
`ACTIVITY
`UN BALOAN CED
`
`420
`YES
`
`NO
`
`LOAD LEVELING
`
`CURRENT
`CHANNELS+1
`> MAX
`
`NO
`
`ADD ONE DATA
`CHANNEL
`
`Qj
`
`ARRIS883IPRI0000965
`
`

`
`US. Patent Sep. 26, 1989
`
`Sheet 4 0f 5
`
`4,870,408
`
`FIG. 5A
`
`TRANSMITI REVERT
`TO MASTER OSW
`
`,
`TRANSMIT SEED
`OFFSET TO SUBSCRIBER
`I
`TRANSMIT NUMBER OF
`DATA CHANNELS AND
`IDENTITY INFORMATION
`
`I 502
`
`504
`
`?
`FIG.5B TRANSMIT, REVERT
`TO MASTER OSW
`I,
`TRANSMIT
`SYSTEM MESSAGE
`I
`TRANSMIT NUMBER OF
`DATA CHANNELS AND
`IDENTITY INFORMATION
`
`510
`
`508
`
`ARRIS883IPRI0000966
`
`

`
`US. Patent Sep.26,1989
`
`Sheet 5 of 5
`
`4,870,408
`
`6
`
`SUBSCRIBER
`
`INITIALIZE
`4,
`RECEIVE DATA CHANNEL
`ALLOCATION INFORMATION
`+
`RANDOMLY SELECT A
`DATA CHANNEL
`
`'
`V
`OPERATE 0N ASSIGNED
`DATA CHANNEL
`
`600
`
`e02
`
`604
`
`608 G
`
`TO MASTER
`CHANNEL‘
`'?
`
`612
`
`GO TO MASTER DATA
`CHANNEL AND RECEIVE
`ALLOCATED INFORMATION
`
`616
`
`DISPLAY MESSAGE
`
`I?
`
`RAMDOMLY RE—SELECT
`A DATA CHANNEL
`
`@
`
`ARRIS883IPRI0000967
`
`

`
`1
`
`METHOD FOR DYNAMICALLY ALLOCATING
`DATA CHANNELS ON A TRUNKED
`COMMUNICATION SYSTEM
`
`TECHNICAL FIELD
`This invention relates generally to trunked communi=
`cations systems and more particularly to trunked com‘:
`munication systems that transceive both voice and data.
`
`4,870,408
`2
`nels, permanently removed from the channel allocation
`“pool” of frequencies, is wasteful of spectral resources
`and leads to inefficient system operation. Moreover, the
`dedicated data channel systems lack the capacity to
`dynamically redistribute or allocate the data traf?c load
`across the available data channels. Such systems typi
`cally permanently assign a subscriber unit to a data
`channel thereby building in future problems as the num
`ber of data subscribers increases on a particular channel.
`Accordingly, there exists a need for a trunked com
`munication system that can accommodate both voice
`and data signals, and that operates in true trunked man
`ner to efficiently utilize spectral resources.
`
`10
`
`BACKGROUND ART
`In a basic RF trunked system there exists a high de
`gree of flexibility to partition voice conversations be—
`tween different groups so that no one group of users is
`speci?cally aware when another group of users makes
`use of the system. Typically, these groups are subdi
`vided into subgroups so that calls may be made upon
`either a group, subgroup or individual basis depending
`upon the type of communication desired by an initiating
`subscriber.
`To establish a voice communication between a group
`of units operating on a trunked system, a subscriber unit
`transmits a data packet called an “inbound signalling
`word” (ISW) on a control channel that is maintained for
`such purposes. The ISW contains at least the requesting
`unit’s unique ID code, which may contain or be used to
`obtain the requesting subscriber's current talk-group.
`The request is forwarded to a central controller, which
`decodes the request, and transmits on the control chan
`nel a data pocket called an “outbound signalling word”
`(OSW) to all subscriber units, which continuously mon
`itor the control channel when not participating in a
`voice conversation. The OSW is a channel grant which
`contains the talk-group code of the requesting unit, and
`the voice channel number assigned for the conversa=
`tion. The OSW causes the requesting unit to move to
`the voice channel and commence transmitting, while
`simultaneously causing all other subscriber units in the
`same talk-group to move to the voice channel as listen
`ing units. In this way a group call is set up. If, however,
`all voice channels are in use when a subscriber unit
`transmits an ISW, the central controller typically sends
`the requesting subscriber a “busy OSW”.
`In addition to voice messages, it is desirable to send
`data information across a trunked radio channel. In
`some data systems, a subscriber unit obtains a trunked
`data communication channel via the same procedure
`used to obtain a voice channel. However, this practice
`is inefficient and spectrally wasteful, due to the time it
`takes for a requesting subscriber to transmit an ISW and
`receive a channel grant OSW from the central, and the
`time it takes to set-up and clear-down the call on the
`voice channel. At contemporary data transmission
`rates, it is anticipated that an entire typical data message
`would take substantially less time to transmit than the
`time required to obtain a channel (approximately 0.5
`seconds). Thus, assigning a data channel pursuant to the
`same procedure as assigning a voice channel would be
`wasteful of spectrum and consume precious system time
`that could be better used to transmit data messages.
`Other trunked communication systems desirous to
`accommodate data traf?c have permanently dedicated
`one or more channels to handling data traffic. While
`this avoids the access time problem noted above, this
`technique is contrary to the basic principles of trunked
`communication systems, which strive to allocate chan
`nel resources across a plurality of users as required.
`Therefore, the practice of having dedicated data chan
`
`SUMMARY OF THE INVENTION
`Accordingly, it is an object of the present invention
`to provide an improved trunked communication sys
`tem.
`It is another object of the present invention to pro
`vide a procedure to dynamically allocate data channels
`on a trunked radio system.
`It is a further object of the present invention to redis
`tribute or balance the data traf?c load on the particular
`number of data channels currently available.
`It is another object of the present invention to pro
`vide a rapid and convenient method to broadcast system
`wide data messages to all data subscribers.
`Accordingly, these and other objects are achieved by
`the present invention’s dynamic allocation of data chan
`nels in a trunked radio system.
`Briefly, according to the invention, a method is dis
`closed to dynamically allocate a number of data chan
`nels on a trunked radio system. The data activity is
`monitored during a predetermined time interval. If ac
`tivity is above apredetermined maximum, an additional
`channel is reserved for data use. Conversely, if data
`traffic is low, a data channel is reallocated for voice
`message use. Moreover, should the amount of data traf
`?c between the available data channels be unbalanced,
`the present invention contemplates reassigning sub
`scriber units to the available data channels to balance
`the data traffic load, thereby providing superior access
`time and system performance.
`
`20
`
`25
`
`35
`
`40
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`The features of the present invention which are be
`lieved to be novel are set forth with particularlity in the
`appended claims. The invention, together with further
`objects and advantages thereof, may be understood by
`reference to the .following description, taken in con
`junction with the accompanying drawings, and the
`several ?gures of which like referenced numerals iden
`tify like elements, and in which:
`FIG. 1 is a block diagram of a trunked radio system
`that may employ the present invention;
`FIG. 2 is an illustration of the preferred signalling
`format for a master data channel;
`FIG. 3 is an illustration of the preferred signalling
`format for other data channels;
`FIG. 4 is a flow diagram illustrating the steps exe
`cuted by the ?xed-end equipment of FIG. 1 in accor
`dance with the present invention;
`FIG. 5a is a ?ow diagram illustrating the steps exe
`cuted by the ?xed-end equipment of FIG. 1 to perform
`the load leveling of subscriber units to available data
`channels in accordance with the present invention;
`
`50
`
`55
`
`60
`
`65
`
`ARRIS883IPRI0000968
`
`

`
`. 4,870,408
`
`3
`FIG. 5b, is a flow diagram of the steps executed by
`the fixed-end equipment of FIG. 1 to transmit a system
`message to the subscriber units in accordance with the
`present invention; and
`FIGS. 60 and 6b are flow diagrams illustrating the
`steps executed by the data subscribers of FIG. 1.
`
`25
`
`DETAILED DESCRIPTION OF THE
`PREFERRED EMBODIMENT
`Referring now to the drawings, and in particular to
`FIG. 1, there is shown a block diagram of a trunked
`voice/data communication system (100) that may em
`ploy the present invention. The centralized or ?xed-end
`equipment comprises a central controller 102, which is
`responsible for allocating the channel resources (repre
`sented here by repeaters 104a—104N) amongst the many
`subscriber units. Of the available communication chan
`nels, one (repeater 1040) is selected to be a voice control
`channel, which communicates with any trunked sub
`scriber capable of transmitting voice traf?c.
`Preferably, each of the repeaters 104a-N are capable
`of operating as a voice channel, control channel, or data
`channel. To accommodate data traffic, such repeaters
`are equipped with a data interface 122. The data inter
`faces 122 are responsible for encoding outbound data,
`decoding and error correcting inbound data, repeater
`control, and providing an interface between the re
`peater and the network controller 108. Alternately, a
`predetermined subset of the total number of repeaters
`may be equipped for data or used as a control channel.
`Typically, the particular repeater selected to be the
`control channel (1040) is periodically changed as a con
`trol measure.
`The data network comprises at least one host com
`puter 106, which is coupled (i.e., wireline) to a network
`controller 108. The network controller'108 is responsi
`ble for data traf?c routing and communicating with the
`central controller 102 to request the allocation of a data
`channel. Those skilled in the art will appreciate that if
`the host computer 106, the network controller 108 and
`40
`the central controller 102 are co-located, the intercou=
`plings (124-128) may be direct. However, should re
`mote locations be desired, such communications may be
`maintained through the use of data modems as is known
`in the art. Optionally, or additionally, the trunked voi‘=
`ce/ data communication system 100 may employ one or
`more radio frequency (RF) coupled host computers
`118. The RF host 118 communicates as a trunked con
`trol station via any suitable data transceiver 120. The
`primary difference between the wireline host 106 and
`50
`the RF host 118 is that the data subscribers communi
`cate directly (i.e., via both the inbound and outbound
`frequencies of a data equipped repeater) with the RF
`host, whereas the wireline host 106 transceives all infor
`mation via the inbound or outbound frequencies of a
`data equipped repeater. Accordingly, the data network
`of the present invention may employ several computers
`in either a centralized or distributed processing arrange
`ment.
`Generally, the ?xed-end equipment also includes a
`system manager console 110 that enables the supervisor
`of a communication service provider to set a number of
`operational parameters that control the operation of the
`trunked communication system. Typical examples of
`such parameters include the maximum number of as
`65
`signable data channels (if any), whether voice or data
`will be the priority traffic, and various threshold values
`that control when data channels may be added or real
`
`60
`
`4
`located to voice traffic. Thus, at any particular time, the
`trunked communication system of the present invention
`need not have any channels allocated for data traf?c.
`Conversely, if voice traffic is low, or if data traf?c
`enjoys a priority status or is particularly heavy, one or
`more channels may be allocated for data communica
`tion.
`According to the present invention, a predetermined
`channel ordinarily comprises the first channel to be
`allocated for data. Preferably, this ?rst assigned data
`channel (hereinafter “the master data channel”) has the
`same frequency as any single frequency data-only sub
`scribers (116) to provide maximum compatibility with
`existing data equipment. Alternately, a random channel
`may be the ?rst assigned data channel; however, the
`data-only subscribers must scan the available channels
`to find it. Thus, the present invention prefers to ?rst
`assign a selected channel, and, thereafter, assign any
`other data equipped (122) channel as an additional data
`channel.
`The present invention allocates data channels for a
`time interval determined by either the system manager
`or a default parameter. The length of the allocation
`period may vary with the time of day, system loading or
`other such parameters. By reserving a channel for data
`use over a time period, data channel requests are mini
`mized and spectral ef?ciency is maximized since a data
`subscriber need not request a data channel for each
`separate data transmission.
`As a general principle, the goal of any trunked com
`munication system is to effectively allocate the limited
`channel resources amongst a plurality of subscriber
`units. The present invention contemplates three classes
`of subscriber units: voice-only subscribers 112, voice/
`data subscribers 114, and data-only subscribers 116. The
`voice-only subscribers 112 are contemplated to be any
`existing trunked subscriber unit having a compatible
`signalling protocol to allow interaction with the system
`(100). The data-only subscribers (116) are contemplated
`to be any multiple or single channel data transceivers
`such as the KDT 800 TM , manufactured by Motorola,
`Inc., or functional equivalent. Of course, receive-only
`data devices, such as any of the Motorola family of
`display pagers, may also operate to receive paging data
`over an assigned data channel. In this way, the trunked
`system of the present invention accommodates existing
`equipment, while providing enhanced communication
`capabilities. Subscriber units are typically comprised of
`either mobile, portable or control stations. Typically,
`mobile units are understood to be transceivers designed
`to operate in a vehicle. A portable unit is typically un
`derstood to be a transceiving or receive-only device
`designed primarily to be carried on or about the person.
`Control stations are usually permanent or semi-perma
`nent installations in buildings or other such ?xed loca
`tions. These are collectively referred to herein as sub
`scriber units, which communicate with one another
`through the ?xed-end equipment.
`As previously mentioned, the ?rst data channel allo
`cated is de?ned as the master data channel, the identity
`of which is periodically transmitted to all subscribers
`over the control channel. Additionally, or optionally,
`the identities of all other allocated data channels are
`periodically transmitted over both the voice control
`channel and the master data channel.
`Those skilled in the art will appreciate that some
`criteria is required to decide how to distribute data users
`when multiple data channels are present. According to
`
`ARRIS883IPRI0000969
`
`

`
`25
`
`30
`
`4,870,408
`6
`5
`assignments. For load leveling, the actual number of
`the present invention, the data subscribers (114 and 116)
`allocated data channels may not have changed. The
`each determine their own assigned data channel by
`data subscribers are merely forced to randomly re-select
`randomly selecting one of the available data channels.
`a data channel assignment. However, it is possible that
`It should also be understood that other bases are
`available and the particular basis used in any particular
`the data subscribers may not be able to effectively re
`distribute the data traffic using this simple approach.
`implementation is not critical to the practice of the
`Accordingly, the present invention contemplates trans
`present invention. Random number (selection) genera
`tors are well known in the art, and the particular algo
`mitting an offset “seed” to some or all the subscribers
`for the random selection algorithm. In this way, there is
`rithm used is not critical to the practice or understand
`a statistical probability that the load will be spread over
`ing of the present inventive method. Of course, the
`particular data channel assignment will depend upon
`the available data channels as opposed to being con
`gested onto a particular data channel. The data traf?c
`the actual number of data channels currently available.
`may then be monitored over the next operating period,
`For example, a particular subscriber unit may select
`and if the load is still unbalanced a different offset seed
`data channel one if the current number of data channels
`may be transmitted to again redistribute the data load.
`is two. If the number of channels is three, channel two
`Those skilled in the art will appreciate that it is often
`may be selected, and so on. Of course, if there is only
`desirable to communicate with all subscriber units at
`one data channel available, all data subscribers will use
`that channel. In this way, data subscribers may select a
`one time in response to either an emergency, or to dis
`data channel and up-load or down-load information to
`tribute a message of general concern. For example, a
`or from the host computer 106 (or 118). As used herein,
`message announcing some emergency condition, or that
`the host computer 106 (or 118) will be down for repair
`“up-=load” means the transference of data or executable
`are examples of messages that would be convenient to
`code from a subscriber unit to a host computer. The
`transmit to all subscribers at one time. Accordingly, the
`term “down-load” means the transference of data or
`present invention achieves this operation by transmit
`executable code from a host computer to a subscriber
`ting the revert to master command over all allocated
`unit.
`‘
`data channels. All subscribers respond to this command
`When a particular number of data channels is as
`signed, the central 102 monitors the voice activity,
`by listening to the master data channel. Just prior to
`while the network controller 108 monitors the activity
`retransmitting the current number of data channels and
`on the data channels. This activity monitoring is prefer
`their identities (which may be unchanged), a system
`ably performed for a predetermined period of time. For
`broadcast message is transmitted so that all subscribers
`example, the monitoring activity may be done by the
`may receive the message prior to receiving the data
`hour (or half hour) so that during peak loading times the
`channel information. In this way rapid system wide data
`communication is provided by the present inventive
`trunked system (100) can quickly adapt to reallocate the
`. method. After receiving the system message, the data
`channel resources. If the network controller determines
`that the data activity on the assigned data channels has
`subscribers may return to their assigned data channels.
`35
`exceeded a predetermined supervisor selected thresh
`Referring now to FIG. 2, an illustration of the pre
`ferred signalling format for the master data channel is
`old, the network controller 108 requests the central to
`shown. The signalling format 200 begins with a pream
`allocate another channel for data traffic. Conversely, if
`ble portion 202, which may include synchronization or
`the central determines that voice activity has exceeded
`framing information for the data subscriber units. Fol
`a predetermined threshold, the central 102 requests the
`lowing the preamble 202 is an optional block 204
`network controller to relinquish a data channel. In this
`way, the trunked system 100 adapts to reallocate the
`wherein either a system message or an offset seed may
`be transmitted to effectuate either the system message
`channel resources.
`operation or the load leveling procedure previously
`According to the present invention, reallocation be
`mentioned. Of course, during normal operations format
`gins by transmitting a “revert to master” command over
`all currently assigned data channels. When the sub
`block 204 would not be used and the preamble 202
`would directly precede block 206.
`scriber units receive this command, they all revert to
`Basically, block 206 transmits the total number of
`the master data channel to listen for new data channel
`currently available data channels (be it 1, 2, 5, etc.) in
`assignments. The allocated data channels may be incre
`any suitable form. Following block 206 are a plurality
`mented or decremented by a predetermined number
`of blocks (208a through 208n) which transmit the iden
`(one of the preferred embodiments) and the new alloca=
`tity of the data channels. In the preferred embodiment,
`tion or number of data channels may be broadcast along
`the transmitted identity of the data channels is the actual
`with the identity of each data channel. The subscriber
`frequency of the channels. Alternately, the channels
`units receiving this information determine the number
`could be assigned a designated number and the selected
`of available data channels and randomly select an as
`55
`ones available for data use transmitted. For example, if
`signment. In this way, the number of data channels can
`be conveniently incremented or decremented depend~
`a particular system has ?ve channels, it may be conve
`nient to label them 1-5. Then, assuming the subscribers
`ing upon data traffic.
`knew the frequencies, the numbers “4” and “5” may be
`In addition to overall data traf?c monitoring, the
`transmitted to indicate that channels four and five are
`network controller 108 may determine that the data
`the data channels. The preferred method, however, is to
`traf?c load on a particular data channel is excessive.
`transmit the actual frequencies, since this allows for
`Accordingly, the present invention contemplates a
`simple expansion of the system, and limits the amount of
`method to balance the data traf?c over the available
`data channels. Load leveling may be accomplished by
`information required to reside in the subscriber units.
`Therefore, if there is one data channel (i.e., the master
`simply transmitting a “revert to master" command over
`all currently assigned data channels. When the sub
`data channel), that frequency will be transmitted in
`block 2080. If there are ?ve data channels currently
`scriber units receive this command, they all revert to
`available (the master data channel plus four other data
`the master data channel to listen for new data channel
`
`60
`
`40
`
`45
`
`65
`
`ARRIS883IPRI0000970
`
`

`
`4, 870,408
`8
`7
`.
`channels), those frequencies may be transmitted (for
`tors the voice activity and the network controller moni
`example in blocks 208a through 208a), and so on.
`tors the data activity. In step 404, these measurements
`After the transmission of the identity of the last avail
`are taken such as by calculating the air-time billing
`able data channel, the master data channel may be used
`information or other such suitable means. Following
`by the subscriber units as a data channel as is illustrated
`step 404, decision 406 determines whether or not the
`by block 210.
`timer has elapsed. If the timer has not elapsed, a loop is
`formed with step 404 until decision 406 determines that
`To effectuate a recovery process, in case any particu
`lar subscriber unit should temporarily lose its data chan
`the timer has expired.
`nel assignment, the central 102 and the network control~
`Decision 408 determines whether the voice activity is
`ler 108 may periodically transmit the signalling format
`high when compared to a selected threshold that may
`be speci?ed by the system supervisor. If the determina
`200 over the voice control channel and the master data
`channel, respectively. If through some error the data
`tion of decision 408 is that the voice activity is high,
`channel assignment is lost, the present invention pro
`decision 410 determines whether the current number of
`vides that all data mode subscriber units automatically
`data channels minus a predetermined offset (one in the
`revert to the master data channel. In this way, a sub
`preferred embodiment) would be less than the minimum
`scriber unit may receive the periodic transmissions of
`number (if any) of data channels speci?ed by the system
`the channel assignments from the master data channel
`supervisor. If so, decision 410 returns control to refer
`and return to the proper data channel assignment. In the
`ence letter A, which resets the timer and the routine
`begins again. If, however, decision 410 determines that
`event a subscriber unit loses the identity of the master
`data channel, the present invention further provides
`removing a channel would not be below the minimum
`that the subscriber units revert to the voice control
`allowed data channels, or there is no minimum, the
`channel to receive the data channel allocation informa
`routine proceeds to step 412, which de-allocates a chan
`tion.
`nel from data traf?c and returns it to voice traffic. The
`Referring now to_ FIG. 3, the preferred format for
`routine then proceeds to reference letter A of FIG. 4.
`other (i.e., not the master) data channels is shown. Basi
`If the determination of decision 408 is that the voice
`cally, the format of a data channel 300 begins with a
`activity is not high, the routine proceeds to decision
`preamble 302, which may include synchronization and
`414, which determines whether the data activity is high
`framing information. The preamble 302 precedes a plu
`compared to a predetermined threshold selected by the
`rality of variable length data messages 304-308.
`system supervisor. If the determination of decision 414
`As previously mentioned, the request for assignment
`is that the data activity is high, the routine proceeds to
`of a data channel is prohibitively long compared to the
`decision 416, which determines whether the current
`typical data message transmission time. Therefore, the
`number of channels plus one (in the preferred embodi
`present invention contemplates a subscriber unit going
`ment) is greater than the maximum number (if any)
`to its assigned data channel and transmitting the data
`speci?ed by the system supervisor. If the determination
`information without re-requesting the channel. Operat
`of decision 416 is that the additional channel would
`ing in this manner conserves spectrum and speeds trans
`exceed the maximum, the routine returns control to
`mission by eliminating the requirement to request a data
`reference letter A. If, however, decision 416 determines
`channel. Of course, there exists the possibility that there
`that the addition of a data channel will not exceed the
`will be data collisions on the data channels.~ However,
`maximum, the routine proceeds to step 418, which allo
`data collision avoidance mechanisms and methods are
`cates an additional channel from voice traf?c to data
`widely known in the art and any suitable data collision
`traf?c. The routine then returns control to reference
`avoidance and recovery method will be suitable for use
`letter A of FIG. 4.
`in the present invention.
`Additionally, the ?xed-end equipment may take traf
`As illustrated in FIG. 3, the lengths of data messages
`?c priorities into account before the allocation step 418
`1, 2 and 3 (304, 306 and 308), are all of a variable dura
`and the de-allocation step 412. If, for example, a particu
`tion depending upon the amount of information to be
`lar system favored voice traf?c, an additional data chan
`transmitted. Thus, once a subscriber unit gains access to
`nel may not be allocated if voice traf?c were above a
`a data channel, the subscriber may transmit data for as
`predetermined minimum. Alternately, for a system hav
`long as required to complete a data message. Of course,
`ing a data traf?c preference, a data channel may not be
`a second subscriber unit attempting to transmit data
`re-allocated for voice traf?c if data traf?c was above a
`may be required to wait until the ?rst subscriber has
`predetermined threshold. In the absence of either a
`completed transmitting. Thus, a data channel may be in
`voice traf?c or data traf?c preference, the absolute
`constant or near constant use. During periods of high
`allocation and de-allocation procedure of FIG. 4 is
`preferred.
`data channel use, the preamble portion 302 need not be
`transmitted since the subscribers may still be synchro
`Referring still to FIG. 4, if the determination of 414 is
`nized to the incoming data. However, if the data chan
`that the data activity as a whole is not high, the routine
`nel use is low, the network controller 108 or a data
`proceeds to decision 420 to determine whether the data
`subscriber may transmit the preamble portion 302 prior
`traf?c across all available data channels is balanced or
`to transmitting.
`unbalanced. If the determination of decision 420 is that
`Referring now to FIG. 4, there is shown a ?ow dia
`the traf?c is essentially balanced, the routine returns
`gram illustrating the steps executed by the fixed-end
`control to reference letter A, which resets the timer of
`equipment to implement the present invention. The
`step 402. If, however, decision 420 determines that the
`routine begins with initializing step 400, wherein the
`data traf?c is unbalanced the routine proceeds to the
`central controller 102 and the network controller 108
`load leveling routine of FIG. 50.
`may set aside memory space or perform other such
`Referring now to FIG. 5a, the steps executed by the
`functions as any particular system may require. The
`network controller 108 to execute a load leveling of
`routine next proceeds to step 402