Network Planning Algorithms for Optimizing Signalling Load in Mobile Networks

Network Planning Algorithms for Optimizing Signalling Load in Mobile Networks

Vilmos Simon (Budapest University of Technology and Economics, Hungary)
DOI: 10.4018/978-1-60566-148-3.ch009
OnDemand PDF Download:


In the next generation IP-based mobile networks, one of the most important QoS parameters are the delay and the delay variation. The cell handover causes incremental signaling traffic, which can be critical from the point of view of delay variation. It worsens the quality parameters of the real-time services, which are the backbone of next generation mobile commercial services. We have designed and implemented two algorithms: a location area forming algorithm (LAFA) and a cell regrouping algorithm (CEREAL), which can help us to guarantee QoS parameters in the next generation mobile networks. We used our realistic mobile environment simulator to generate input statistics on cell changes and incoming call for our algorithms and by comparing the values of the cost functions proposed by us, we recognized that significant reduction was achieved in the amount of the signaling traffic, the location update cost was decreased by 40-60% in average. To confirm the results obtained by the realistic mobile environment simulator, a vehicular mobility simulator was used for generating the input to the algorithms for realistic vehicle mobility behavior. The same was recognized, that by employing our LA forming schemes, a significant reduction was attained in the signalling traffic that causes delay and delay variation, helping us improving QoS parameters in general.
Chapter Preview


Signalling delay and the delay variation are very important service quality parameters of the next generation, IP based mobile networks. The cell handovers in mobile networks causes an incremental signalling message overhead (Akyildiz, Mcnair, Ho, Uzunalioglu, and Wang, 1998), which affects the delay variation and it is critical in the case of timing-sensitive real-time media applications. The signalling overhead is caused because the location information of a mobile is maintained by registration (Wong & Leung, 2000), where the mobile terminals update their location area information to their home agents (Location Management). The determination of the location of the user is also important, because the demand of mobile Location Dependent Information Services (LDIS) has fueled in recent years. (Jayaputera & Taniar, 2005) proposed a new approach to generate a query result for Location-Dependent Information Services. Another scope is when the users location moves from one base station to another and the queries cross multi-cells, (Jayaputera & Taniar, 2005) gave an approach of mobile query processing in these situations.

The determination of the optimal number of cells in each location area (LA) is a very important task, but the optimal partition of cells into LAs is an NP-hard problem. There was an important contribution in the determination of the optimal number of cells in an LA (Saraydar, Kelly, and Rose, 2000), but they were not focusing on the selection of the optimal set of cells for each LA. Therefore we propose a solution to obtain the optimal partition of cells for every LA.

The location area structure means that we can join several cells into one administrative unit, so-called location area, and in this way the cell border crossings inside this domain will be hidden for the upper hierarchical levels. Signalling overhead will be produced only when we cross a domain border, but that is rarer than a cell handover, thus the traffic of signalling messages will be reduced (Cayirci & Akyildiz, 2003).

The question arises: What size the LA should be? Both, increasing and decreasing the size have their own benefit. On the one hand if we join more and more cells into one LA, then the number of LA handovers will be smaller, so the number of location update messages sent to the upper levels will decrease. However in the case of numerous cells belonging to a single LA, an incoming call will cause lots of paging messages (Zhang, Castellanos, and Campbell, 2002), since we must send one to every cell to find where is the mobile user inside that LA. That will increase the load of base stations.

On the other hand if we decrease the number of cells, then we do not need to send so many paging messages (hereby we will load less links and the processing time will decrease, too), but then the number of LA changes will increase.

Accordingly we must search for the optimal compromise between these two conflicting aspects (Kameda & Li, 2000).

Complete Chapter List

Search this Book:
Editorial Advisory Board
Table of Contents
Indranil Bose
Chapter 1
Varadharajan Sridhar
Telecom operators have a wide variety of functions to perform including marketing of telecom products and services, managing their networks... Sample PDF
Strategic Outsourcing: Opportunities and Challenges for Telecom Operators
Chapter 2
Sami J. Habib
This article presents a computer-aided integration tool, iCAD, that can predict a network evolution. We have used the term a network evolution to... Sample PDF
Empirical Prediction of Computer-Network Evolution
Chapter 3
Hak Ju Kim
This article seeks to develop a richer understanding of the suitability of IP telephony in the Public Switched Telephony Network (PSTN) with an... Sample PDF
Suitability of IP Telephony in the Public Switched Telephone Network (PSTN): A Case Study
Chapter 4
Abid Al Ajeeli
This chapter describes a detailed framework configuration infrastructure design for a high performance network. The configuration is described based... Sample PDF
A Framework for High-Speed Networking
Chapter 5
Nurul I. Sarkar, Catherine Byrne, Nabeel A.Y. Al-Qirim
Ethernet network technology is still one of the most popular LAN technologies in use today by many organizations and educational institutions... Sample PDF
Updating on Gigabit Ethernet Implementation: The Case of a Large New Zealand Organization
Chapter 6
M. Chandrasekaran, R. S.D. Wahida Banu
This chapter introduces and analyses a class of non-linear congestion control algorithms called polynomial congestion control algorithms. These... Sample PDF
Interaction Between MIMD-Poly & PIPD-Poly Algorithms and other TCP Variants in Multiple Bottleneck TCP Networks
Chapter 7
Xabiel G. Pañeda
This chapter presents a method for performance analysis and configuration of audio/video-on-demand services. These kind of services makes use of an... Sample PDF
A Systematic Approach to the Analysis and Configuration of Audio/Video-on-Demand Services
Chapter 8
Say Ying Lim
As more and more servers appearing in the wireless environment provide accesses to mobile users, more and more demand and expectation is required by... Sample PDF
Mobile Information Processing Involving Multiple Non-Collaborative Sources
Chapter 9
Vilmos Simon
In the next generation IP-based mobile networks, one of the most important QoS parameters are the delay and the delay variation. The cell handover... Sample PDF
Network Planning Algorithms for Optimizing Signalling Load in Mobile Networks
Chapter 10
Joon-Yeoul Oh, John P. Mullen
This chapter proposes a very effective heuristic algorithm to address a variation of the cellular network expansion problem and discusses each... Sample PDF
A Heuristic Solution to the Large Scale Cellular Telecommunication Network Expansion Problem
Chapter 11
Manuel Vilas
This article introduces a distributed system, called wireless proxy, to mitigate the effects of user mobility over streaming services on IEEE 802.11... Sample PDF
Wireless Proxy: Distributed System to Mitigate the Effects of User Mobility Over Streaming Services on IEEE 802.11 Wireless LANs
Chapter 12
R. Radhakrishnan, K. R. Shankarkumar, A. Ebenezer Jeyakumar
In this chapter, we propose a new scheme for Multi User Detection (MUD) using Parallel Interference Cancellation (PIC) technique. This technique... Sample PDF
Soft Decision Parallel Interference Cancellation for Multi-Carrier DS-CDMA
Chapter 13
Ghassan Kbar
This chapter introduces a new radio resource management technique based on distributed dynamic channel assignment, and sharing load among Access... Sample PDF
Distributed Resources Management in Wireless LANs that Support Fault Tolerance
Chapter 14
Mieso K. Denko
This article proposes a cooperative data caching and prefetching scheme for Mobile Ad Hoc Networks (MANETs). In this scheme, multiple hosts... Sample PDF
Cooperative Data Caching and Prefetching in Wireless Ad Hoc Networks
Chapter 15
Essam Natsheh
The challenge in creating a routing protocol for ad-hoc networks is to design a single protocol that can adapt to the wide variety of conditions... Sample PDF
A Survey on Fuzzy Reasoning Applications for Routing Protocols in Wireless Ad-Hoc Networks
Chapter 16
Essam Natsheh
Mobile ad-hoc network is a network without infrastructure, where every node has its own protocols and services for powerful cooperation in the... Sample PDF
Fuzzy Linguistic Knowledge for Active Queue Management in Wireless Ad-Hoc Networks
Chapter 17
Yun Wang, Lee Seidman
The use of network traffic audit data for retrieving anomaly intrusion information and profiling user behavior has been studied previously, but the... Sample PDF
Risk Factors to Retrieve Anomaly Intrusion Information and Profile User Behavior
Chapter 18
Rania Wehbi
In Inter-Vehicle Communication (IVC) networks, the high mobility and lack of infrastructure pose major challenges in designing secure routing... Sample PDF
Network Setup for Secure Routing in Inter-Vehicle Communication Networks
Chapter 19
Antonios Alexiou, Christos Bouras, John Papagiannopoulos, Dimitrios Primpas
This chapter presents the design principles that cover the implementation of broadband infrastructure in the region of Western Greece, by examining... Sample PDF
Metropolitan Broadband Networks: Design and Implementation Aspects, and Business Models
About the Contributors