Performance Analysis Of Prole Based Paging For Addis Ababa Umts Networks

Paging is an important mobile network procedure that is performed to locate andrnconnect mobile users when they receive calls/sessions. It is needed as users arernmobile, and continuously updating their serving cells is not bandwidth efficient.rnIn traditional broadcast paging, all cells of a network are grouped into clustersrnthat are identified by Location Area Code (LAC). Users update their LAC andrnnetwork look for a paged user by sending paging messages for all cells within thernuser’s LAC. A decision on cluster size is an important factor that determines thernpaging overhead and connection delay. The larger cluster size, the smaller LACrnupdate but the larger capacity for the paging message. To minimize the capacityrnrequired for paging messages while maintaining a larger cluster size, profile-basedrnpaging has been proposed and studied. Yet, such a paging approach has not beenrninvestigated and applied for Addis Ababa third-generation network.rnIn this thesis work, we analyzed the performance of profile-based paging algorithmrnfor Addis Ababa third-generation network based on call detail record datarncollected from the network management system and compared it with conventionalrnone. The algorithms considered were static and dynamic profile based paging.rnWe analyzed the paging algorithms for users with less, moderate and highlyrnmobile. A user’s mobility is modeled using a Markov model.rnAchieved results show that the profile-based algorithm considerably increases thernefficiency of utilization with slight or no effect in the overall paging success rate.

Get Full Work

Report copyright infringement or plagiarism