BACKGROUND:
Field:
[0001] Channel reservation in time division duplex for devices in systems involving, for
example user devices and access points, may be accomplished using channel reservation
request messages, such as request-to-send (RTS) messages, and channel reservation
grant messages, such as clear-to-send (CTS) messages. The format of such messages
within a time division duplex (TDD) frame may be significant in, for example, the
physical (PHY) layer of local area evolution (LAE).
Description of the Related Art:
[0002] Various frame structures exist for request-to-send (RTS) and clear-to-send (CTS)
messages. The frame structures, however, are not applicable to transmissions of orthogonal
frequency division multiple access (OFDMA) systems.
[0003] United States patent application publication number
US 2009/0059891 A1 relates to access control based on Carrier-Sense-Multiple-Access with a Request-to-Send/Clear-to-send
procedure.
SUMMARY:
[0004] The present invention is defined by the appended independent claims. Certain more
specific aspects are defined by the dependent claims.
[0005] In certain examples, the present invention is a method. A method includes preparing
a frame including at least one channel reservation request message and at least one
channel reservation grant message. The preparing includes multiplexing the at least
one channel reservation request message and the at least one channel reservation grant
message at least by frequency-division multiplexing. The method also includes transmitting
the frame from a first node to a second node. The channel reservation request message
and the channel reservation grant message relate to communications between the first
node and the second node.
[0006] In another example a method includes preparing a frame including at least one channel
reservation request message and no channel reservation grant messages or no channel
reservation request messages and at least one channel reservation grant message. The
method also includes transmitting the frame from a first node to a second node, wherein
the channel reservation request message and the channel reservation grant message
relate to communications between the first node and the second node.
[0007] Another example of the present invention is an apparatus. The apparatus includes
at least one memory including computer program code and at least one processor. The
at least one memory and computer program code are configured to, with the at least
one processor, cause the apparatus at least to prepare a frame including at least
one channel reservation request message and at least one channel reservation grant
message. The preparation of the frame includes multiplexing the at least one channel
reservation request message and the at least one channel reservation grant message
at least by frequency-division multiplexing. The at least one memory and computer
program code are also configured to, with the at least one processor, cause the apparatus
at least to transmit the frame from a first node to a second node. The channel reservation
request message and the channel reservation grant message relate to communications
between the first node and the second node.
[0008] An apparatus, in another example of the present invention, includes at least one
memory including computer program code and at least one processor. The at least one
memory and computer program code are configured to, with the at least one processor,
cause the apparatus at least to prepare a frame including at least one channel reservation
request message and no channel reservation grant messages or no channel reservation
request messages and at least one channel reservation grant message. The at least
one memory and computer program code are also configured to, with the at least one
processor, cause the apparatus at least to transmit the frame from a first node to
a second node, wherein the channel reservation request message and the channel reservation
grant message relate to communications between the first node and the second node.
[0009] In certain examples, the present invention is an apparatus. The apparatus includes
preparing means for preparing a frame including at least one channel reservation request
message and at least one channel reservation grant message. The preparing means includes
multiplexing means for multiplexing the at least one channel reservation request message
and the at least one channel reservation grant message at least by frequency-division
multiplexing. The apparatus also includes transmitting means for transmitting the
frame from a first node to a second node. The channel reservation request message
and the channel reservation grant message relate to communications between the first
node and the second node.
[0010] In another example an apparatus includes preparing means for preparing a frame including
at least one channel reservation request message and no channel reservation grant
messages or no channel reservation request messages and at least one channel reservation
grant message. The method also includes transmitting means for transmitting the frame
from a first node to a second node. The channel reservation request message and the
channel reservation grant message relate to communications between the first node
and the second node.
[0011] In further examples, a method includes receiving a frame from a first node at a second
node, the frame comprising at least one channel reservation request message and at
least one channel reservation grant message. The method also includes demultiplexing
the at least one channel reservation request message and the at least one channel
reservation grant message at least by frequency-division demultiplexing, wherein the
channel reservation request message and the channel reservation grant message relate
to communications between the first node and the second node.
[0012] In additional examples, a method includes receiving a frame from a first node to
a second node, the frame comprising at least one channel reservation request message
and no channel reservation grant messages or no channel reservation request messages
and at least one channel reservation grant message. The method also includes processing
the received frame to extract the at least one channel reservation request message
or the at least one channel reservation grant message. The channel reservation request
message and the channel reservation grant message relate to communications between
the first node and the second node.
[0013] The present invention, in other examples, is an apparatus including at least one
memory including computer program code and at least one processor. The at least one
memory and computer program code are configured to, with the at least one processor,
cause the apparatus at least to process a received frame from a first node at a second
node. The frame includes at least one channel reservation request message and at least
one channel reservation grant message. The at least one memory and computer program
code are also configured to, with the at least one processor, cause the apparatus
at least to demultiplex the at least one channel reservation request message and the
at least one channel reservation grant message at least by frequency-division demultiplexing.
The channel reservation request message and the channel reservation grant message
relate to communications between the first node and the second node.
[0014] In certain further examples, the present invention is an apparatus. The apparatus
includes at least one memory including computer program code and at least one processor.
The at least one memory and computer program code are configured to, with the at least
one processor, cause the apparatus at least to process a received frame from a first
node at a second node, the frame comprising at least one channel reservation request
message and no channel reservation grant messages or no channel reservation request
messages and at least one channel reservation grant message. The at least one memory
and computer program code are also configured to, with the at least one processor,
cause the apparatus at least to extract the at least one channel reservation request
message or the at least one channel reservation grant message. The channel reservation
request message and the channel reservation grant message relate to communications
between the first node and the second node.
[0015] In certain further examples a non-transitory computer-readable medium is encoded
with instructions that, when executed in hardware perform one of the above-described
methods.
[0016] In additional examples, a computer program product may include a computer-readable
medium bearing computer program code embodied therein for use with a computer. The
computer program code may include code for preparing a frame comprising at least one
channel reservation request message and at least one channel reservation grant message,
wherein the preparing comprises multiplexing the at least one channel reservation
request message and the at least one channel reservation grant message at least by
frequency-division multiplexing. The computer program code may also include code for
transmitting the frame from a first node to a second node, wherein the channel reservation
request message and the channel reservation grant message relate to communications
between the first node and the second node.
[0017] The present invention may also be, in other examples a computer program product comprising
a computer-readable medium bearing computer program code embodied therein for use
with a computer. The computer program code may include code for receiving a frame
from a first node at a second node, the frame comprising at least one channel reservation
request message and at least one channel reservation grant message. The computer program
code may also include code for demultiplexing the at least one channel reservation
request message and the at least one channel reservation grant message at least by
frequency-division demultiplexing, wherein the channel reservation request message
and the channel reservation grant message relate to communications between the first
node and the second node.
BRIEF DESCRIPTION OF THE DRAWINGS:
[0018] For proper understanding of the invention, reference should be made to the accompanying
drawings, wherein:
Figure 1 illustrates reference frame structures for scheduled access.
Figure 2 illustrates references frame structures for request-to-send (RTS) - clear-to-send
(CTS) based access.
Figure 3 illustrates an arrangement for RTS-CTS with a small number of direction switches
and a short downlink (DL) allocation delay.
Figure 4 illustrates an arrangement for RTS-CTS with a small number of direction switches
and a flexible DL - to - uplink (UL) switching point.
Figure 5 illustrates an arrangement for RTS-CTS with a small number of direction switches
and reservations in UL only.
Figure 6 illustrates an arrangement for RTS-CTS with a small amount of allocation
delay.
Figure 7 illustrates an arrangement for RTS-CTS with measurement opportunities in
every possible direction change.
Figure 8 illustrates compression techniques for RTS-CTS messages.
Figure 9 illustrates a method according to certain embodiments of the present invention.
Figure 10 illustrates another method according to certain embodiments of the present
invention.
Figure 11 illustrates a system according to certain embodiments of the present invention.
Figure 12 illustrates a method according to certain embodiments of the present invention.
Figure 13 illustrates a method according to further embodiments of the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S):
[0019] The use of channel reservation request and grant messages, such as request-to-send
(RTS)/clear-to-send (CTS) messages, may benefit from the efficient allocation of RTS
and CTS control channels in a frame structure, such that overhead due to uplink (UL)/downlink
(DL) switching is minimized.
[0020] Certain embodiments of the present invention relate more particularly to orthogonal
frequency-division multiple access (OFDMA). Thus, in certain embodiments, RTS and
CTS messages are multiplexed in frequency as well as in time. The separation of RTS
and CTS in OFDMA frequency resources may permit further compression and may also permit
the combination of several RTS and CTS messages in the same resources. For example,
an access point, such as an enhanced Node B (eNB), that is processing several CTS
responses and RTS requests may multiplex all the messages in the same channel, using
OFDMA to separate the messages.
[0021] Accordingly, in certain embodiments, a system is a local area radio system that complements
a cellular wide area system, such as global system for mobile communications (GSM),
universal mobile telecommunications system (UMTS), highs speed packet access (HSPA),
and long term evolution (LTE) of the third generation partnership project (3GPP).
Unlike wide area cellular systems, a local area system may utilize license-exempt
spectrum or white spaces, thereby taking advantage of the additional available bandwidth.
In addition a local area system may offer an efficient device-to-device operation
mode to establish ad-hoc networks.
[0022] The radio interface of a local area evolution (LAE) system may have some similarities
to the radio system of 3GPP LTE-Advanced (LTE-A). However, in LAE systems there may
be important differences from LTE-A. In particular, LAE system may take account that
uncoordinated deployments and dynamic time division duplex (TDD) switching points
may be used.
[0023] An approach to reduce interference experienced by receivers is given by multiple
access systems based on channel reservation, in typical wireless local area network
(WLAN) systems. For a system based on a frame structure, such as LAE, this may be
realized by means of request to send (RTS) - clear-to-send (CTS) handshake. In an
RTS-CTS handshake, following an RTS message, a terminal responds with a CTS message.
This procedure aims to ensure that all transmissions are essentially interference-free,
which is particularly beneficial for terminals at the edge of a cell.
[0024] For efficient utilization of resources, the RTS and CTS control channels may be carefully
arranged in the frame structure. If the RTS and CTS control channels are not carefully
arranged in the frame structure, the potential gains from lower interference may be
overshadowed by the increased overhead due to UL/DL switching times.
[0025] In some WLAN standards, RTS/CTS protocol is an optional feature for trying to solve
the hidden node problem. The "hidden node problem" is a term for the practical reality
that in some wireless networks the access point, hub, or base station may communicate
with two nodes that cannot communicate with one another. Indeed, because of the physical
realities of the network, a first mobile node may be unable to receive any communications
from a second mobile node and
vice versa. This situation is viewed as the mobile nodes being hidden from one another, although
there is no requirement that any intentional hiding take place. The existence of hidden
nodes may complicate media access control. For example, carrier sense multiple access
with collision avoidance (CSMA/CA) may not work in such circumstances, because a mobile
node may not realize that its packets are colliding with those of the hidden node.
[0026] There may be, accordingly, shortcomings with the application of RTS/CTS in conjunction
with the CSMA protocol, resulting in an overall rate degradation in the system. However,
cell-edge users have the advantage of an essentially interference-free channel, leading
to small outage probability. This property makes an RTS/CTS scheme useful for a multi-cell
environment that has a quality of service (QoS) target in which a minimum guaranteed
data rate should be supported. For efficient utilization of resources, the RTS and
CTS control channels may be carefully arranged in the frame structure in order to
minimize the signaling overhead and leverage the benefits of a synchronized frame
structure for RTS-CTS operation.
[0027] Certain embodiments of the present invention provide a method and system that utilize
an arrangement of RTS and CTS messages in a frame structure such that overall signaling
overhead is minimized.
[0028] Figure 1 shows an example frame structure to be considered as a reference frame structure.
In the following discussion, the system utilizes time-division duplex (TDD) and orthogonal
frequency-division multiple access (OFDMA) in the physical layer. However, these aspects
are for purposes of illustration. The uplink (UL) / downlink (DL) switching times
may take into account the time required for a certain device to switch between transmission
and reception mode. All nodes may be synchronized at the cyclic prefix (CP) level.
[0029] Figure 2 shows a reference implementation of a frame structure supporting RTS-CTS
handshake. Compared to the frame structure in Figure 1, the number of direction switches
is increased by a factor of three, which together with the RTS-CTS messages themselves
may generate additional overhead. One reason for the overhead is the fact that each
of the switches involves a time period during which a device is switching transceiver
modes from either transmit to receive or receive to transmit. This time cannot conventionally
be used either for transmission or reception. Likewise, the RTS-CTS messages, which
may serve a valuable administrative purpose, do not actually communicate the payload
information.
[0030] Accordingly, certain embodiments of the present invention employ an arrangement of
RTS-CTS messages that may reduce the number TDD switching points and the amount of
control channel overhead compared with, for example, the reference implementation
of Figure 2. One technique that certain embodiments use is to compress RTS-CTS messages.
In particular, certain embodiments utilize simultaneous transmission of new RTS requests
with the CTS response to a received pending RTS request. Another technique that certain
embodiments of the present invention employ is multiplexing RTS and CTS messages in
a frequency domain or in both a time domain and frequency domain. A further technique
that is used in certain embodiments of the present invention is the combination of
several RTS and CTS messages in the same resources.
[0031] Another technique is to put receiving UL RTS and/or DL CTS adjacent to the UL frame,
and to put transmitting DL RTS and UL CTS adjacent to the DL frame. The DL RTS may
be the new RTS providing a request by a first node to a second node for downlink resources
or reservations. UL CTS may be the CTS response to a previously received pending RTS
request. The received pending RTS request may be sent from the second node to the
first node to request uplink reservation. Thus, it should be understood, for example,
that the UL RTS and the DL CTS in the same frame are referring to two different channel
reservations. Several examples of RTS-CTS arrangement in a TDD frame structure are
provided below.
[0032] The term "cell" in the following discussion refers to a set of transmission (Tx)
- reception (Rx) nodes that primarily are configured to communicate with each other.
Thus, "cell" is not limited to so-called "cellular radio" or traditional mobile telephone
networks. The concept includes the traditional cell of cellular communications, as
well as an access point (AP) with the clients it serves, potential device-to-device
communication pairs, clusters in ad-hoc networks, and the like.
[0033] Several implementations of the RTS-CTS allocations for different trade-offs between
control overhead, delay, and flexibility in TDD switching point are possible, as discussed
below.
[0034] A first example embodiment is one in which there is a minimized amount of direction
switching and reservations to both directions. Specifically, Figure 3 shows an arrangement
of RTS-CTS messages minimizing the number of direction switches, while keeping DL
allocation delay short. The number of direction switches is the same as in the reference
frame structure for scheduled access of Figure 1.
[0035] In this scheme there may be no extra direction switches compared to reference frame
structure for scheduled access are required. Additionally, there may be a short time
between RTS and data transmission in DL. There may, however, be a long time between
RTS and data transmission in UL, and the CTS response in UL comes quite late, such
that there is only a short time to prepare a new request and to prepare the transmission
itself. Furthermore, the scheme illustrated in Figure 3 may require the DL-to-UL border
to be synchronized among other access points (APs).
[0036] Another example embodiment is one in which there is minimized direction switching,
reservations to both directions, and flexible DL/UL switching. The scheme illustrated
in Figure 3 may be viewed as strict with respect to the switching point between DL
and UL sub-frames, such that utilization of RTS-CTS mechanism to coordinate interference
between cells is effective. As an alternative to the scheme of Figure 3, Figure 4
shows a scheme in which the reservation period is located at the border between UL
and DL sub-frames, thus relaxing constraints on the DL-to-UL switching point relative
to the embodiment shown in Figure 3. The tradeoff for this flexibility is increased
delays in both directions, in particular for DL allocations. The optional traffic
map in Figure 4 may contain more detailed information on the allocations. For example,
the optional traffic map may indicate modulation and coding scheme (MCS) to be used,
antenna weights, number of parallel streams, and the like. This information may be
transmitted in the CTS message itself, and hence the traffic map may be considered
simply a logical representation and not necessarily a separate channel from the CTS.
[0037] The scheme of Figure 4 has no extra direction switches compared to reference frame
structure for scheduled access. Additionally, this scheme has no constraint on the
DL-to-UL switching point. There is also, in this scheme, a short time between RTS
and data transmission in UL and a reasonable time between CTS response and data transmission
in UL. Additionally, there may be a long time between RTS and data transmission in
DL and the CTS response in DL comes quite late, which implies that there is only a
short time to prepare a new request and to prepare the transmission itself.
[0038] A further embodiment has minimized direction switching with UL reservations only.
If channel reservation mechanism is desired in the UL direction only, the arrangement
illustrated in Figure 5 may be a suitable candidate. It is compatible with a flexible
TDD switching point.
[0039] Such a scheme has no extra direction switches compared to reference frame structure
for scheduled access and places no constraints on the DL-to-UL switching point. Additionally,
there is only a short time between RTS and data transmission in the UL, while there
is a reasonable amount of time between CTS response and data transmission in the UL.
There are, however, no reservations in the DL direction, and consequently this scheme
cannot, without further modification, be used to coordinate DL transmissions between
APs.
[0040] An additional embodiment may provide for minimum allocation delay. When allocation
delay is seen as more important than overhead due to UL/DL direction switching times,
the schemes shown in Figure 6 may be used for short allocations where all allocation
delays are smaller than one frame.
[0041] The embodiment illustrated in Figure 6 features no constraints on DL-to-UL switching
point, a short time between RTS and data transmission in both UL and DL, and a reasonable
time between CTS response and data transmission in UL. However, the embodiment of
Figure 6 also includes two extra switches compared to the reference frame structure
for scheduled access.
[0042] Another embodiment of the present invention may use a scheme in which there are a
maximum number of measurement opportunities. When the TDD switching point is not fixed
within the network, it may be useful to have reservations done every time there is
a change in transmission direction in at least one of the neighboring cells. The lack
of fixed TDD switching point implies that it may be useful for RTS messages to be
transmitted for every time slot where a direction change would be possible. This is
illustrated in Figure 7.
[0043] One should note that, in principle, CTS responses may be aggregated and transmitted
in the areas marked in Figure 7. However, for optimum interference management capability,
an arrangement similar to the reference frame in Figure 2 may be utilized, with RTS-CTS
messages transmitted in every possible direction change.
[0044] In another aspect, certain embodiments of the present invention employ compression
of RTS-CTS messages. Specifically, when RTS and CTS messages are transmitted by the
same node, it is possible to compress the messages to further save control overhead.
Thus, there are alternative ways in which RTS and CTS may be sent. For example, a
node may send RTS, CTS or combination of RTS + CTS message at one reservation opportunity.
Examples of compression possibilities are in DL RTS and UL CTS messages, since they
are transmitted by the same AP. Some of these possibilities are illustrated in Figure
8. Note that the total number of resources to be used for RTS and CTS messages is
variable and may depend, for example, on the number of requests per frame.
[0045] Multiplexing in frequency as in Figure 8(a) may avoid unutilized portions of the
symbols containing RTS and CTS messages. The arrangement in Figure 8(b) may be useful
when CTS messages are more detailed, such as when they include channel quality information
(CQI). The arrangement in Figure 8(c) is suitable for situations where there are devices
with traffic in both directions, while some others have only UL or DL traffic.
[0046] Specifically, Figure 8(a) illustrates multiplexing DL RTS and UL CTS in frequency.
Figure 8(b) illustrates multiplexing DL RTS and UL CTS in frequency and time, with
room for detailed CTS responses. Figure 8(c) illustrates combined CTS and RTS. These
schemes may be useful for devices that have traffic in both directions. It should
be noted that combining responses in UL direction are possible as well, for example
for devices with traffic in both directions, similarly to Figure 8(c).
[0047] The schemes identified above allow for a trade-off between signaling overhead due
to UL/DL switching times, allocation delays, and flexibility in TDD switching point.
[0048] Figure 9 illustrates a method according to certain embodiments of the present invention.
The method illustrated in Figure 9 includes preparing 910 a frame including at least
one channel reservation request message, such as a request-to-send message, and at
least one channel reservation grant message, such as a clear-to-send message. The
preparing 910 includes multiplexing 911 together the at least one request-to-send
message and the at least one clear-to-send message at least by frequency-division
multiplexing 912. The method also includes transmitting 920 the frame from a first
node to a second node, wherein the request-to-send message and the clear-to-send message
relate to communications between the first node and the second node.
[0049] The multiplexing 911 together the at least one request-to-send message and the at
least one clear-to-send message may further include time-division multiplexing 913
together the at least one request-to-send message and the at least one clear-to-send
message.
[0050] The multiplexing 911 may include multiplexing 914 at least one downlink clear-to-send
message together with at least one uplink request-to-send message. The preparing 910
the frame may include providing 915 a traffic map with the at least one clear-to-send
message.
[0051] The frame may be prepared with respect to a second frame. For example, the when an
immediately previous frame ended with channel reservation information, the method
may include providing 916 the at least one request-to-send message and the at least
one clear-to-send message at the start of the frame and when an immediately previous
frame began with channel reservation information, the method may include providing
917 the at least one request-to-send message and the at least one clear-to-send message
at the end of the frame.
[0052] In one example, the present frame may be an uplink frame, whereas the previous frame
was a downlink frame. The preparing the frame may include providing 918 channel reservation
only at the start of the frame when the frame is an uplink frame.
[0053] The transmitting 920 the frame may be performed using 922 orthogonal frequency division
multiple access.
[0054] Figure 10 illustrates another method according to certain embodiments of the present
invention. As illustrated in Figure 10, the method may include preparing 1010 a frame
including at least one channel reservation request message, such as a request-to-send
message, and no channel reservation grant messages, such as clear-to-send messages
or no channel reservation request messages, such as request-to-send messages, and
at least one channel reservation grant message, such as a clear-to-send message. The
method may also include transmitting 1020 the frame from a first node to a second
node. The request-to-send message and the clear-to-send message relate to communications
between the first node and the second node.
[0055] The preparing 1010 may include providing 1012 no clear-to-send messages when the
frame is an uplink frame and the preparing 1010 may include providing 1014 no request-to-send
messages when the frame is a downlink frame. Thus, in such embodiments, the RTS/CTS
signaling is used only for uplink (UL) reservations.
[0056] Figure 11 illustrates a system according to certain embodiments of the present invention.
The system may include two apparatuses, namely a first node 1110 and a second node
1120. The first node 1110 may be, for example, a mobile node, user equipment, or terminal
device. The second node 1120 may be an access point, base station, or evolved node
B. Alternatively, the first node 1110 and the second node 1120 each be device-to-device
capable nodes, such as user equipment.
[0057] The first node 1110 and the second node 1120 may each include at least one memory
1130 and computer program code 1140. The first node 1110 and the second node 1120
may also each include at least one processor 1150. The memory 1130 and computer program
code 1140 may be configured, together with the processor 1150, to cause the first
node 1110 or second node 1120 to perform a method, such as the methods illustrated
in Figures 9 and 10 or the methods illustrated in Figures 12 and 13, below.
[0058] The memory 1130 may be any suitable storage device. For example, the memory 1130
may be a hard drive, random access memory (RAM), or read-only memory (ROM). The computer
program code 1140 may be, for example, computer instructions in the form of a compiled
or interpreted programming language. The processor 1150 may be any suitable processing
device. For example, the processor 1150 may be a controller, a central processing
unit (CPU) or an application specific integrated circuit (ASIC). The processor 1150
and the memory 1130 may be implemented on a single chip or on separate chips.
[0059] The first node 1110 and the second node 1120 may further each include a transceiver
1160 including a receiver 1163 and a transmitter 1167. The transceiver 1160 may be
configured to communicate over a wireless communication link 1180 using at least one
antenna 1170.
[0060] Figure 12 illustrates a method according to certain embodiments of the present invention.
The method of Figure 12 includes receiving 1210 a frame from a first node at a second
node, the frame including at least one channel reservation request message and at
least one channel reservation grant message. The method of Figure 12 also includes
demultiplexing 1220 the at least one channel reservation request message and the at
least one channel reservation grant message at least by frequency-division demultiplexing
1222, wherein the channel reservation request message and the channel reservation
grant message relate to communications between the first node and the second node.
The at least one channel reservation request message may include a request-to-send
message and the at least one channel reservation grant message includes a clear-to-send
(CTS) message.
[0061] The CTS message may refer to an already-created own reservation, that is to say,
a reservation previously requested by the node receiving the CTS. In contrast, the
RTS message may be a request to provide a reservation to the other device.
[0062] The demultiplexing 1220 the at least one request-to-send message and the at least
one clear-to-send message may further include time-division demultiplexing 1224 the
at least one request-to-send message and the at least one clear-to-send message. The
demultiplexing 1220 the at least one request-to-send message and the at least one
clear-to-send message may include demultiplexing 1226 at least one downlink clear-to-send
message with at least one uplink request-to-send message. The receiving 1210 the frame
further includes receiving 1215 a traffic map with the at least one clear-to-send
message.
[0063] Figure 13 illustrates a method according to further embodiments of the present invention.
The method includes receiving 1310 a frame from a first node to a second node, the
frame including at least one channel reservation request message and no channel reservation
grant messages or no channel reservation request messages and at least one channel
reservation grant message. The method further includes processing 1320 the received
frame to extract the at least one channel reservation request message or the at least
one channel reservation grant message. The channel reservation request message and
the channel reservation grant message relate to communications between the first node
and the second node.
[0064] In certain embodiments of the present invention, a computer program product includes
a computer-readable medium bearing computer program code embodied therein for use
with a computer. The code may include code for performing the various features of
the methods discussed above, such as the methods of FIGS. 9-10 and 12- 13.
[0065] One having ordinary skill in the art will readily understand that the invention as
discussed above may be practiced with steps in a different order, and/or with hardware
elements in configurations which are different than those which are disclosed. Therefore,
although the invention has been described based upon these preferred embodiments,
it would be apparent to those of skill in the art that certain modifications, variations,
and alternative constructions would be apparent, while remaining within the scope
of the invention. For example, while the use of RTS and CTS as examples of channel
reservation request messages and channel reservation grant messages have been provided,
other embodiments are also possible. In order to determine the metes and bounds of
the invention, therefore, reference should be made to the appended claims.
1. A method, comprising:
preparing (910) a frame comprising at least one channel reservation request message
and at least one channel reservation grant message, wherein the preparing comprises
multiplexing the at least one channel reservation request message and the at least
one channel reservation grant message at least by frequency-division multiplexing;
and
transmitting (920) the frame from a first node to a second node, wherein the channel
reservation request message and the channel reservation grant message relate to communications
between the first node and the second node,
wherein the preparing comprises providing (916) the at least one request-to-send message
and the at least one channel reservation grant message at the start of the frame when
an immediately previous frame ends with channel reservation information,
and providing (917) the at least one channel reservation request message and the at
least one channel reservation grant message at the end of the frame when an immediately
previous frame begins with channel reservation information.
2. The method of claim 1, wherein the preparing the frame comprises preparing a frame
wherein the at least one channel reservation request message comprises a request-to-send
message and the at least one channel reservation grant message comprises a clear-to-send
message.
3. An apparatus, comprising:
means for preparing (910) a frame comprising at least one channel reservation request
message and at least one channel reservation grant message, wherein the preparation
of the frame comprises multiplexing the at least one channel reservation request message
and the at least one channel reservation grant message at least by frequency-division
multiplexing, and
means for transmitting (920) the frame from a first node to a second node, wherein
the channel reservation request message and the channel reservation grant message
relate to communications between the first node and the second node,
wherein the means for preparing comprises means for providing (916) the at least one
request-to-send message and the at least one channel reservation grant message at
the start of the frame when an immediately previous frame ends with channel reservation
information, and providing (917) the at least one channel reservation request message
and the at least one channel reservation grant message at the end of the frame when
an immediately previous frame begins with channel reservation information.
4. The apparatus of claim 3, wherein the means for preparing comprises means for preparing
a frame wherein the at least one channel reservation request message comprises a request-to-send
message and the at least one channel reservation grant message comprises a clear-to-send
message.
5. The apparatus of claim 3, wherein the means for preparing comprises means for time-division
multiplexing the at least one channel reservation request message and at least one
channel reservation grant message.
6. The apparatus of claim 3, wherein the means for preparing comprises means for providing
a traffic map with the at least one channel reservation grant message.
7. The apparatus of claim 3, wherein the means for transmitting comprising means for
transmitting the frame using orthogonal frequency division multiple access.
8. A method, comprising:
receiving (1210) a frame from a first node at a second node, the frame comprising
at least one channel reservation request message and at least one channel reservation
grant message; and
demultiplexing (1220) the at least one channel reservation request message and the
at least one channel reservation grant message at least by frequency-division demultiplexing,
wherein
the channel reservation request message and the channel reservation grant message
relate to communications between the first node and the second node,
wherein the receiving comprises receiving the at least one request-to-send message
and the at least one channel reservation grant message at the start of the frame when
an immediately previous frame ends with channel reservation information, and receiving
the at least one channel reservation request message and the at least one channel
reservation grant message at the end of the frame when an immediately previous frame
begins with channel reservation information.
9. The method of claim 8, wherein the receiving the frame comprises receiving a frame
wherein the at least one channel reservation request message comprises a request-to-send
message and the at least one channel reservation grant message comprises a clear-to-send
message.
10. An apparatus, comprising:
means for processing (1210) a received frame from a first node at a second node, the
frame comprising at least one channel reservation request message and at least one
channel reservation grant message, and
means for demultiplexing (1220) the at least one channel reservation request message
and the at least one channel reservation grant message at least by frequency-division
demultiplexing, wherein the channel reservation request message and the channel reservation
grant message relate to communications between the first node and the second node,
wherein the means for processing a received frame comprises means for receiving the
at least one request-to-send message and the at least one channel reservation grant
message at the start of the frame when an immediately previous frame ends with channel
reservation information, and means for receiving the at least one channel reservation
request message and the at least one channel reservation grant message at the end
of the frame when an immediately previous frame begins with channel reservation information.
11. The apparatus of claim 10, wherein the means for processing comprises means for processing
the received frame wherein the at least one channel reservation request message comprises
a request-to-send message and the at least one channel reservation grant message comprises
a clear-to-send message.
12. The apparatus of claim 10, wherein the means for processing comprises means for time-division
demultiplexing the at least one channel reservation request message and at least one
channel reservation grant message.
13. The apparatus of claim 10, wherein the means for processing comprises means for demultiplexing
at least one channel reservation request message with at least one channel reservation
grant message.
14. A computer-readable memory that stores program instructions for performing the method
according to any of claims 1-2 or 8-9.
1. Verfahren, das Folgendes umfasst:
Vorbereiten (910) eines Rahmens, der mindestens eine Kanalreservierungsanforderungsnachricht
und mindestens eine Kanalreservierungsgewährungsnachricht umfasst, wobei das Vorbereiten
das Multiplexen der mindestens einen Kanalreservierungsanforderungsnachricht und der
mindestens einen Kanalreservierungsgewährungsnachricht mindestens durch Frequenzmultiplexen
umfasst; und
Übertragen (920) des Rahmens von einem ersten Knoten zu einem zweiten Knoten, wobei
die Kanalreservierungsanforderungsnachricht und die Kanalreservierungsgewährungsnachricht
eine Kommunikation zwischen dem ersten Knoten und dem zweiten Knoten betreffen,
wobei das Vorbereiten, wenn ein direkt vorheriger Rahmen mit Kanalreservierungsinformationen
endet, das Bereitstellen (916) der mindestens einen Sendeanforderungsnachricht und
der mindestens einen Kanalreservierungsgewährungsnachricht am Anfang des Rahmens und,
wenn ein direkt vorheriger Rahmen mit Kanalreservierungsinformationen beginnt, das
Bereitstellen (917) der mindestens einen Kanalreservierungsanforderungsnachricht und
der mindestens einen Kanalreservierungsgewährungsnachricht am Ende des Rahmens umfasst.
2. Verfahren nach Anspruch 1, wobei das Vorbereiten des Rahmens das Vorbereiten eines
Rahmens umfasst, wobei die mindestens eine Kanalreservierungsanforderungsnachricht
eine Sendeanforderungsnachricht umfasst und die mindestens eine Kanalreservierungsgewährungsnachricht
eine Sendebereitschaftsnachricht umfasst.
3. Vorrichtung, die Folgendes umfasst:
ein Mittel zum Vorbereiten (910) eines Rahmens, der mindestens eine Kanalreservierungsanforderungsnachricht
und mindestens eine Kanalreservierungsgewährungsnachricht umfasst, wobei das Vorbereiten
das Multiplexen der mindestens einen Kanalreservierungsanforderungsnachricht und der
mindestens einen Kanalreservierungsgewährungsnachricht mindestens durch Frequenzmultiplexen
umfasst, und
ein Mittel zum Übertragen (920) des Rahmens von einem ersten Knoten zu einem zweiten
Knoten, wobei die Kanalreservierungsanforderungsnachricht und die Kanalreservierungsgewährungsnachricht
eine Kommunikation zwischen dem ersten Knoten und dem zweiten Knoten betreffen,
wobei das Mittel zum Vorbereiten, wenn ein direkt vorheriger Rahmen mit Kanalreservierungsinformationen
endet, ein Mittel zum Bereitstellen (916) der mindestens einen Sendeanforderungsnachricht
und der mindestens einen Kanalreservierungsgewährungsnachricht am Anfang des Rahmens
und, wenn ein direkt vorheriger Rahmen mit Kanalreservierungsinformationen beginnt,
zum Bereitstellen (917) der mindestens einen Kanalreservierungsanforderungsnachricht
und der mindestens einen Kanalreservierungsgewährungsnachricht am Ende des Rahmens
umfasst.
4. Vorrichtung nach Anspruch 3, wobei das Mittel zum Vorbereiten ein Mittel zum Vorbereiten
eines Rahmens umfasst, wobei die mindestens eine Kanalreservierungsanforderungsnachricht
eine Sendeanforderungsnachricht umfasst und die mindestens eine Kanalreservierungsgewährungsnachricht
eine Sendebereitschaftsnachricht umfasst.
5. Vorrichtung nach Anspruch 3, wobei das Mittel zum Vorbereiten ein Mittel zum Zeitmultiplexen
der mindestens einen Kanalreservierungsanforderungsnachricht und der mindestens einen
Kanalreservierungsgewährungsnachricht umfasst.
6. Vorrichtung nach Anspruch 3, wobei das Mittel zum Vorbereiten ein Mittel zum Bereitstellen
einer Verkehrskarte mit der mindestens einen Kanalreservierungsgewährungsnachricht
umfasst.
7. Vorrichtung nach Anspruch 3, wobei das Mittel zum Übertragen ein Mittel zum Übertragen
des Rahmens unter Verwendung eines orthogonalen Frequenzmehrfachzugangs umfasst.
8. Verfahren, das Folgendes umfasst:
Empfangen (1210) eines Rahmens von einem ersten Knoten an einem zweiten Knoten, wobei
der Rahmen mindestens eine Kanalreservierungsanforderungsnachricht und mindestens
eine Kanalreservierungsgewährungsnachricht umfasst; und
Demultiplexen (1220) der mindestens einen Kanalreservierungsanforderungsnachricht
und der mindestens einen Kanalreservierungsgewährungsnachricht mindestens durch Frequenzdemultiplexen,
wobei die Kanalreservierungsanforderungsnachricht und die Kanalreservierungsgewährungsnachricht
eine Kommunikation zwischen dem ersten Knoten und dem zweiten Knoten betreffen,
wobei das Empfangen, wenn ein direkt vorheriger Rahmen mit Kanalreservierungsinformationen
endet, das Empfangen der mindestens einen Sendeanforderungsnachricht und der mindestens
einen Kanalreservierungsgewährungsnachricht am Anfang des Rahmens und, wenn ein direkt
vorheriger Rahmen mit Kanalreservierungsinformationen beginnt, das Empfangen der mindestens
einen Kanalreservierungsanforderungsnachricht und der mindestens einen Kanalreservierungsgewährungsnachricht
am Ende des Rahmens umfasst.
9. Verfahren nach Anspruch 8, wobei das Empfangen des Rahmens das Empfangen eines Rahmens
umfasst, wobei die mindestens eine Kanalreservierungsanforderungsnachricht eine Sendeanforderungsnachricht
umfasst und die mindestens eine Kanalreservierungsgewährungsnachricht eine Sendebereitschaftsnachricht
umfasst.
10. Vorrichtung, die Folgendes umfasst:
ein Mittel zum Verarbeiten (1210) eines empfangenen Rahmens an einem zweiten Knoten
von einem ersten Knoten, wobei der Rahmen mindestens eine Kanalreservierungsanforderungsnachricht
und mindestens eine Kanalreservierungsgewährungsnachricht umfasst, und
ein Mittel zum Demultiplexen (1220) der mindestens einen Kanalreservierungsanforderungsnachricht
und der mindestens einen Kanalreservierungsgewährungsnachricht mindestens durch Frequenzdemultiplexen,
wobei die Kanalreservierungsanforderungsnachricht und die Kanalreservierungsgewährungsnachricht
eine Kommunikation zwischen dem ersten Knoten und dem zweiten Knoten betreffen,
wobei das Mittel zum Verarbeiten eines empfangenen Rahmens, wenn ein direkt vorheriger
Rahmen mit Kanalreservierungsinformationen endet, ein Mittel zum Empfangen der mindestens
einen Sendeanforderungsnachricht und der mindestens einen Kanalreservierungsgewährungsnachricht
am Anfang des Rahmens und, wenn ein direkt vorheriger Rahmen mit Kanalreservierungsinformationen
beginnt, ein Mittel zum Empfangen der mindestens einen Kanalreservierungsanforderungsnachricht
und der mindestens einen Kanalreservierungsgewährungsnachricht am Ende des Rahmens
umfasst.
11. Vorrichtung nach Anspruch 10, wobei das Mittel zum Verarbeiten ein Mittel zum Verarbeiten
des empfangenen Rahmens umfasst, wobei die mindestens eine Kanalreservierungsanforderungsnachricht
eine Sendeanforderungsnachricht umfasst und die mindestens eine Kanalreservierungsgewährungsnachricht
eine Sendebereitschaftsnachricht umfasst.
12. Vorrichtung nach Anspruch 10, wobei das Mittel zum Verarbeiten ein Mittel zum Zeitdemultiplexen
der mindestens einen Kanalreservierungsanforderungsnachricht und der mindestens einen
Kanalreservierungsgewährungsnachricht umfasst.
13. Vorrichtung nach Anspruch 10, wobei das Mittel zum Verarbeiten ein Mittel zum Demultiplexen
mindestens einer Kanalreservierungsanforderungsnachricht mit mindestens einer Kanalreservierungsgewährungsnachricht
umfasst.
14. Computerlesbarer Speicher, in dem Programmanweisungen zum Durchführen des Verfahrens
nach einem der Ansprüche 1-2 oder 8-9 gespeichert sind.
1. Procédé, comprenant :
la préparation (910) d'une trame comprenant au moins un message de demande de réservation
de canaux et au moins un message d'acceptation de réservation de canaux, la préparation
comprenant le multiplexage de l'au moins un message de demande de réservation de canaux
et de l'au moins un message d'acceptation de réservation de canaux au moins par multiplexage
par répartition en fréquence ; et
la transmission (920) de la trame d'un premier noeud à un deuxième noeud, le message
de demande de réservation de canaux et le message d'acceptation de réservation de
canaux concernant les communications entre le premier noeud et le deuxième noeud,
la préparation comprenant la fourniture (916) de l'au moins un message de demande
à envoyer et de l'au moins un message d'acceptation de réservation de canaux au début
de la trame lorsqu'une trame immédiatement précédente se termine avec des informations
de réservation de canaux, et la fourniture (917) de l'au moins un message de demande
de réservation de canaux et de l'au moins un message d'acceptation de réservation
de canaux à la fin de la trame quand une trame immédiatement précédente commence avec
des informations de réservation de canaux.
2. Procédé selon la revendication 1, la préparation de la trame comprenant la préparation
d'une trame, l'au moins un message de demande de réservation de canaux comprenant
un message de demande pour émettre et l'au moins un message d'acceptation de réservation
de canaux comprenant un message prêt à émettre.
3. Appareil, comprenant :
des moyens pour préparer (910) une trame comprenant au moins un message de demande
de réservation de canaux et au moins un message d'acceptation de réservation de canaux,
la préparation de la trame comprenant le multiplexage de l'au moins un message de
demande de réservation de canaux et de l'au moins un message d'acceptation de réservation
de canaux au moins par multiplexage par répartition en fréquence, et des moyens pour
transmettre (920) la trame depuis un premier noeud vers un deuxième noeud, le message
de demande de réservation de canaux et le message d'acceptation de réservation de
canaux concernant les communications entre le premier noeud et le deuxième noeud,
les moyens de préparation comprenant des moyens pour fournir (916) l'au moins un message
de demande pour émettre et l'au moins un message d'acceptation de réservation de canaux
au début de la trame lorsqu'une trame immédiatement précédente se termine avec des
informations de réservation de canaux, et fournir (917) l'au moins un message de demande
de réservation de canaux et l'au moins un message d'acceptation de réservation de
canaux à la fin de la trame lorsqu'une trame immédiatement précédente commence avec
des informations de réservation de canaux.
4. Appareil selon la revendication 3, les moyens de préparation comprenant des moyens
pour préparer une trame, l'au moins un message de demande de réservation de canaux
comprenant un message de demande pour émettre et l'au moins un message d'acceptation
de réservation de canaux comprenant un message prêt à émettre.
5. Appareil selon la revendication 3, les moyens de préparation comprenant des moyens
pour multiplexer par répartition dans le temps l'au moins un message de demande de
réservation de canaux et l'au moins un message d'acceptation de réservation de canaux.
6. Appareil selon la revendication 3, les moyens de préparation comprenant des moyens
pour fournir une carte de trafic avec au moins un message d'acceptation de réservation
de canaux.
7. Appareil selon la revendication 3, les moyens de transmission comprenant des moyens
pour transmettre la trame en utilisant un accès multiple à répartition en fréquence
orthogonale.
8. Procédé, comprenant :
la réception (1210) d'une trame à partir d'un premier noeud à un deuxième noeud, la
trame comprenant au moins un message de demande de réservation de canaux et au moins
un message d'acceptation de réservation de canaux ; et
le démultiplexage (1220) de l'au moins un message de demande de réservation de canaux
et de l'au moins un message d'acceptation de réservation de canaux au moins par démultiplexage
par répartition en fréquence, le message de demande de réservation de canaux et le
message d'acceptation de réservation de canaux concernant des communications entre
le premier noeud et le deuxième noeud,
la réception comprenant la réception de l'au moins un message de demande pour émettre
et de l'au moins un message d'acceptation de réservation de canaux au début de la
trame lorsqu'une trame immédiatement précédente se termine avec des informations de
réservation de canaux, et la réception de l'au moins un message de demande de réservation
de canaux et de l'au moins un message d'acceptation de réservation de canaux à la
fin de la trame lorsqu'une trame immédiatement précédente commence par des informations
de réservation de canaux.
9. Procédé selon la revendication 8, la réception de la trame comprenant la réception
d'une trame, l'au moins un message de demande de réservation de canaux comprenant
un message de demande pour émettre et l'au moins un message d'acceptation de réservation
de canaux comprenant un message prêt à émettre.
10. Appareil, comprenant :
des moyens pour traiter (1210) une trame reçue d'un premier noeud à un deuxième noeud,
la trame comprenant au moins un message de demande de réservation de canaux et au
moins un message d'acceptation de réservation de canaux, et
des moyens pour démultiplexer (1220) l'au moins un message de demande de réservation
de canaux et l'au moins un message d'acceptation de réservation de canaux au moins
par démultiplexage par répartition en fréquence, le message de demande de réservation
de canaux et le message d'acceptation de réservation de canaux concernant des communications
entre le premier noeud et le deuxième noeud,
les moyens pour traiter une trame reçue comprenant des moyens pour recevoir l'au moins
un message de demande pour émettre et l'au moins un message d'acceptation de réservation
de canaux au début de la trame lorsqu'une trame immédiatement précédente se termine
avec des informations de réservation de canaux, et des moyens pour recevoir l'au moins
un message de demande de réservation de canaux et l'au moins un message d'acceptation
de réservation de canaux à la fin de la trame lorsqu'une trame immédiatement précédente
commence avec des informations de réservation de canaux.
11. Appareil selon la revendication 10, les moyens de traitement comprenant des moyens
pour traiter la trame reçue, l'au moins un message de demande de réservation de canaux
comprenant un message de demande pour émettre et l'au moins un message d'acceptation
de réservation de canaux comprenant un message prêt à émettre.
12. Appareil selon la revendication 10, les moyens de traitement comprenant des moyens
pour démultiplexer par répartition dans le temps l'au moins un message de demande
de réservation de canaux et l'au moins un message d'acceptation de réservation de
canaux.
13. Appareil selon la revendication 10, les moyens de traitement comprenant des moyens
pour démultiplexer au moins un message de demande de réservation de canaux avec au
moins un message d'acceptation de réservation de canaux.
14. Mémoire lisible par ordinateur qui stocke les instructions de programme pour réaliser
le procédé selon l'une quelconque des revendications 1-2 ou 8-9.