Method for transmitting data in multiple access data communications networks

• US 4,907,224 A
• Filed: 10/17/1986
• Issued: 03/06/1990
• Est. Priority Date: 10/17/1986
• Status: Expired due to Fees

• Current Assignee: Aria Wireless Systems, Inc.
• Original Assignee: Bydatel Corporation
• Inventors: Stornelli, Gary A., White, Cheryl L., Bernasek, Jay W., Jobmann, Cherice, Wall, Robert L., Schneider, John J. Jr., Botts, Byron J., Scoles, Bruce D.
• Primary Examiner(s): Orsino, Joseph A.
• Assistant Examiner(s): NOT, DEFINED
• Application Number:
  US06/920,013
• Time in Patent Office: 1,236 Days
• Field of Search: 370/85, 370/89, 370/94, 340/825.5, 340/825.51, 340/825.52
• US Class Current: 370/443
• CPC Class Codes: H04W 28/26 Resource reservation
• CPC Class Codes: H04W 4/06 Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
• CPC Class Codes: H04W 74/08 Non-scheduled access, e.g. ALOHA hybrid access H04W74/02
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support

Abstract

A method for transmitting data in packet switching networks provides a Collision-Eliminating Multiple Access protocol in which nodes desiring to transmit over the network channel transmit reservation requests during a plurality of contention slots, the number of contention slots being dynamically controlled according to network load. A node designated to next obtain control of the channel receives the identifiers of nodes transmitting reservation requests and, prior to transmitting application data, transmits network control data consisting of the identifiers of nodes from whom successful reservation requests were successfully received. The transmitted identifiers are received and stored by each node in an identical queue, whereby subsequent control of the channel is rotated based on the order of node identifiers appearing in an identical queue on each node. The transmitted network control data includes reservation requests received during a previous contention slot period, queue correction information, and the identifiers of nodes from which the controlling node expects to receive data.

Claims

1. A method for transmitting application data between a plurality of communication nodes each having a unique identifier, said nodes being interconnected via a communications channel to form a network such that transmission from any of the nodes is supplied simultaneously to others of the nodes, the method comprising:

designating a first node as a control node defined as a node having control of said channel;

transmitting reservation requests during a contention period, reservation requests each comprising a signal from a node desiring to transmit over said channel, said contention period comprising a predetermined time period during which simultaneous transmissions from a plurality of nodes are permitted to occur on the network;

transmitting network control data, which specifies a second node to subsequently become the control node and derived from said reservation requests, from said first node;

transmitting application data from said control node; and

designating said second node as the control node.

2. A method as recited in claim 1 wherein said step of transmitting network control data from said first node includes the step of transmitting a signal identifying the node specified to next obtain control of said channel.

6. A method as recited in claim 1 wherein said step of transmitting network control data from said first node includes transmitting reservation confirmations consisting of the identifiers of nodes from which reservation requests have been successfully received by said first node during said predetermined time period.

8. A method as recited in claim 1 wherein the step of transmitting network control data from said first node includes the step of transmitting the position for storage, within said queues of all of said nodes, of said identifiers of nodes from which reservations requests have been successfully received.

13. A method as recited in claim 1 comprising the step of transmitting network control data and application data from a second node specified to subsequently obtain control including the substeps of:

monitoring said channel by said first node to determine if network control information has been transmitted by said second node; and

if no network control data has been transmitted by said second node, retransmitting network control data from said first node to specify said second node to next assume control of said channel.

14. A method as recited in claim 13 comprising the additional step of transmitting network control data specifying a node other than said second node to next assume control of said channel if no network control data is transmitted from said second node after said retransmission.

18. A method as recited in claim 1 wherein said step of designating a first node as a control node includes the steps of:

monitoring said channel by all nodes;

transmitting, on a random delay basis, data from all nodes to another of said nodes;

transmitting, from a node successfully receiving one of said randomly delayed transmissions, response data to the one of said nodes from which a randomly delayed transmission was received;

designating as said first node said one of said nodes from which a randomly delayed transmission was received; and

transmitting network control data from said first node.

3. A method for transmitting application data between a plurality of communication nodes each having a unique identifier, said nodes being interconnected via a communications channel to form a network, the method comprising:

designating a first node as a control node defined as a node having control of said channel;

transmitting reservation requests during a predetermined time period from nodes desiring to transmit over said channel;

transmitting network control data, specifying a second node to subsequently become the control node and derived from said reservation requests, from said first node;

transmitting application data from said control node;

designating said second node as the control node; and

storing in all nodes a data structure determining the order in which nodes will obtain control of said channel;

wherein said step of transmitting network control data from said first node includes the step of transmitting a signal identifying the node specified to next obtain control of said channel.

4. A method as recited in claim 3 wherein said step of transmitting a signal includes the step of transmitting an identifier associated with the node specified to next obtain control of said channel, and said step of storing in all nodes a data structure determining the order in which nodes will obtain control of said channel includes the step of storing in all nodes a queue of identifiers arranged in the order in which nodes associated with said queued identifiers will obtain control of said channel.

5. A method as recited in claim 4 wherein said queue comprises a migrating window.

12. A method as recited in claim 3 further comprising the steps of:

transmitting reservation confirmations consisting of the identifiers of nodes from which reservation requests have been successfully received by said first node; and

transmitting reservation confirmations consisting of the identifiers of nodes from which reservation requests had previously been successfully received by said first node.

15. A method as recited in claim 4 wherein said step of transmitting a signal identifying the node specified to next obtain control of said channel includes the substep of transmitting the next entry in said queue of said first node as the node specified to next obtain control of said channel.

16. A method as recited in claim 15 wherein, if the next entry in said queue of said first node is not a valid node identifier, said substep of transmitting the identifier of the node specified to next obtain control of said channel includes the substep of transmitting a null character as the identifier of the node specified to next obtain control of said channel.

17. A method as recited in claim 16 wherein, if said first node transmits a null characters as the identifier of the node specified to next obtain control of said channel, the method further comprises the steps of:

examining the respective queues by each of said nodes to determine the identifier present as the first entry of said respective queues; and

assuming control of said channel by the node whose identifier is the first entry in said queue.

7. A method for transmitting application data between a plurality of communication nodes each having a unique identifier, said nodes being interconnected via a communications channel to form a network, the method comprising:

designating a first node as a control node defined as a node having control of said channel;

transmitting reservation requests during a predetermined time period from nodes desiring to transmit over said channel;

transmitting network control data from said first node, said network control data being derived from said reservation requests, and said network control data including reservation confirmations consisting of the identifiers of nodes from which reservation requests have been successfully received by said first node during said predetermined time period, and an identifier associated with a second node specified to next obtain control of the channel;

transmitting application data from said control node;

designating said second node as the control node; and

storing said reservation confirmations in queues of all of said nodes, said queues being arranged in the order in which nodes associated with aid queued identifiers will obtain control of said channel, thereby determining the order in which nodes will obtain control of said channel.

9. A method as recited in claim 7 further comprising the steps of:

determining whether said queue of said first node contains the identifier of a node from which a reservation request has been successfully received; and

transmitting at least one node identifier by said first node from said first node queue if said first node queue contains the identifier of a node from which a reservation request has been successfully received.

10. A method as recited in claim 7 further comprising the step of:

determining the identifier of an auto-queue node comprising a node which will require access to said channel; and

wherein said step of transmitting network control data from said first node to specify a second node to subsequently become the control node includes transmitting reservation confirmations consisting of the identifiers of auto-queue nodes.

11. A method as recited in claim 7 further comprising the steps of:

determining whether a node desires to transmit over said channel;

determining, if said node desires to transmit over said channel, whether the identifier of said node is in said queue of said node; and

transmitting a reservation request only if the identifier of said node is not in said queue of said node.

19. A method for transmitting data between a plurality of communication nodes each having an identifier and interconnected via a communications channel, the method comprising:

initiating reservation request transmissions during one of a plurality of contention time periods after the completion of data transmission from a first node, the reservation request transmissions being initiated by each node desiring to generate a data transmission over the channel;

maintaining in each of the nodes a pending transmission queue specifying the order of transmission of nodes desiring to generate a data transmission over the channel;

monitoring the channel, by the node specified by the pending transmission queue to next generate a data transmission over the channel, to receive the reservation request transmissions;

transmitting network control data containing reservation confirmations consisting of the identifiers of nodes from which reservation request transmissions were received;

storing the transmitted identifiers in the pending transmission queue of each node; and

transmitting data from the node specified by the pending transmission queue to next generate a data transmission over the channel.

20. A method for transmitting application data between a plurality of communication nodes, the nodes being interconnected via at least one communication channel to form a network, wherein a transmission from one of the nodes is supplied simultaneously to others of the nodes, the method comprising:

designating one of the nodes as a control node defined as a node having control of said channel;

transmitting reservation requests from a plurality of the nodes during a first period, the reservation requests each comprising a signal identifying a node desiring to transmit application data over the network, and the first period comprising a predetermined period of time during which simultaneous transmissions from a plurality of the nodes are permitted to occur on the network;

receiving the reservation requests in the control node;

deriving network control information from reservation requests received in the control node, the network control information including information specifying the order in which nodes will become the control node; and

transmitting the network control data from the control data over the network a second period in which simultaneous transmissions on the network from a plurality of the nodes are not permitted.