Optimal Pipeline Paging Load Balancing for Hierarchical Cellular Networks

Yang Xiao, Hui Chen, Mohsen Guizani, Hsiao-Hwa Chen

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We study load balancing of paging schemes for multitier hierarchical cellular networks, in which different tiers of cells overlay each other to provide multiple coverage in cellular service areas. Each mobile terminal (MT) can be paged in any tier of a multitier hierarchical cellular network. Paging requests are balanced in different waiting queues of different tiers, and the load balancing among them is achieved probabilistically among N tiers. The studied paging schemes are the Hierarchical Pipeline Paging scheme, the Hierarchical Sequential Paging scheme, and the Hierarchical Blanket Paging scheme. We study two optimization problems using the N-tier load balancing: 1) given a paging delay constraint, to minimize the total paging cost under the constraint that the total delay is upper bounded by a predefined total delay, and 2) given a bound on the total delay, to minimize the total paging cost under a paging delay constraint.

Original languageEnglish
Pages (from-to)1532-1544
Number of pages13
JournalIEEE Transactions on Mobile Computing
Volume11
Issue number9
DOIs
Publication statusPublished - 2012 Jan 1

Fingerprint

Resource allocation
Pipelines
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Xiao, Yang ; Chen, Hui ; Guizani, Mohsen ; Chen, Hsiao-Hwa. / Optimal Pipeline Paging Load Balancing for Hierarchical Cellular Networks. In: IEEE Transactions on Mobile Computing. 2012 ; Vol. 11, No. 9. pp. 1532-1544.
@article{a5b4c08611b240dca1f54db1770690ca,
title = "Optimal Pipeline Paging Load Balancing for Hierarchical Cellular Networks",
abstract = "We study load balancing of paging schemes for multitier hierarchical cellular networks, in which different tiers of cells overlay each other to provide multiple coverage in cellular service areas. Each mobile terminal (MT) can be paged in any tier of a multitier hierarchical cellular network. Paging requests are balanced in different waiting queues of different tiers, and the load balancing among them is achieved probabilistically among N tiers. The studied paging schemes are the Hierarchical Pipeline Paging scheme, the Hierarchical Sequential Paging scheme, and the Hierarchical Blanket Paging scheme. We study two optimization problems using the N-tier load balancing: 1) given a paging delay constraint, to minimize the total paging cost under the constraint that the total delay is upper bounded by a predefined total delay, and 2) given a bound on the total delay, to minimize the total paging cost under a paging delay constraint.",
author = "Yang Xiao and Hui Chen and Mohsen Guizani and Hsiao-Hwa Chen",
year = "2012",
month = "1",
day = "1",
doi = "10.1109/TMC.2011.166",
language = "English",
volume = "11",
pages = "1532--1544",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

Optimal Pipeline Paging Load Balancing for Hierarchical Cellular Networks. / Xiao, Yang; Chen, Hui; Guizani, Mohsen; Chen, Hsiao-Hwa.

In: IEEE Transactions on Mobile Computing, Vol. 11, No. 9, 01.01.2012, p. 1532-1544.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Optimal Pipeline Paging Load Balancing for Hierarchical Cellular Networks

AU - Xiao, Yang

AU - Chen, Hui

AU - Guizani, Mohsen

AU - Chen, Hsiao-Hwa

PY - 2012/1/1

Y1 - 2012/1/1

N2 - We study load balancing of paging schemes for multitier hierarchical cellular networks, in which different tiers of cells overlay each other to provide multiple coverage in cellular service areas. Each mobile terminal (MT) can be paged in any tier of a multitier hierarchical cellular network. Paging requests are balanced in different waiting queues of different tiers, and the load balancing among them is achieved probabilistically among N tiers. The studied paging schemes are the Hierarchical Pipeline Paging scheme, the Hierarchical Sequential Paging scheme, and the Hierarchical Blanket Paging scheme. We study two optimization problems using the N-tier load balancing: 1) given a paging delay constraint, to minimize the total paging cost under the constraint that the total delay is upper bounded by a predefined total delay, and 2) given a bound on the total delay, to minimize the total paging cost under a paging delay constraint.

AB - We study load balancing of paging schemes for multitier hierarchical cellular networks, in which different tiers of cells overlay each other to provide multiple coverage in cellular service areas. Each mobile terminal (MT) can be paged in any tier of a multitier hierarchical cellular network. Paging requests are balanced in different waiting queues of different tiers, and the load balancing among them is achieved probabilistically among N tiers. The studied paging schemes are the Hierarchical Pipeline Paging scheme, the Hierarchical Sequential Paging scheme, and the Hierarchical Blanket Paging scheme. We study two optimization problems using the N-tier load balancing: 1) given a paging delay constraint, to minimize the total paging cost under the constraint that the total delay is upper bounded by a predefined total delay, and 2) given a bound on the total delay, to minimize the total paging cost under a paging delay constraint.

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

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

U2 - 10.1109/TMC.2011.166

DO - 10.1109/TMC.2011.166

M3 - Article

VL - 11

SP - 1532

EP - 1544

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 9

ER -