U.S. patent application number 12/969971 was filed with the patent office on 2011-04-14 for reuse pattern network scheduling using interference levels.
This patent application is currently assigned to Fujitsu Limited. Invention is credited to Jonathan Agre, Wei-Peng Chen, Jagan Seshadri, Dorin Viorel, Chenxi ZHU.
Application Number | 20110086653 12/969971 |
Document ID | / |
Family ID | 39360302 |
Filed Date | 2011-04-14 |
United States Patent
Application |
20110086653 |
Kind Code |
A1 |
ZHU; Chenxi ; et
al. |
April 14, 2011 |
REUSE PATTERN NETWORK SCHEDULING USING INTERFERENCE LEVELS
Abstract
Interference levels occurring at one or more stations are
mapped, and a reuse pattern is generated, based on the mapped
interference levels, including one or more reuse sets of stations
capable of sharing a transmission resource. The stations within
each reuse set are listed in increasing order based on their
respective interference levels, and an additional station is added
to a reuse set, as long as the cumulative interference level within
the reuse set is below a threshold interference level and the
additional station is not already listed in another reuse set. A
network schedule is updated based on the reuse pattern to increase
bandwidth efficiency in the network.
Inventors: |
ZHU; Chenxi; (Gaithersburg,
MD) ; Viorel; Dorin; (Calgary, CA) ; Seshadri;
Jagan; (Calgary, CA) ; Agre; Jonathan;
(Brinklow, MD) ; Chen; Wei-Peng; (Santa Clara,
CA) |
Assignee: |
Fujitsu Limited
Kawasaki
JP
|
Family ID: |
39360302 |
Appl. No.: |
12/969971 |
Filed: |
December 16, 2010 |
Related U.S. Patent Documents
|
|
|
|
|
|
Application
Number |
Filing Date |
Patent Number |
|
|
11777385 |
Jul 13, 2007 |
7877097 |
|
|
12969971 |
|
|
|
|
60864498 |
Nov 6, 2006 |
|
|
|
Current U.S.
Class: |
455/501 |
Current CPC
Class: |
H04W 16/02 20130101 |
Class at
Publication: |
455/501 |
International
Class: |
H04B 15/00 20060101
H04B015/00 |
Claims
1. A method comprising: generating, by an entity in a wireless
network, a reuse set capable of sharing a transmission resource,
wherein said generating comprises: beginning with a respective
station of a plurality of stations in the network with a smallest
interference level, adding the respective station to the reuse set,
and adding an additional station of the plurality of stations with
a next lowest interference level to the reuse set, as long as a
cumulative interference level within the reuse set is below a
threshold interference level and the additional station is not
already assigned to another reuse set.
2. The method as in claim 1, wherein the network is an Institute of
Electrical and Electronics Engineers (IEEE) 802.16 system, and each
of the plurality of stations is a base station or a relay
station.
3. The method of claim 1, further comprising: generating a
plurality of reuse sets; and removing empty reuse sets that include
no stations.
4. The method of claim 1, further comprising: generating a reuse
pattern comprising one or a plurality of reuse sets; and generating
a network schedule, by a network management entity, based on the
reuse pattern, to increase bandwidth efficiency.
5. The method of claim 1, wherein the plurality of stations
includes at least one relay station.
6. An apparatus comprising: means for generating a reuse set
capable of sharing a transmission resource, wherein the means for
generating comprises: means, beginning with a respective station of
a plurality of stations in the network with a smallest interference
level, for adding the respective station to the reuse set, and
means for adding an additional station of the plurality of stations
with a next lowest interference level to the reuse set, as long as
a cumulative interference level within the reuse set is below a
threshold interference level and the additional station is not
already assigned to another reuse set.
7. A system for generating a reuse group on interference levels in
an Institute of Electrical and Electronics Engineers (IEEE) 802.16
network, comprising: means for generating a reuse pattern capable
of sharing a transmission resource, wherein the means for
generating comprises: means for adding an additional station to a
respective reuse set, as long as a cumulative interference level
within the respective reuse set is below a threshold interference
level and the additional station is not already assigned to another
reuse set.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application is a continuation of U.S. Ser. No.
11/777,385, filed Jul. 13, 2007, which is incorporated herein by
reference in its entirety. Moreover, this application is based on,
and claims the benefit of, U.S. Provisional Application titled
"REUSE PATTERN NETWORK SCHEDULING ALGORITHM FOR OFDMA NETWORKS
USING RELAY STATIONS", U.S. Ser. No. 60/864,498, filed Nov. 6,
2006, inventors Chenxi Zhu, Dorin Viorel, Jagan Seshadri, Jonathan
Agre and Wei-Peng Chen, Attorney Docket No. 1974.1009P, and which
is incorporated herein by reference in its entirety.
BACKGROUND OF THE INVENTION
Description of the Related Art
[0002] Wireless communication networks have become increasingly
popular and generally include a base station that provides service
to a cell area located around the base station. Subscriber
stations, including mobile stations (such as cell phones, etc.),
are able to communicate with the base station when they are within
the service area (such as the cell area) of the base station.
[0003] Interference among stations in the same or different cells
of the network can cause significant problems. The use of relay
stations in the network can complicate interference problems.
SUMMARY OF THE INVENTION
[0004] Various embodiments of the present invention provide a
method and apparatus which (a) maps interference levels occurring
at one or more stations in a wireless network; and (b) generates a
reuse set, based on the mapping, of stations, included in said one
or more stations, capable of sharing a transmission resource.
[0005] Various embodiments of the present invention provide a
method and apparatus which (a) maps interference levels occurring
in one or more stations in an Institute of Electrical and
Electronics Engineers (IEEE) 802.16 system, each station of said
one or more stations being a base station or a relay station; and
(b) generates a reuse pattern, based on the mapping, including one
or more reuse sets of stations, included in said one or more
stations, capable of sharing a transmission resource.
[0006] The above embodiments of the present invention are simply
examples, and all embodiments of the present invention are not
limited to these examples or to including all the features
described in the Summary of the Invention section of this
application.
[0007] Additional features of the invention will be set forth in
part in the description which follows, and, in part, will be
obvious from the description, or may be learned by practice of the
invention.
BRIEF DESCRIPTION OF THE DRAWINGS
[0008] FIG. 1 is an illustration of an example of a wireless
network topology involving a base station, a network management
entity (such as a base station controller) and three relay stations
operating in an OFDMA network under the IEEE 802.16j standard.
[0009] FIG. 2 is a flowchart illustrating the method of mapping
interference levels occurring at one or more stations in a wireless
network and generating a reuse set, according to embodiments of the
present invention.
[0010] FIG. 3 is a flowchart illustrating the method of generating
a reuse set, according to embodiments of the present invention.
[0011] FIG. 4 is a flowchart illustrating the method of generating
one or a plurality of reuse sets and a reuse pattern used to update
a network schedule, according to embodiments of the present
invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0012] Reference will now be made in detail to the present
preferred embodiments of the present invention, examples of which
are illustrated in the accompanying drawings, wherein like
reference numerals refer to like elements throughout.
[0013] In wireless communication networks, due to such effects as
shadowing arising from blockage by buildings and other obstructions
between transmission/reception antennas, there exist dead zones in
which communication with the base station is not possible, despite
being within the service area. To combat this problem, in a
wireless network, such as for example, an Orthogonal Frequency
Division Multiple Access (OFDMA) network, relay stations can be
employed for providing enhanced transmission capabilities by acting
as intermediaries between mobile stations operating in the network
and the base station. In this manner, a mobile station that is
incapable of connecting directly to a base station within its cell
service area may still connect indirectly to the base station by
first communicating with a relay station that does have a direct
link, or possibly an indirect link through additional relay
stations, to the base station.
[0014] A problem arises, however, in that greater levels of
interference are produced in the network with the addition of base
and relay stations. Spatial reuse of the spectrum in the network is
required to increase the spectrum efficiency and total capacity of
the network, subject to the requirement the interference caused by
concurrent transmissions needs to be carefully managed. Since the
increased intranet interference degrades the carrier to
interference-plus-noise ration (CINR) for the impacted links,
properly scheduling the concurrent transmissions to mitigate the
interference levels impacts directly the quality of service (QoS)
on these links.
[0015] Therefore, a network entity schedule algorithm can be
defined that reduces the intranet interference between different
stations (either base stations or relay stations) operating within
the wireless network (e.g., an OFDMA network) while at the same
time maximizes the spatial reuse of the radio resource, thereby
optimizing CINR degradation and thus allowing higher coding rates
to be used on the impacted links.
[0016] FIG. 1 is an illustrative example of a wireless network
topology involving a base station and three relay stations
operating in an OFDMA network. The network cell includes a base
station (BS) 10, a first relay station (RS1) 20, a second relay
station (RS2) 21, a third relay station (RS3) 22 and a network
management entity 30. This example topology is intended to show a
single possibility of a network cell, and embodiments of the
present invention are not limited to any particular topology. For
example, embodiments of the present invention are not limited to a
network with the specific number of base and/or relay stations in
the specific configuration shown in FIG. 1.
[0017] In the specific example in FIG. 1, RS1 20 can communicate
directly with BS 10 via the transmission link between BS 10 and RS1
20, or indirectly via the transmission link from BS 10 to RS2 21
and then through the transmission link from RS2 21 to RS1 20.
[0018] Various embodiments of the present invention assume a fixed
reuse pattern. That is, the base stations and relay stations are
assumed to be in fixed positions and each transmitter (either a
base station or a relay station) transmits with a fixed power
assigned by network management entity 30. However, the present
invention is not limited to a fixed reuse pattern.
[0019] As the algorithms described herein are computationally
demanding, various embodiments of the present invention are
intended for use in networks where, for example, each base station
and relay station generates its own transmission schedule. However,
the present invention is not limited to each base and relay station
generating its own transmission schedule.
[0020] FIG. 2 is a flowchart illustrating a method of mapping
interference levels occurring at one or more stations in a wireless
network and generating a reuse set, according to embodiments of the
present invention. Referring now to FIG. 2, at operation 110,
interference levels occurring at one or more stations in a wireless
network are mapped.
[0021] For example, network management entity 30 (see FIG. 1)
produces a mapped interference matrix based, for example, on noise
plus interference measurements performed by different stations
(e.g., base station 10) positioned within a cluster of cells
subject to the interference mapping. That is, the interference
matrix includes the noise plus interference generated by each
station upon each other station.
[0022] A mapping interference mode is, for example, a maintenance
type of operation, in which an implementation-specific network
interference mapping pattern is transmitted from a station using,
for example, fixed power. As an example, each relay station within
the cluster of cells subject to the interference mapping transmits
within the same uplink (UL) frame, a specific UL interference
pattern based, for example, on a specific UL sounding sequence.
Upon receiving the UL interference patterns, all stations within
the cluster of cells execute, for example, burst noise power
measurements on the received UL interference patterns. Of course,
the present invention is not limited to any particular UL
interference pattern based on any specific UL sounding sequence, or
to stations executing any particular burst noise power
measurements.
[0023] For example, the burst power measurements executed by the
stations are implementation specific and could include, for
example, Received Signal Strength Indication (RSSI) measurements
or, for example, Signal to Interference Plus Noise Ration (SINR)
measurements. These burst power measurements are, for example,
proportional with the interference path between stations sending
and receiving the UL interference patterns. Of course, the present
invention is not limited to any particular measurements being
included in the executed burst power measurements.
[0024] According to various embodiments of the present invention,
the network interference mapping pattern is scheduled, for example,
periodically by network management entity 30. Each base station
(e.g. base station BS 10) then, for example, averages the burst
power measurements from each station and transmit the averaged
measurements to network management entity 30 to generate the
interference matrix. However, the present invention is not limited
to periodic scheduling of network interference mapping, or to any
particular types of calculations.
[0025] An example interference matrix (INT) shown below maps the
noise plus interference caused by each station upon each other
station in the wireless network. As shown in this example,
NI.sub.ij represents the noise (N) plus interference (I) caused by
station "i" upon station "j". The effect is not necessarily
symmetrical due to the potential different transmission powers of
the stations, although it is assumed that each transmitter
transmits with a fixed power. This example shows a square Y.times.Y
matrix, but the matrix could also be an Y.times.M matrix.
INT = [ NI 1 , 1 NI 1 , 2 NI 1 , 3 NI 2 , 1 NI 2 , 2 NI 2 , 3 NI 3
, 1 NI 3 , 2 NI 3 , 3 ] ##EQU00001##
[0026] The above-described mapping the interference levels by
estimation of the interference matrix is described, for example, in
U.S. Provisional Application No. 60/864,491, titled "INTERFERENCE
MAPPING PROCEDURE FOR OFDMA NETWORKS USING RELAY STATIONS",
inventors Chenxi Zhu, Dorin Viorel, Jagan Seshadri, Jonathan Agre
and Wei-Peng Chen, filed Nov. 6, 2006, attorney docket number
1974.1007P, and U.S. Provisional Application No. 60/891,096, titled
"INTERFERENCE MAPPING PROCEDURE FOR OFDMA NETWORKS USING RELAY
STATIONS", inventors Chenxi Zhu, Dorin Viorel, Jagan Seshadri,
Jonathan Agre and Wei-Peng Chen, filed Feb. 22, 2007, attorney
docket number 1974.1020P, and U.S. utility patent application
titled "INTERFERENCE MEASURING AND MAPPING METHOD AND APPARATUS FOR
WIRELESS NETWORKS USING RELAY STATIONS", U.S. Ser. No. 11/777,566,
inventors Chenxi Zhu, Dorin Viorel, Jagan Seshadri, Jonathan Agre
and Wei-Peng Chen, attorney docket number 1974.1020, filed Jul. 13,
2007, and which are incorporated herein by reference in their
entirety. However, the present invention is not limited to this
specific manner of mapping the interference levels, and other
manners of mapping the interference levels can be implemented. More
specifically, the present invention is not limited to the mapping
the interference levels by estimation of the interference matrix as
described above, and in U.S. Provisional Application No.
60/864,491, titled "INTERFERENCE MAPPING PROCEDURE FOR OFDMA
NETWORKS USING RELAY STATIONS", inventors Chenxi Zhu, Dorin Viorel,
Jagan Seshadri, Jonathan Agre and Wei-Peng Chen, filed Nov. 6,
2006, attorney docket number 1974.1007P, and U.S. Provisional
Application No. 60/891,096, titled "INTERFERENCE MAPPING PROCEDURE
FOR OFDMA NETWORKS USING RELAY STATIONS", inventors Chenxi Zhu,
Dorin Viorel, Jagan Seshadri, Jonathan Agre and Wei-Peng Chen,
filed Feb. 22, 2007, attorney docket number 1974.1020P, and U.S.
utility patent application titled "INTERFERENCE MEASURING AND
MAPPING METHOD AND APPARATUS FOR WIRELESS NETWORKS USING RELAY
STATIONS", U.S. Ser. No. 11/777,566, inventors Chenxi Zhu, Dorin
Viorel, Jagan Seshadri, Jonathan Agre and Wei-Peng Chen, attorney
docket number 1974.1020, filed Jul. 13, 2007. Accordingly, the
present invention is not limited to any particular manner of
mapping interference levels in operation 110.
[0027] From operation 110, the process moves to operation 120,
where a reuse set of stations capable of sharing a transmission
resource is generated based on the mapping operation 110. Specific
operations of generating the reuse set are described in detail with
reference to FIG. 3 described below.
[0028] FIG. 3 is a flowchart illustrating a method of generating a
reuse set, according to an embodiment of the present invention.
Referring now to FIG. 3, in operation 210, the one or more stations
within the wireless network are sorted, for example, by network
management entity 30 in, for example, increasing order based on
their respective interference levels mapped by operation 110 (see
FIG. 2) described above. The present invention is not limited to
sorting in an increasing order, and other variations of a sorting
procedure can be implemented. In addition, the sorting is not
limited to being performed by network management entity 30, and
could be performed by other entities in the network.
[0029] From operation 210, the process moves to operation 220,
where network management entity 30 determines, for example, the
station with the lowest interference level (i.e., the smallest
NI.sub.ij), based on the mapping operation 110, and this station is
added to the reuse set. The present invention is not limited to
determining the station with the lowest interference level, and
other variations can be implemented, based on the sorting procedure
implemented in operation 210. In addition, the determination is not
limited to being performed by network management entity 30, and
could be performed by other entities in the network.
[0030] From operation 220, the process moves to operation 230, in
which it is determined, using the sorting procedure 210, whether
the station with the next lowest interference level is unassigned
to a reuse set and whether the cumulative interference level within
the reuse set currently being generated would be below a threshold
interference level for all the stations already in the reuse set
and for the station under consideration for being added to the
reuse set if the station with the next lowest interference level is
added to the reuse set currently being generated.
[0031] The threshold interference level is a predetermined level
set by, for example, the network management entity 30 (see FIG. 1).
The threshold interference level is, for example, fixed and is
determined, for example, by simulations based on an effective
coding rate calculated by averaging transmission rates to mobile
stations by the base and/or relay stations. The threshold
interference level reflects, for example, the maximal total
interference that a downlink transmitter (a base station or a relay
station) can tolerate is allowed to cause to other cells sharing
the same spectrum. The network management entity 30 is capable of
determining, for example, the maximal transmission power used by
each base and relay station. However, the present invention is not
limited to the predetermined level of the threshold interference
level being set by the network management entity 30 or to being
fixed or to being determined based on any particular
simulation.
[0032] If both of the conditions checked in operation 230 are not
met, the process moves to operation 250, where it is checked if
every station has been either assigned to a reuse set (including
previous constructed reuse sets and the current one), or is not
eligible to the current reuse set. If both conditions are not met,
the process returns to operation 230, where the next station in the
sorted list of stations, with a next lowest interference level, is
checked to determine whether it is already assigned to a reuse set
or the cumulative interference level within the reuse set currently
being generated would be below a threshold interference level if
the current station being checked is added to the reuse set
currently being generated.
[0033] If both of the conditions checked in operation 230 are
satisfied, the process moves to operation 260 in which the station
being checked is, for example, added to the reuse set currently
being generated. From operation 260, the process moves to operation
250, where it is determined, for example, whether all stations are
assigned to a reuse set.
[0034] The process including operations 230, 250 and 260 is
reiterated, for example, until all stations have been either
assigned to a reuse set or determined not eligible to any reuse
sets constructed as determined by operation 250. When operation 250
determines that, for example, all stations are assigned, the
process of constructing a reuse set ends. The process may repeat
and generate a reuse set each time, until all stations have been
assigned to some reuse set.
[0035] The process illustrated in FIG. 3 assures that each
generated reuse set includes as many stations (relay and/or base
stations) as possible, while still having a cumulative interference
level below the threshold interference level. Thus, each generated
reuse set includes the maximum number of stations while tolerating
the cumulative interference when transmitting with a predetermined
effective coding rate and transmission power. As a result, each
generated reuse set includes one or more stations which are capable
of sharing a transmission resource, including a frequency or a
timeslot, or a combination of both.
[0036] Of course, the process in FIG. 3 is only one example of a
process to generate a reuse set, and many variations are possible.
The present invention is not limited to the specific example in
FIG. 3. For example, the present invention is not limited to
including each of the specific operations in FIG. 3. Moreover,
there are many variations of the specific operations in FIG. 3 that
can be implemented.
[0037] FIG. 4 is a flowchart illustrating the method of generating
one or a plurality of reuse sets and a reuse pattern used to update
a network schedule, according to an embodiment of the present
invention. Referring now to FIG. 4, operation 310 represents the
generation of one or a plurality of reuse sets using the reuse set
generation operation described above (see FIG. 3).
[0038] From operation 310, the process moves to operation 320, in
which, for example, any empty reuse sets (i.e., reuse sets
including no base stations or relay stations) are removed.
[0039] From operation 320, the process moves to operation 330, in
which, for example, the remaining reuse sets are grouped to form a
reuse pattern, including one or a plurality of reuse sets.
[0040] From operation 330, the process moves to operation 340,
where, for example, the network management entity 30 or a base
station 10 (see FIG. 1) generates a network schedule including the
radio resources that base station and relay stations in each
respective reuse set is allowed to use for its downlink access. The
bandwidth can be efficiently allocated using, for example, the
reuse pattern by assigning resources to individual reuse sets
including a maximum number of base stations and relay stations,
while, for example, maintaining a cumulative interference level
below the predetermined threshold interference level. As an
example, each station generates its own transmission schedule using
the radio resource assigned to it by, for example, network
management entity 30 or a base station 10.
[0041] From operation 340, the process moves to operation 350,
where network management entity 30 or the base station 10 waits,
for example, for a predetermined period of time before updating the
network schedule. The base station may update the network
interference matrix by having the transmission stations estimate
the interference from other transmission stations, and collect and
update the network load and/or congestion information. Because the
computations at network management entity 30 or the base station 10
are intensive, the update may take place, for example, over tens of
frames. For example, the network schedule can be set to update
every ten seconds. However, the present invention is not limited to
any particular period of time before updating the network
schedule.
[0042] From operation 350, the process moves to operation 360,
where the network schedule is updated after a predetermined period
of time in order to assure that the network schedule optimally
allocates transmission resources, based on the reuse pattern.
[0043] Of course, the process in FIG. 4 is only one example of a
process to generate one or a plurality of reuse sets and a reuse
pattern. The present invention is not limited to the specific
example in FIG. 4. For example, the present invention is not
limited to including each of the specific operations in FIG. 4.
Moreover, there are many variations of the specific operations in
FIG. 4 that can be implemented.
[0044] Various embodiments of the present invention provide a
method and apparatus which (a) maps interference levels occurring
at one or more stations in a wireless network; and (b) generates a
reuse set, based on the mapping, of stations, included in said one
or more stations, capable of sharing a transmission resource.
Although not limited to any particular type of wireless network,
various embodiments of the present invention are applicable for use
within an IEEE 802.16 system, where each of the one or more
stations is a base station or a relay station.
[0045] Various embodiments of the present invention provide a
method and apparatus in which generating a reuse set includes (a)
sorting one or more stations in increasing order based on their
respective mapped interference levels; (b) beginning with a
station, among the one or more stations, with the smallest
interference level, adding the station to the reuse set; (c) adding
an additional station with a next lowest interference level to the
reuse set, as long as a cumulative interference level for every
station within the reuse set is below a threshold interference
level and the additional station is not already assigned to another
reuse set; and (d) repeatedly adding an additional station, as
described above, until each of the one or more stations is included
in a reuse set.
[0046] Various embodiments of the present invention provide a
method and apparatus which (a) generates a reuse pattern comprising
one or a plurality of reuse sets; and (b) updates a network
schedule, by a network management entity, based on the reuse
pattern, to increase bandwidth efficiency.
[0047] Various embodiments of the present invention provide a
system for generating a reuse group based on interference levels in
an IEEE 802.16 network. In various embodiments of the present
invention, the system (a) maps interference levels, occurring at
one or more stations, each of said one or more stations being a
base station or a relay station; and (b) generates a reuse pattern,
based on the mapped interference levels, including one or more
reuse sets of stations, included in said one or more stations,
capable of sharing a transmission resource. In various embodiments
of the present invention, within each reuse set, the stations are
listed in increasing order based on their respective interference
levels, and an additional station is added to a reuse set, as long
as the cumulative interference level within the reuse set is below
a threshold interference level and the additional station is not
already listed in another reuse set. In various embodiments of the
present invention, the system removes empty reuse sets. In various
embodiments of the present invention, the system also generates a
network schedule, by a network management entity, based on the
reuse pattern to increase bandwidth efficiency in the network.
[0048] Various embodiments of the present invention are applicable
to IEEE 802.16 networks, which includes amendments or extensions to
IEEE 802.16. However, the present invention is not limited to IEEE
802.16 networks, and is applicable to other types of networks.
[0049] Similarly, various embodiments of the present invention are
applicable to OFDMA networks. However, the present invention is not
limited to OFDMA networks, and is applicable to other types of
networks.
[0050] Various embodiments of the present invention are described
herein with respect to "mobile" stations that communicate with base
stations and relay stations in a network. However, the present
invention is not limited to networks with "mobile" stations.
Instead, a network might have many different types of stations,
typically referred to a "subscriber" stations, which communicate
with base and/or relay stations. A "mobile" station is one type of
"subscriber" station.
[0051] According to embodiments of the present invention, the above
described methods, apparatuses and systems can, for example,
mitigate the intranet interference between different stations
(either base stations or relay stations) operating within the
wireless network (e.g., an OFDMA network), thereby optimizing CINR
degradation and thus allowing higher coding rates to be used on the
impacted links, and cause a related improvement on the spectral
efficiency per link, considering the improvement in the related
bandwidth efficiency.
[0052] U.S. utility application titled "REUSE PATTERN NETWORK
SCHEDULING USING LOAD LEVELS", U.S. Ser. No. 11/777,494, inventors
Chenxi Zhu, Wei-Peng Chen, Jonathan Agre, Dorin Viorel and Jagan
Seshadri, filed Jul. 13, 2007, attorney docket number 1974.1019,
and U.S. Provisional Application titled "Load-Based MMR Network
Scheduling Algorithm With Frequency Reuse", U.S. Application Ser.
No. 60/884,464, filed Jan. 11, 2007, inventors Chenxi Zhu, Dorin
Viorel, Jagan Seshadri, Jonathan Agre and Wei-Peng Chen, Attorney
Docket No. 1974.1019P, and which are incorporated herein by
reference in their entireties.
[0053] Although a few preferred embodiments of the present
invention have been shown and described, it would be appreciated by
those skilled in the art that changes may be made in these
embodiments without departing from the principles and spirit of the
invention, the scope of which is defined in the claims and their
equivalents.
* * * * *