Two tier adaptive random access protocol

Claim 2

A receiver comprising: receiving means for receiving a downstream data frame having range parameters R0 and R1 and a minislot parameter MAP, wherein the minislot parameter MAP defines new message minislots MS0 and old message minislots MS1 for a subsequent upstream data frame; transmission parameter generating means for generating a transmission parameter N1 within a range defined by the range parameter R1 and for generating a transmission parameter N0 within a range defined by the range parameter R0, wherein the transmission parameter generating means generates the transmission parameter N1 when the receiver has an old message reservation request to re-transmit, and wherein the transmission parameter generating means generates the transmission parameter N0 when the receiver has a new message reservation request to transmit; and, transmitting means for transmitting the old message reservation request in a minislot of an upstream data frame if the transmission parameter N1 corresponds to one of the old message minislots MS1, and for transmitting the new message reservation request in a minislot of an upstream data frame if the transmission parameter N0 corresponds to one of the new message minislots MS0.

Claim 3

The receiver of claim 1 wherein the subsequent upstream data frame has S slots, wherein the S slots include MS minislots and/or DS data slots, wherein MS may vary from MS min to MS max , wherein MS=MS0+MS1, wherein DS may vary from DS min to DS max , wherein MS max =S, and wherein DS min =0.

Claim 4

The receiver of claim 2 wherein DS max =S, and wherein MS min =0.

Claim 5

The receiver of claim 2 wherein MS min =S-DS max ≠0.

Claim 6

The receiver of claim 1 wherein the subsequent upstream data frame has S slots, wherein the S slots include MS minislots and/or DS data slots, wherein MS may vary from MS min to MS max , wherein MS=MS0+MS1, wherein DS may vary from DS min to DS max , wherein DS max =S, and wherein MS min =0.

Claim 7

The receiver of claim 1 wherein the subsequent upstream data frame has S slots, wherein the S slots include MS minislots and/or DS data slots, wherein MS may vary from MS min to MS max , wherein MS=MS0 +MS1, wherein DS may vary from DS min to DS max , and wherein MS min =S-DS max ≠0.

Claim 8

The receiver of claim 1 wherein the transmission parameters N1 and N0 are a random numbers.

Claim 11

The method of claim 8 wherein the upstream data frame has S slots, wherein the S slots include MS minislots and/or DS data slots, wherein MS may vary from MS min to MS max , wherein MS=MS0+MS1, wherein DS may vary from DS min to DS max , wherein MS max =S, and wherein DS min =0.

Claim 12

The method of claim 9 wherein DS max =S, and wherein MS min =0.

Claim 13

The method of claim 9 wherein MS min =S-DS max ≠0.

Claim 14

The method of claim 8 wherein the upstream data frame has S slots, wherein the S slots include MS minislots and/or DS data slots, wherein MS may vary from MS min to MS max , wherein MS=MS0+MS1, wherein DS may vary from DS min to DS max , wherein DS max =S, and wherein MS min =0.

Claim 15

The method of claim 8 wherein the upstream data frame has S slots, wherein the S slots include MS minislots and/or DS data slots, wherein MS may vary from MS min to MS max , wherein MS=MS0+MS1, wherein DS may vary from DS min to DS max , and wherein MS min =S-DS max ≠0.

Claim 16

The method of claim 8 wherein step b) comprises the step of generating the transmission parameter N1 as a random number, and wherein step c) comprises the step of generating the transmission parameter N0 as a random number.

Claim 17

The method of claim 8 wherein step d) comprises the step of re-transmitting the previously transmitted reservation request in a minislot corresponding to the transmission parameter N1, and wherein step e) comprises the step of transmitting the new reservation request in a minislot corresponding to the transmission parameter N0.

Claim 18

The method of claim 15 wherein step b) comprises the step of generating the transmission parameter N1 as a random number, and wherein step c) comprises the step of generating the transmission parameter N0 as a random number.

Claim 19

A communication system having a plurality of stations which communicate data in a data frame having a plurality of slots, wherein the plurality of slots include data slots RDS(n+1) and/or minislots MS(n+1), and wherein the communication system comprises: range parameter determining means at a first station for determining a new message range parameter R0(n+1) and an old message range parameter R1(n+1); minislot parameter determining means at the first station for determining a minislot parameter MAP defining new message minislots MS0(n+1) and an old message minislots MS1(n+1); first station transmitting means at the first station for transmitting the new message range parameter R0(n+1), the old message range parameter R1(n+1), and the minislot parameter MAP to a second station; transmission parameter determining means at the second station for determining a new message transmission parameter N0 within a range corresponding to the new message range parameter R0(n+1), and for determining an old message transmission parameter N1 within a range corresponding to the old message range parameter R1(n+1); and, second station transmitting means at the second station for transmitting a new reservation request to the first station if the new message transmission parameter N0 corresponds to one of the new message minislots MS0(n+1), and for transmitting a previously transmitted reservation request to the first station if the old message transmission parameter N1 corresponds to one of the old message minislots MS1(n+1).

Claim 20

A communication system having a plurality of stations which communicate data in a data frame having a plurality of slots, wherein the plurality of slots include data slots RDS(n+1) and/or minislots MS(n+1), and wherein the communication system comprises: range parameter determining means at a first station for determining a new message range parameter R0(n+1) and an old message range parameter R1(n+1); minislot parameter determining means at the first station for determining a minislot parameter MAP defining new message minislots MS0(n+1) and an old message minislots MS1(n+1); first station transmitting means at the first station for transmitting the new message range parameter R0(n+1), the old message range parameter R1(n+1), and the minislot parameter MAP to a second station; transmission parameter determining means at the second station for determining a new message transmission parameter N0 within a range corresponding to the new message range parameter R0(n+1), and for determining an old message transmission parameter N1 within a range corresponding to the old message range parameter R1(n+1); and, second station transmitting means at the second station for transmitting a new reservation request to the first station if the new message transmission parameter N0 corresponds to one of the new message minislots MS0(n+1), and for transmitting a previously transmitted reservation request to the first station if the old message transmission parameter N1 corresponds to one of the old message minislots MS1(n+1).

Claim 21

The communication system of claim 17 wherein the minislot parameter determining means determines minislots MS(n+1) as follows: if RDS(n)<DQ(n)<αRDS(n), determine minislots MS(n+1) based upon the following equation: ##EQU5## if DQ(n)<RDS(n), determine minislots MS(n+1) based upon the following equation: MS(n+1)=m(S-DQ(n)); and, if DQ(n)>αRDS(n), determine minislots MS(n+1) based upon the following equation: ##EQU6## wherein RDS(n) is a number of minislots in a previous upstream data frame n, DO(n) corresponds to reservation activity at discrete time n, S is a total number of slots in a data frame, m is a number of minislots into which a slot may be subdivided, e is 2.718281828 . . . , MS(n+1) is a number of minislots for an upstream data frame n+1, MS(n+1)=MS0(n+1)+MS1(n+1), k is an average number of data slots reserved by reservation requests, α is a constant, and M is the steady state number of minislots.

Claim 22

The communication system of claim 17 wherein the range parameter determining means determines the old message range parameter R1(n+1) for discrete time n+1 according to the following equation: ##EQU7## where n indicates an upstream data frame just received, n+1 indicates a next upstream data frame, R1(n+1) is the old message range parameter for the next upstream data frame n+1, R1(n) is an old message range parameter for the upstream data frame n just received, N represents a total number of stations in the communication system, MS1(n) is a number of old message minislots in the upstream data frame n just received, Col0(n) is a number of collided new message minislots MS0(n) in the upstream data frame n just received, Col1(n) is a number of collided old message minislots MS1(n) in the upstream data frame n just received, and e is 2.718281828 . . . .

Claim 23

The communication system of claim 19 wherein the minislot parameter determining means determines minislots MS(n+1) as follows: if RDS(n)<DQ(n)<αRDS(n), determine minislots MS(n+1) based upon the following equation: ##EQU8## if DQ(n)<RDS(n), determine minislots MS(n+1) based upon the following equation: MS(n+1)=m(S-DQ(n)); and, if DQ(n)>αRDS(n), determine minislots MS(n+1) based upon the following equation: ##EQU9## wherein RDS(n) is a number of minislots in a previous upstream data frame n, DO(n) corresponds to reservation activity at discrete time n, S is a total number of slots in a data frame, m is a number of minislots into which a slot may be subdivided, e is 2.718281828 . . . , MS(n+1) is a number of minislots for an upstream data frame n+1, MS(n+1)=MS0(n+1)+MS1(n+1), k is an average number of data slots reserved by reservation requests, α is a constant, and M is the steady state number of minislots.

Claim 24

The communication system of claim 20 wherein the minislot parameter determining means determines the new message minislots MS0(n+1) and the old message minislots MS1(n+1) as follows: if R1(n+1)<MS(n+1), determine the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon the following equations: MS1(n+1)=R1(n+1) MS0(n+1)=MS(n+1)-MS1(n+1) if R1(n+1)≮MS(n+1), determine the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon the following equations: MS1(n+1)=MS(n+1) MS0(n+1)=0.

Claim 25

The communication system of claim 21 wherein the range parameter determining means determines the new message range parameter R0(n+1) for discrete time n+1 according to the following equation: ##EQU10## wherein MS0(n) is a number of old message minislots in the upstream data frame n just received.

Claim 26

The communication system of claim 17 wherein the range parameter determining means determines the old message range parameter R1(n+1) based upon an old message range parameter R1(n) for an upstream data frame n just received, based upon a total number of stations, based upon a number of old message minislots MS1(n) in the upstream data frame n just received, based upon a number of collided new message minislots MS0(n) in the upstream data frame n just received, and based upon a number of collided old message minislots MS1(n) in the upstream data frame n just received.

Claim 27

The communication system of claim 23 wherein the minislot parameter determining means determines minislots MS(n+1) based upon reservation request activity.

Claim 28

The communication system of claim 24 wherein the minislot parameter determining means determines the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon R1(n+1) and MS(n+1).

Claim 29

The communication system of claim 25 wherein the range parameter determining means determines the new message range parameter R0(n+1) based upon a new message range parameter R0(n) for an upstream data frame n just received, based upon the total number of stations, based upon a number of new message minislots MS0(n) in the upstream data frame n just received, based upon MS0(n+1), and based upon a number of collided new message minislots MS0(n) in the upstream data frame n just received.

Claim 30

The communication system of claim 24 wherein the minislot parameter determining means determines the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon MS(n+1).

Claim 31

The communication system of claim 27 wherein the range parameter determining means determines the new message range parameter R0(n+1) based upon a new message range parameter R0(n) for an upstream data frame n just received, based upon the total number of stations, based upon a number of new message minislots MS0(n) in the upstream data frame n just received, based upon MS0(n+1), and based upon a number of collided new message minislots MS0(n) in the upstream data frame n just received.

Claim 32

The communication system of claim 17 wherein the range parameter determining means determines the old message range parameter R1(n+1) based upon a number of collided minislots in the upstream data frame n just received.

Claim 33

The communication system of claim 29 wherein the minislot parameter determining means determines minislots MS(n+1) based upon reservation request activity.

Claim 34

The communication system of claim 30 wherein the minislot parameter determining means determines the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon R1(n+1) and MS(n+1).

Claim 35

The communication system of claim 31 wherein the range parameter determining means determines the new message range parameter R0(n+1) based upon a number of collided minislots in the upstream data frame n just received.

Claim 36

The communication system of claim 30 wherein the minislot parameter determining means determines the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon MS(n+1).

Claim 37

The communication system of claim 33 wherein the range parameter determining means determines the new message range parameter R0(n+1) based upon a number of collided minislots in the upstream data frame n just received.

Claim 38

A transmitter comprising: upstream data frame receiving means for receiving an upstream data frame n at discrete time n; range parameter determining means for determining a new message range parameter R0(n+1) and an old message range parameter R1(n+1); minislot parameter determining means for determining a minislot parameter MAP defining new message minislots MS0(n+1) and an old message minislots MS1(n+1), wherein the minislot parameter MAP at least partially defines an upstream data frame n+1 at discrete time n+1; and, transmitting means for transmitting the new message range parameter R0(n+1), the old message range parameter R1(n+1), and the minislot parameter MAP.

Claim 39

A transmitter comprising: upstream data frame receiving means for receiving an upstream data frame n at discrete time n; range parameter determining means for determining a new message range parameter R0(n+1) and an old message range parameter R1(n+1); minislot parameter determining means for determining a minislot parameter MAP defining new message minislots MS0(n+1) and an old message minislots MS1(n+1), wherein the minislot parameter MAP at least partially defines an upstream data frame n+1 at discrete time n+1; and, transmitting means for transmitting the new message range parameter R0(n+1), the old message range parameter R1(n+1), and the minislot parameter MAP.

Claim 40

The transmitter of claim 35 wherein the minislot parameter determining means determines minislots MS(n+1) as follows: if RDS(n)<DQ(n)<αRDS(n), determine minislots MS(n+1) based upon the following equation: ##EQU11## if DQ(n)<RDS(n), determine minislots MS(n+1) based upon the following equation: MS(n+1)=m(S-DQ(n)); and, if DQ(n)>αRDS(n), determine minislots Ms(n+1) based upon the following equation: ##EQU12## wherein RDS(n) is a number of minislots in a previous upstream data frame n, DO(n) corresponds to reservation activity at discrete time n, S is a total number of slots in a data frame, m is a number of minislots into which a slot may be subdivided, e is 2.718281828 . . . , MS(n+1) is a number of minislots for an upstream data frame n+1, MS(n+1)=MS0(n+1)+MS1(n+1), k is an average number of data slots reserved by reservation requests, α is a constant, and M is the steady state number of minislots.

Claim 41

The transmitter of claim 35 wherein the range parameter determining means determines the old message range parameter R1(n+1) for discrete time n+1 according to the following equation: ##EQU13## where n indicates an upstream data frame just received, n+1 indicates a next upstream data frame, R1(n+1) is the old message range parameter for the next upstream data frame n+1, R1(n) is an old message range parameter for the upstream data frame n just received, N represents a total number of stations in a network, MS1(n) is a number of old message minislots in the upstream data frame n just received, Col0(n) is a number of collided new message minislots MS0(n) in the upstream data frame n just received, Col1(n) is a number of collided old message minislots MS1(n) in the upstream data frame n just received, and e is 2.718281828 . . . .

Claim 42

The transmitter of claim 37 wherein the minislot parameter determining means determines minislots MS(n+1) as follows: if RDS(n)<DQ(n)<αRDS(n), determine minislots MS(n+1) based upon the following equation: ##EQU14## if DQ(n)<RDS(n), determine minislots MS(n+1) based upon the following equation: MS(n+1)=m(S-DQ(n)); and, if DQ(n)>αRDS(n), determine minislots MS(n+1) based upon the following equation: ##EQU15## wherein RDS(n) is a number of minislots in a previous upstream data frame n, DO(n) corresponds to reservation activity at discrete time n, S is a total number of slots in a data frame, m is a number of minislots into which a slot may be subdivided, e is 2.718281828 . . . , MS(n+1) is a number of minislots for an upstream data frame n+1, MS(n+1)=MS0(n+1)+MS1(n+1), k is an average number of data slots reserved by reservation requests, α is a constant, and M is the steady state number of minislots.

Claim 43

The transmitter of claim 38 wherein the minislot parameter determining means determines the new message minislots MS0(n+1) and the old message minislots MS1(n+1) as follows: if R1(n+1)<MS(n+1), determine the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon the following equations: MS1(n+1)=R1(n+1) MS0(n+1)=MS(n+1)-MS1(n+1); if R1(n+1)≮MS(n+1), determine the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon the following equations: MS1(n+1)=MS(n+1) MS0(n+1)=0. 40.

Claim 44

The transmitter of claim 39 wherein the range parameter determining means determines the new message range parameter R0(n+1) for discrete time n+1 according to the following equation: ##EQU16## wherein MS0(n) is a number of old message minislots in the upstream data frame n just received.

Claim 45

The transmitter of claim 35 wherein the range parameter determining means determines the old message range parameter R1(n+1) based upon an old message range parameter R1(n) for an upstream data frame n just received, based upon a total number of stations in a network, based upon a number of old message minislots MS1(n) in the upstream data frame n just received, based upon a number of collided new message minislots MS0(n) in the upstream data frame n just received, and based upon a number of collided old message minislots MS1(n) in the upstream data frame n just received.

Claim 46

The transmitter of claim 41 wherein the minislot parameter determining means determines minislots MS(n+1) based upon reservation request activity.

Claim 47

The transmitter of claim 42 wherein the minislot parameter determining means determines the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon R1(n+1) and MS(n+1).

Claim 48

The transmitter of claim 43 wherein the range parameter determining means determines the new message range parameter R0(n+1) based upon a new message range parameter R0(n) for an upstream data frame n just received, based upon the total number of stations in a network, based upon a number of new message minislots MS0(n) in the upstream data frame n just received, based upon MS0(n+1), and based upon a number of collided new message minislots MS0(n) in the upstream data frame n just received.

Claim 49

The transmitter of claim 42 wherein the minislot parameter determining means determines the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon MS(n+1).

Claim 50

The transmitter of claim 45 wherein the range parameter determining means determines the new message range parameter R0(n+1) based upon a new message range parameter R0(n) for an upstream data frame n just received, based upon the total number of stations in a network, based upon a number of new message minislots MS0(n) in the upstream data frame n just received, based upon MS0(n+1), and based upon a number of collided new message minislots MS0(n) in the upstream data frame n just received.

Claim 51

The transmitter of claim 35 wherein the range parameter determining means determines the old message range parameter R1(n+1) based upon a number of collided minislots in the upstream data frame n just received.

Claim 52

The transmitter of claim 47 wherein the minislot parameter determining means determines minislots MS(n+1) based upon reservation request activity.

Claim 53

The transmitter of claim 48 wherein the minislot parameter determining means determines the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon R1(n+1) and MS(n+1).

Claim 54

The transmitter of claim 49 wherein the range parameter determining means determines the new message range parameter R0(n+1) based upon a number of collided minislots in the upstream data frame n just received.

Claim 55

The transmitter of claim 48 wherein the minislot parameter determining means determines the new message minislots MS0(n+1) and the old message minislots MS1(n+1) based upon MS(n+1).

Claim 56

The transmitter of claim 51 wherein the range parameter determining means determines the new message range parameter R0(n+1) based upon a number of collided minislots in the upstream data frame n just received.