Download Now Free registration required
The authors study the performance of non-cooperative networks in light of three major topology design and control considerations, namely the price of establishing a link, path delay, and path proneness to congestion or interference, the latter being modeled through the "Relaying Extent" of the nodes. They analyze these considerations and the tradeoffs between them from a game theoretic perspective, where each network element attempts to optimize its individual performance. They show that for all considered cases but one, the existence of a Nash equilibrium point is guaranteed.
- Format: PDF
- Size: 233 KB