TY - GEN

T1 - On the decentralized management of scrambling codes in small cell networks

AU - Perlaza, Samir M.

AU - Han, Zhu

AU - Poor, H. Vincent

AU - Niyato, Dusit

PY - 2012

Y1 - 2012

N2 - In this paper, the problem of primary scrambling code (PSC) allocation in wideband code-division multiple access (WCDMA) self-configuring small cell networks is studied using tools from game theory. In this game, it is shown that when the number of available scrambling codes is larger than or equal to the number of small cells, globally optimal and individually optimal PSC allocations always exist and coincide with the set of Nash equilibria. In the converse case, it is shown that an individually optimal PSC allocation might not exist. However, the existence of a global optimal allocation is always ensured. Here, the notion of individual optimality corresponds to the case in which small cells cannot reduce their probabilities of code confusion by changing their own PSC choices. On the other hand, the notion of global optimality refers to the case in which no other PSC allocation can reduce the probability of code confusion. The second contribution is a pair of algorithms based on the notion of trial and error learning that allow the achievability of an individually optimal PSC allocation, if it exists, or a globally optimal allocation otherwise. Both algorithms present attractive properties independently of the network topology and the ratio between the numbers of PSCs and active small cells in the network.

AB - In this paper, the problem of primary scrambling code (PSC) allocation in wideband code-division multiple access (WCDMA) self-configuring small cell networks is studied using tools from game theory. In this game, it is shown that when the number of available scrambling codes is larger than or equal to the number of small cells, globally optimal and individually optimal PSC allocations always exist and coincide with the set of Nash equilibria. In the converse case, it is shown that an individually optimal PSC allocation might not exist. However, the existence of a global optimal allocation is always ensured. Here, the notion of individual optimality corresponds to the case in which small cells cannot reduce their probabilities of code confusion by changing their own PSC choices. On the other hand, the notion of global optimality refers to the case in which no other PSC allocation can reduce the probability of code confusion. The second contribution is a pair of algorithms based on the notion of trial and error learning that allow the achievability of an individually optimal PSC allocation, if it exists, or a globally optimal allocation otherwise. Both algorithms present attractive properties independently of the network topology and the ratio between the numbers of PSCs and active small cells in the network.

UR - http://www.scopus.com/inward/record.url?scp=84873558060&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84873558060&partnerID=8YFLogxK

U2 - 10.1109/ICCS.2012.6406194

DO - 10.1109/ICCS.2012.6406194

M3 - Conference contribution

AN - SCOPUS:84873558060

SN - 9781467320542

T3 - 2012 IEEE International Conference on Communication Systems, ICCS 2012

SP - 478

EP - 482

BT - 2012 IEEE International Conference on Communication Systems, ICCS 2012

T2 - 2012 IEEE International Conference on Communication Systems, ICCS 2012

Y2 - 21 November 2012 through 23 November 2012

ER -