AUB ScholarWorks

Tabu search based approach to solve the TAs reconfiguration problem in LTE networks -

Show simple item record Ahmad, Nadine Nabih, 2017-08-30T13:57:13Z 2017-08-30T13:57:13Z 2015 2015
dc.identifier.other b18330885
dc.description Thesis. M.S. American University of Beirut. Department of Computer Science, 2015. T:6172
dc.description Advisor : Dr. Haidar Safa, Associate Professor, Computer Science ; Members of Committee : Dr. Wassim El Hajj, Chairperson, Computer Science ; Dr. Hassan Artail, Professor, Electrical and Computer Engineering.
dc.description Includes bibliographical references (leaves 103-104)
dc.description.abstract Designing tracking areas (TAs) in LTE networks affects the signaling cost of user equipment (UE) during mobility. Indeed, when the latter is called, the mobility management entity (MME), which records the TA in which the UE is registered, broadcasts a paging message in the UE’s TA to determine the exact cell through which the call should be delivered. When a UE moves to a new TA, a TA update (TAU) might be performed either to update the MME or the home subscriber server (HSS), which is a database maintaining the subscriber’s profile, depending on whether the move is intra- or inter-MME. TA update and paging result in a significant amount of signaling overhead. The TA design is usually optimized during the network planning phase. However, the mobility of UEs might turn the initial TA configuration inefficient requiring TA reconfiguration. In this thesis, we use the tabu search (TS) heuristic to solve TAs reconfiguration problem in LTE networks taking into consideration both signaling overhead and reconfiguration cost. We compare our solution with a variation of the genetic algorithm (GA) based solution found in the literature and with the optimal solution obtained by formulating the problem using an Integer Programming Model (IPM) and implementing it using Gurobi optimizer.
dc.format.extent 1 online resource (xxii, 104 leaves) : illustrations ; 30cm
dc.language.iso eng
dc.relation.ispartof Theses, Dissertations, and Projects
dc.subject.classification T:006172
dc.subject.lcsh Long-Term Evolution (Telecommunications)
dc.subject.lcsh Mathematical optimization.
dc.subject.lcsh Genetic algorithms.
dc.subject.lcsh Traffic flow -- Mathematical models.
dc.subject.lcsh Paging (Computer science)
dc.subject.lcsh Integer programming.
dc.title Tabu search based approach to solve the TAs reconfiguration problem in LTE networks -
dc.type Thesis
dc.contributor.department Faculty of Arts and Sciences.
dc.contributor.department Department of Computer Science,
dc.contributor.institution American University of Beirut.

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search AUB ScholarWorks


My Account