Dynamic address allocation within RF trunking multisite switch

• US 5,276,442 A
• Filed: 02/22/1991
• Issued: 01/04/1994
• Est. Priority Date: 02/22/1991
• Status: Expired due to Term

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Brame, Charles P., Cree, Timothy F., Imron, Wim A.
• Primary Examiner(s): Peng, John K.
• Assistant Examiner(s): Gray, Robert
• Application Number:
  US07/658,843
• Time in Patent Office: 1,047 Days
• Field of Search: 340/825.01, 340/825.03, 340/825.04, 340/825.15, 340/825.52, 340/825.07, 370/60, 370/67, 370/85.7, 370/92, 370/95.1, 370/93, 370/94.1, 455/34.1, 455/34.2, 455/53.3, 379/58, 379/59, 379/63
• US Class Current: 340/9.16
• CPC Class Codes: H04W 84/08 Trunked mobile radio systems

Abstract

A multisite network switch for a series of RF digital trunked radio transceivers and dispatcher consoles. The switch establishes audio communications between different sites and various dispatcher consoles. The multisite switch has a distributed architecture in which each node of the switch is supported by a microprocessor controlled card. These nodes perform all of the logical functions of the switch. When the switch is booted-up or reset, each node executes a dynamic address generation algorithm to select a unique address and resolve any address conflicts with other nodes.

Claims

1. A method for generating unique node addresses in a switch having a distributed architecture of nodes operatively coupled to a message bus and wherein each node comprises a controller and an associated memory unit having a n address table, said method comprising the steps of:

a. a subject node generating a requested address and broadcasting an address request message to the other nodes in the switch;

b. each node receiving the address request message comparing the requested address to its own address and broadcasting an address denial message if the two addresses are the same;

c. upon receiving an address denial for its address, the subject node selecting a new address and broadcasting the new address to other nodes;

d. each node waiting a first predetermined count period of time as monitored by a counter;

e. if any address request or address denial messages that match the subject node'"'"'s requested address are received during the first predetermined count period of time, returning to step (c);

f. if no address request or denial messages that match the subject node'"'"'s requested address are received during the first predetermined count time period, waiting a second predetermined period of time; and

g. if no address request or address denial messages are received by any node during the second predetermined period of time, storing unique node addresses in each node'"'"'s associated memory unit.

3. The method according to claim 1, wherein the second predetermined time period is longer then the first predetermined count time period.

2. A method for generating unique node addresses in a switch having a distributed architecture of nodes operatively coupled to a message bus and wherein each node comprises a controller and an associated memory unit having an address table, said method performed by each node and comprising the steps of:

a. a subject node generating its own address, setting the address into its address table and broadcasting an address request message for its requested address to the other nodes in the switch over the message bus;

b. each node receiving the address request message, comparing the requested address to its own address and broadcasting an address denial message if the compared addresses are the same;

c. upon receiving an address denial message for its requested address, the subject node returns to said step (a);

d. waiting a predetermined count period of time as monitored by a counter;

e. if no address denial or address request message for the address generated by the subject node is received within the count period of time in step (d), waiting another predetermined period of time for any address request or address denial message;

f. if any address request or address denial message is received before expiration of the another predetermined period of time, then repeating step (e), and

g. if no address request or address denial message is received before expiration of the another predetermined period of time in step (e), then writing unique addresses associated with all nodes in the address table of each node.

4. The method according to claim 2, wherein each node coordinates radio communications between plural repeaters which communicates between plural RF transceivers located in different geographical regions.