Method for optimal allocation of resources in a multi-user network
The present disclosure relates generally to communication systems and more particularly to wired communication systems. One embodiment relates to a network arrangement, comprising at least one master node and plurality of slave nodes coupled to the master node. The master node and slave nodes communicate over a medium (e.g., telephone wiring, coaxial cables, or power lines) with time-variant channel characteristics. The master node includes a processing block to receive inputs from the plurality of slave nodes. The inputs used by the processing block to generate an optimized Time-Division Multiple Access (TDMA) schedule which is broadcast to the plurality of slave nodes. Other methods and systems are also disclosed.
1 . An apparatus that generates a Media Access Plan (MAP) message to be used in a network having a number of nodes and links coupling the nodes, wherein at least one node is the master and one or more nodes are slaves, the apparatus comprising:
a channel estimation unit that generates:
a vector t of K time regions indicating a length of time of the time regions,
wherein the time regions correspond to regions of periodic noise having period T,
a matrix β of L×K elements indicating a bit-rate for at least one link in at least one time region;
a vector δ of L links indicating a target bandwidth for each link;
a scheduler unit that generates using t, β and δ an optimized schedule α, which is an L×K matrix in which elements α ij represent an amount of channel time allocated to link i during time region j; and
a MAP generation unit that generates a MAP message including a schedule of time-slots allocated to one or more nodes in the network based on the optimized schedule α.
2 . The apparatus of claim 1 , wherein the MAP generation unit sends the MAP message over the network to one or more nodes.
3 . The apparatus of claim 1 , wherein the channel estimation unit in at least two nodes runs a protocol that exchanges messages with the same block in every other node. The protocol results in a bit-loading table for communication between each pair of nodes.
4 . The apparatus of claim 1 , wherein scheduler unit finds values of α ij such that a total capacity allocated to link i (γ i ) is equal to or greater than the target bandwidth for each link.
5 . The apparatus of claim 4 , wherein scheduler unit determines the optimized schedule α by minimizing an amount of time allocated to each link.
6 . The apparatus of claim 5 , wherein the scheduler unit minimizes the amount of time allocated to each link using at least one of the following selected from the group consisting of a simplex or an interior point apparatus.
7 . The apparatus of claim 5 , wherein the scheduler unit minimizes the amount of time allocated to each link by using a linear function.
8 . The apparatus of claim 5 , wherein the scheduler unit minimizes the amount of time allocated to each link by using a graphical solution.
9 . The apparatus of claim 2 , the scheduling unit calculates the optimized schedule α by finding an allocation that provides the maximum possible capacity allocated to link i (γ i ).
10 . The apparatus of claim 2 , wherein the MAP generation unit sends the MAP message over a medium selected from the group consisting of power lines, coaxial cables, wireless and twisted pair wires.
11 . The apparatus of claim 2 , wherein the channel estimation unit determines the target bandwidth using a bit-loading table for communication between nodes.
12 . The apparatus of claim 11 , wherein the channel estimation unit generates the bit-loading table by exchanging messages between the nodes.