An apparatus and a method for routing data in a radio data communication system having one or more host computers, one or more intermediate base stations, and one or more RF terminals organizes the intermediate base stations into an optimal spanning-tree network to control the routing of data to and from the RF terminals and the host computer efficiently and dynamically. Communication between the host computer and the RF terminals is achieved by using the network of intermediate base stations to transmit the data.

Radio frequency local area network

A packet data transmission system is used to link a number of remote hand-held data-gathering units such as bar code readers to a central computer which maintains a database management system. Data packets are sent from the remote units by an RF link to intermediate base stations, then sent by the base stations to the central computer by a serial link. Direct sequence spread spectrum modulation is used for the RF link. The remote hand-held units initiate an exchange using RF transmission to and from the base stations, receiving only during a rigid time window following a transmission from the remote unit. The base stations cannot initiate communication to the remote units, but instead send data to the remote units only as part of the exchange.

Packet data communication system

Improved apparatus for a radio communication system having a multiplicity of mobile transceiver units selectively in communication with a plurality of base transceiver units which, in turn, communicate with one or more host computers for storage and manipulation of data collected by bar code scanners or other collection means associated with the mobile transceiver units. A network controller and an adapter which has a simulcast and sequential mode provide selective interface between host computers and base transceivers. A scheme for routing data through the communication system is also disclosed wherein the intermediate base stations are organized into an optimal spanning-tree network to control the routing of data to and from the RF terminals and the host computer efficiently and dynamically. Additionally, redundant network and communication protocol is disclosed wherein the network utilizes a polling communication protocol which, under heavy loaded conditions, requires that a roaming terminal wishing to initiate communication must first determine that the channel is truly clear by listing for an entire interpoll gap time. In a further embodiment, a criterion used by the roaming terminals for attaching to a given base station reduces conflicts in the overlapping RF regions of adjacent base stations.

Network supporting roaming, sleeping terminals

Packet data communication network

A data communication apparatus wherein the stealthiness has been enhanced by significantly increasing the time required for a wiretapper to decrypt an encrypted text. The data communication apparatus is constituted by connecting a data transmitting apparatus and a data receiving apparatus via a transmission path. The data transmitting apparatus receives a first predetermined initial value (key information) and information data, generates a multi-valued signal the level of which varies substantially like a random number, and converts the multi-valued signal to a modulated signal of a predetermined modulation format for transmission. The data receiving apparatus demodulates the modulated signal to output the multi-valued signal, and then reproduces the information data from the multi-valued signal and a second predetermined initial value (key information) that is received.

Data communication apparatus

This disclosure relates to a station for a data transmission network which is adapted to operate in a cyclic mode for contending for access to the network channel along with other stations of the network. The three states of the cycle are the idle state, the packet-being-transmitted state and the acknowlegement period state. Each station will not begin transmission until it determines that the channel is in an idle state. Once the station has determined that the channel is idle, it will then delay for a period of time that is randomly chosen and, if the channel is still idle, will then begin transmission. In this way, contention conflicts between stations is minimized without unduly restricting communication between stations. Following transmission, the channel will again be quiescent a short period of time before the acknowledgement signal is transmitted from the receiver. Each packet of data to be transmitted is of a fixed length so as to provide for synchronization between various stations contending for access to the channel.

Gary W. Hodgman

Papers

A local area contention network data communication system