CA2486982C - Arq mac for ad-hoc communication networks - Google Patents
Arq mac for ad-hoc communication networks Download PDFInfo
- Publication number
- CA2486982C CA2486982C CA2486982A CA2486982A CA2486982C CA 2486982 C CA2486982 C CA 2486982C CA 2486982 A CA2486982 A CA 2486982A CA 2486982 A CA2486982 A CA 2486982A CA 2486982 C CA2486982 C CA 2486982C
- Authority
- CA
- Canada
- Prior art keywords
- channel
- nodes
- node
- mode
- messages
- 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 - Lifetime
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0023—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the signalling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
- H04L12/407—Bus networks with decentralised control
- H04L12/413—Bus networks with decentralised control with random access, e.g. carrier-sense multiple-access with collision detection (CSMA-CD)
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/16—Time-division multiplex systems in which the time allocation to individual channels within a transmission cycle is variable, e.g. to accommodate varying complexity of signals, to vary number of channels transmitted
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/1887—Scheduling and prioritising arrangements
-
- 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
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/18—Negotiating wireless communication parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
A system and method for a media access control (MAC) algorithm with separate operation modes for good channel and bad channel communication. Variables, including channel vector values transmitted in request-to-send/clear-to-send (RTS/CTS) messages (102-1 and 106), are varied depending on channel mode, resulting in optimized system throughput. In a first mode, the present invention provides a system and method to estimate a channel vector length (102-1), and communicate the length to a first node and any associated groups of nodes receiving the RTS/CTS sequence. In a second mode, a maximum channel vector length is used (106), as retransmissions are less probable in good channels.
Description
ARQ MAC For Ad-Hoc Communication Networks BACKGROUND OF THE INVENTION
Field of the Invention:
[0001] The present invention relates to a media access control (MAC) algorithm containing two modes, and a method for using the same. Specifically, the present invention relates to a MAC algorithm with separate operation modes for good channel and bad channel communication in a communication network, such as a wireless ad-hoc communication network. In each mode, the MAC algorithm is configured, to vary operational parameters, including channel vector values transmitted in request-to-send/clear-to-send (RTS/CTS) messages, depending on the channel mode indicated.
Description of the Related Art:
Field of the Invention:
[0001] The present invention relates to a media access control (MAC) algorithm containing two modes, and a method for using the same. Specifically, the present invention relates to a MAC algorithm with separate operation modes for good channel and bad channel communication in a communication network, such as a wireless ad-hoc communication network. In each mode, the MAC algorithm is configured, to vary operational parameters, including channel vector values transmitted in request-to-send/clear-to-send (RTS/CTS) messages, depending on the channel mode indicated.
Description of the Related Art:
[0002] Wireless communications networks, such as mobile wireless telephone networks, have become increasingly prevalent over the past decade. These wireless communications networks are commonly referred to as "cellular networks", because the network infrastructure is arranged to divide the service area into a plurality of regions called "cells". A terrestrial cellular network includes a plurality of interconnected base stations, or base nodes, that are distributed geographically at designated locations throughout the service area. Each base node includes one or more transceivers that are capable of transmitting and receiving electromagnetic signals, such as radio frequency (RF) communications signals, to and from mobile user nodes, such as wireless telephones, located within the coverage area. The communications signals include, for example, voice data that has been modulated according to a desired modulation technique and transmitted as data packets. As can be appreciated by one skilled in the art, network nodes transmit and receive data packet communications in a multiplexed format, such as time-division multiple access (TDMA) format, code-division multiple access (CDMA) format, or frequency-division multiple access (FDMA) format, which enables a single transceiver at the base node to communicate simultaneously with several mobile nodes in its coverage area.
100031 In recent years, a type of mobile communications network known as an "ad-hoc"
network has been developed for use by the military. In this type of network, each mobile node is capable of operating as a base station or router for other mobile nodes, thereby eliminating the need for a fixed infrastructure of base stations. Details of an ad-hoc network are set forth in U.S. Patent No. 5,943,322 to Mayor.
100041 More sophisticated ad-hoc networks are also being developed which, in addition to enabling mobile nodes to communicate with each other as in a conventional ad-hoc network, further enable the mobile nodes to access a fixed network and communicate with other mobile nodes, such as those on the public switched telephone network (PSTN), and on other networks, such as the Internet. Details of these advanced types of ad-hoc networks are described in U.S. Patent No. 7,072,650 entitled "Ad Hoc Peer-to-Peer Mobile Radio Access System Interfaced to the PSTN and Cellular Networks", in U.S. Patent No.
6,807,165 entitled "Time Division Protocol for an Ad-Hoc, Peer-to-Peer Radio Network Having Coordinating Channel Access to Shared Parallel Data Channels with Separate Reservation Channel", and in U.S. Patent No. 6,873,839 entitled "Prioritized-Routing for an Ad-Hoc, Peer-to-Peer, Mobile Radio Access System".
100051 Communication between nodes, however, is often subject to interference and transmission errors. To minimize the occurrence of erroneous data, receivers and transmitters may be configured to detect transmission errors in a number of ways and if detected, request retransmissions. For instance, a data transmission system between nodes may include an automatic repeat request (ARQ) transmitter and receiver, each adapted to use an error correction code. As may be appreciated by one skilled in the art, the ARQ
transmitter may be used to include error detection codes in the transmission data stream to a remote receiver.
The ARQ receiver may then be used to detect errors in the data stream using such codes and request retransmission from the transmitter. Further details of ARQ
application and use of error detection codes may be found in U.S. Patent No. 5,629,948 to Hagiwara et at., and in U.S. Patent No. 5,784,362 to Turina. The selective use of ARQ with a sliding window transport mechanism is also discussed in U.S. Patent No. 5,717,689 to Ayanoglu, and still
100031 In recent years, a type of mobile communications network known as an "ad-hoc"
network has been developed for use by the military. In this type of network, each mobile node is capable of operating as a base station or router for other mobile nodes, thereby eliminating the need for a fixed infrastructure of base stations. Details of an ad-hoc network are set forth in U.S. Patent No. 5,943,322 to Mayor.
100041 More sophisticated ad-hoc networks are also being developed which, in addition to enabling mobile nodes to communicate with each other as in a conventional ad-hoc network, further enable the mobile nodes to access a fixed network and communicate with other mobile nodes, such as those on the public switched telephone network (PSTN), and on other networks, such as the Internet. Details of these advanced types of ad-hoc networks are described in U.S. Patent No. 7,072,650 entitled "Ad Hoc Peer-to-Peer Mobile Radio Access System Interfaced to the PSTN and Cellular Networks", in U.S. Patent No.
6,807,165 entitled "Time Division Protocol for an Ad-Hoc, Peer-to-Peer Radio Network Having Coordinating Channel Access to Shared Parallel Data Channels with Separate Reservation Channel", and in U.S. Patent No. 6,873,839 entitled "Prioritized-Routing for an Ad-Hoc, Peer-to-Peer, Mobile Radio Access System".
100051 Communication between nodes, however, is often subject to interference and transmission errors. To minimize the occurrence of erroneous data, receivers and transmitters may be configured to detect transmission errors in a number of ways and if detected, request retransmissions. For instance, a data transmission system between nodes may include an automatic repeat request (ARQ) transmitter and receiver, each adapted to use an error correction code. As may be appreciated by one skilled in the art, the ARQ
transmitter may be used to include error detection codes in the transmission data stream to a remote receiver.
The ARQ receiver may then be used to detect errors in the data stream using such codes and request retransmission from the transmitter. Further details of ARQ
application and use of error detection codes may be found in U.S. Patent No. 5,629,948 to Hagiwara et at., and in U.S. Patent No. 5,784,362 to Turina. The selective use of ARQ with a sliding window transport mechanism is also discussed in U.S. Patent No. 5,717,689 to Ayanoglu, and still
3 another ARQ retransmission technique using a "go-back-n" ARQ command is discussed in U.S. Patent No. 4,726,027 to Nakamura et al.
[0006] However, ARQ media access control (MAC) for ad-hoc networks encounter several difficulties. As known to those skilled in the art, data packet collisions can occur if transmissions overlap. In such cases, an ACK will not be received and both packets must be retransmitted. As noted in an article by Garcia-Luna-Aceves et al., entitled "Reversing The Collision-Avoidance Handshake In Wireless Networks", International Conference on Mobile Computing and Networking archive Proceedings of the 5th Annual ACM/IEEE
International Conference on Mobile Computing and Networking, Seattle, Washington, United States, 1999, pages: 120 - 131, one solution to packet collisions involves split-channel reservation multiple access (SRMA) wherein a node requiring to transmit data to a receiver first sends a request-to-send (RTS) packet to the receiver, who responds with a clear-to-send (CTS) packet if it receives the RTS correctly. However, multichannel MAC design, which is basically an extension of multiple access with collision avoidance (MACA) algorithm, typically cannot efficiently handle such ARQ functions. Additional details of the MACA
algorithm is presented in an article by Phil Kam, entitled "MACA-A New Channel Access Method For Packet Radio", ARRL/CRRL Amateur Radio 9th computer Networking Conference, 1990, pages 134 - 140, and in an article by Tang et al., entitled "Collision-Avoidance Transmission Scheduling For Ad-Hoc Networks", Communications, 2000. ICC 2000. 2000 IEEE
International Conference, 2000. Volume: 3, page(s): 1788 - 1794 vol. 3, New Orleans, LA, USA.
[0007] Where retransmissions are required, the MACA algorithm handles ARQ by repeating the whole request to send/clear to send channel access sequence.
This includes transmission of an entire channel vector, equal to the length of channel reservation. This is inefficient in some channel conditions due to fact that resend will happen with a very high probability. Accordingly, a need exists for an ARQ MAC that can handle ARQ
segment retransmissions more efficiently.
SUMMARY OF THE INVENTION
[0006] However, ARQ media access control (MAC) for ad-hoc networks encounter several difficulties. As known to those skilled in the art, data packet collisions can occur if transmissions overlap. In such cases, an ACK will not be received and both packets must be retransmitted. As noted in an article by Garcia-Luna-Aceves et al., entitled "Reversing The Collision-Avoidance Handshake In Wireless Networks", International Conference on Mobile Computing and Networking archive Proceedings of the 5th Annual ACM/IEEE
International Conference on Mobile Computing and Networking, Seattle, Washington, United States, 1999, pages: 120 - 131, one solution to packet collisions involves split-channel reservation multiple access (SRMA) wherein a node requiring to transmit data to a receiver first sends a request-to-send (RTS) packet to the receiver, who responds with a clear-to-send (CTS) packet if it receives the RTS correctly. However, multichannel MAC design, which is basically an extension of multiple access with collision avoidance (MACA) algorithm, typically cannot efficiently handle such ARQ functions. Additional details of the MACA
algorithm is presented in an article by Phil Kam, entitled "MACA-A New Channel Access Method For Packet Radio", ARRL/CRRL Amateur Radio 9th computer Networking Conference, 1990, pages 134 - 140, and in an article by Tang et al., entitled "Collision-Avoidance Transmission Scheduling For Ad-Hoc Networks", Communications, 2000. ICC 2000. 2000 IEEE
International Conference, 2000. Volume: 3, page(s): 1788 - 1794 vol. 3, New Orleans, LA, USA.
[0007] Where retransmissions are required, the MACA algorithm handles ARQ by repeating the whole request to send/clear to send channel access sequence.
This includes transmission of an entire channel vector, equal to the length of channel reservation. This is inefficient in some channel conditions due to fact that resend will happen with a very high probability. Accordingly, a need exists for an ARQ MAC that can handle ARQ
segment retransmissions more efficiently.
SUMMARY OF THE INVENTION
4 [0008] An object of the present invention is to provide a system and method of media access control (MAC) which handles ARQ segment retransmissions more efficiently in ad-hoc communication networks.
[0009] Another object of the present invention is to provide a system and method for estimating a channel vector length is a first mode of operation, and communicating the length to a first group of nodes for use in RTS/CTS sequences.
[0010] Another object of the present invention is to provide a system and method for monitoring a data channel to determine an actual channel vector length, and communicating the actual length to a first group of nodes for use in RTS/CTS sequences.
[0011] Still another object of the present invention is to provide a system and method for a second mode of operation, wherein the true channel vector is communicated to a first group of nodes for use in RTS/CTS sequences.
[0012] These and other objects are substantially achieved by providing a system and method for a MAC algorithm with separate operation modes. Individual operation modes can be created based on channel specifics, including a separate mode for good channel and bad channel communication. For each mode, channel vector values transmitted during collision avoidance operations, such as in an exchange of request-to-send/clear-to-send (RTS/CTS) messages, are varied depending on channel mode, thus resulting in optimized system throughput.
[0013] In a first mode, the present invention provides a system and method to estimate a channel vector length, and communicate the length to a first node, and an associated group of nodes receiving the RTS/CTS sequence. Each node then maintains this channel length for use in their own RTS/CTS sequences. Additionally, the data channel is monitored in the case of bad channels, to determine an actual channel vector length by monitoring partial and complete acknowledgement (ACK) messages. Once the actual channel vector length is determined, it can be communicated to the associated group of nodes directly, in the case of individual RTS/CTS sequences, or as a group, in the case where the nodes monitor adjacent RTS/CTS sequences. In a second mode, a maximum channel vector length is used, as retransmissions are less probable in good channels.
[0014] Specifically, in good channel operation mode, the true channel vector is communicated in the RTS/CTS and used. In bad channel operation mode, the estimated channel vector is communicated in the RTS/CTS and used, however the data channel is monitored for partial and complete ACK messages to detect the actual channel vector. This actual channel vector is then communicated in the RTS/CTS and used, and provided to other nodes to update channel vector information.
BRIEF DESCRIPTION OF THE DRAWINGS
[0015] These and other objects, advantages and novel features of the invention will be more readily appreciated from the following detailed description when read in conjunction with the accompanying drawings, in which:
[0016] Fig. 1 is a block diagram of an example ad-hoc packet switched wireless communications network including a plurality of nodes in accordance with an embodiment of the present invention;
[0017] Fig. 2 is a block diagram illustrating an example of a mobile node employed in the network shown in Fig. 1;
[0018] Fig. 3 is a slot diagram illustrating an example of a channel and channel vector used by nodes in the network shown in Fig. 1 in accordance with an embodiment of the present invention; and [0019] Fig. 4A-4E are diagrams illustrating an example of a communication between nodes in a network as shown in Fig. 1 performed in accordance with an embodiment of the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[00201 Fig. 1 is a block diagram illustrating an example of an ad-hoc packet-switched wireless communications network 100 employing an embodiment of the present invention.
Specifically, the network 100 includes a plurality of mobile wireless user terminals 102-1 through 102-n (referred to generally as nodes 102 or mobile nodes 102), and can, but is not required to, include a fixed network 104 having a plurality of access points 106-1, 106-2, 106-n (referred to generally as nodes 106 or access points 106), for providing nodes 102 with access to the fixed network 104. The fixed network 104 can include, for example, a core local access network (LAN), and a plurality of servers and gateway routers to provide network nodes with access to other networks, such as other ad-hoc networks, the public switched telephone network (PSTN) and the Internet. The network 100 may also include a plurality of fixed routers 107-1 through 107-n (referred to generally as nodes 107 or routers 107) for routing data packets between other nodes 102, 106 or 107. It is noted that for purposes of this discussion, the nodes discussed above can be collectively referred to as "nodes 102, 106 and 107", or simply "nodes" or "terminals". As can be appreciated by one skilled in the art, the nodes 102, 106 and 107 are capable of communicating with each other directly, or via one or more other nodes operating as routers for packets being sent between nodes, as described in U.S. Patent No. 5,943,322 to Mayor, and in U.S. Patent Nos.
7,072,650, 6,807,165 and 6,873,839, referenced above.
100211 As shown in Figure 2, each node 102, 106 and 107 includes a transceiver which is coupled to an antenna 110 and is capable of receiving and transmitting signals, such as packetized signals, to and from the node 102, 106 or 107, under the control of a controller 112. The packetized data signals can include, for example, voice, data or multimedia information, and packetized control signals, including node routing and update information.
100221 Each node 102, 106 and 107 further includes a memory 114, such as a random access memory (RAM), that is capable of storing, among other things, routing information pertaining to itself and other nodes in the network. The nodes 102, 106 and 107 periodically exchange respective routing information, referred to as routing advertisements, with each other via a broadcasting mechanism at various intervals, such as when a new node enters the network, or when existing nodes in the network move.
10023] As further shown in Figure 2, certain nodes, especially mobile nodes 102, can include a host 116 which may consist of any number of devices, such as a notebook computer terminal, mobile telephone unit, mobile data unit, or any other suitable device. Each node 102, 106 and 107 also includes the appropriate hardware and software to perform Internet Protocol (IP) and Address Resolution Protocol (ARP), the purposes of which can be readily appreciated by one skilled in the art. The appropriate hardware and software to perform transmission control protocol (TCP) and user datagram protocol (UDP) may also be included.
Additionally, each node includes the appropriate hardware and software to perform automatic repeat request (ARQ) functions and media access control (MAC), as set forth in greater detail below.
100241 As stated earlier, multichannel MAC design typically cannot efficiently handle ARQ functions. To implement ARQ MAC for ad-hoc networks in accordance with an embodiment of the present invention, the transmitter 108 of a node 102, 106 or 107 may be directed to output a bit stream of transmission data, which are then given to a ARQ
transmitter. At the ARQ transmitter, or transceiver, error detection codes are attached to the transmission data and resulting transmission signals in the ARQ segments are transmitted to an ARQ receiver on a reception side via a transmission path. At the ARQ
receiver, the presence of an error is checked for each segment of the received signals, and a re-transmission request signal is transmitted to the ARQ transmitter whenever an error is detected. When no errors are detected in the received signals, the ARQ
receiver, or transceiver, outputs the received data to a reception side data terminal and transmits a successful reception signal, an acknowledgment (ACK) message, to the ARQ
transmitter.
However, multiple modes of operation to achieve this result can be implemented depending on channel characteristics and the probability of retransmissions.
10025] To achieve this in accordance with an embodiment of the present invention, the transceiver 108 of a node, such as nodes 102, 106 and 107 of Fig. 1, is directed to send a media access control protocol data unit (MPDU) as a stream of segments to a receiving node.
Each segment contains forward error correction (FEC) and error detection, for example, Viterbi encoding for FEC, and cyclic redundancy check (CRC) error detection.
As described above, at the ARQ receiver, the presence of an error is checked for each segment of the received signals, and a re-transmission request signal is transmitted to the ARQ transmitter whenever an error is detected.
[00261 When no errors are detected in the received signals, a transmitter associated with the ARQ receiver, such as a transceiver in which the receiver can be included, outputs the received data to a reception side data terminal and transmits an ACK message to the ARQ
transmitter. The ACK message can be provided upon completion of all segments, or partial segments. At the receiving node, if a segment has errors after FEC has been performed and the segment has no information to locate errors, the entire segment or partial segment has to be retransmitted.
[00271 As described above, each segment can be transmitted as a physical layer packet, each of which has parity and forward error correcting coding. A parity code is used to verify correctness of the data in the segment, and segments that fail parity check are discarded by receiver. An acknowledgement (ACK) of successful reception is sent by the receiving node 102, 106 or 107 only after all the segments or partial segments in the MPDU
are received correctly. A negative acknowledgement (NACK) is sent in the event of failed or erroneous segment reception, such as when a packet collision occurs.
[00281 As noted above, collision avoidance can be achieved using a control-signal handshake between transmitting and receiving nodes. The multiple access with collision avoidance (MACA) protocol of the present embodiment uses such a handshake technique between nodes consisting of a request-to-send (RTS) control packet sent from a source node to a destination node which in response, replies with a clear-to-send (CTS) control packet.
However, typically a MACA algorithm handles ARQ retransmissions by repeating the whole request-to-send/clear-to-send (RTS/CTS) channel access sequence. The embodiment of the present invention described below discloses a MACA algorithm containing multiple modes, such as a first mode of operation for good communication channels and a second mode for bad channels. These modes optimize system throughput in different channel conditions. As known to those skilled in the art, channel conditions can vary between "good"
and "bad"
depending upon factors such as interference from other users, radio propagation, noise and fading due to multipath and high mobility. One example of a bad channel is when average nonfade period (ANFP) is smaller, or of the same duration, as one transmitted segment.
[0029] In each mode, the channel vector, or segment stream, monitored for ACK/NACK
messages is adjusted based upon a probability of retransmission. For example, in good channel mode, where there are lower probabilities of retransmission, the channel vector transmitted in RTS/CTS is the true channel vector, or true length of channel reservation. This can be indicated by a bit in RTS/CTS messages. In bad channel mode, where there are higher probabilities of retransmission occurring, the channel vector transmitted in RTS/CTS is an estimate of the maximum length and actual communication can be shorter. Fig. 3 illustrates channels in a first and second mode of operation in accordance with an embodiment of the present invention.
[0030] Fig. 3 is a slot diagram illustrating an example of a channel and channel vector used by nodes in the network shown in Fig. 1 in accordance with an embodiment of the present invention. Channel 118 and 120 of Fig. 3 represent channels used in communications between nodes in a network, such as network 100 of Fig. 1. Each channel is occupied by a stream of data segments during communication, and each channel vector represents a set number of segments. Channel 120 represents a maximum channel vector, based on estimated retransmissions of segments in the channel. This value is announced in RTS/CTS
messages between nodes. Channel 118 represents an actual channel vector determined by monitoring the data channel through the use of the present embodiment. The two modes of operation can be described using the channel illustration of Fig. 3.
[0031] In channel 118 of Fig. 3, a first mode is shown applied to a representative bad channel, where there are higher probabilities of retransmission occurring. A
channel vector 118-1, comprising a series of segments transmitted in the RTS/CTS sequence, is based on an estimate of the maximum channel vector length including retransmissions. The embodiment of the present invention directs the communicating nodes to monitor the data channel for either partial segment ACK or all segments good ACK messages, which serve to define the actual channel vector length. In this case, the channel vector 118-1 can be shorter than the maximum channel vector. The vector length is defined by partial segment ACK
messages in the channel, such as 118-2, and all segments good ACK messages. Therefore the channel vector is shorter, resulting in a time savings shown as the channel duration 118-4. For a representative good channel, where there are lower probabilities of retransmission, the channel vector transmitted in the RTS/CTS sequence is the true channel vector, or true length of channel reservation and this can be indicated by a bit in RTS/CTS messages.
As the probability of retransmission is low, a longer channel vector has less impact.
[0032] In the channels of Fig. 3, maximum estimated channel vector value is used if a source knows that a channel is difficult and retransmissions are probable. The maximum channel vector is announced in the RTS/CTS based on the estimated retransmission of segments in the channel. Retransmissions can be done without accessing the control channel as long as the channel is reserved. Other terminals in the network have to use estimated maximum channel vector or, they can get real channel values by monitoring the data channel.
This allows, for example, a "multi-headed IAP" to be able to obtain real channel vector values by receiving all the channels and being able to capture all successful segment acknowledgement (ACK) messages in the data channel.
[0033] If an intelligent access point (IAP) 106 or wireless router (WR) 107 of Fig.1, which can monitor data ACK messages in all channels, sends an RTS to a terminal, such as a node 102 which cannot monitor all channels, the node may update the maximum channel vectors based on information that the IAP provides in the RTS packet. The IAP
may need to associate information that the node can use to verify that the IAP/WR has information equaling, either heard or transmitted, all segment good ACK messages indicating that the channel vector was shorter than the announced maximum value.
[0034] One way to achieve this in accordance with an embodiment of the present invention, is to compute the checksum of addresses of a node marked as having a maximum vector in a channel that is announced free by the IAP. This checksum, transmitted in an RTS
packet, can be used by the node to verify that the address entry in the IAP/WR
channel monitoring table is the same entry the node has in it's table. If not, the node can modify the channel vector information to a correct value.
[0035] If a terminal has a channel vector to a 48 bit MAC address, aa.bb.cc.dd.ee.ff, where each letter is 4 bits, then this entry has to be compressed so that it can fit in the RTS. The RTS can not be long as length increases control channel usage and increases the amount of access collisions. Checksum is just an example of a function a=F(MAC address) that is computed in transmit and receive and can be used to verify that the channel is ready. For example, when terminal A sends a packet to terminal B, and terminal A knows that terminal C, who transmitted previous RTS, has finished communication earlier than it announced in RTS, then terminal A sends RTS
packet to terminal B with a=F(MAC address of C), as channel vector is reserved for communication by terminal C. Terminal B computes a=F(MAC address of terminal that reserved channel proposed in RTS) and compares that to the transmission by terminal A. If it matches, then terminal B knows that terminal A knows more about the channel than B and can continue and respond with CTS. A checksum function is presented as an example, however any suitable function can be used for this purpose.
[0036] Figs. 4A-4E are diagrams illustrating an example of a communication between nodes in the network shown in Fig. 1 performed in accordance with an embodiment of the present invention. Figs. 4A-4E illustrate several nodes of network 100 in Fig.
1 during communication. The network 100-1 of Fig. 4A includes an intelligent access point (IAP) 106 in communication with nodes 102-1, 102-2, 102-3 and 102-4, however any number of nodes 102, 106 and 107 of Fig. 1 can be included. Specifically, Figs. 4A-4E
illustrate the communication of four nodes with an IAP when there are hidden nodes in the network (not shown).
[0037] The communication between nodes, implementing an RTS/CTS sequence in accordance with an embodiment of the present invention, is shown in a series of communications. In a first communication shown in Fig. 4A, the IAP 106 at the center of the network 100-1 receives request-to-send (RTS) messages with estimated channel vectors with one retransmission from node 102-1. The estimated length of the communication in this channel "A" is 2 (transmission + retransmission), however, any estimated length may be considered, as this is presented as one example.
[0038] In Fig. 4B, the IAP responds to the RTS message with a CTS message that can be heard by all nodes within the IAP's broadcast range. As shown in Fig. 4C, node transmits a data stream to the IAP 106 in response to receipt of the CTS
message. Upon successful completion of transmission and any retransmissions, the IAP 106 sends an all segments good ACK message to node 102-1 in Fig. 4D. In this communication, nodes 102-2, 102-3 and 102-4 do not monitor the data channel, and each thinks that channel vector "A" is reserved for a vector length of 2 based on the CTS message provided by the IAP
to node 102-1 which is heard by each node 102-1, 102-2, 102-3 and 102-4. However, the IAP
106 (and any remaining nodes configured to do so) monitors the data channel and determines an actual channel vector length for channel "A".
[0039] After communicating with node 102-1, the IAP can move to another node as shown in Fig. 4E, such as node 102-3, and transmit an RTS message to node 102-3 and specify that channel "A" is free and a checksum for address of node 102-1.
Node 102-3 compares the checksum and verifies that the channel is free and the checksum matches the address of the node that is marked as using the channel. This can be repeated for each node of network 100-1.
[0040] In a second embodiment of the present invention, each node can verify information received regarding the maximum channel vector is from the same IAP
address from which a free channel message is received. The same operation can be done by nodes 102-2 and 102-4 if each are monitoring the control channel when they hear the RTS message as nbr RTS.
[0041] The node communication works the same way in examples in which the IAP
transmits data frames. In this case, the IAP receives the all segments good ACK message and can then transmit RTS or CTS messages with the channel marked as free based on channel monitoring.
[0042] The embodiment of the present invention described above reduces the overhead of retransmissions by having retransmissions contained in a data channel.
Furthermore, the new media access control described above operates efficiently in both good and bad channel conditions due to operation capabilities in two modes. The embodiment is very efficient when communicating with multi-headed infrastructures and serves to reduce maximum time to deliver a MPDU in a fading channel.
[0043] Although only a few exemplary embodiments of the present invention have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of this invention. Accordingly, all such modifications are intended to be included within the scope of this invention as defined.
[0009] Another object of the present invention is to provide a system and method for estimating a channel vector length is a first mode of operation, and communicating the length to a first group of nodes for use in RTS/CTS sequences.
[0010] Another object of the present invention is to provide a system and method for monitoring a data channel to determine an actual channel vector length, and communicating the actual length to a first group of nodes for use in RTS/CTS sequences.
[0011] Still another object of the present invention is to provide a system and method for a second mode of operation, wherein the true channel vector is communicated to a first group of nodes for use in RTS/CTS sequences.
[0012] These and other objects are substantially achieved by providing a system and method for a MAC algorithm with separate operation modes. Individual operation modes can be created based on channel specifics, including a separate mode for good channel and bad channel communication. For each mode, channel vector values transmitted during collision avoidance operations, such as in an exchange of request-to-send/clear-to-send (RTS/CTS) messages, are varied depending on channel mode, thus resulting in optimized system throughput.
[0013] In a first mode, the present invention provides a system and method to estimate a channel vector length, and communicate the length to a first node, and an associated group of nodes receiving the RTS/CTS sequence. Each node then maintains this channel length for use in their own RTS/CTS sequences. Additionally, the data channel is monitored in the case of bad channels, to determine an actual channel vector length by monitoring partial and complete acknowledgement (ACK) messages. Once the actual channel vector length is determined, it can be communicated to the associated group of nodes directly, in the case of individual RTS/CTS sequences, or as a group, in the case where the nodes monitor adjacent RTS/CTS sequences. In a second mode, a maximum channel vector length is used, as retransmissions are less probable in good channels.
[0014] Specifically, in good channel operation mode, the true channel vector is communicated in the RTS/CTS and used. In bad channel operation mode, the estimated channel vector is communicated in the RTS/CTS and used, however the data channel is monitored for partial and complete ACK messages to detect the actual channel vector. This actual channel vector is then communicated in the RTS/CTS and used, and provided to other nodes to update channel vector information.
BRIEF DESCRIPTION OF THE DRAWINGS
[0015] These and other objects, advantages and novel features of the invention will be more readily appreciated from the following detailed description when read in conjunction with the accompanying drawings, in which:
[0016] Fig. 1 is a block diagram of an example ad-hoc packet switched wireless communications network including a plurality of nodes in accordance with an embodiment of the present invention;
[0017] Fig. 2 is a block diagram illustrating an example of a mobile node employed in the network shown in Fig. 1;
[0018] Fig. 3 is a slot diagram illustrating an example of a channel and channel vector used by nodes in the network shown in Fig. 1 in accordance with an embodiment of the present invention; and [0019] Fig. 4A-4E are diagrams illustrating an example of a communication between nodes in a network as shown in Fig. 1 performed in accordance with an embodiment of the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[00201 Fig. 1 is a block diagram illustrating an example of an ad-hoc packet-switched wireless communications network 100 employing an embodiment of the present invention.
Specifically, the network 100 includes a plurality of mobile wireless user terminals 102-1 through 102-n (referred to generally as nodes 102 or mobile nodes 102), and can, but is not required to, include a fixed network 104 having a plurality of access points 106-1, 106-2, 106-n (referred to generally as nodes 106 or access points 106), for providing nodes 102 with access to the fixed network 104. The fixed network 104 can include, for example, a core local access network (LAN), and a plurality of servers and gateway routers to provide network nodes with access to other networks, such as other ad-hoc networks, the public switched telephone network (PSTN) and the Internet. The network 100 may also include a plurality of fixed routers 107-1 through 107-n (referred to generally as nodes 107 or routers 107) for routing data packets between other nodes 102, 106 or 107. It is noted that for purposes of this discussion, the nodes discussed above can be collectively referred to as "nodes 102, 106 and 107", or simply "nodes" or "terminals". As can be appreciated by one skilled in the art, the nodes 102, 106 and 107 are capable of communicating with each other directly, or via one or more other nodes operating as routers for packets being sent between nodes, as described in U.S. Patent No. 5,943,322 to Mayor, and in U.S. Patent Nos.
7,072,650, 6,807,165 and 6,873,839, referenced above.
100211 As shown in Figure 2, each node 102, 106 and 107 includes a transceiver which is coupled to an antenna 110 and is capable of receiving and transmitting signals, such as packetized signals, to and from the node 102, 106 or 107, under the control of a controller 112. The packetized data signals can include, for example, voice, data or multimedia information, and packetized control signals, including node routing and update information.
100221 Each node 102, 106 and 107 further includes a memory 114, such as a random access memory (RAM), that is capable of storing, among other things, routing information pertaining to itself and other nodes in the network. The nodes 102, 106 and 107 periodically exchange respective routing information, referred to as routing advertisements, with each other via a broadcasting mechanism at various intervals, such as when a new node enters the network, or when existing nodes in the network move.
10023] As further shown in Figure 2, certain nodes, especially mobile nodes 102, can include a host 116 which may consist of any number of devices, such as a notebook computer terminal, mobile telephone unit, mobile data unit, or any other suitable device. Each node 102, 106 and 107 also includes the appropriate hardware and software to perform Internet Protocol (IP) and Address Resolution Protocol (ARP), the purposes of which can be readily appreciated by one skilled in the art. The appropriate hardware and software to perform transmission control protocol (TCP) and user datagram protocol (UDP) may also be included.
Additionally, each node includes the appropriate hardware and software to perform automatic repeat request (ARQ) functions and media access control (MAC), as set forth in greater detail below.
100241 As stated earlier, multichannel MAC design typically cannot efficiently handle ARQ functions. To implement ARQ MAC for ad-hoc networks in accordance with an embodiment of the present invention, the transmitter 108 of a node 102, 106 or 107 may be directed to output a bit stream of transmission data, which are then given to a ARQ
transmitter. At the ARQ transmitter, or transceiver, error detection codes are attached to the transmission data and resulting transmission signals in the ARQ segments are transmitted to an ARQ receiver on a reception side via a transmission path. At the ARQ
receiver, the presence of an error is checked for each segment of the received signals, and a re-transmission request signal is transmitted to the ARQ transmitter whenever an error is detected. When no errors are detected in the received signals, the ARQ
receiver, or transceiver, outputs the received data to a reception side data terminal and transmits a successful reception signal, an acknowledgment (ACK) message, to the ARQ
transmitter.
However, multiple modes of operation to achieve this result can be implemented depending on channel characteristics and the probability of retransmissions.
10025] To achieve this in accordance with an embodiment of the present invention, the transceiver 108 of a node, such as nodes 102, 106 and 107 of Fig. 1, is directed to send a media access control protocol data unit (MPDU) as a stream of segments to a receiving node.
Each segment contains forward error correction (FEC) and error detection, for example, Viterbi encoding for FEC, and cyclic redundancy check (CRC) error detection.
As described above, at the ARQ receiver, the presence of an error is checked for each segment of the received signals, and a re-transmission request signal is transmitted to the ARQ transmitter whenever an error is detected.
[00261 When no errors are detected in the received signals, a transmitter associated with the ARQ receiver, such as a transceiver in which the receiver can be included, outputs the received data to a reception side data terminal and transmits an ACK message to the ARQ
transmitter. The ACK message can be provided upon completion of all segments, or partial segments. At the receiving node, if a segment has errors after FEC has been performed and the segment has no information to locate errors, the entire segment or partial segment has to be retransmitted.
[00271 As described above, each segment can be transmitted as a physical layer packet, each of which has parity and forward error correcting coding. A parity code is used to verify correctness of the data in the segment, and segments that fail parity check are discarded by receiver. An acknowledgement (ACK) of successful reception is sent by the receiving node 102, 106 or 107 only after all the segments or partial segments in the MPDU
are received correctly. A negative acknowledgement (NACK) is sent in the event of failed or erroneous segment reception, such as when a packet collision occurs.
[00281 As noted above, collision avoidance can be achieved using a control-signal handshake between transmitting and receiving nodes. The multiple access with collision avoidance (MACA) protocol of the present embodiment uses such a handshake technique between nodes consisting of a request-to-send (RTS) control packet sent from a source node to a destination node which in response, replies with a clear-to-send (CTS) control packet.
However, typically a MACA algorithm handles ARQ retransmissions by repeating the whole request-to-send/clear-to-send (RTS/CTS) channel access sequence. The embodiment of the present invention described below discloses a MACA algorithm containing multiple modes, such as a first mode of operation for good communication channels and a second mode for bad channels. These modes optimize system throughput in different channel conditions. As known to those skilled in the art, channel conditions can vary between "good"
and "bad"
depending upon factors such as interference from other users, radio propagation, noise and fading due to multipath and high mobility. One example of a bad channel is when average nonfade period (ANFP) is smaller, or of the same duration, as one transmitted segment.
[0029] In each mode, the channel vector, or segment stream, monitored for ACK/NACK
messages is adjusted based upon a probability of retransmission. For example, in good channel mode, where there are lower probabilities of retransmission, the channel vector transmitted in RTS/CTS is the true channel vector, or true length of channel reservation. This can be indicated by a bit in RTS/CTS messages. In bad channel mode, where there are higher probabilities of retransmission occurring, the channel vector transmitted in RTS/CTS is an estimate of the maximum length and actual communication can be shorter. Fig. 3 illustrates channels in a first and second mode of operation in accordance with an embodiment of the present invention.
[0030] Fig. 3 is a slot diagram illustrating an example of a channel and channel vector used by nodes in the network shown in Fig. 1 in accordance with an embodiment of the present invention. Channel 118 and 120 of Fig. 3 represent channels used in communications between nodes in a network, such as network 100 of Fig. 1. Each channel is occupied by a stream of data segments during communication, and each channel vector represents a set number of segments. Channel 120 represents a maximum channel vector, based on estimated retransmissions of segments in the channel. This value is announced in RTS/CTS
messages between nodes. Channel 118 represents an actual channel vector determined by monitoring the data channel through the use of the present embodiment. The two modes of operation can be described using the channel illustration of Fig. 3.
[0031] In channel 118 of Fig. 3, a first mode is shown applied to a representative bad channel, where there are higher probabilities of retransmission occurring. A
channel vector 118-1, comprising a series of segments transmitted in the RTS/CTS sequence, is based on an estimate of the maximum channel vector length including retransmissions. The embodiment of the present invention directs the communicating nodes to monitor the data channel for either partial segment ACK or all segments good ACK messages, which serve to define the actual channel vector length. In this case, the channel vector 118-1 can be shorter than the maximum channel vector. The vector length is defined by partial segment ACK
messages in the channel, such as 118-2, and all segments good ACK messages. Therefore the channel vector is shorter, resulting in a time savings shown as the channel duration 118-4. For a representative good channel, where there are lower probabilities of retransmission, the channel vector transmitted in the RTS/CTS sequence is the true channel vector, or true length of channel reservation and this can be indicated by a bit in RTS/CTS messages.
As the probability of retransmission is low, a longer channel vector has less impact.
[0032] In the channels of Fig. 3, maximum estimated channel vector value is used if a source knows that a channel is difficult and retransmissions are probable. The maximum channel vector is announced in the RTS/CTS based on the estimated retransmission of segments in the channel. Retransmissions can be done without accessing the control channel as long as the channel is reserved. Other terminals in the network have to use estimated maximum channel vector or, they can get real channel values by monitoring the data channel.
This allows, for example, a "multi-headed IAP" to be able to obtain real channel vector values by receiving all the channels and being able to capture all successful segment acknowledgement (ACK) messages in the data channel.
[0033] If an intelligent access point (IAP) 106 or wireless router (WR) 107 of Fig.1, which can monitor data ACK messages in all channels, sends an RTS to a terminal, such as a node 102 which cannot monitor all channels, the node may update the maximum channel vectors based on information that the IAP provides in the RTS packet. The IAP
may need to associate information that the node can use to verify that the IAP/WR has information equaling, either heard or transmitted, all segment good ACK messages indicating that the channel vector was shorter than the announced maximum value.
[0034] One way to achieve this in accordance with an embodiment of the present invention, is to compute the checksum of addresses of a node marked as having a maximum vector in a channel that is announced free by the IAP. This checksum, transmitted in an RTS
packet, can be used by the node to verify that the address entry in the IAP/WR
channel monitoring table is the same entry the node has in it's table. If not, the node can modify the channel vector information to a correct value.
[0035] If a terminal has a channel vector to a 48 bit MAC address, aa.bb.cc.dd.ee.ff, where each letter is 4 bits, then this entry has to be compressed so that it can fit in the RTS. The RTS can not be long as length increases control channel usage and increases the amount of access collisions. Checksum is just an example of a function a=F(MAC address) that is computed in transmit and receive and can be used to verify that the channel is ready. For example, when terminal A sends a packet to terminal B, and terminal A knows that terminal C, who transmitted previous RTS, has finished communication earlier than it announced in RTS, then terminal A sends RTS
packet to terminal B with a=F(MAC address of C), as channel vector is reserved for communication by terminal C. Terminal B computes a=F(MAC address of terminal that reserved channel proposed in RTS) and compares that to the transmission by terminal A. If it matches, then terminal B knows that terminal A knows more about the channel than B and can continue and respond with CTS. A checksum function is presented as an example, however any suitable function can be used for this purpose.
[0036] Figs. 4A-4E are diagrams illustrating an example of a communication between nodes in the network shown in Fig. 1 performed in accordance with an embodiment of the present invention. Figs. 4A-4E illustrate several nodes of network 100 in Fig.
1 during communication. The network 100-1 of Fig. 4A includes an intelligent access point (IAP) 106 in communication with nodes 102-1, 102-2, 102-3 and 102-4, however any number of nodes 102, 106 and 107 of Fig. 1 can be included. Specifically, Figs. 4A-4E
illustrate the communication of four nodes with an IAP when there are hidden nodes in the network (not shown).
[0037] The communication between nodes, implementing an RTS/CTS sequence in accordance with an embodiment of the present invention, is shown in a series of communications. In a first communication shown in Fig. 4A, the IAP 106 at the center of the network 100-1 receives request-to-send (RTS) messages with estimated channel vectors with one retransmission from node 102-1. The estimated length of the communication in this channel "A" is 2 (transmission + retransmission), however, any estimated length may be considered, as this is presented as one example.
[0038] In Fig. 4B, the IAP responds to the RTS message with a CTS message that can be heard by all nodes within the IAP's broadcast range. As shown in Fig. 4C, node transmits a data stream to the IAP 106 in response to receipt of the CTS
message. Upon successful completion of transmission and any retransmissions, the IAP 106 sends an all segments good ACK message to node 102-1 in Fig. 4D. In this communication, nodes 102-2, 102-3 and 102-4 do not monitor the data channel, and each thinks that channel vector "A" is reserved for a vector length of 2 based on the CTS message provided by the IAP
to node 102-1 which is heard by each node 102-1, 102-2, 102-3 and 102-4. However, the IAP
106 (and any remaining nodes configured to do so) monitors the data channel and determines an actual channel vector length for channel "A".
[0039] After communicating with node 102-1, the IAP can move to another node as shown in Fig. 4E, such as node 102-3, and transmit an RTS message to node 102-3 and specify that channel "A" is free and a checksum for address of node 102-1.
Node 102-3 compares the checksum and verifies that the channel is free and the checksum matches the address of the node that is marked as using the channel. This can be repeated for each node of network 100-1.
[0040] In a second embodiment of the present invention, each node can verify information received regarding the maximum channel vector is from the same IAP
address from which a free channel message is received. The same operation can be done by nodes 102-2 and 102-4 if each are monitoring the control channel when they hear the RTS message as nbr RTS.
[0041] The node communication works the same way in examples in which the IAP
transmits data frames. In this case, the IAP receives the all segments good ACK message and can then transmit RTS or CTS messages with the channel marked as free based on channel monitoring.
[0042] The embodiment of the present invention described above reduces the overhead of retransmissions by having retransmissions contained in a data channel.
Furthermore, the new media access control described above operates efficiently in both good and bad channel conditions due to operation capabilities in two modes. The embodiment is very efficient when communicating with multi-headed infrastructures and serves to reduce maximum time to deliver a MPDU in a fading channel.
[0043] Although only a few exemplary embodiments of the present invention have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of this invention. Accordingly, all such modifications are intended to be included within the scope of this invention as defined.
Claims (12)
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
1. A method for communication during collision avoidance operations within an ad hoc communication network (100), the method comprising:
establishing a plurality of modes of operation associated with each of a plurality of channel operation conditions, including a first mode of operation for use with bad communication channels (118) and a second mode of operation for use with good communication channels;
transmitting an estimate of a maximum length of a channel reservation (118-1) in a collision avoidance message by the node (102, 106, 107) when operating in the first mode; and transmitting an actual length of a channel reservation in a collision avoidance message by a node (102, 106, 107) when operating in the second mode.
establishing a plurality of modes of operation associated with each of a plurality of channel operation conditions, including a first mode of operation for use with bad communication channels (118) and a second mode of operation for use with good communication channels;
transmitting an estimate of a maximum length of a channel reservation (118-1) in a collision avoidance message by the node (102, 106, 107) when operating in the first mode; and transmitting an actual length of a channel reservation in a collision avoidance message by a node (102, 106, 107) when operating in the second mode.
2. The method in Claim 1, wherein communication within the bad communication channel (118) includes a high probability of retransmissions.
3. The method in Claim 1, further comprising prior to transmitting the estimate of the maximum length of the channel reservation in the second mode:
estimating the maximum length of the channel reservation based on an expected number of transmitted segments and an expected number of retransmitted segments for a communication in which the channel reservation is associated.
estimating the maximum length of the channel reservation based on an expected number of transmitted segments and an expected number of retransmitted segments for a communication in which the channel reservation is associated.
4. The method in Claim 1, wherein communication within the good communication channel includes a low probability of retransmissions.
5. The method of Claim 1, wherein the channel operation conditions are selected from a group comprising an interference level from other devices, a radio propagation, a noise level, and a fading level due to multipath and high mobility.
6. The method of Claim 1, wherein each of the collision avoidance messages comprise one or more of a request to send message and a clear to send message communicated in a multiple access with collision avoidance (MACA) handshake between the node (102, 106, 107) and one or more other nodes (102, 106, 107).
7. The method of Claim 1, further comprising, prior to transmitting in the second mode step:
monitoring by the node (102, 106, 107) the good communication channel to determine the actual length of the channel reservation.
monitoring by the node (102, 106, 107) the good communication channel to determine the actual length of the channel reservation.
8. The method of Claim 7, further comprising:
receiving at one or more other nodes (102, 106, 107), the actual length of the channel reservation in the collision avoidance message transmitted by the node (102, 106, 107) when operating in the second mode; and maintaining the actual length of the channel reservation at each of the one or more other nodes (102, 106, 107) for use in transmission of one or more other collision avoidance messages.
receiving at one or more other nodes (102, 106, 107), the actual length of the channel reservation in the collision avoidance message transmitted by the node (102, 106, 107) when operating in the second mode; and maintaining the actual length of the channel reservation at each of the one or more other nodes (102, 106, 107) for use in transmission of one or more other collision avoidance messages.
9. The method of Claim 1, further comprising prior to the transmitting in the first mode step:
monitoring by the node (102, 106, 107) the bad communication channel (118) including detecting one or more of partial acknowledgement messages (118-2) and complete acknowledgement (ACK) messages; and estimating the maximum length of the channel reservation using the received one or more of partial acknowledgement messages (118-2) and complete acknowledgement (ACK) messages.
monitoring by the node (102, 106, 107) the bad communication channel (118) including detecting one or more of partial acknowledgement messages (118-2) and complete acknowledgement (ACK) messages; and estimating the maximum length of the channel reservation using the received one or more of partial acknowledgement messages (118-2) and complete acknowledgement (ACK) messages.
10. The method of Claim 9, further comprising:
receiving at one or more other nodes (102, 106, 107), the estimate of the maximum length of the channel reservation in the collision avoidance message transmitted by the node (102, 106, 107) when operating in the first mode; and maintaining the estimate of the maximum length of the channel reservation at each of the one or more other nodes (102, 106, 107) for use in transmission of one or more other collision avoidance messages.
receiving at one or more other nodes (102, 106, 107), the estimate of the maximum length of the channel reservation in the collision avoidance message transmitted by the node (102, 106, 107) when operating in the first mode; and maintaining the estimate of the maximum length of the channel reservation at each of the one or more other nodes (102, 106, 107) for use in transmission of one or more other collision avoidance messages.
11. The method of Claim 10, further comprising at each of the one or more other nodes:
monitoring the bad communication channel (118); and updating the estimated length of the channel reservation based on one or more received messages on the bad communication channel (118).
monitoring the bad communication channel (118); and updating the estimated length of the channel reservation based on one or more received messages on the bad communication channel (118).
12. The method of Claim 1, wherein each of the collision avoidance messages comprise an automatic repeat request (ARQ) retransmission message.
Applications Claiming Priority (5)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US38557402P | 2002-06-05 | 2002-06-05 | |
| US60/385,574 | 2002-06-05 | ||
| US10/375,013 US6687259B2 (en) | 2002-06-05 | 2003-02-28 | ARQ MAC for ad-hoc communication networks and a method for using the same |
| US10/375,013 | 2003-02-28 | ||
| PCT/US2003/017248 WO2003105389A2 (en) | 2002-06-05 | 2003-06-04 | Arq mac for ad-hoc communication networks and a method for using the same |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2486982A1 CA2486982A1 (en) | 2003-12-18 |
| CA2486982C true CA2486982C (en) | 2011-12-13 |
Family
ID=29715228
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2486982A Expired - Lifetime CA2486982C (en) | 2002-06-05 | 2003-06-04 | Arq mac for ad-hoc communication networks |
Country Status (7)
| Country | Link |
|---|---|
| US (1) | US6687259B2 (en) |
| EP (1) | EP1510027A4 (en) |
| JP (1) | JP4447452B2 (en) |
| KR (1) | KR100970543B1 (en) |
| AU (1) | AU2003239917A1 (en) |
| CA (1) | CA2486982C (en) |
| WO (1) | WO2003105389A2 (en) |
Families Citing this family (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040229566A1 (en) * | 2003-05-13 | 2004-11-18 | Weilin Wang | Systems and methods for congestion control in a wireless mesh network |
| US7941149B2 (en) | 2002-05-13 | 2011-05-10 | Misonimo Chi Acquistion L.L.C. | Multi-hop ultra wide band wireless network communication |
| US7835372B2 (en) * | 2002-05-13 | 2010-11-16 | Weilin Wang | System and method for transparent wireless bridging of communication channel segments |
| US7957356B2 (en) | 2002-05-13 | 2011-06-07 | Misomino Chi Acquisitions L.L.C. | Scalable media access control for multi-hop high bandwidth communications |
| US7852796B2 (en) | 2002-05-13 | 2010-12-14 | Xudong Wang | Distributed multichannel wireless communication |
| US8780770B2 (en) * | 2002-05-13 | 2014-07-15 | Misonimo Chi Acquisition L.L.C. | Systems and methods for voice and video communication over a wireless network |
| JP4480726B2 (en) * | 2004-11-26 | 2010-06-16 | 富士通株式会社 | Wireless terminal and wireless communication method |
| US7668146B2 (en) | 2004-12-20 | 2010-02-23 | Connectivities Llc | Internet-oriented ad-hoc network |
| US7717342B2 (en) | 2005-08-26 | 2010-05-18 | Hand Held Products, Inc. | Data collection device having dynamic access to multiple wireless networks |
| US8694435B1 (en) * | 2005-11-14 | 2014-04-08 | American Express Travel Related Services Company, Inc. | System and method for linking point of sale devices within a virtual network |
| KR100728297B1 (en) | 2006-01-17 | 2007-06-13 | 삼성전자주식회사 | Apparatus and method for a wireless resource processing of mobile ad hoc network |
| US8175613B2 (en) | 2006-08-04 | 2012-05-08 | Misonimo Chi Acquisitions L.L.C. | Systems and methods for determining location of devices within a wireless network |
| US8005100B2 (en) * | 2006-09-21 | 2011-08-23 | Active Control Technology Inc. | Network for confined hazardous or other extreme environments |
| JP4861484B2 (en) * | 2006-12-07 | 2012-01-25 | ミソニモ チ アクイジションズ エル．エル．シー． | System and method for assigning time slots and channels |
| JP4793287B2 (en) * | 2007-02-28 | 2011-10-12 | ブラザー工業株式会社 | Communication apparatus and communication system |
| US8971346B2 (en) | 2007-04-30 | 2015-03-03 | Hand Held Products, Inc. | System and method for reliable store-and-forward data handling by encoded information reading terminals |
| US8638806B2 (en) * | 2007-05-25 | 2014-01-28 | Hand Held Products, Inc. | Wireless mesh point portable data terminal |
| US7874483B2 (en) | 2007-11-14 | 2011-01-25 | Hand Held Products, Inc. | Encoded information reading terminal with wireless path selection capability |
| US8654753B2 (en) * | 2008-08-26 | 2014-02-18 | Qualcomm Incorporated | Multichannel TDMA mechanism |
| US8191785B2 (en) * | 2009-03-05 | 2012-06-05 | Hand Held Products, Inc. | Encoded information reading terminal operating in infrastructure mode and ad-hoc mode |
Family Cites Families (122)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US689A (en) | 1838-04-13 | Julius austin | ||
| US948A (en) | 1838-09-26 | Office | ||
| US5784A (en) | 1848-09-19 | Door-spring | ||
| US362A (en) | 1837-08-18 | Tongs | ||
| US231634A (en) * | 1880-08-24 | Oil-can | ||
| US5717A (en) | 1848-08-15 | Straw-gutter | ||
| US5629A (en) | 1848-06-13 | Meat-ctjttek | ||
| US4910521A (en) | 1981-08-03 | 1990-03-20 | Texas Instruments Incorporated | Dual band communication receiver |
| US4494192A (en) | 1982-07-21 | 1985-01-15 | Sperry Corporation | High speed bus architecture |
| JPS59115633A (en) | 1982-12-22 | 1984-07-04 | Toshiba Corp | Information transmitting system |
| JPH0732387B2 (en) * | 1985-02-23 | 1995-04-10 | 株式会社日立製作所 | Data retransmission method |
| 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 |
| US4747130A (en) | 1985-12-17 | 1988-05-24 | American Telephone And Telegraph Company, At&T Bell Laboratories | Resource allocation in distributed control systems |
| US4736371A (en) * | 1985-12-30 | 1988-04-05 | Nec Corporation | Satellite communications system with random multiple access and time slot reservation |
| US4742357A (en) | 1986-09-17 | 1988-05-03 | Rackley Ernie C | Stolen object location system |
| GB2229064B (en) | 1987-06-11 | 1990-12-12 | Software Sciences Limited | An area communications system |
| US5210846B1 (en) | 1989-05-15 | 1999-06-29 | Dallas Semiconductor | One-wire bus architecture |
| US5555425A (en) | 1990-03-07 | 1996-09-10 | Dell Usa, L.P. | Multi-master bus arbitration system in which the address and data lines of the bus may be separately granted to individual masters |
| US5068916A (en) | 1990-10-29 | 1991-11-26 | International Business Machines Corporation | Coordination of wireless medium among a plurality of base stations |
| JP2692418B2 (en) | 1991-05-17 | 1997-12-17 | 日本電気株式会社 | Radio channel allocation method |
| US5241542A (en) | 1991-08-23 | 1993-08-31 | International Business Machines Corporation | Battery efficient operation of scheduled access protocol |
| US5369748A (en) | 1991-08-23 | 1994-11-29 | Nexgen Microsystems | Bus arbitration in a dual-bus architecture where one bus has relatively high latency |
| FR2683326B1 (en) | 1991-10-31 | 1993-12-24 | Thomson Applic Radars Centre | METHOD FOR QUERYING A RADAR ANSWERING MACHINE AND AN ANSWERING MACHINE FOR IMPLEMENTING THE METHOD. |
| US5231634B1 (en) * | 1991-12-18 | 1996-04-02 | Proxim Inc | Medium access protocol for wireless lans |
| US5392450A (en) | 1992-01-08 | 1995-02-21 | General Electric Company | Satellite communications system |
| US5896561A (en) | 1992-04-06 | 1999-04-20 | Intermec Ip Corp. | Communication network having a dormant polling protocol |
| FR2690252B1 (en) | 1992-04-17 | 1994-05-27 | Thomson Csf | METHOD AND SYSTEM FOR DETERMINING THE POSITION AND ORIENTATION OF A MOBILE, AND APPLICATIONS. |
| US5233604A (en) | 1992-04-28 | 1993-08-03 | International Business Machines Corporation | Methods and apparatus for optimum path selection in packet transmission networks |
| GB9304638D0 (en) | 1993-03-06 | 1993-04-21 | Ncr Int Inc | Wireless data communication system having power saving function |
| US5696903A (en) | 1993-05-11 | 1997-12-09 | Norand Corporation | Hierarchical communications system using microlink, data rate switching, frequency hopping and vehicular local area networking |
| IT1270938B (en) | 1993-05-14 | 1997-05-16 | Cselt Centro Studi Lab Telecom | PROCEDURE FOR THE CONTROL OF THE TRANSMISSION ON A SAME CHANNEL OF INFORMATION FLOWS AT VARIABLE SPEED IN COMMUNICATION SYSTEMS BETWEEN MOBILE VEHICLES, AND A SYSTEM USING SUCH PROCEDURE |
| JP2967897B2 (en) | 1993-07-22 | 1999-10-25 | エヌ・ティ・ティ移動通信網株式会社 | Automatic retransmission request data transmission method |
| US5317566A (en) | 1993-08-18 | 1994-05-31 | Ascom Timeplex Trading Ag | Least cost route selection in distributed digital communication networks |
| US5631897A (en) | 1993-10-01 | 1997-05-20 | Nec America, Inc. | Apparatus and method for incorporating a large number of destinations over circuit-switched wide area network connections |
| US5857084A (en) | 1993-11-02 | 1999-01-05 | Klein; Dean A. | Hierarchical bus structure access system |
| US5412654A (en) | 1994-01-10 | 1995-05-02 | International Business Machines Corporation | Highly dynamic destination-sequenced destination vector routing for mobile computers |
| JP2591467B2 (en) | 1994-04-18 | 1997-03-19 | 日本電気株式会社 | Access method |
| US5502722A (en) * | 1994-08-01 | 1996-03-26 | Motorola, Inc. | Method and apparatus for a radio system using variable transmission reservation |
| CA2132180C (en) | 1994-09-15 | 2001-07-31 | Victor Pierobon | Massive array cellular system |
| JP3043958B2 (en) | 1994-09-29 | 2000-05-22 | 株式会社リコー | Network communication method by wireless communication |
| US6029217A (en) | 1994-10-03 | 2000-02-22 | International Business Machines Corporation | Queued arbitration mechanism for data processing system |
| EP0709982B1 (en) | 1994-10-26 | 2004-06-30 | International Business Machines Corporation | Medium access control scheme for wireless LAN using a variable length interleaved time division frame |
| US5618045A (en) | 1995-02-08 | 1997-04-08 | Kagan; Michael | Interactive multiple player game system and method of playing a game between at least two players |
| US5555540A (en) | 1995-02-17 | 1996-09-10 | Sun Microsystems, Inc. | ASIC bus structure |
| US5796741A (en) | 1995-03-09 | 1998-08-18 | Nippon Telegraph And Telephone Corporation | ATM bus system |
| US5572528A (en) | 1995-03-20 | 1996-11-05 | Novell, Inc. | Mobile networking method and apparatus |
| US5886992A (en) | 1995-04-14 | 1999-03-23 | Valtion Teknillinen Tutkimuskeskus | Frame synchronized ring system and method |
| US5784362A (en) | 1995-04-17 | 1998-07-21 | Telefonaktiebolaget Lm Ericsson | Temporary frame identification for ARQ in a reservation-slotted-ALOHA type of protocol |
| US5517491A (en) | 1995-05-03 | 1996-05-14 | Motorola, Inc. | Method and apparatus for controlling frequency deviation of a portable transceiver |
| US5623495A (en) | 1995-06-15 | 1997-04-22 | Lucent Technologies Inc. | Portable base station architecture for an AD-HOC ATM lan |
| US5822309A (en) | 1995-06-15 | 1998-10-13 | Lucent Technologies Inc. | Signaling and control architecture for an ad-hoc ATM LAN |
| US5781540A (en) | 1995-06-30 | 1998-07-14 | Hughes Electronics | Device and method for communicating in a mobile satellite system |
| GB2303763B (en) | 1995-07-26 | 2000-02-16 | Motorola Israel Ltd | Communications system and method of operation |
| GB9517943D0 (en) | 1995-09-02 | 1995-11-01 | At & T Corp | Radio communication device and method |
| US6132306A (en) | 1995-09-06 | 2000-10-17 | Cisco Systems, Inc. | Cellular communication system with dedicated repeater channels |
| US6192053B1 (en) | 1995-09-07 | 2001-02-20 | Wireless Networks, Inc. | Enhanced adjacency detection protocol for wireless applications |
| US5615212A (en) | 1995-09-11 | 1997-03-25 | Motorola Inc. | Method, device and router for providing a contention-based reservation mechanism within a mini-slotted dynamic entry polling slot supporting multiple service classes |
| US5805842A (en) | 1995-09-26 | 1998-09-08 | Intel Corporation | Apparatus, system and method for supporting DMA transfers on a multiplexed bus |
| US5805593A (en) | 1995-09-26 | 1998-09-08 | At&T Corp | Routing method for setting up a service between an origination node and a destination node in a connection-communications network |
| US5701294A (en) | 1995-10-02 | 1997-12-23 | Telefonaktiebolaget Lm Ericsson | System and method for flexible coding, modulation, and time slot allocation in a radio telecommunications network |
| US5717689A (en) | 1995-10-10 | 1998-02-10 | Lucent Technologies Inc. | Data link layer protocol for transport of ATM cells over a wireless link |
| US5920821A (en) | 1995-12-04 | 1999-07-06 | Bell Atlantic Network Services, Inc. | Use of cellular digital packet data (CDPD) communications to convey system identification list data to roaming cellular subscriber stations |
| US5991279A (en) | 1995-12-07 | 1999-11-23 | Vistar Telecommunications Inc. | Wireless packet data distributed communications system |
| US5878036A (en) | 1995-12-20 | 1999-03-02 | Spartz; Michael K. | Wireless telecommunications system utilizing CDMA radio frequency signal modulation in conjunction with the GSM A-interface telecommunications network protocol |
| KR100197407B1 (en) | 1995-12-28 | 1999-06-15 | 유기범 | Communication bus architecture between process in the full electronic switching system |
| US5680392A (en) | 1996-01-16 | 1997-10-21 | General Datacomm, Inc. | Multimedia multipoint telecommunications reservation systems |
| US5684794A (en) | 1996-01-25 | 1997-11-04 | Hazeltine Corporation | Validation of subscriber signals in a cellular radio network |
| US5706428A (en) | 1996-03-14 | 1998-01-06 | Lucent Technologies Inc. | Multirate wireless data communication system |
| US5652751A (en) | 1996-03-26 | 1997-07-29 | Hazeltine Corporation | Architecture for mobile radio networks with dynamically changing topology using virtual subnets |
| US5796732A (en) | 1996-03-28 | 1998-08-18 | Cisco Technology, Inc. | Architecture for an expandable transaction-based switching bus |
| US5805977A (en) | 1996-04-01 | 1998-09-08 | Motorola, Inc. | Method and apparatus for controlling transmissions in a two-way selective call communication system |
| US5943322A (en) | 1996-04-24 | 1999-08-24 | Itt Defense, Inc. | Communications method for a code division multiple access system without a base station |
| US5787080A (en) | 1996-06-03 | 1998-07-28 | Philips Electronics North America Corporation | Method and apparatus for reservation-based wireless-ATM local area network |
| US5845097A (en) | 1996-06-03 | 1998-12-01 | Samsung Electronics Co., Ltd. | Bus recovery apparatus and method of recovery in a multi-master bus system |
| SE518132C2 (en) | 1996-06-07 | 2002-08-27 | Ericsson Telefon Ab L M | Method and apparatus for synchronizing combined receivers and transmitters in a cellular system |
| US5774876A (en) | 1996-06-26 | 1998-06-30 | Par Government Systems Corporation | Managing assets with active electronic tags |
| US5844905A (en) * | 1996-07-09 | 1998-12-01 | International Business Machines Corporation | Extensions to distributed MAC protocols with collision avoidance using RTS/CTS exchange |
| US5909651A (en) | 1996-08-02 | 1999-06-01 | Lucent Technologies Inc. | Broadcast short message service architecture |
| US5987011A (en) | 1996-08-30 | 1999-11-16 | Chai-Keong Toh | Routing method for Ad-Hoc mobile networks |
| US6044062A (en) | 1996-12-06 | 2000-03-28 | Communique, Llc | Wireless network system and method for providing same |
| US5903559A (en) | 1996-12-20 | 1999-05-11 | Nec Usa, Inc. | Method for internet protocol switching over fast ATM cell transport |
| US6130892A (en) | 1997-03-12 | 2000-10-10 | Nomadix, Inc. | Nomadic translator or router |
| US5877724A (en) | 1997-03-25 | 1999-03-02 | Trimble Navigation Limited | Combined position locating and cellular telephone system with a single shared microprocessor |
| US6052594A (en) | 1997-04-30 | 2000-04-18 | At&T Corp. | System and method for dynamically assigning channels for wireless packet communications |
| US5881095A (en) | 1997-05-01 | 1999-03-09 | Motorola, Inc. | Repeater assisted channel hopping system and method therefor |
| US5870350A (en) | 1997-05-21 | 1999-02-09 | International Business Machines Corporation | High performance, high bandwidth memory bus architecture utilizing SDRAMs |
| US6240294B1 (en) | 1997-05-30 | 2001-05-29 | Itt Manufacturing Enterprises, Inc. | Mobile radio device having adaptive position transmitting capabilities |
| GB2326065B (en) | 1997-06-05 | 2002-05-29 | Mentor Graphics Corp | A scalable processor independent on-chip bus |
| US6108738A (en) | 1997-06-10 | 2000-08-22 | Vlsi Technology, Inc. | Multi-master PCI bus system within a single integrated circuit |
| US5987033A (en) | 1997-09-08 | 1999-11-16 | Lucent Technologies, Inc. | Wireless lan with enhanced capture provision |
| US6163699A (en) | 1997-09-15 | 2000-12-19 | Ramot University Authority For Applied Research And Industrial Development Ltd. | Adaptive threshold scheme for tracking and paging mobile users |
| US6067291A (en) | 1997-09-23 | 2000-05-23 | Lucent Technologies Inc. | Wireless local area network with enhanced carrier sense provision |
| US6034542A (en) | 1997-10-14 | 2000-03-07 | Xilinx, Inc. | Bus structure for modularized chip with FPGA modules |
| US6009553A (en) | 1997-12-15 | 1999-12-28 | The Whitaker Corporation | Adaptive error correction for a communications link |
| US5936953A (en) | 1997-12-18 | 1999-08-10 | Raytheon Company | Multi-mode, multi-channel communication bus |
| US6047330A (en) | 1998-01-20 | 2000-04-04 | Netscape Communications Corporation | Virtual router discovery system |
| US6269075B1 (en) * | 1998-01-26 | 2001-07-31 | Nokia Mobile Phones Limited | Finger assignment in a CDMA rake receiver |
| US6065085A (en) | 1998-01-27 | 2000-05-16 | Lsi Logic Corporation | Bus bridge architecture for a data processing system capable of sharing processing load among a plurality of devices |
| US6130881A (en) | 1998-04-20 | 2000-10-10 | Sarnoff Corporation | Traffic routing in small wireless data networks |
| US6078566A (en) | 1998-04-28 | 2000-06-20 | Genesys Telecommunications Laboratories, Inc. | Noise reduction techniques and apparatus for enhancing wireless data network telephony |
| US6064626A (en) | 1998-07-31 | 2000-05-16 | Arm Limited | Peripheral buses for integrated circuit |
| US6304556B1 (en) | 1998-08-24 | 2001-10-16 | Cornell Research Foundation, Inc. | Routing and mobility management protocols for ad-hoc networks |
| US6115580A (en) | 1998-09-08 | 2000-09-05 | Motorola, Inc. | Communications network having adaptive network link optimization using wireless terrain awareness and method for use therein |
| US6208870B1 (en) | 1998-10-27 | 2001-03-27 | Lucent Technologies Inc. | Short message service notification forwarded between multiple short message service centers |
| US6285892B1 (en) | 1998-11-24 | 2001-09-04 | Philips Electronics North America Corp. | Data transmission system for reducing terminal power consumption in a wireless network |
| US6104712A (en) | 1999-02-22 | 2000-08-15 | Robert; Bruno G. | Wireless communication network including plural migratory access nodes |
| US6453168B1 (en) | 1999-08-02 | 2002-09-17 | Itt Manufacturing Enterprises, Inc | Method and apparatus for determining the position of a mobile communication device using low accuracy clocks |
| US6275707B1 (en) | 1999-10-08 | 2001-08-14 | Motorola, Inc. | Method and apparatus for assigning location estimates from a first transceiver to a second transceiver |
| US6327300B1 (en) | 1999-10-25 | 2001-12-04 | Motorola, Inc. | Method and apparatus for dynamic spectrum allocation |
| US6404756B1 (en) * | 1999-11-03 | 2002-06-11 | Itt Manufacturing Enterprises, Inc. | Methods and apparatus for coordinating channel access to shared parallel data channels |
| US6349210B1 (en) * | 1999-11-12 | 2002-02-19 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for broadcasting messages in channel reservation communication systems |
| US6349091B1 (en) | 1999-11-12 | 2002-02-19 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for controlling communication links between network nodes to reduce communication protocol overhead traffic |
| DE60026454T2 (en) * | 2000-05-19 | 2006-11-09 | Lucent Technologies Inc. | Wireless local area network with load sharing |
| US6522650B1 (en) * | 2000-08-04 | 2003-02-18 | Intellon Corporation | Multicast and broadcast transmission with partial ARQ |
| DE10039532B4 (en) * | 2000-08-08 | 2006-05-11 | Walke, Bernhard, Prof. Dr.-Ing | Mutual control of radio systems of different standards in the same frequency band |
| US6895255B1 (en) * | 2000-10-20 | 2005-05-17 | Symbol Technologies, Inc. | Dual mode wireless data communications |
| US6807165B2 (en) | 2000-11-08 | 2004-10-19 | Meshnetworks, Inc. | Time division protocol for an ad-hoc, peer-to-peer radio network having coordinating channel access to shared parallel data channels with separate reservation channel |
| US6873839B2 (en) | 2000-11-13 | 2005-03-29 | Meshnetworks, Inc. | Prioritized-routing for an ad-hoc, peer-to-peer, mobile radio access system |
| US7072650B2 (en) | 2000-11-13 | 2006-07-04 | Meshnetworks, Inc. | Ad hoc peer-to-peer mobile radio access system interfaced to the PSTN and cellular networks |
| AU2002314824A1 (en) * | 2001-06-14 | 2003-01-02 | Meshnetworks, Inc. | Routing algorithms in a mobile ad-hoc network |
| US20030128681A1 (en) * | 2001-12-29 | 2003-07-10 | Dennis Rauschmayer | Method and apparatus for implementing an automatic repeat request ("ARQ") function in a fixed wireless communication system |
| EP1477033A2 (en) * | 2002-02-20 | 2004-11-17 | Meshnetworks, Inc. | A system and method for routing 802.11 data traffic across channels to increase ad-hoc network capacity |
-
2003
- 2003-02-28 US US10/375,013 patent/US6687259B2/en not_active Expired - Lifetime
- 2003-06-04 AU AU2003239917A patent/AU2003239917A1/en not_active Abandoned
- 2003-06-04 CA CA2486982A patent/CA2486982C/en not_active Expired - Lifetime
- 2003-06-04 WO PCT/US2003/017248 patent/WO2003105389A2/en active Application Filing
- 2003-06-04 KR KR1020047019741A patent/KR100970543B1/en active IP Right Grant
- 2003-06-04 EP EP03734325A patent/EP1510027A4/en not_active Ceased
- 2003-06-04 JP JP2004512331A patent/JP4447452B2/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| KR20050004284A (en) | 2005-01-12 |
| US20030227935A1 (en) | 2003-12-11 |
| EP1510027A2 (en) | 2005-03-02 |
| JP2005529543A (en) | 2005-09-29 |
| JP4447452B2 (en) | 2010-04-07 |
| CA2486982A1 (en) | 2003-12-18 |
| AU2003239917A8 (en) | 2003-12-22 |
| EP1510027A4 (en) | 2007-02-21 |
| WO2003105389A3 (en) | 2004-04-08 |
| WO2003105389A2 (en) | 2003-12-18 |
| AU2003239917A1 (en) | 2003-12-22 |
| KR100970543B1 (en) | 2010-07-16 |
| US6687259B2 (en) | 2004-02-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2486982C (en) | Arq mac for ad-hoc communication networks | |
| US6744766B2 (en) | Hybrid ARQ for a wireless Ad-Hoc network and a method for using the same | |
| EP1924009B1 (en) | Relay apparatus for relaying a data packet to be transmitted from a first partner transceiver to a second partner transceiver | |
| US8102939B2 (en) | Link adaptation | |
| US7586948B2 (en) | Packet sub-frame structure for selective acknowledgment | |
| US8300563B2 (en) | Aggregated transmission in WLAN systems with FEC MPDUs | |
| KR100890481B1 (en) | Software architecture and hardware abstraction layer for multi-radio routing and method for providing the same | |
| US9363707B2 (en) | Systems and methods for generating and decoding short control frames in wireless communications | |
| US20030227934A1 (en) | System and method for multicast media access using broadcast transmissions with multiple acknowledgements in an Ad-Hoc communications network | |
| US7609670B2 (en) | System and method for performing low-overhead, high spatial reuse medium access control in a wireless network | |
| Tourrilhes | Robust broadcast: improving the reliability of broadcast transmissions on CSMA/CA | |
| US20050286440A1 (en) | System and method for adaptive rate selection for wireless networks | |
| US8351864B2 (en) | Wireless terminal and retransmission method | |
| Hoefel | A cross-layer saturation goodput analysis for IEEE 802.11 a networks | |
| Gomez et al. | A channel predictor for wireless packet networks | |
| JP2005529518A (en) | Hybrid ARQ for wireless ad hoc networks and its usage | |
| JP2008211600A (en) | Radio communication system, communication device and method for controlling communication | |
| Gidlund | An approach for using adaptive error control schemes in wireless LAN with CSMA/CA MAC protocol | |
| CN113412594A (en) | Multi-layer transmission technique | |
| Shankar et al. | Mobility-Tolerant Reliable Wireless LAN Multicast Communication | |
| Hoefel | A Joint MAC and Physical Layer Analytical Model for IEEE 802.11 a Networks Operating under RTS/CTS Access Scheme |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |
Effective date: 20230605 |