Multicast paging scheme based on bipartite graph matching model

Liang Huang*, Li Hu, Yao Yuan, Xue Han, Jing Lin Shi

*Corresponding author for this work

Research output: Contribution to journalArticle

Abstract

Aiming at one of the most important problems in the multicast service of how the wireless network could track and locate the mobile users in idle state, under the tight bandwidth and delay constraints, an efficient multicast paging scheme was proposed based on bipartite graph matching model. By quantifying the location uncertainty of mobile users with entropy, the scheme adopted the LZ78 compression algorithm to design location update scheme and predict the location probability to reduce the cost of location update. With the purpose of optimal performance on both expected paging delay and paging cost, the multicast paging system needed to guarantee the maximum total probability that each user resided at the assigned paging area. Therefore, the bigraph-based multicast paging scheme (BMPS) firstly built the bipartite graph model of multicast paging problem, through converting the location probability into weight of the edge. BMPS decided the optimal allocation between the mobile users and location areas, which was mainly achieved by the maximum weight perfect matching in bipartite graph, with dynamically modified the weights. Simulation results show that BMPS yields a low paging delay as well as a low paging cost, and reduces the impact of user collision.

Original languageEnglish
Pages (from-to)1014-1023
Number of pages10
JournalXitong Fangzhen Xuebao / Journal of System Simulation
Volume25
Issue number5
Publication statusPublished - May 2013

Keywords

  • Bipartite graph matching
  • Location probability prediction
  • Multicast paging
  • Paging cost
  • Paging delay

Fingerprint Dive into the research topics of 'Multicast paging scheme based on bipartite graph matching model'. Together they form a unique fingerprint.

Cite this