Location Area Planning with Complete Homogenous Traffic
Mobility tracking is concerned with finding mobile users within the area serviced by the wireless network. The two basic operations for tracking mobile users, location updating and paging, constitute a necessary overhead on the network. A central problem in the design phase of the system is Location Area Planning: optimally divide the service area into location areas to minimize the total cost of updating and paging. This paper examines complete homogeneous traffic, i.e., the number of mobile users that move between any pair of cells per time unit is a constant, and presents a polynomial time approximation scheme.
wireless networks location area planning homogeneous traffic approzimation algorithms polynomial time approzimation scheme
Li Shuguang Xin Xiao
College of Computer Science and Technology Shandong Institute of Business and Technology Yantai, Chi College of Foreign Studies Shandong Institute of Business and Technology Yantai, China
国际会议
第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)
南京
英文
298-300
2009-07-25(万方平台首次上网日期,不代表论文的发表时间)