On the Complexity of Bandwidth Allocation in Radio Networks with Steady Trac Demands (original) (raw)
Related papers
Optimal random access in networks with two-way traffic
2004
Abstract We consider a random access network in which the nodes need to optimize their channel access rates. The nodes are assumed to be rational and interested in their performance seen as a transmitter as well as a receiver. By casting this problem as a non-cooperative game, we derive conditions for the Nash equilibrium. We also show the existence of a Nash equilibrium when the nodes are constrained by their battery power (for this case, the constraints on the access rates of the nodes become coupled).
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.