Skip to main content Accessibility help
Hostname: page-component-5d59c44645-hb754 Total loading time: 0 Render date: 2024-02-20T16:24:13.873Z Has data issue: false hasContentIssue false

9 - Mobility in small cell networks

Published online by Cambridge University Press:  05 May 2013

Veeraruna Kavitha
Sreenath Ramanath
Eitan Altman
Tony Q. S. Quek
Singapore University of Technology and Design
Guillaume de la Roche
Mindspeed Technologies
İsmail Güvenç
Florida International University
Marios Kountouris
SUPÉLEC (Ecole Supérieure d'Electricité)
Get access



Small cell networks (SCNs) made of portable pico and femto base stations (BSs) serve dense urban areas, commercial and office spaces, hotspots, etc. Their design and deployment pose many new challenges to the optimal system design. Managing mobile users deriving service from such SCNs is one of the key challenges. Furthermore, reducing cell size increases the frequency of handovers, which results in an increased number of call drops before completing the service. However, they also offer better communication rates to cell-edge users resulting in reduced service times. The study of such tradeoffs is an important topic while designing optimal systems.

In order to prevent large numbers of handovers that would result from reducing cell size, it has been proposed (for e.g., see [1, 2]) to group together a number of small cells (SCs) into one virtual macrocell. This helps to restrict the effort of preventing losses due to the handover only to those handovers that occur between SCs of the same virtual cell. In between the SCs some fast switching mechanisms are proposed such as frequency following mechanisms where the frequency used by a mobile follows it from one SC to the next. This requires reserving the same channel for a user in the entire macrocell.

In this chapter, we consider a large macrocell divided into a number of SCs and study the impact of mobility in such systems, especially the effect of frequent handovers. We assume that an ongoing call is never dropped at the SC boundary within a virtual cell (in later sections, we relax this assumption and study handover at SC boundaries within a virtual cell).

Small Cell Networks
Deployment, PHY Techniques, and Resource Management
, pp. 219 - 245
Publisher: Cambridge University Press
Print publication year: 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)


[1] S., Sen, A., Arunachalam, K., Basu, and M., Wernik, “A QoS management framework for 3G wireless mobile network,” in Proc. IEEE Wireless Commun. Networking Conf. (WCNC), New Orleans, LA, Sep. 1999, pp. 1273–7.Google Scholar
[2] Alcatel, Lucent, “Beyond the base station router,” Alcatel-Lucent, Tech. Rep., 2008.Google Scholar
[3] P. V., Orlik and S. S., Rappaport, “On the handoff arrival process in cellular communications,” Wirel. Netw., vol. 7, no. 2, Mar.–Apr. 2001.Google Scholar
[4] S., Dharmaraja, K. S., Trivedi, and D., Logothetis, “Performance analysis of cellular networks with generally distributed handoff interarrival times,” Elsevier Comput. Commun., vol. 26, no. 15, pp. 1747–56, Sep. 2003.Google Scholar
[5] X., Huang and R. F., Serfozo, “Spatial queueing processes,” Math. Oper. Res., vol. 24, no. 4, pp. 865–86, Nov. 1999.Google Scholar
[6] V., Kavitha and E., Altman, “Queueing in space: design of message ferry routes in sensor networks,” in Proc. Int. Teletraffic Congress (ITC), Paris, France, Sep. 2009, pp. 1–8.Google Scholar
[7] W., Saad, Z., Han, T., Basar, M., Debbah, and A., Hjorungnes, “A selfish approach to coalition formation among unmanned air vehicles in wireless networks,” in Proc. Int. Conf. Game Theory for Networks (GAMENETS), Istanbul, Turkey, May 2009, pp. 259–67.Google Scholar
[8] F., Baccelli, B., Blaszczyszyn, and M., Karray, “A spatial markov queuing process and its applications to wireless loss systems,” INRIA, Tech. Rep., 2010.Google Scholar
[9] R. W., Wolff, Stochastic Modeling and the Theory of Queues. Prentice-Hall, 1989.Google Scholar
[10] J. G., Markoulidakis, G. L., Lyberopoulos, D. F., Tsirkas, and E. D., Sykas, “Mobility modeling in third-generation mobile telecommunications systems,” IEEE Pers. Commun., vol. 4, no. 4, pp. 41–56, Aug. 1997.Google Scholar
[11] J. B., Andersen, T. S., Rappaport, and S., Yoshida, “Propagation measurements and models for wireless communications channels,” IEEE Commun. Mag., vol. 33, no. 1, pp. 42–9, Jan. 1995.Google Scholar
[12] M., Grossglauser and D. N. C., Tse, “Mobility increases the capacity of ad hoc wireless networks,” IEEE/ACM Trans. Netw., vol. 10, no. 4, pp. 477–86, Aug. 2002.Google Scholar
[13] N., Bansal and Z., Liu, “Capacity, delay and mobility in wireless ad-hoc networks,” in Proc. IEEE Int. Conf. on Computer Commun. (INFOCOM), San Francisco, CA, Apr. 2003, pp. 1553–63.Google Scholar
[14] T., Bonald, S., Borst, N., Hegde, M., Jonckheere, and A., Proutiere, “Flow-level performance and capacity of wireless networks with user mobility,” Queueing Syst.: Theory Appl., vol. 63, no. 1–4, pp. 131–64, Dec. 2009.Google Scholar
[15] T., Bonald, S., Borst, and A., Proutiere, “How mobility impacts the flow-level performance of wireless data systems,” in Proc. IEEE Int. Conf. on Computer Commun. (INFOCOM), Hong Kong, Mar. 2004, pp. 1872–81.Google Scholar
[16] S., Borst, A., Proutiere, and N., Hegde, “Capacity of wireless data networks with intra- and inter-cell mobility,” in Proc. IEEE Int. Conf. on Computer Commun. (INFOCOM), Barcelona, Spain, Apr. 2006, pp. 1–12.Google Scholar
[17] S., Borst, N., Hegde, and A., Proutiere, “Mobility-driven scheduling in wireless networks,” in Proc. IEEE Int. Conf. on Computer Commun. (INFOCOM), Rio de Janeiro, Brazil, Apr. 2009, pp. 1260–8.Google Scholar
[18] V., Kavitha, S., Ramanath, and E., Altman, “Spatial queuing analysis for design and dimensioning of picocell networks with mobile users,” Elsevier Perform. Evaluation, vol. 68, no. 8, pp. 710–27, Aug. 2011.Google Scholar
[19] S., Ramanath, E., Altman, V., Kumar, and M., Debbah, “Optimizing cell size in pico-cell networks,” in Proc. Int. Workshop on Resource Allocation in Wireless Networks (RAWNET), Seoul, South Korea, June 2009, pp. 1–9.Google Scholar
[20] Y., Takahashi, “An approximation formula for the mean waiting time of an M/G/c queue,” J. Operations Research Society of Japan, pp. 150–63, 1977.Google Scholar
[21] V., Kavitha, S., Ramanath, and E., Altman, “Analysis of small cells with randomly wandering users,” in Proc. Ing. Conf. Mobile, Ad hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 2012.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the or variations. ‘’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats