Name
Abstract | ||
|---|---|---|
Traditional load balancing schemes only considered two cells cooperation that is less likely to succeed. A novel scheme, load balancing by cells- cooperation-chains (C$^3$LB), is proposed. C$^3$LB establishes multi-level cells-cooperation-chains (C$^3$) to transfer traffic and extents the conditions of traffic transfer. We formulate a minimum-level C$^3$ selection problem and propose a simple algorithm to solve it. In addition, we present a C$^3$LB protocol to execute the found C$^3$. Numerical results show that as the maximum allowed levels of C$^3$ increase, the system call blocking probability decreases. Finally, we give the proposed value of the maximum allowed levels. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/VTCSpring.2013.6692617 | VTC Spring |
Keywords | Field | DocType |
cell cooperation chains,multi-cell,call blocking probability,cellular radio,blocking probability,load balancing schemes,multicell cooperation,transfer traffic,telecommunication traffic,cooperation,traffic transfer,cellular networks,load balancing,probability,algorithm design and analysis,cost function,protocols,wireless communication,switches | Cellular radio,Load balancing (computing),Computer science,Computer network,System call,Cellular network,SIMPLE algorithm,Distributed computing | Conference |
Volume | Issue | ISSN |
null | null | 1550-2252 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
5 | ||