This paper proposes an efficient multicast search scheme based on bipartite graph matching model, aiming at one of the most important problems in the multicast service, how can the wireless network track and locate the mobile uses in the idle state, under the tight bandwidth and delay constraints,. By quantifying the location uncertainty of mobile users with Shannon's entropy, the scheme adopts the LZ78 compression algorithm to design location update scheme and predict the location probability, in order to reduce the cost of location update. The multicast search system need to guarantee the maximum total probability that each user resides at the assigned paging area, for the purpose of an optimal performance on both expected paging delay and paging cost. Therefore, the bigraph-based multicast paging scheme (BMPS) firstly builds the bipartite graph model of multicast search problem, through converting the location probability into weight of the edge. BMPS decides the optimal allocation between the mobile users and location areas, which is mainly achieved by the maximum weight perfect matching in bipartite graph, while modifying the weights dynamically. Simulation results show that BMPS yields a low search delay as well as a low search cost, and reduces the impact of user collision.
목차
Abstract 1. Introduction 2. Location Prediction Mechanism 2.1. Location Update 2.2. Location Probability Prediction 3. Multicast Paging System 3.1. System Model Description 3.2 Multicast Paging Strategy Analysis 4. Multicast Paging Scheme Based on Bipartite Graph Matching 4.1. Definition of Bipartite Graph Model 4.2. Multicast Paging Scheme Based on Bipartite Graph Matching 5. Experimental Results and Performance Analysis 5.1. Effect of Maximum Paging Delay on Algorithm Performance 5.2. Effect of User Conflict on Algorithm Performance 5.3. User Fairness 5.4. Bandwidth Overhead 6. Conclusion References
키워드
multicast searchbipartite graph matchinglocation probability predictionpaging delaypaging cost
저자
Yuan Yao [ Beijing Key Laboratory of Mobile Computing and Pervasive Device; Institute of Computing Technology, Chinese Academy of Sciences ]
Zhang Dalin [ Beijing Key Laboratory of Mobile Computing and Pervasive Device; Institute of Computing Technology, Chinese Academy of Sciences ]
Wang Qing [ Beijing Key Laboratory of Mobile Computing and Pervasive Device; Institute of Computing Technology, Chinese Academy of Sciences ]
Shi Jinglin [ Beijing Key Laboratory of Mobile Computing and Pervasive Device; Institute of Computing Technology, Chinese Academy of Sciences ]
보안공학연구지원센터(IJSIP) [Science & Engineering Research Support Center, Republic of Korea(IJSIP)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Signal Processing, Image Processing and Pattern Recognition
간기
격월간
pISSN
2005-4254
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.8 No.11