Distributed wireless call processing system

• US 6,055,429 A
• Filed: 10/07/1996
• Issued: 04/25/2000
• Est. Priority Date: 10/07/1996
• Status: Expired due to Fees

• Current Assignee: World Wide Wireless Communications, Inc. (Air Water International Corp.)
• Original Assignee: World Wide Wireless Communications, Inc. (Air Water International Corp.)
• Inventors: Lynch, Michael R.
• Primary Examiner(s): PATEL, ASHOK
• Assistant Examiner(s): PATEL, ASHOK
• Application Number:
  US08/726,662
• Time in Patent Office: 1,296 Days
• Field of Search: 370/235, 370/237, 370/320, 370/331, 370/913, 370/229, 370/230, 370/236, 370/238, 370/332, 370/351, 370/346, 455/445, 455/456, 455/466, 455/550, 455/11.1, 455/518, 455/561, 455/507
• US Class Current: 455/445
• CPC Class Codes: H04W 88/02 Terminal devices

Abstract

A distributed wireless call processing system includes a plurality of mobile transceiver units each having the capability to simultaneous receive, reprocess and retransmit a plurality of calls to form a plurality of call paths within the network formed by the units. Within each mobile transceiver unit, a multilevel audit buffer is maintained which is used to store identification and power level data in accordance with a vector ring diagram. The first level of each mobile transceiver unit stores data relating to directly reachable transceiver units. Successive levels of each transceiver'"'"'s audit buffer store data which has been downloaded upon request from the audit buffers of other transceiver units. The multilevel audit buffering provides for establishment of call vectoring paths between a seeking transceiver unit and a desired transceiver unit.

Claims

1. A distributed wireless call processing system comprising:

a plurality of wireless communication transceivers each of said transceivers being operative as a virtual cell site and is able to relay calls between other transceivers within the system;

a plurality of audit buffers within said wireless transceivers;

means for auditing within each of said transceivers to store first level data within said audit buffers identifying directly communicatable transceivers; and

means for downloading said audit buffers between at least some of said transceivers,

said plurality of audit buffers each being organized to define a first level for said first level data of one of said transceivers and a second level for said downloaded audit buffers of said at least some of said transceivers and each of said transceivers using its second level buffer for locating transceivers not found in its first level buffer and wherein no base or central unit is required and each transceiver is able to communicate with other transceivers using direct call placement or relay call routing through said transceivers.

2. A distributed wireless call processing system as set forth in claim 1 wherein said transceivers each include means for minimizing the amount of transceiver data stored in its audit buffer.

3. A distributed wireless call processing system as set forth in claim 2 wherein said means for minimizing includes means for establishing a first power level within which other transceivers are defined in said first level and for establishing a second power level, greater than said first power level, within which other transceivers are defined in said second level.

4. A distributed wireless call processing system as set forth in claim 3 wherein alternative call paths between said transceivers are determined and a primary call path and alternate call paths are selected therefrom.

5. For use in a distributed plurality of wireless transceivers, a method of call processing comprising the steps of:

performing a first level audit within each of said wireless transceivers and storing first level data identifying other wireless transceivers with which direct communication is available;

defining a vector ring as a function of transceiver density within said first level;

selecting transceivers within said vector ring as centers of a second level search;

downloading said first level data from each of said selected transceivers and storing said downloaded data as second level data; and

culling redundant data from said second level data.

6. The method of claim 5 further including the step of minimizing the number of transceivers within said second level by redefining said vector ring.

7. The method of claim 6 further including the step of repeating said steps of defining, selecting, downloading and culling to establish successively lower order data levels.