Computing optimal channel allocations using decomposition methods and related devices
First Claim
Patent Images
1. A method for allocating one or more channels to access points (APs) during a time frame, t, within a network comprising:
- (a) assigning a weight, Wn, where n=1,2, . . . n ,to each AP;
(b) dividing an interference graph into a plurality of subgraphs;
(c) computing a maximized sum of weights associated with activated APs for each subgraph;
(d) combining each of the maximized sums to compute a first, total sum of weights for all of the subgraphs;
(e) forming new subgraphs;
(f) carrying out steps (c) and (d) using the new subgraphs;
(g) combining sums associated with the new subgraphs to compute a new total sum of weights;
(h) selecting a highest total sum of weights from the first computed total sum of weights and all of the subsequently computed, new total sum of weights, wherein the selected total sum represents a best approximation of optimal channel allocations; and
(i) allocating one or more channels to an AP based on the selected total sum performing the steps (a)-(i) by a controller.
12 Assignments
0 Petitions
Accused Products
Abstract
By decomposing (i.e., dividing) an interference graph into subgraphs, it becomes feasible to compute close approximations of an optimal channel allocation scheme within a reasonable amount of time. The channel allocation scheme may be used to allocate specific channels to access points (APs) in a wireless, local area network (WLAN).
7 Citations
32 Claims
-
1. A method for allocating one or more channels to access points (APs) during a time frame, t, within a network comprising:
-
(a) assigning a weight, Wn, where n=1,2, . . . n ,to each AP; (b) dividing an interference graph into a plurality of subgraphs; (c) computing a maximized sum of weights associated with activated APs for each subgraph; (d) combining each of the maximized sums to compute a first, total sum of weights for all of the subgraphs; (e) forming new subgraphs; (f) carrying out steps (c) and (d) using the new subgraphs; (g) combining sums associated with the new subgraphs to compute a new total sum of weights; (h) selecting a highest total sum of weights from the first computed total sum of weights and all of the subsequently computed, new total sum of weights, wherein the selected total sum represents a best approximation of optimal channel allocations; and (i) allocating one or more channels to an AP based on the selected total sum performing the steps (a)-(i) by a controller. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A device for allocating one or more channels to access points (APs) during a time frame, t, within a network operable to:
-
(a) assign a weight, Wn, where n =1,2, . . . n, to each AP; (b) divide an interference graph into a plurality of subgraphs; (c) compute a maximized sum of weights associated with activated APs for each subgraph; (d) combine each of the maximized sums to compute a first, total sum of weights for all of the subgraphs; (e) form new subgraphs; (f) carry out steps (c) and (d) using the new subgraphs; (g) combine sums associated with the new subgraphs to form a new total sum of weights; (h) select a highest total sum of weights from the first computed total sum of weight and all of the subsequently computed, new total sum of weights, wherein the selected total sum represents a best approximation of optimal channel allocations; and (i) allocating one or more channels to an AP based on the selected total sum. - View Dependent Claims (17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32)
-
Specification