Modeling concurrent search in All-IP heterogeneous wireless networks

Rung-Hung Gau*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


In this paper, we propose a novel probabilistic method for evaluating concurrent search in all-Internet protocol (IP) networks. It is expected that the next-generation Internet will consist of a variety of wireless-access networks. To be independent of wireless-access technology and to reduce the cost of mobility management in a heterogeneous environment, we propose integrating IP Paging with concurrent search, which was originally proposed for homogeneous cellular networks. We focus on the case in which the call-arrival process is general and has stationary independent increments. Since a number of calls could arrive simultaneously, the blocking probability is not equal to the probability with the system that is full. Therefore, we resort to renewal theory to accurately derive the blocking probability. Furthermore, we obtain the throughput, the average system size, and the average system delay. Our analytical results are consistent with simulation results.

Original languageEnglish
Pages (from-to)3137-3148
Number of pages12
JournalIEEE Transactions on Vehicular Technology
Issue number5
StatePublished - 1 Sep 2007


  • All-IP networks
  • Concurrent search
  • Mobility management
  • Paging
  • Performance analysis

Fingerprint Dive into the research topics of 'Modeling concurrent search in All-IP heterogeneous wireless networks'. Together they form a unique fingerprint.

Cite this