CA2171978C - Method and system for providing uplink/downlink collision avoidance in a wireless communication system - Google Patents
Method and system for providing uplink/downlink collision avoidance in a wireless communication systemInfo
- Publication number
- CA2171978C CA2171978C CA002171978A CA2171978A CA2171978C CA 2171978 C CA2171978 C CA 2171978C CA 002171978 A CA002171978 A CA 002171978A CA 2171978 A CA2171978 A CA 2171978A CA 2171978 C CA2171978 C CA 2171978C
- Authority
- CA
- Canada
- Prior art keywords
- frame
- time
- packet
- announcement
- subscriber unit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
- H04W74/0816—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA carrier sensing with collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/08—Access point devices
Abstract
Collision avoidance is maximized by placing collision avoidance scheduling in a central access manager. The central access manager coordinates downlink transmissions of a base site with the uplink transmissions by subscriber units, virtually avoiding collisions of the two types of transmissions. The subscriber units utilize a waiting period (204, 206) prior to transmission of packets to permit the central access manager to maintain the scheduling.
Description
W 096/0~725 2 1 7 ~ pcTrus95los95o Uplink/Downlink Collision Avoidance S Field of the Invention The present invention relates generally to access control in a communication system, and more particularly to optimization of ~ccess control for coliision avoidance in a 10 communication system.
Background In time-division multiple access (TDMA) communication 15 systems, each frame is an interval of T seconds, and each frame is divided into n discrete time slots. Thus, subscriber units can communicate with each other on a basis of non-overlapping transmission bursts. Since there is no overlap, a same pair of carrier frequencies, one for uplink and one for downlink, may be assigned to all subscriber units using a same base site.
The TDMA technique is characterized by duration of the time frame and the time slot within the frame. Each time slot typically consists of a guard time, a preamble, and the information to be transmitted. Typically, the preamble contains system information such as synchronization, control and routing information. The guard time and the preamble generally depend on the organization of the system. The 30 information to be transmitted occupies a predetermined number of bits.
Some time division multiple access, i.e., TDMA, systems, allow contention for the use of one slot to occur across 35 multiple slots. In this type of system, subscriber unit 2~9~
terminals may effectiveiy be designed to be half-duplex. For example, subscriber units may attempt to increase efficiency for a wireless system that is primarily intended for circuit-switched traffic by using excess system capacity for packet-5 switched data services via similar subscriber unit equipment.While the equipment may be full-duplex, said equipment may be incapable of transmitting and receiving data on two different time slots since this is not required for full-duplex circuit mode communication in a TDMA system. In this system, 10 the incidence where a particular subscriber unit is transmitting a packet of data on a first time slot, and a base station is transmitting a packet to the same subscriber unit on a second time slot, is called a collision. When collision occurs, at least one of the two transmitted packets will be 15 lost. Thus, retransmission of the lost packet is required, and system throughput is reduced.
Depending upon the type of packet services being used, the number of time slots, and the number of subscriber units, 20 the collisions tend to significantly degrade system performance. Use of a reservation contention algorithm may add a significant amount of delay to the system. Thus, there is a need for a collision avoidance method and system that prevents collision of transmitted packets, thus alleviating the 25 necessity for retransmission of lost packets and increasing system throughput.
Brief Descriptions of the Drawings FIG. 1 is a schematic showing an exemplary distribution of collision-resolving time slots/frames in a TDMA system_i n accordance with the present invention.
~WO 96/0472S 2 ~ 7 ~ ~ ~ 8 PCTtUS95tO5950 FIG. 2 is a flow chart of steps implemented by a contention timer in a subscriber unit for providing a buffer period in which the central access manager at the base site may schedule collision avoidance in accordance with the s present invention.
FIG. 3 is a flow chart of one embodiment of steps taken by a subscriber unit prior to executing a contention algorithm in accordance with the present invention.
FIG. 4 is a flow chart of steps taken by the central access manager in accordance with the present invention.
FIG. 5 is a flow chart of one embodiment of a method for 15 providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication system in accordance with the present invention.
FIG. 6 is a flow chart of one embodiment, shown with 20 greater particularity, of the step of determining, by the central access manager during a predetermined time interval, whether a selected subscriber unit is transmitting, and where the selected subscriber unit is idle, transmitting a packet on a contention time slot/frame to the selected subscriber unit in 25 accordance with the present invention.
FIG. 7 is a flow chart of another embodiment of a method for providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication 30 system having P frames between announcement frames, P a positive integer in accordance with the present invention.
FIG. 8 is a flow chart of another embodiment of a method for providing uplink/downlink collision avoidance of packets of 35 transmitted data in a time division multiplex communication W096/04725 ~ ~ 7 ~ q 7 PCT/US9!;/05950 ~
system, comprising the steps of, in parallel, in accordance with the present invention.
FIG. 9 is a block diagram of a time division multiple 5 access communication system for providing uplink/downlink collision avoidance of packets of transmitted data between a base site and each of a plurality of subscriber units in accordance with the present invention.
Detailed Description of a Preferred Embodiment The present invention allows a communication system to reduce average packet delay and increase system throughput by 15 distributing collision avoidance between a central access manager and a plurarity of subscriber units. The central access manager coordinates downlink transmissions of a base site with the uplink transmissions by subscriber units while the subscriber units coordinate the uplink transmission with 20 the downlink transmission, virtually avoiding collisions of the two types of transmissions.
FIG. 1, numeral 100, is a schematic showing an exemplary distribution of collision-resolving time 25 slots/frames in a TDMA system in accordance with the present invention. A central access manager in a base site, places, in an announcement frame A (102, 104, ...), an address of a packet to be transmitted on the downlink at predetermined time intervals. In order to allow the central access manager to 30 obtain the necessary information on the status of the uplink channel prior to placing the address of the packet in the frame, a predetermined number N, N an integer, of collision-resolving time slots/frames located immediately prior to the announcement frame A (102, 104, ...) are designated as non-35 contention frames, D (106, 108, ...), that are only available for ~W096/04725 2 i 7 1 9 7 ~3 PCT/USgS/059~0 packet transmission on the uplink and have no restriction onthe downlink. Collision-resolving time slots/frames that are available for contention (110, 112, ...), C, are located in the position bounded by the non-contention frames D (106, 108, ...) 5 and the announcement frame A (102, 104, ...). In the uplink, both types of frames, C and D, are available for packet transmission. Thus, upon completion of transmission of an uplink packet, a subscriber unit waits in accordance with the time encompassed by the predetermined number of non lo contention frames to read a next announcement frame, refraining from contending for an uplink time slot/frame until the subscriber unit has determined that none of the downlink packets currently waiting in the central access manager are being transmitted to the subscriber unit's terminal. In the lS example shown in FIG. 1, N is selected to be four.
FIG. 2, numeral 200, is a flow chart of steps implemented by a contention timer in a subscriber unit for providing a buffer period in which the central access manager 20 at the base site may schedule collision avoidance in accordance with the present invention. When an uplink packet has been transmitted, the subscriber unit determines whether a number of frames to a next announcement time sloVframe, A, is greater than N (202). Where the number of frames to the 25 next announcement frame is less than or equal to N, the subscriber unit sets a contention timer to a value that is equal to the sum of the number of frames to the next announcement time sloVframe and the number of frames between adjacent announcement time slots/frames (204). Where the number of 30 frames to the next announcement frame is greater than N, the subscriber unit sets a contention timer to a value that is equal to the number of frames to a next announcement time sloVframe (206). That is, the subscriber unit must wait until it receives an announcement time slot/frame before 35 transmitting a new packet since the announcement time WO 96104725 2 1 7 1 9 7 8 PCT/US95/OS950 ~
slot/frame information will enable the subscriber unit to avoid transmitting the new packet on a different time slot/frame that is being used by the base site to transmit a downlink packet to the same SU. After the subscriber sets the 5 contention timer, the contention timer decrements each time a frame is completed (208).
FIG. 3, numeral 300, is a flow chart of one embodiment of steps taken by a subscriber unit prior to executing a 10 contention algorithm in accordance with the present invention.
When an uplink packet is ready to be transmitted, the subscriber unit checks the reading of the contention timer, i.e.
counter (302). Where the contention timer has a reading that is greater than or equal to zero, the subscriber unit 15 decrements the contention timer one time each time a frame is completed (306) and recycles to determine the reading of the counter (302). Where the contention timer has a reading that is less than zero, the subscriber unit determines the number of frames to a next announcement time sloVframe, A (304).
20 Where the number of frames to the next announcement frame is less than or equal to N, the subscriber unit decrements the contention timer, one time each time a frame is completed (306) and recycles to determine the reading of the counter (302). Where the number of frames to the next announcement 25 frame is greater than N, the subscriber unit executes a contention algorithm (308) in order to send a packet.
FIG. 4, numeral 400, is a flow chart of steps taken by the central access manager in accordance with the present 30 invention. The central access manager determines whether collision conditions exist for a first packet, i.e., j = 1, in the time sloVframe (404). Where collision conditions exist for the packet j, the central access manager places packet j in a buffer, advances to a next packet (410), and determines 35 whether an announcement time slot/frame is full (412), i.e., ~VO 96/04725 2 1 7 1 9 7 ~ PCT/US95/059S0 whether any more addresses may be stored in the announcement time sloVframe. Where the announcement time slot/frame is at least partially empty, the central access manager recycles to determining whether collision conditions 5 exist for a next packet (404). Where the announcement time sloVframe is full, the central access manager transmits the announcement frame (414). Where collision conditions are absent for the packet j, the central access manager places the address of packet j in the announcement time sloVframe lo (408), advances to a next packet (410),and determines whether an announcement time sloVframe is full (412). Where the announcement time sloVframe is at least partially empty, the central access manager recycles to determining whether collision conditions exist for a next packet (404). Where the lS announcement time sloVframe is full, the central access manager transmits the announcement frame (414).
FIG. 5, numeral 500, is a flow chart of one embodiment of a method for providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication system in accordance with the present invention. The method includes the steps of, in parallel:
A) determining, by the central access manager during a predetermined time interval, whether a selected subscriber unit is transmitting, and where the selected subscriber unit is idle, transmitting a packet on a contention time slot/frame to the selected subscriber unit (502); and B) waiting, by each of a plurality of subscriber units, for a predetermined length of time between transmission of consecutive packets on an uplink channel to allow transmission of a packet from the central access manager on a downlink channel and checking an announcement time sloVframe for availability of the contention time sloVframe on the uplink channel prior to transmission of a packet on the contention time sloVframe WO 96/04725 2 1 7 1 9 7 8 PCT/US95/05950 ~
(504). Typically, to conserve power during waiting, the subscriber units are in a reduced power mode, i.e., "sleep".
The predetermined time interval is provided so that the central access manager may determine a status of the uplink s channel prior to indicating availability of a contention time sloVframe by placing an address of a packet in a next announcement frame. The predetermined time interval is equivalent to a time required for a predetermined number N, N
an integer, of time slots/frames.
The predetermined length of time between transmission of consecutive packets on an uplink channel is selected for the subscriber unit such that sufficient time is allowed for the base site to determine whether the subscriber unit is lS transmitting and to place announcement information on the status of contention time slots in an announcement time sloVframe and transmit it to the subscriber unit. The predetermined length of time is selected in one of two manners: A) where a number G, G an integer, of collision-20 resolving time slots/frames located immediately prior to theannouncement frame is greater than or equal to the predetermined number N, the predetermined length of time between transmission of consecutive packets is set to a time representing G; and B) where a number of collision-resolving 25 time slots/frames located immediately prior to the announcement frame is less than the predetermined number N, the predetermined length of time between transmission of consecutive packets is set to a time representing the number of time slots/frames between two anouncements time 30 slots/frames plus a number T, T < N, of time slots/frames between a present time sloVframe and the next announcement time slot/frame.
The subscriber unit typically includes a counter, later 35 referred to herein as a contention timer, that indicates a ~VO 96/04725 2 1 7 1 9 7 ~ PCTIUS95/OS950 number of time slots/frames representing the predetermined length of time between transmission of consecutive packets on an uplink channel, and decrements once each time sloVframe.
5 Where selected, the predetermined number N of collision-resolving time slots/frames located immediately prior to the announcement frame may be utilized as downlink channel time slots/frames. The central access manager is typically implemented with a digital signal processor in the base site.
FIG. 6, numeral 600, is a flow chart of one embodiment, shown with greater particularity, of the step of determining, by the central access manager during a predetermined time interval, whether a selected subscriber unit is transmitting, and where the selected subscriber unit is idle, transmitting a packet on a contention time slot/frame to the selected subscriber unit in accordance with the present invention.
comprises the steps of: A) determining whether collision conditions exist for the packet to be transmitted (602);
B) where collision conditions are present for the packet (604), B1) buffering the downlink packet for the predetermined time interval (606); B2) advancing to a next packet (608); B3) determining whether the announcement frame is full (610); B4) where the announcement frame is empty/partially filled, recycling to step A (612); B5) where the announcement frame is full, transmitting the announcement frame (614); C) where collision conditions are absent (616), C1) placing an address of the packet in the announcement time sloVframe (618); C2) advancing to a next packet (620); C3) determining whether the announcement frame is full (622); C4) where the announcement frame is empty/partially filled, recycling to step A (624); and C5) where the announcement frame is full, transmitting the announcement frame (626).
3s WO 96/04725 2 1 7 1 q ~ 8 PCT/US95/05950 ~
FIG. 7, numeral 700, is a flow chart of another embodiment of a method for providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication system having P frames 5 between announcement frames, P a positive integer in accordance with the present invention. The method includes the steps of: in a subscriber unit, steps A-E: A) determining whether a number of frames M from a present frame to a next announcement frame is ~ N, where M is a positive integer and lO N is a number of non-contention frames immediately prior to the next announcement frame (702); B) where M is ~ N, initializing a timer to a value of M plus P, where P is a number of frames to a next announcement frame, and where M 2 N, initializing the timer to a value of M (704); C) decrementing 15 the timer for each frame interval elapsed (706), wherein, while the timer has a positive value, the subscriber unit refrains from transmitting, and wherein, where the timer has a negative value, the subscriber unit is allowed to transmit packets (708), and where the subscriber unit transmits 20 packets, the subscriber unit implements the steps of: D) determining whether a number of frames Q to a next announcement frame is > N (710); E) where Q > N, transmitting the packet (712), and where Q s N, setting another timer equal to Q + 1 and waiting until Q + 1 frame intervals have elapsed, 25 reading contents of the announcement frame (714), and where the announcement frame shows a downlink packet pending for the subscriber unit, reading, by the subscriber unit, a downlink packet at an indicated time slot(716), and where the announcement frame is void of a downlink packet pending 30 message for the subscriber unit, transmitting, by the subscriber unit, contending for the time slot to transmit the uplink packet (718). In parallel with the subscriber units, the base site performs the following steps: F) determining whether collision conditions exist for the packet to be 35 transmitted (720); G) where collision conditions are present ~WO 96/0472~ 2 1 7 1 9 7 8 PCTIUS95/05950 for the packet (722), G1) buffering the downlink packet for the predetermined time interval (724); G2) advancing to a next packet (726); G3) determining whether the announcement frame is full (728); G4) where the announcement frame is S empty/partially filled, recycling to step F (730); G5) where the announcement frame is full, transmitting the announcement frame (732); H) where collision conditions are absent (734), H1) placing an address of the packet in the announcement time slot/frame (736); H2) advancing to a next packet (738); H3) determining whether the announcement frame is full (740); H4) where the announcement frame is empty/partially filled, recycling to step F (742); H5) where the announcement frame is full, transmitting the announcement frame (744).
FIG. 8, numeral 800, is a flow chart of another embodiment of a method for providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication system, comprising the steps of, in parallel, in accordance with the present invention.
The method includes the steps of: A) determining, by a central access manager, whether a subscriber unit is transmitting prior to sending the subscriber unit a packet (802); and B) balancing a flow of packets in an uplink and a downlink direction by pausing, by the subscriber unit, between a transmission of consecutive uplink packets to allow a transmission of a downlink packet (804).
FIG. 9, numeral 900, is a block diagram of a time division multiple access communication system for providing uplink/downlink collision avoidance of packets of transmitted data between a base site and each of a plurality of subscriber units in accordance with the present invention. The TDMA
cornmunication system includes a base site (902) that has a central access manager (904) and a plurality of subscriber WO 96/04725 2 1 7 1 9 7 8 PCT/US9S/OS9SO ~
units (906, 912, ...), each having a contention timer (908, 914, ...) and a scheduling unit (910, 916, ...). The central access manager (904) of the base site (902) is used for determining, during a predetermined time interval, whether a selected 5 subscriber unit is transmitting, placing, in an announcement time slot/frame, information giving availability of a contention time slot/frame based on whether the selected subscriber unit is transmitting in the contention time sloVframe, and where the selected subscriber unit is idle, for lo transmitting a packet on the contention time sloVframe to the selected subscriber unit.
In FIG. 9 the contention timer (908, 914, ...) of each of the plurality of subscriber units is used for waiting for a 15 predetermined length of time between transmission of consecutive packets on an uplink channel to allow transmission of a packet from the central access manager on a downlink channel. The scheduling unit (910, 916, ...) is operably coupled to the contention timer (908, 914, ...) and is 20 used for checking the announcement time sloVframe received from the central access manager for availability of the contention time slot/frame on the uplink channel prior to transmission of a packet on the contention time slot/frame..
During waiting, the subscriber units are typically in a reduced 25 power mode, i.e., "sleep". Again, the predetermined time interval is a time required for the central access manager to determine a status of the uplink channel prior to indicating availability of a contention time slot/frame by placing an address of a packet in a next announcement frame, and the 30 predetermined time interval is equivalent to a time required for a predetermined number N, N an integer, of time slots/frames. The predetermined length of time between transmission of consecutive packets on an uplink channel is typically determined as described above. The selected 35 subscriber unit further maintains a counter that indicates a ~WO 96/0472S ~ ~ 7 ~ ~ 7~ PCTIUS95/05950 number of time slots/frames representing the predetermined length of time between transmission of consecutive packets on an uplink channel, and decrementing the counter once each time slot/f rame .
The central access manager is generally a digital signal processor in the base site. Determining, by the central access manager (904) whether a selected subscriber unit is transmitting, and where the selected subscriber unit is idle, 10 transmitting a packet on a contention time slot/frame to the selected subscriber unit is typically accomplished as described above for FIG. 6.
Although exemplary embodiments are described above, it 15 will be obvious to those skilled in the art that many alterations and modifications may be made without departing from the invention. Accordingly, it is intended that all such alterations and modifications be included within the spirit and scope of the invention as defined in the appended claims.
We claim:
Background In time-division multiple access (TDMA) communication 15 systems, each frame is an interval of T seconds, and each frame is divided into n discrete time slots. Thus, subscriber units can communicate with each other on a basis of non-overlapping transmission bursts. Since there is no overlap, a same pair of carrier frequencies, one for uplink and one for downlink, may be assigned to all subscriber units using a same base site.
The TDMA technique is characterized by duration of the time frame and the time slot within the frame. Each time slot typically consists of a guard time, a preamble, and the information to be transmitted. Typically, the preamble contains system information such as synchronization, control and routing information. The guard time and the preamble generally depend on the organization of the system. The 30 information to be transmitted occupies a predetermined number of bits.
Some time division multiple access, i.e., TDMA, systems, allow contention for the use of one slot to occur across 35 multiple slots. In this type of system, subscriber unit 2~9~
terminals may effectiveiy be designed to be half-duplex. For example, subscriber units may attempt to increase efficiency for a wireless system that is primarily intended for circuit-switched traffic by using excess system capacity for packet-5 switched data services via similar subscriber unit equipment.While the equipment may be full-duplex, said equipment may be incapable of transmitting and receiving data on two different time slots since this is not required for full-duplex circuit mode communication in a TDMA system. In this system, 10 the incidence where a particular subscriber unit is transmitting a packet of data on a first time slot, and a base station is transmitting a packet to the same subscriber unit on a second time slot, is called a collision. When collision occurs, at least one of the two transmitted packets will be 15 lost. Thus, retransmission of the lost packet is required, and system throughput is reduced.
Depending upon the type of packet services being used, the number of time slots, and the number of subscriber units, 20 the collisions tend to significantly degrade system performance. Use of a reservation contention algorithm may add a significant amount of delay to the system. Thus, there is a need for a collision avoidance method and system that prevents collision of transmitted packets, thus alleviating the 25 necessity for retransmission of lost packets and increasing system throughput.
Brief Descriptions of the Drawings FIG. 1 is a schematic showing an exemplary distribution of collision-resolving time slots/frames in a TDMA system_i n accordance with the present invention.
~WO 96/0472S 2 ~ 7 ~ ~ ~ 8 PCTtUS95tO5950 FIG. 2 is a flow chart of steps implemented by a contention timer in a subscriber unit for providing a buffer period in which the central access manager at the base site may schedule collision avoidance in accordance with the s present invention.
FIG. 3 is a flow chart of one embodiment of steps taken by a subscriber unit prior to executing a contention algorithm in accordance with the present invention.
FIG. 4 is a flow chart of steps taken by the central access manager in accordance with the present invention.
FIG. 5 is a flow chart of one embodiment of a method for 15 providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication system in accordance with the present invention.
FIG. 6 is a flow chart of one embodiment, shown with 20 greater particularity, of the step of determining, by the central access manager during a predetermined time interval, whether a selected subscriber unit is transmitting, and where the selected subscriber unit is idle, transmitting a packet on a contention time slot/frame to the selected subscriber unit in 25 accordance with the present invention.
FIG. 7 is a flow chart of another embodiment of a method for providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication 30 system having P frames between announcement frames, P a positive integer in accordance with the present invention.
FIG. 8 is a flow chart of another embodiment of a method for providing uplink/downlink collision avoidance of packets of 35 transmitted data in a time division multiplex communication W096/04725 ~ ~ 7 ~ q 7 PCT/US9!;/05950 ~
system, comprising the steps of, in parallel, in accordance with the present invention.
FIG. 9 is a block diagram of a time division multiple 5 access communication system for providing uplink/downlink collision avoidance of packets of transmitted data between a base site and each of a plurality of subscriber units in accordance with the present invention.
Detailed Description of a Preferred Embodiment The present invention allows a communication system to reduce average packet delay and increase system throughput by 15 distributing collision avoidance between a central access manager and a plurarity of subscriber units. The central access manager coordinates downlink transmissions of a base site with the uplink transmissions by subscriber units while the subscriber units coordinate the uplink transmission with 20 the downlink transmission, virtually avoiding collisions of the two types of transmissions.
FIG. 1, numeral 100, is a schematic showing an exemplary distribution of collision-resolving time 25 slots/frames in a TDMA system in accordance with the present invention. A central access manager in a base site, places, in an announcement frame A (102, 104, ...), an address of a packet to be transmitted on the downlink at predetermined time intervals. In order to allow the central access manager to 30 obtain the necessary information on the status of the uplink channel prior to placing the address of the packet in the frame, a predetermined number N, N an integer, of collision-resolving time slots/frames located immediately prior to the announcement frame A (102, 104, ...) are designated as non-35 contention frames, D (106, 108, ...), that are only available for ~W096/04725 2 i 7 1 9 7 ~3 PCT/USgS/059~0 packet transmission on the uplink and have no restriction onthe downlink. Collision-resolving time slots/frames that are available for contention (110, 112, ...), C, are located in the position bounded by the non-contention frames D (106, 108, ...) 5 and the announcement frame A (102, 104, ...). In the uplink, both types of frames, C and D, are available for packet transmission. Thus, upon completion of transmission of an uplink packet, a subscriber unit waits in accordance with the time encompassed by the predetermined number of non lo contention frames to read a next announcement frame, refraining from contending for an uplink time slot/frame until the subscriber unit has determined that none of the downlink packets currently waiting in the central access manager are being transmitted to the subscriber unit's terminal. In the lS example shown in FIG. 1, N is selected to be four.
FIG. 2, numeral 200, is a flow chart of steps implemented by a contention timer in a subscriber unit for providing a buffer period in which the central access manager 20 at the base site may schedule collision avoidance in accordance with the present invention. When an uplink packet has been transmitted, the subscriber unit determines whether a number of frames to a next announcement time sloVframe, A, is greater than N (202). Where the number of frames to the 25 next announcement frame is less than or equal to N, the subscriber unit sets a contention timer to a value that is equal to the sum of the number of frames to the next announcement time sloVframe and the number of frames between adjacent announcement time slots/frames (204). Where the number of 30 frames to the next announcement frame is greater than N, the subscriber unit sets a contention timer to a value that is equal to the number of frames to a next announcement time sloVframe (206). That is, the subscriber unit must wait until it receives an announcement time slot/frame before 35 transmitting a new packet since the announcement time WO 96104725 2 1 7 1 9 7 8 PCT/US95/OS950 ~
slot/frame information will enable the subscriber unit to avoid transmitting the new packet on a different time slot/frame that is being used by the base site to transmit a downlink packet to the same SU. After the subscriber sets the 5 contention timer, the contention timer decrements each time a frame is completed (208).
FIG. 3, numeral 300, is a flow chart of one embodiment of steps taken by a subscriber unit prior to executing a 10 contention algorithm in accordance with the present invention.
When an uplink packet is ready to be transmitted, the subscriber unit checks the reading of the contention timer, i.e.
counter (302). Where the contention timer has a reading that is greater than or equal to zero, the subscriber unit 15 decrements the contention timer one time each time a frame is completed (306) and recycles to determine the reading of the counter (302). Where the contention timer has a reading that is less than zero, the subscriber unit determines the number of frames to a next announcement time sloVframe, A (304).
20 Where the number of frames to the next announcement frame is less than or equal to N, the subscriber unit decrements the contention timer, one time each time a frame is completed (306) and recycles to determine the reading of the counter (302). Where the number of frames to the next announcement 25 frame is greater than N, the subscriber unit executes a contention algorithm (308) in order to send a packet.
FIG. 4, numeral 400, is a flow chart of steps taken by the central access manager in accordance with the present 30 invention. The central access manager determines whether collision conditions exist for a first packet, i.e., j = 1, in the time sloVframe (404). Where collision conditions exist for the packet j, the central access manager places packet j in a buffer, advances to a next packet (410), and determines 35 whether an announcement time slot/frame is full (412), i.e., ~VO 96/04725 2 1 7 1 9 7 ~ PCT/US95/059S0 whether any more addresses may be stored in the announcement time sloVframe. Where the announcement time slot/frame is at least partially empty, the central access manager recycles to determining whether collision conditions 5 exist for a next packet (404). Where the announcement time sloVframe is full, the central access manager transmits the announcement frame (414). Where collision conditions are absent for the packet j, the central access manager places the address of packet j in the announcement time sloVframe lo (408), advances to a next packet (410),and determines whether an announcement time sloVframe is full (412). Where the announcement time sloVframe is at least partially empty, the central access manager recycles to determining whether collision conditions exist for a next packet (404). Where the lS announcement time sloVframe is full, the central access manager transmits the announcement frame (414).
FIG. 5, numeral 500, is a flow chart of one embodiment of a method for providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication system in accordance with the present invention. The method includes the steps of, in parallel:
A) determining, by the central access manager during a predetermined time interval, whether a selected subscriber unit is transmitting, and where the selected subscriber unit is idle, transmitting a packet on a contention time slot/frame to the selected subscriber unit (502); and B) waiting, by each of a plurality of subscriber units, for a predetermined length of time between transmission of consecutive packets on an uplink channel to allow transmission of a packet from the central access manager on a downlink channel and checking an announcement time sloVframe for availability of the contention time sloVframe on the uplink channel prior to transmission of a packet on the contention time sloVframe WO 96/04725 2 1 7 1 9 7 8 PCT/US95/05950 ~
(504). Typically, to conserve power during waiting, the subscriber units are in a reduced power mode, i.e., "sleep".
The predetermined time interval is provided so that the central access manager may determine a status of the uplink s channel prior to indicating availability of a contention time sloVframe by placing an address of a packet in a next announcement frame. The predetermined time interval is equivalent to a time required for a predetermined number N, N
an integer, of time slots/frames.
The predetermined length of time between transmission of consecutive packets on an uplink channel is selected for the subscriber unit such that sufficient time is allowed for the base site to determine whether the subscriber unit is lS transmitting and to place announcement information on the status of contention time slots in an announcement time sloVframe and transmit it to the subscriber unit. The predetermined length of time is selected in one of two manners: A) where a number G, G an integer, of collision-20 resolving time slots/frames located immediately prior to theannouncement frame is greater than or equal to the predetermined number N, the predetermined length of time between transmission of consecutive packets is set to a time representing G; and B) where a number of collision-resolving 25 time slots/frames located immediately prior to the announcement frame is less than the predetermined number N, the predetermined length of time between transmission of consecutive packets is set to a time representing the number of time slots/frames between two anouncements time 30 slots/frames plus a number T, T < N, of time slots/frames between a present time sloVframe and the next announcement time slot/frame.
The subscriber unit typically includes a counter, later 35 referred to herein as a contention timer, that indicates a ~VO 96/04725 2 1 7 1 9 7 ~ PCTIUS95/OS950 number of time slots/frames representing the predetermined length of time between transmission of consecutive packets on an uplink channel, and decrements once each time sloVframe.
5 Where selected, the predetermined number N of collision-resolving time slots/frames located immediately prior to the announcement frame may be utilized as downlink channel time slots/frames. The central access manager is typically implemented with a digital signal processor in the base site.
FIG. 6, numeral 600, is a flow chart of one embodiment, shown with greater particularity, of the step of determining, by the central access manager during a predetermined time interval, whether a selected subscriber unit is transmitting, and where the selected subscriber unit is idle, transmitting a packet on a contention time slot/frame to the selected subscriber unit in accordance with the present invention.
comprises the steps of: A) determining whether collision conditions exist for the packet to be transmitted (602);
B) where collision conditions are present for the packet (604), B1) buffering the downlink packet for the predetermined time interval (606); B2) advancing to a next packet (608); B3) determining whether the announcement frame is full (610); B4) where the announcement frame is empty/partially filled, recycling to step A (612); B5) where the announcement frame is full, transmitting the announcement frame (614); C) where collision conditions are absent (616), C1) placing an address of the packet in the announcement time sloVframe (618); C2) advancing to a next packet (620); C3) determining whether the announcement frame is full (622); C4) where the announcement frame is empty/partially filled, recycling to step A (624); and C5) where the announcement frame is full, transmitting the announcement frame (626).
3s WO 96/04725 2 1 7 1 q ~ 8 PCT/US95/05950 ~
FIG. 7, numeral 700, is a flow chart of another embodiment of a method for providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication system having P frames 5 between announcement frames, P a positive integer in accordance with the present invention. The method includes the steps of: in a subscriber unit, steps A-E: A) determining whether a number of frames M from a present frame to a next announcement frame is ~ N, where M is a positive integer and lO N is a number of non-contention frames immediately prior to the next announcement frame (702); B) where M is ~ N, initializing a timer to a value of M plus P, where P is a number of frames to a next announcement frame, and where M 2 N, initializing the timer to a value of M (704); C) decrementing 15 the timer for each frame interval elapsed (706), wherein, while the timer has a positive value, the subscriber unit refrains from transmitting, and wherein, where the timer has a negative value, the subscriber unit is allowed to transmit packets (708), and where the subscriber unit transmits 20 packets, the subscriber unit implements the steps of: D) determining whether a number of frames Q to a next announcement frame is > N (710); E) where Q > N, transmitting the packet (712), and where Q s N, setting another timer equal to Q + 1 and waiting until Q + 1 frame intervals have elapsed, 25 reading contents of the announcement frame (714), and where the announcement frame shows a downlink packet pending for the subscriber unit, reading, by the subscriber unit, a downlink packet at an indicated time slot(716), and where the announcement frame is void of a downlink packet pending 30 message for the subscriber unit, transmitting, by the subscriber unit, contending for the time slot to transmit the uplink packet (718). In parallel with the subscriber units, the base site performs the following steps: F) determining whether collision conditions exist for the packet to be 35 transmitted (720); G) where collision conditions are present ~WO 96/0472~ 2 1 7 1 9 7 8 PCTIUS95/05950 for the packet (722), G1) buffering the downlink packet for the predetermined time interval (724); G2) advancing to a next packet (726); G3) determining whether the announcement frame is full (728); G4) where the announcement frame is S empty/partially filled, recycling to step F (730); G5) where the announcement frame is full, transmitting the announcement frame (732); H) where collision conditions are absent (734), H1) placing an address of the packet in the announcement time slot/frame (736); H2) advancing to a next packet (738); H3) determining whether the announcement frame is full (740); H4) where the announcement frame is empty/partially filled, recycling to step F (742); H5) where the announcement frame is full, transmitting the announcement frame (744).
FIG. 8, numeral 800, is a flow chart of another embodiment of a method for providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication system, comprising the steps of, in parallel, in accordance with the present invention.
The method includes the steps of: A) determining, by a central access manager, whether a subscriber unit is transmitting prior to sending the subscriber unit a packet (802); and B) balancing a flow of packets in an uplink and a downlink direction by pausing, by the subscriber unit, between a transmission of consecutive uplink packets to allow a transmission of a downlink packet (804).
FIG. 9, numeral 900, is a block diagram of a time division multiple access communication system for providing uplink/downlink collision avoidance of packets of transmitted data between a base site and each of a plurality of subscriber units in accordance with the present invention. The TDMA
cornmunication system includes a base site (902) that has a central access manager (904) and a plurality of subscriber WO 96/04725 2 1 7 1 9 7 8 PCT/US9S/OS9SO ~
units (906, 912, ...), each having a contention timer (908, 914, ...) and a scheduling unit (910, 916, ...). The central access manager (904) of the base site (902) is used for determining, during a predetermined time interval, whether a selected 5 subscriber unit is transmitting, placing, in an announcement time slot/frame, information giving availability of a contention time slot/frame based on whether the selected subscriber unit is transmitting in the contention time sloVframe, and where the selected subscriber unit is idle, for lo transmitting a packet on the contention time sloVframe to the selected subscriber unit.
In FIG. 9 the contention timer (908, 914, ...) of each of the plurality of subscriber units is used for waiting for a 15 predetermined length of time between transmission of consecutive packets on an uplink channel to allow transmission of a packet from the central access manager on a downlink channel. The scheduling unit (910, 916, ...) is operably coupled to the contention timer (908, 914, ...) and is 20 used for checking the announcement time sloVframe received from the central access manager for availability of the contention time slot/frame on the uplink channel prior to transmission of a packet on the contention time slot/frame..
During waiting, the subscriber units are typically in a reduced 25 power mode, i.e., "sleep". Again, the predetermined time interval is a time required for the central access manager to determine a status of the uplink channel prior to indicating availability of a contention time slot/frame by placing an address of a packet in a next announcement frame, and the 30 predetermined time interval is equivalent to a time required for a predetermined number N, N an integer, of time slots/frames. The predetermined length of time between transmission of consecutive packets on an uplink channel is typically determined as described above. The selected 35 subscriber unit further maintains a counter that indicates a ~WO 96/0472S ~ ~ 7 ~ ~ 7~ PCTIUS95/05950 number of time slots/frames representing the predetermined length of time between transmission of consecutive packets on an uplink channel, and decrementing the counter once each time slot/f rame .
The central access manager is generally a digital signal processor in the base site. Determining, by the central access manager (904) whether a selected subscriber unit is transmitting, and where the selected subscriber unit is idle, 10 transmitting a packet on a contention time slot/frame to the selected subscriber unit is typically accomplished as described above for FIG. 6.
Although exemplary embodiments are described above, it 15 will be obvious to those skilled in the art that many alterations and modifications may be made without departing from the invention. Accordingly, it is intended that all such alterations and modifications be included within the spirit and scope of the invention as defined in the appended claims.
We claim:
Claims (17)
- THE EMBODIMENT OF THE INVENTION IN WHICH AN EXCLUSIVE PROPERTY
OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
A method for providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication system, comprising the steps of:
in parallel:
A) determining, by the central access manager during a predetermined time interval, whether a selected subscriber unit is transmitting, and where the selected subscriber unit is idle, transmitting a packet on a contention time slot/frame to the selected subscriber unit; and B) waiting, by each of a plurality of subscriber units, for a predetermined length of time between transmission of consecutive packets on an uplink channel to allow transmission of a packet from the central access manager on a downlink channel and reading an announcement time slot/frame to check availability of the contention time slot/frame on the uplink channel prior to transmission of a packet on the contention time slot/frame. - 2. The method of claim 1 wherein, during waiting, the subscriber units are in a reduced power mode, i.e., "sleep".
- 3. The method of claim 1 wherein the predetermined time interval is a time required for the central access manager to determine a status of the uplink channel prior to indicating availability of a contention time slot/frame by placing an address of a packet in a next announcement frame.
- 4. The method of claim 3 wherein the predetermined time interval is equivalent to a time required for a predetermined number N, N an integer, of time slots/frames.
- 5. The method of claims 1 wherein the predetermined length of time between transmission of consecutive packets on an uplink channel comprises:
A) where a number G, G an integer, of collision-resolving time slots/frames located immediately prior to the announcement frame is greater than the predetermined number N, the predetermined length of time between transmission of consecutive packets substantially equal to a time representing G; and B) where a number of collision-resolving time slots/frames located immediately prior to the announcement frame is less than or equal to the predetermined number N, the predetermined length of time between transmission of consecutive packets substantially equal to a time representing the number of time slots/frames between anouncement time slots/frames plus a number T, T<N, of time slots/frames between a present time slot/frame and the next announcement time slot/frame. - 6. The method of claim 5 including maintaining, by the subscriber unit, a counter that indicates a number of time slots/frames representing the predetermined length of time between transmission of consecutive packets on an uplink channel, and decrementing the counter once each time slot/frame.
- 7. The method of claim 1 wherein the central access manager is a digital signal processor in the base site.
- 8. The method of claim 1 wherein the step of determining, by the central access manager during a predetermined time interval, whether a selected subscriber unit is transmitting, and where the selected subscriber unit is idle, transmitting a packet on a contention time slot/frame to the selected subscriber unit comprises the steps of:
A) determining whether collision conditions exist for the packet to be transmitted;
B) where collision conditions are present for the packet, B1) buffering the downlink packet for the predetermined time interval;
B2) advancing to a next packet;
B3) determining whether the announcement frame is full;
B4) where the announcement frame is empty/partially filled, recycling to step A;
B5) where the announcement frame is full, transmitting the announcement frame;
C) where collision conditions are absent, C1) placing an address of the packet in the announcement time slot/frame;
C2) advancing to the next packet;
C3) determining whether the announcement frame is full;
C4) where the announcement frame is empty/partially filled, recycling to step A;
C5) where the announcement frame is full, transmitting the announcement frame. - 9. A method for providing uplink/downlink collision avoidance of packets of transmitted data in a time division multiplex communication system having P
frames between announcement frames, P a positive integer, comprising the steps of:
in a subscriber unit:
A) determining whether a number of frames M from a present frame to a next announcement frame is <N, where M is a positive integer and N is a number of non-contention frames immediately prior to the next announcement frame, B) where M is <N, initializing a timer to a value of M plus P, where P is a number of frames to a next announcement frame, and where M>=N, initializing the timer to a value of M
C) decrementing the timer for each frame interval elapsed, wherein, while the timer has a positive value, the subscriber unit refrains from transmitting, and wherein, where the timer has a negative value, the subscriber unit is allowed to transmit packets, and where the subscriber unit transmits packets, the subscriber unit implements the steps of:
D) determining whether a number of frames Q to a next announcement frame is >N, E) where Q>N, transmitting the packet, and where Q<=N, setting another timer equal to Q+1 and waiting until Q+1 frame intervals have elapsed, reading contents of the announcement frame and where the announcement frame indicates a downlink packet pending for the subscriber unit, reading, by the subscriber unit, a downlink packet at an indicated time slot, and where the announcement frame is void of a downlink packet pending message for the subscriber unit, transmitting, by the subscriber unit, in contention for the time slot to transmit the uplink packet, for the base site, F) determining whether collision conditions exist for the packet to be transmitted;
G) where collision conditions are present for the packet, G1) buffering the downlink packet for the predetermined time interval;
G2) advancing to a next packet;
G3) determining whether the announcement frame is full;
G4) where the announcement frame is empty/partially filled, returning to step F;
G5) where the announcement frame is full, transmitting the announcement frame;
H) where collision conditions are absent, H1) placing an address of the packet in the announcement time slot/frame;
H2) advancing to a next packet;
H3) determining whether the announcement frame is full;
H4) where the announcement frame is empty/partially filled, recycling to step F;
H5) where the announcement frame is full, transmitting the announcement frame. - 10. A time division multiple access communication system for providing uplink/downlink collision avoidance of packets of transmitted data between a base site and each of a plurality of subscriber units, comprising:
A) the base site having a central access manager, for determining, during a predetermined time interval, whether a selected subscriber unit is transmitting, placing, in an announcement time slot/frame, information giving availability of a contention time slot/frame based on whether the selected subscriber unit is transmitting in the contention time slot/frame, and where the selected subscriber unit is idle, for transmitting a packet on the contention time slot/frame to the selected subscriber unit; and B) each of the plurality of subscriber units comprising:
B1) a contention timer, for waiting for a predetermined length of time between transmission of consecutive packets on an uplink channel to allow transmission of a packet from the central access manager on a downlink channel; and B2) a scheduling unit, operably coupled to the contention timer, for reading the announcement time slot/frame received from the central access manager to check availability of the contention time slot/frame on the uplink channel prior to transmission of a packet on the contention time slot/frame. - 11. The time division multiple access communication system of claim 10 wherein, during waiting, the subscriber units are in a reduced power mode, i.e., "sleep".
- 12. The time division multiple access communication system of claim 10 wherein the predetermined time interval is a time required for the central access manager to determine a status of the uplink channel prior to indicating availability of a contention time slot/frame by placing an address of a packet in a next announcement frame.
- 13. The time division multiple access communication system of claim 12 wherein the predetermined time interval is equivalent to a time required for a predetermined number N, N an integer, of time slots/frames.
- 14. The time division multiple access communication system of claim 13 wherein the predetermined length of time between transmission of consecutive packets on an uplink channel comprises:
A) where a number G, G an integer, of collision-resolving time slots/frames located immediately prior to the announcement frame is greater than or equal to the predetermined number N, the predetermined length of time between transmission of consecutive packets substantially equal to a time representing G; and B) where a number of collision-resolving time slots/frames located immediately prior to the announcement frame is less than the predetermined number N, the predetermined length of time between transmission of consecutive packets substantially equal to a time representing the number of time slots/frames between anouncement time slots/frames plus a number T, T<N, of time slots/frames between a present time slot/frame and the next announcement time slot/frame. - 15. The time division multiple access communication system of claim 14 wherein the selected subscriber unit further maintains a counter that indicates a number of time slots/frames representing the predetermined length of time between transmission of consecutive packets on an uplink channel, and decrementing the counter once each time slot/frame.
- 16. The time division multiple access communication system of claim 10 wherein the central access manager is a digital signal processor in the base site.
- 17. The time division multiple access communication system of claim 10 wherein the central access manager, in determining whether a selected subscriber unit is transmitting, and where the selected subscriber unit is idle, transmitting a packet on a contention time slot/frame to the selected subscriber unit utilizes the following:
A) determining whether collision conditions exist for the packet to be transmitted;
B) where collision conditions are present for the packet, B1) buffering the downlink packet for the predetermined time interval;
B2) determining whether the announcement frame is full;
B3) where the announcement frame is empty/partially filled, recycling to step A;
B4) where the announcement frame is full, transmitting the announcement frame;
C) where collision conditions are absent, C1) placing an address of the packet in the announcement time slot/frame;
C2) advancing to a next packet C3) determining whether the announcement frame is full;
C4) where the announcement frame is empty/partially filled, recycling to step A;
C5) where the announcement frame is full, transmitting the announcement frame.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/282,833 | 1994-07-29 | ||
| US08/282,833 US5517504A (en) | 1994-07-29 | 1994-07-29 | Method and system for providing uplink/downlink collision avoidance in a wireless communication system |
| PCT/US1995/005950 WO1996004725A1 (en) | 1994-07-29 | 1995-05-15 | Uplink/downlink collision avoidance |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2171978A1 CA2171978A1 (en) | 1996-02-15 |
| CA2171978C true CA2171978C (en) | 1999-09-21 |
Family
ID=23083324
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002171978A Expired - Fee Related CA2171978C (en) | 1994-07-29 | 1995-05-15 | Method and system for providing uplink/downlink collision avoidance in a wireless communication system |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US5517504A (en) |
| EP (1) | EP0721711A1 (en) |
| CN (1) | CN1064799C (en) |
| AU (1) | AU676638B2 (en) |
| CA (1) | CA2171978C (en) |
| WO (1) | WO1996004725A1 (en) |
Families Citing this family (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE19722219A1 (en) * | 1997-05-28 | 1998-12-03 | Alsthom Cge Alcatel | Radio communication system with a fixed and a movable radio device |
| SE509542C2 (en) | 1997-06-27 | 1999-02-08 | Ericsson Telefon Ab L M | Packet switching in a cellular radio communication system |
| US6108314A (en) * | 1998-08-31 | 2000-08-22 | Motorola, Inc. | Method, subscriber device, wireless router, and communication system efficiently utilizing the receive/transmit switching time |
| JP4510294B2 (en) * | 1998-11-13 | 2010-07-21 | ローベルト ボツシユ ゲゼルシヤフト ミツト ベシユレンクテル ハフツング | In particular, a method and apparatus for driving a communication terminal device in a power saving mode in a wireless communication system |
| US7388846B1 (en) * | 1999-09-08 | 2008-06-17 | Qwest Communications International Inc. | Cellularized packetized voice and data |
| US6987769B1 (en) | 1999-09-08 | 2006-01-17 | Qwest Communications International Inc. | System and method for dynamic distributed communication |
| US6831902B1 (en) * | 1999-09-08 | 2004-12-14 | Qwest Communications International, Inc. | Routing information packets in a distributed network |
| US8005077B1 (en) | 1999-09-08 | 2011-08-23 | Qwest Communications International Inc. | Distributively routed VDSL and high-speed information packets |
| EP1100228A3 (en) * | 1999-11-09 | 2009-03-25 | Panasonic Corporation | Data transmission method and system, and device used therefor |
| AU4645101A (en) * | 2000-02-18 | 2001-08-27 | Nokia Networks Oy | Communications system |
| US7142527B2 (en) * | 2001-02-28 | 2006-11-28 | Nokia Inc. | System and method for transmission scheduling using network membership information and neighborhood information |
| JP3530141B2 (en) * | 2001-03-06 | 2004-05-24 | 松下電器産業株式会社 | Wireless LAN system and wireless LAN system signal collision avoidance method |
| US6765882B2 (en) | 2001-07-02 | 2004-07-20 | Motorola, Inc. | Method and system for data packet collision avoidance in a wireless communication system |
| BR0212132A (en) * | 2001-08-25 | 2004-08-24 | Nokia Corp | System and methods for distributed packet programming, and methods for compressing a plurality of neighbor entries from a neighborhood list contained in a network configuration package, for transmitting a network configuration package associated with a node in a ad hoc network, and for broadcast programming on an ad hoc network |
| EP1289219A1 (en) * | 2001-08-28 | 2003-03-05 | Lucent Technologies Inc. | A method of scheduling data packets for transmission over a shared channel, and a terminal of data packet transmission network |
| US20040254728A1 (en) * | 2002-10-25 | 2004-12-16 | Poropat George Vladimir | Collision warning system and method |
| US7355992B2 (en) * | 2003-03-18 | 2008-04-08 | Harris Corporation | Relay for extended range point-to-point wireless packetized data communication system |
| US7616568B2 (en) * | 2006-11-06 | 2009-11-10 | Ixia | Generic packet generation |
| US8223790B1 (en) * | 2007-04-30 | 2012-07-17 | Avaya Inc. | Method and apparatus performing no back-off forwarding |
| CN101370301B (en) * | 2008-09-19 | 2011-08-03 | 中国科学技术大学 | Multi-user cooperation transmission data traffic method based on service characteristic |
| CN102204174A (en) * | 2008-11-04 | 2011-09-28 | 株式会社自动网络技术研究所 | Communication device, relay device, communication system, and communication method |
| US8370695B2 (en) * | 2008-11-06 | 2013-02-05 | Htc Corporation | Method and apparatus for improving uplink transmission of transmission time interval bundling in a wireless communication system |
| EP3024156A1 (en) * | 2014-11-19 | 2016-05-25 | Motorola Solutions, Inc. | Method, device and system for transmitting short data during an active TDMA call |
| US10862705B2 (en) | 2015-04-16 | 2020-12-08 | Telefonaktiebolaget L M Ericsson (Publ) | Carrier sense multiple access (CSMA) with frequency division multiplexing for data transmission in wireless communication |
| US9788182B2 (en) | 2015-06-03 | 2017-10-10 | The United States Of America As Represented By The Secretary Of The Army | Method and system for packet collision avoidance in a wireless communication system |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4675863A (en) * | 1985-03-20 | 1987-06-23 | International Mobile Machines Corp. | Subscriber RF telephone system for providing multiple speech and/or data signals simultaneously over either a single or a plurality of RF channels |
| US4949335A (en) * | 1989-01-23 | 1990-08-14 | Motorola, Inc. | A TDM quasi-duplex system |
| US5091906A (en) * | 1989-12-18 | 1992-02-25 | Motorola, Inc. | Quasi-duplex radio system using bi-directional hole extension |
| US5040175A (en) * | 1990-04-11 | 1991-08-13 | Ncr Corporation | Wireless information transmission system |
| US5142533A (en) * | 1991-03-28 | 1992-08-25 | Motorola, Inc. | Method for controlling the scheduling of multiple access to communication resources |
| US5319635A (en) * | 1991-05-06 | 1994-06-07 | Motorola, Inc. | Electronic duplex communication system |
| GB9217374D0 (en) * | 1992-08-14 | 1992-09-30 | Ncr Int Inc | Wireless local area network transmission system |
| US5287384A (en) * | 1992-10-15 | 1994-02-15 | Lxe Inc. | Frequency hopping spread spectrum data communications system |
| US5371734A (en) * | 1993-01-29 | 1994-12-06 | Digital Ocean, Inc. | Medium access control protocol for wireless network |
-
1994
- 1994-07-29 US US08/282,833 patent/US5517504A/en not_active Expired - Lifetime
-
1995
- 1995-05-15 EP EP95919810A patent/EP0721711A1/en not_active Withdrawn
- 1995-05-15 CA CA002171978A patent/CA2171978C/en not_active Expired - Fee Related
- 1995-05-15 AU AU25486/95A patent/AU676638B2/en not_active Ceased
- 1995-05-15 WO PCT/US1995/005950 patent/WO1996004725A1/en not_active Application Discontinuation
- 1995-05-15 CN CN95190701A patent/CN1064799C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| US5517504A (en) | 1996-05-14 |
| CA2171978A1 (en) | 1996-02-15 |
| AU676638B2 (en) | 1997-03-13 |
| CN1131484A (en) | 1996-09-18 |
| AU2548695A (en) | 1996-03-04 |
| WO1996004725A1 (en) | 1996-02-15 |
| EP0721711A1 (en) | 1996-07-17 |
| CN1064799C (en) | 2001-04-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2171978C (en) | Method and system for providing uplink/downlink collision avoidance in a wireless communication system | |
| US6636496B1 (en) | Packet data communication device and method in mobile communication system | |
| EP0941620B1 (en) | Method and apparatus for improving performance of a packet communications system | |
| US5594738A (en) | Time slot allocation method | |
| EP0621708B1 (en) | An adaptive medium access control scheme for wireless LAN | |
| US7522630B2 (en) | Unified channel access for supporting quality of service (QoS) in a local area network | |
| EP1626594B1 (en) | Method and apparatus for communicating in a wireless communication system | |
| US6324172B1 (en) | Method of rate allocation in a data communications network | |
| US20060098604A1 (en) | Method and apparatus for contention management in a radio-based packet network | |
| CA2171976C (en) | Method and system for efficiently optimizing throughput and minimizing delay for a channel in a communication system | |
| EP1627476B1 (en) | Scheduler and method of scheduling data for communication between a node station and plurality of radio terminals | |
| US20030081577A1 (en) | Fast message exchange method for a radio communication system | |
| EP1652342B1 (en) | Method, access point and program product for providing bandwidth and airtime fairness in wireless networks | |
| US6831894B1 (en) | Method and a system for reserving transmission capacity | |
| JP3284977B2 (en) | Transmission method of retransmission control information | |
| JPH04252526A (en) | Base station control mini-slot reservation random access control system | |
| KR20000040268A (en) | Medium access control method for voice and data integrated service in cdma network | |
| Lu et al. | A combined polling and random access protocol for integrated voice and data wireless networks | |
| Needham et al. | QCRA-a packet data multiple access protocol for ESMR systems | |
| van den Eijnden | A multiple access protocol for a dynamic car navigation system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |