Mitsubishi Electric Research Labs.

Mitsubishi Electric Research Laboratories, Inc.

Yu-Jung Chang

Jinyun Zhang

Zhifeng Tao

A method allocates frequency subchannels in an orthogonal frequency-division multiple access (OFDMA) network including a set of base stations and a set of mobile stations for each base station. A graph of nodes and edges is constructed, in which the nodes represent the mobile stations in the network, and the edges connecting the nodes represent subchannel allocation constraints to be satisfied for the mobile stations represented by the nodes. The nodes are colored with colors selected from a set of colors such that subchannel allocation constraints of a pair of nodes connected by one of the edges are satisfied. The subchannels are allocated to the mobile stations according to the colors of the corresponding the nodes.

Graph-based method for dynamic fractional frequency reuse

A method allocates radio channel resource in an orthogonal frequency-division multiple access network including a set of base stations (BS) and a set of mobile stations (MS). For each BS, a diversity set is maintained for the sets of MS. Each BS determines possible interference at the MS based on the diversity set. A graph is constructed, in which nodes represent the sets of MS, and each edge between a pair of nodes represents channel interference between the MS represented by the pair of nodes. A weight is assigned to each edge, which reflects interference and signal strength on the subchannel between the two MSs connected by the edge. Channel resources are allocated to the MS based on the graph.

Graph-based method for allocating resources in OFDMA networks

A method allocates radio channel resources in an orthogonal frequency-division multiple access network including a set of base stations (BS) and a set of mobile stations (MS). For each BS, a diversity set is maintained for the sets of MS. Each BS determines possible interference at the MS based on the diversity set. A graph is constructed, in which nodes represent the sets of MS, mid each edge between a pair of nodes represents channel interference between the MS represented by the pair of nodes. A weight is assigned to each edge, which reflects interference between the two MSs connected by the edge. The interference graph is partitioned into non-overlapping clusters of nodes based on a structure of the interference graph, the potential interference, so that a sum of the weights of the edges between each cluster is maximized. Based upon the graph partitioning, the channel resources are allocated to the mobile stations in order to maximize the system capacity.

Growing community of inventors

Somerville, MA, United States of America

Yu-Jung Chang