DSpace

King Saud University Repository >
King Saud University >
COLLEGES >
Science Colleges >
College of Computer and Information Sciences >
College of Computer and Information Sciences >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/15672

Title: Location Areas Planning Optimization in Mobile Networks
Authors: E.-G. Talbi
M. Batouche
L. Foughali
Keywords: location areas planning, paging, location update, planar graph partitioning, metaheursitics
Issue Date: 2007
Abstract: The main interest of this work is the optimization of the location areas planning in mobile networks. We propose a detailed model for this problem based on a very realistic specification. It is recognized that the quality of service in mobile networks depends on many parameters, among them an op timal location areas planning. Furthermore, for the already deployed networks, it is interesting to provide a logical net works organization. The location areas planning problem is planar graph partitioning with constraints. That’s why, we propose greedy algorithms and genetic algorithms to solve it. The latter algorithms use new operators designed specifically for the planar graph partitioning problems. Finally, we in vestigate the effectiveness of these algorithms.
URI: http://hdl.handle.net/123456789/15672
Appears in Collections:College of Computer and Information Sciences

Files in This Item:

File Description SizeFormat
DrBatouche-conf-19.docx11.94 kBMicrosoft Word XMLView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

DSpace Software Copyright © 2002-2007 MIT and Hewlett-Packard - Feedback