Q are like so with that and everyone so i would be in about uh that this a power control um i know that uh i i is in and doing thing and resource allocation for wireless multihop networks is don't work with my but a student a a a a like my gone my friend and probably members post you oh i have a is i know that maybe be in the audience no about um i think that being but for those of that then uh we can that action uh if you have they can that of course in the network you know that uh the you you land in our thing is that a big uh where in oh you have a graph and it would the to present as a graph uh you could uh a it is on the go every L as a set and way typically this way to lex the back or have a that's delay or or uh some other uh back to a let's say your delays that this big on that particular thing and we do so this that thing meeting that we compute the do this but when the source to a desired destination and we like it's along long what was but a this of this path thing is well motivated for a number of reasons uh by five to his motivation or the claim of so was but out thing is that is a service by and if you you weights that basically got to the reflect uh you have is a delay let's say about link uh what you get delay but this is a at low system loads because of kind system loads the so this but may not have enough capacity to can bit your traffic and you may need to use secondary path and that a and number of other issues um the going for stuff set this but i think in but the fact that you can set it uh with a relatively low complexity difference i including a distributed algorithms or these a dynamic programming based the average um the difficult of time and is associated with a this bad that i thing in of the fact that you must know the i've and rate so we can prove a long the service that um i i so that is are going to that they should and fighting all the service that uh that so in fact is slow uh by wireless fading on that that bad to changing i as um in the lower than patterns of a lot but or or of that the nodes and most importantly in wireless network in uh i mean uh change is due to fading okay i i ninety to my uh my colleague as that's you less of that was part of his P the this you you use a new but dying for a uh i think no as back last a minute working common uh is that on a concept a that is a concert there a difference of but which measures the sense only a a a a a a a back to is with respect to an ending no but and that the decisions are but and this one difference and back a and about the surrounding "'cause" one lots of plane in the network i for this is the most and the reason is is that the K is not maximal stable throughput place so basically but this work as the policy so is probably that if the network can sustain a set and uh seven and "'kay" a a and that big you is going to instead but a a a a so we'll will start has a network and push all the packets through the network do you have a site to this nation so it was a maximum flow my can use they can private in that but um the biggest plane we should have as it must recognise the past so it doesn't that a long run only uh let and and the sense because that of to a C is a very way that a is this predicted by to a teenager read quickly that's to changing conditions and like sort of stuff helping um that it is a so of that a problem as well do not think that can be that a because it uses but that's with to guy packets to the network it there is no in the network that work is empty a back and kid can simply go through a time uh would to is that is basically a you a to go with respect to learn okay there's an active node but nice is delay and if you can be like i think you could in late okay very uh a uh uh a have a Q or something i like but this can we get the sense that it can you can combine the said this that are sets of uh uh that you can play so can as a a uh a sort of a picture of set that of four by this of thing so that or that that in the network and sitting here i i think about the and let's my by contains the back it's in this particular example uh this guy was that it contains that the packets a the difference in is the maximum of zero and the difference of this look like this so this particular uh example of so uh but we didn't know to and not five is because this does is not known and um but as we can from these because the you of that guy was is you back risk best that's is but okay a a a a a a a is the that to note is for thing to do this to set of an in between this can know this two but that's of adding for a in that decisions okay a a a bad thing and you that as a down here it's of any possible to is that the only possible for for the so to get back a packet that has been if you look at a lot what he's this but the you when that in how it can be the fact that the market is that is the low builds that okay one big are given below that this one cup a "'cause" that the idea is proof of that you we have not of this nation's um a multiple source destination pair or even different types of that uh i think this these are a come and it is in networking i then uh actually live that's to do this what happens to you you have to be not use but no well that commodity died okay a a and then like to do is on it to you take the maximum difference so but so the my of of um and that is that a this link or the different so that no and basically you you the entirely the capacity about lee to to do the to the commodity that is a uh i i i and it's about a lot so i if it was ever been i me used to a maximum a can which a maximum task got lost okay if you use that this not if you uh that but also i have been and some of the mitigation lead to computation you compute D for the difference is basically on let an occasion because i only get them as or but if it so that was use but we and and a handle but not to the rest of you guys for the don't at all so it's a very nice but to the problem the i think a station is a different because of was is you know is a broadcast medium and a and a link that is dependent transmission scheduling and power of are added that the links so this is what i call love a so yeah i where my to do this but increase but the this is this is an example of the values so but also how to me uh a so that playing field you know it's to to so is the physical you um interference patterns it a a to control K this is what the name of the game here is all about so two i like the problem mathematically uh if you got a set and you let's say between a a time uh with of a a not the L L for link L but i'm duration power my recent and parties be L is that of a cost i mean you games between i have a the the time to meet those have a a in this is a like but with a link a and and uh the receiver of link L but time use of power of link eight and then the background noise okay so this is a lot of in of last noise uh a as you know a the C value of but that i if that sounds st very low a i think that link will be of random is bad the defence i and i would have that i'm to see but would be this one to you the maximum the Q zero and the difference of the queue line and the and it yes that is king oh was a some problem you was so that is that is that's good isn't because it because he he's so so so is E to zero you decide of something okay and so that is and this this oh maximise the reference back but sound oh the it's not bad well as bad for the with an upper bound on a some power of that and the have at time because the right and that's the fans okay you may by a constant so that oh so this problem there was networks we do that he didn't have scheduling and power allocation from the viewpoint of maximizing that works that but that the basic and that's ah at this now ah so that was like that was my buttons the since then and that in many ways this is a a survey but a a problem time my but to the sun um so was not for many he has to be a problem i see hmmm but but not count can perhaps the most for example if you get you can sort times with that but not have so either by ah yeah that was a that this is a this a problem you can smell the and if you are so that you the core and you can so for hours by the powers you set of it is but that for you are present a about the time but in the is where Q is it is but that you had but it if not you can be to use one you don't like this this can you see surprisingly well also so to use maximum stable and and there is very nice intuition of that can exploit explain of states if you it well as far but this of course it is a delay but again we could maximise a a maximum throughput the question that the so of this paper is and the need to compete or something a some bit about this bad is leading powers that you know you can choose you can to to between zero and an upper bound but that stay on pattern not not very well a know if you think that this problem for the that have that this is uh it it is a end of the sound of in is a some problem in not networks well as an words in S cell ah but since sensing at this meeting that not i think that was that could be but assume that that that's and once in the difference we have is that as you can have just a in a as you can and that's that like to answer that has that the receiver and this but quite X yeah so you that is part of the optimization invest as is that that is in this and i i have think that now that's a lot for change or games a i think that it is bad and that was that was that that is the for time that that of the channels are best in a direction so you and to for me to do that um so uh has and so by from and is that a a uh hmmm so that this key difference is the best of them require if you in the back so that uh_huh that is that you can basically when you prevent be is used to show that that is and then P that problem okay and by but are chosen the back you that night so that that them for now that a configuration of back if fact can set so that it can "'cause" not consent to a special configuration if that a configuration so that think that that the that does not sales but has a given i i see that as a right so oh is that is or so and that is not to the for this that's me that on this that is not for this me that i in fact is that i have a set of chords and links and the for back into the the that's another okay and that this so that uh now if you have found this that's will discuss look not because of miss it works you also to find that estimation algorithms and we can basically uh but and i do an on a scale from a and you layers a a and and and button thousand six i'm going to all the level was the is but the basic idea of scale is to a uh no and uh approximation a in a a and of the sound a uh with the an objective function that is um have to that is exact and then to a solution right instead of doing it and that approximation to has now to the specification of those in this you did you that is okay so this is to your this realisation you you of the sequence of convex problems and use the second step of to move this omission of it or an np-hard problem okay ah it can do is with us that is that in that that the of the same that well at the same problem that that problems with different objective function and then a if you have but as it is working but complex this you need something not fast than and that a so that's and look at the algorithms of that to do shall this problem much faster than than it does the service ah where a is a is it can use here and that was that was the of something that was left and then they fans the this person is ugly it is a it because i was network but uh you have not listen what we talk states the that is like you are you're you use it is post by that that it is by the car so it good like that so there is so that that i is and the network and that let you the solution that you're sitting gets that E is in fact a very different from the previous one because in the previous money make for them are used you oh a way for so in fact this is why is doesn't work which also said to and we could be able to show the cases but uh well can expect you are they can be here in the network if you choose a window of past solutions in single a which one of the past babble use an issue is better oh do an excellent rents that okay a a i a that D V you a and that uh extensive uh experiments uh it is interesting that that is a thing that and the simulation but we bring signal processing folks we we uh we the level of simulations and i would have to give it just the um so that that you'll and basically i'm just i we just like some of them a result um is that is a that is it difficult scenarios uh no this is in that not if and this one that has an is this is kind the file as the interference scenario a a this is a i think that we use that as an approximation of than and become problem in terms of a uh not the last so you should my and seven if you do has access to that two nations that it's is the it's and that for this is that this study of for all our out that is actually do do level and sound of his collaborators i have a so that can do a lot of that is the look up as all that could that the a or using all algorithms at at at next well at the um well as the estimate that sense of those of was that a as a sources i would actually used but uh or or as as is what happens with a it is that but have a thing so that was that that it might don't know yeah it a suppose that like sing not i concerned that the problem is that car and the for a approximation so for and i so that that the minute i think course at some point you are and and taking not as a constraint but but as the way in the capacity of ring hmmm at the beginning of your two yeah and you are acting acting as if the cat the C D's where in that and then and at some point maybe some no we E a contacted by to transmit in this case these is will be we act as a multi a model in the multiple access situation and to get a C D's will not be in that then well okay what uh is that that uh you are assume that every E we we um a single a of mission yeah will do that to do the fist that's is something like that is you see then in this is a nice then the formulation you that that nodes i and everything because you know see still but a these case margin for and you could use disk which are set and that mean so that it is not what that that that i when i say that is a a a a a a is a much not stable through i assumption sounds don't