Claims
- 1. A system comprising:a base station; and a plurality of terminals, wherein said base station generates a busy tone signal to control a probability of said plurality of terminals transmitting reservation packets, said probability including a value larger than 0 and less than 1, and wherein each of said plurality of terminals makes references to said busy tone signal to control transmission of a reservation packet, and wherein said busy tone signal is represented by P(t) which satisfies the following equation: R(t)′=R(t−1)/P(t−1), P(t)=(T−I(t))/R(t)′where R(t) denotes a number of reservation packets transmitted by said plurality of terminals in time slot t, R(t)′ denotes a number of transmission request reservation packets in time slot t, I(t) denotes a number of data packets generated in time slot (t), T denotes a number of simultaneously allowable packets, and P(t) denotes a transmission probability of reservation packets in a time slot t.
- 2. A base station which generates a busy tone signal which controls a probability of transmission of reservation packets from a plurality of terminals in accordance with a number of reservation packets received by a reservation channel and traffic channel utilization state information, said probability including a value larger than 0 and less than 1,wherein said busy tone signal is represented by P(t) which satisfies the following equation: R(t)′=R(t−1)/P(t−1), P(t)=(T−I(t))/R(t)′where R(t) denotes a number of reservation packets transmitted by said plurality of terminals in a time slot t, R(t)′ denotes a number of transmission request reservation packets in time slot t, I(t) denotes a number of data packets generated in time slot (t), T denotes a number of simultaneously allowable packets, and P(t) denotes a transmission probability of reservation packets in a time slot t.
- 3. A terminal comprising:a busy tone value calculation routine which receives from a base station a busy tone signal indicating a probability of reservation packet transmission, said probability of reservation packet including a value greater than 0 and less than 1; and an upward schedule control routine which receives traffic state information from said busy tone value calculation routine to control issuance of reservation packets, wherein said busy tone signal is represented by P(t) which satisfies the following equation: R(t)′=R(t−1)/P(t−1), P(t)=(T−I(t))/R(t)′where R(t) denotes a number of reservation packets transmitted by said plurality of terminals in a time slot t, R(t)′ denotes a number of transmission request reservation packets in time slot t, I(t) denotes a number of data packets generated in time slot (t), T denotes a number of simultaneously allowable packets, and P(t) denotes a transmission probability of reservation packets in a time slot t.
Priority Claims (1)
Number |
Date |
Country |
Kind |
7-204232 |
Aug 1995 |
JP |
|
Parent Case Info
This is a continuation application of U.S. Ser. No. 08/690,819, filed Aug. 1, 1996, now U.S. Pat. No. 6,269,088.
US Referenced Citations (26)
Foreign Referenced Citations (7)
Number |
Date |
Country |
5888938 |
May 1983 |
JP |
6090442 |
May 1985 |
JP |
2220526 |
Sep 1990 |
JP |
3214825 |
Sep 1991 |
JP |
A6311160 |
Nov 1994 |
JP |
715533 |
Jan 1995 |
JP |
A738496 |
Feb 1995 |
JP |
Non-Patent Literature Citations (1)
Entry |
IEEE Trans. On Communication, Packet Switching in Radio Channels, COM-24, (Aug. 1976) pp. 832-845. |
Continuations (1)
|
Number |
Date |
Country |
Parent |
08/690819 |
Aug 1996 |
US |
Child |
09/511769 |
|
US |