On-line distributed TDMA/FDMA/CDMA link assignment in mobile radio networks with flexible directivity

Claim 3

The method of claim 1, wherein member time slots t k of the set T are each ordered by a different assigned order number k, and said first choosing step includes choosing said time-slot t k with k being a least order number assigned to a currently available time slot.

Claim 4

The method of claim 1, wherein member frequency-code values (f, c) 1 of the set FC are each ordered by a different assigned order number 1, and said second choosing step includes choosing said frequency-code value (f, c) 1 with 1 being a least order number assigned to a currently available frequency-code value.

Claim 5

The method of claim 1, including implementing a distributed link assignment of said time slots and said frequency-code values, by providing such network management information that when node i is to be linked with node j, the nodes i, j can establish the link (i-j) by determining existing time slot and frequency-code value assignments to nodes neighboring node i and node j, assigning an available time slot t k , and an available frequency-code value (f, c) 1 to the link (i-j), and informing nodes neighboring node i and node j of the time slot t k and the frequency-code value (f, c) 1 assigned to the link (i-j).

Claim 6

The method of claim 1, including incorporating in the communications network nodes that are mobile relative to other nodes in the network.

Claim 7

The method of claim 1, including determining aggregate bandwidth requirements of each of the linked nodes i, j for transmitting information to one another, and dividing the time-slot t k assigned to the link (i-j) according to said aggregate bandwidth requirements.

Claim 8

The method of claim 6, including allocating a portion of said assigned time-slot t k for a first uni-directional link (i←j) in a first direction, and allocating a remaining portion of the time-slot t k for a second uni-directional link (i→j) in a second direction opposite said first direction.

Claim 9

The method of claim 7, wherein said allocating step is carried out by enabling each of the nodes i, j to notify the other of its aggregate transmission bandwidth requirement, and defining a time slot splitting ratio {Ti i →j : T i ←j }for the first and the second uni-directional links to be equal to {1/2+(λ.sub.i -λ.sub.j)/2C}: {1/2-(λ.sub.i -λ.sub.j)/2C} wherein the total capacity of bi-directional link (i-j) is C; the aggregate transmission bandwidth needs of nodes i and j are λ i for unidirectional link i→j, and λ j for unidirectional link i←j; C≧λ i +λ j ; and λ i ≧λ j .

Claim 10

The method of claim 1, comprising: allocating a portion of an assigned time-slot t k for a first uni-directional link (i→j) in a first direction, and allocating a remaining portion of the time-slot t k for a second uni-directional link (i←j) in a second direction opposite said first direction; said allocating steps being carried out by enabling each of the nodes i, j to notify the other of its aggregate transmission bandwidth requirement, and defining a time slot splitting ratio {T i →j : T i ←j } for the first and the second uni-directional links to be equal to {1/2+(λ.sub.i -λ.sub.j)/2C}: {1/2-(λ.sub.i -λ.sub.j)/2C} wherein the total capacity of bi-directional link (i-j) is C; the aggregate transmission bandwidth needs of nodes i and j are λ i for unidirectional link i→j, and λ j for unidirectional link i←j; C≧λ i +λ j ; and λ i ≧λ j .

Claim 11

A node structure for each of a number of nodes in a communications network, wherein said structure enables transmission parameters including time slots and frequency-code values to be assigned to a link (i-j) between a pair of nodes i, j to be linked, and avoids potential conflicts and interference with other nodes that neighbor the nodes i, j; said node structure comprising: transmitter means for transmitting information to other nodes including nodes with which a link is desired; receiver means for receiving information from said other nodes; and controller means coupled to said transmitter means and to said receiver means for (a) acquiring through said receiver means information corresponding to existing time slot and frequency-code value assignments at each neighboring node, (b) first choosing from a set T an available time slot t k which is not in use for links established between node i and nodes neighboring node i, or for links established between node j and nodes neighboring node j; (c) second choosing from a set FC an available frequency-code value (f, c) 1 which is not, during the chosen available time slot t k , in use by a node that neighbors node i, or by a node that neighbors node j; (d) returning, if no frequency-code value (f, c) 1 is available during the chosen time slot t k , to said first choosing step after removing t k from the set T of available time slots; and (e) assigning a chosen time slot t k , and a chosen frequency-code value (f, c) 1 for a link (i-j) between the nodes i, j; wherein k denotes a currently chosen time-slot; l denotes a currently chosen frequency-code value; T is a defined set of time slots (t) during which links in the network can be activated, and FC is a defined set of frequency-code values (f, c) each of which specifies a frequency or a frequency-code pair for association with the links in the network.

Claim 12

A node structure for each of a number of nodes in a communications network, wherein said structure enables transmission parameters including time slots and frequency-code values to be assigned to a link (i-j) between a pair of nodes i, j to be linked, and avoids potential conflicts and interference with other nodes that neighbor the nodes i, j; said node structure comprising: transmitter means for transmitting information to other nodes including nodes with which a link is desired; receiver means for receiving information from said other nodes; and controller means coupled to said transmitter means and to said receiver means for (a) acquiring through said receiver means information corresponding to existing time slot and frequency-code value assignments at each neighboring node, (b) first choosing from a set T an available time slot t k which is not in use for links established between node i and nodes neighboring node i, or for links established between node j and nodes neighboring node j; (c) second choosing from a set FC an available frequency-code value (f, c) 1 which is not, during the chosen available time slot t k , in use by a node that neighbors node i, or by a node that neighbors node j; (d) returning, if no frequency-code value (f, c) 1 is available during the chosen time slot t k , to said first choosing step after removing t k from the set T of available time slots; and (e) assigning a chosen time slot t k , and a chosen frequency-code value (f, c) 1 for a link (i-j) between the nodes i, j; wherein k denotes a currently chosen time-slot; l denotes a currently chosen frequency-code value; T is a defined set of time slots (t) during which links in the network can be activated, and FC is a defined set of frequency-code values (f, c) each of which specifies a frequency or a frequency-code pair for association with the links in the network.

Claim 13

The node structure of claim 10, wherein the controller means of node i and node j include means for informing, through said transmitter means, nodes neighboring node i and node j, respectively, of the time slot t k and the frequency-code value (f, c) 1 assigned to the link (i-j).

Claim 14

The node structure of claim 10, including means for allowing nodes of the communications network to be mobile relative to other nodes within the network.

Claim 15

The node structure of claim 10, wherein said controller means includes means for determining aggregate bandwidth requirements needed for each of the linked nodes i, j to transmit information to one another, and means for dividing the time-slot t k assigned to the link (i-j) according to said aggregate bandwidth requirements.

Claim 16

The node structure of claim 13, wherein said controller means includes means for allocating a portion of said assigned time-slot t k for a first uni-directional link (i→j) in a first direction, and for allocating a remaining portion of the time-slot t k for a second uni-directional link (i←j) in a second direction opposite said first direction.

Claim 17

The node structure of claim 14, wherein said allocating means includes means for enabling each of the nodes i, j to notify the other of its aggregate transmission bandwidth requirement, and for defining a time slot splitting ratio {T i →j : T i ←j } for the first and the second uni-directional links to be equal to {1/2+(λ i -λ j )/2C}: {1/2-(λ i -λ j )/2C} wherein the total capacity of bi-directional link (i-j) is C; the aggregate transmission bandwidth needs of nodes i and j are λ i for unidirectional link i→j, and λ j for unidirectional link i→j; C≧λ i +λ j ; and λ i ≧λ j .

Claim 20

The method of claim 16, wherein the step of notifying the nodes i, j of their transmission bandwidth requirements is carried out by exchanging corresponding information between the nodes i, j.