Information Technology Reference
In-Depth Information
Thus, according to ( 4.4 ), we must have
q a q a , a = q a q a , a .
The spectrum access Markov chain is hence time-reversible and has the unique
stationary distribution as given in ( 4.9 ).
References
1. FCC, Third Memorandum Opinion and Order , FCC Std., April 5, 2012
2. L. Yang, H. Kim, J. Zhang, M. Chiang, C.W. Tan, Pricing-based decentralized spectrum access
control in cognitive radio networks. IEEE/ACM Trans. Netw. 21 (2), 522-535, (2013)
3. X. Chen, J. Huang, Database-assisted distributed spectrum sharing. IEEE J. Sel. Areas
Commun. 31 (11), 2349-2361, (2013)
4. K.N. Ramachandran, E.M. Belding-Royer, K.C. Almeroth, M.M. Buddhikot, Interference-
aware channel assignment in multi-radio wireless mesh networks. INFOCOM 6 , 1-12 (2006)
5. D. Monderer, L.S. Shapley, Potential games. Games Econ. Behav. 14 (1), 124-143, (1996)
6. M. Chen, S.C. Liew, Z. Shao, C. Kai, Markov approximation for combinatorial network
optimization. IEEE INFOCOM 1-9 (2010) (IEEE)
7. S. Boyd, L. Vandenberghe, Convex Optimization (Cambridge University Press, Cambridge,
2004)
8. L. Jiang, J. Walrand, A distributed CSMA algorithm for throughput and utility maximization
in wireless networks. IEEE/ACM TON 18 (3), 960-972, (2010)
9. M.E. Newman, D.J. Watts, S.H. Strogatz, Random graph models of social networks. PANS
99 (Suppl 1), 2566-2572, (2002)
10. T. Roughgarden, Selfish Routing and the Price of Anarchy (MIT Press, Cambridge, 2005)
11. Z. Han, D. Niyato, W. Saad, T. Basar, A. Hjorungnes, Game Theory in Wireless and
Communication Networks (Cambridge University Press, Cambridge, 2012)
12. E. Cho, S.A. Myers, J. Leskovec, Friendship and mobility: User movement in location-based
social networks. ACM SIGKDD 1082-1090 (2011)
Search WWH ::




Custom Search