Unformatted text preview: e explore the tradeoﬀ between
total utility and total power usage in a wireless network in which the link transmit powers can
be adjusted. The network consists of a set of nodes and a set of links over which data can be
transmitted. There are n routes, each corresponding to a sequence of links from a source to a
destination node. Route j has a data ﬂow rate fj ∈ R+ (in units of bits/sec, say). The total utility
(which we want to maximize) is
n U j ( fj ) , U (f ) =
j =1 where Uj : R → R are concave increasing functions.
143 The network topology is speciﬁed by the routing matrix R ∈ Rm×n , deﬁned as
Rij = 1 route j passes over link i
0 otherwise. The total traﬃc on a link is the sum of the ﬂows that pass over the link. The traﬃc (vector) is thus
t = Rf ∈ Rm . The traﬃc on each link cannot exceed the capacity of the link, i.e., t c, where
c ∈ Rm is the vector of link capacities.
+ The link capacities, in turn, are functions of the link transmit powers, given by p ∈ Rm , which
+
cannot exceed given limits, i.e., p pmax . These are related by
ci = αi log(...
View
Full
Document
This note was uploaded on 09/10/2013 for the course C 231 taught by Professor F.borrelli during the Fall '13 term at Berkeley.
 Fall '13
 F.Borrelli
 The Aeneid

Click to edit the document details