Heuristic search techniques for cell to switch assignment in location area planning for cellular networks

Mandal, Swarup; Saha, Debashis; Mahanti, Ambuj

doi:10.1109/icc.2004.1313360

Cited by 12 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The concept behind this algorithm is similar to our previous work [11]. It is based on a state space representation of the problem [16] (as exemplified in Fig.…”

Section: State Space Formulation and Optimal Heuristic Search Algomentioning

confidence: 99%

“…It is obvious from the fonnulation that an exhaustive enumeration technique for assigning RNCs in dual homing problem requires checking (m+s)r combinations. So, when the problem size is large, heuristic techniques are suitable to solve such problems [11].…”

Section: " "mentioning

confidence: 99%

“…In the current work, we have extended our earlier work to UMTS networks for dual homing of RNCs to MSCs/SGSNs and solved it using three separate techniques. Firstly, we have used simulated annealing (SA) [3] and tabu search (TS) [5] meta-heuristic techniques and then developed a novel optimal search method with a polynomial time admissible heuristic [11], [16]. The heuristics method is reasonably strong that works fine with even larger networks, where SA and TS fail to give optimal solutions.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Post-deployment tuning of UMTS cellular networks through dual-homing of RNCs

Sadhukhan

Mandal

Biswas³

et al. 2009

2009 First International Communication Systems and Networks and Workshops

View full text Add to dashboard Cite

In conventional UMTS cellular networks, during deployment usually a set of NodeBs is assigned to one Radio Network Controller (RNC), and a set of RNCs to one Serving GPRS Support Node (SGSN) for data services, as weD as to one Mobile Switching Centre (MSC) for voice services. Operators thus far have considered single-homing of RNCs to MSCs/SGSNs (i.e., many-to-one mapping) with an objective to reduce the total cost over a fIXed period of time. However, a single-homing network does not remain cost-effective any more when subscribers later on begin to show specific inter-MSC/SGSN mobility patterns (say, diurnality of office goers) over time. This necessitates post-deployment topological extension of the network in terms of dual-homing of RNCs, in which some specific RNCs are connected to two MSCs/SGSNs via direct links resulting in a more complex many-to-two mapping structure in parts of the network. The partial dual-homing attempts to increase link cost minimally and reduce handoff cost maximaDy, thereby significantly reducing the total cost in a post-deployment optimal extension. In this paper, we formulate the scenario as a combinatorial optimization problem and solve the NP-Complete problem using two meta-heuristic techniques, namely Simulated Annealing (SA) and Tabu search (TS). We then compare these techniques with a novel optimal heuristic search method that we propose typically to solve the problem. The comparative results reveal that, though aD of them perform equally well for small networks, for larger networks, the search-based method is more efficient than meta-heuristic techniques in finding optimal solutions quickly.This can be addressed in post deployment planning phase by splitting cells (where capital expenditure as well as hand-off cost will increase) or by redefining the connectivity of cells and switches. The third case may arise due to a gradual change in mobility pattern of the existing subscriber base over a long period of time [6]. This problem can be addressed by regrouping cells into new clusters i.e., by changing the connectivity of NodeBs to RNCs and RNCs to MSCs/SGSNsHowever, this cannot take care of situations where handoff increases with no increase in total traffic due to periodic (temporal) changes of subscribers' locations. If there is a clear pattern of this temporal mobility of subscribers, a multi-homing consideration (where many NodeBs are connected to one RNC, and many RNCs are connected to one MSC/SGSN) will be a useful strategy in post deployment tuning stage. Obviously, the multi-homing concept can be implemented at two levels, namely, in the first level, multi-homing of NodeBs, and, in the second level, multi-homing of RNCs. In this paper, we have considered dual-homing of RNCs, where some RNCs (to be decided optimally) are connected to two MSCs/SGSNs (as shown in Fig. 1) to reduce handoff cost, unlike single homing where one RNC is connected to one MSC/SGSN only. In order to achieve an optimal selection of RNCs from the set of potential RNCs to be dual-homed, we have prop...

show abstract

“…The concept behind this algorithm is similar to our previous work [11]. It is based on a state space representation of the problem [16] (as exemplified in Fig.…”

Section: State Space Formulation and Optimal Heuristic Search Algomentioning

confidence: 99%

Section: " "mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Post-deployment tuning of UMTS cellular networks through dual-homing of RNCs

Sadhukhan

Mandal

Biswas³

et al. 2009

2009 First International Communication Systems and Networks and Workshops

View full text Add to dashboard Cite

show abstract

“…The author in [23] regards the TA planning problem as a graph optimisation problem. The authors in [24] use heuristic search for depth-first search to solve TA planning problems with specified execution time. The authors in [25] propose a delayed registration (DR) algorithm to reduce the signalling overhead in the network.…”

Section: Related Workmentioning

confidence: 99%

Tracking areas planning based on spectral clustering in small cell networks

Lin

Waqas

et al. 2019

IET Communications

View full text Add to dashboard Cite

“…However, little work has been done with respect to mapping a particular network related problem, other than finding shortest routes, to a state-space problem and solving it. For instance, cell-to-switch assignment is developed using heuristic search for mobile calls in [17]. Heuristic search is further used in [18] to simulate possible attackers searching for attacks in modelled network for proactive and continuous identification of network attacks.…”

Section: Motivationmentioning

confidence: 99%

VOIP Call Optimization in Diverse Network Scenarios Using Learning Based State-Space Search Technique

Chakraborty¹,

Mukhopadhyay²,

Misra³

et al. 2011

IJWMN

View full text Add to dashboard Cite

A VoIP based call has stringent QoS requirements with respect to delay, jitter, loss, MOS and R-Factor. Various QoS mechanisms implemented to satisfy these requirements must be adaptive under diverse network scenarios and applied in proper sequence, otherwise they may conflict with each other. The objective of this paper is to address the problem of adaptive QoS maintenance and sequential execution of available QoS implementation mechanisms with respect to VoIP under varying network conditions. In this paper, we generalize this problem as state-space problem and solve it. Firstly, we map the problem of QoS optimization into state-space domain and apply incremental heuristic search. We implement the proposed algorithm under various network and user scenarios in a VoIP test-bed for QoS enhancement.Then learning strategy is implemented for refinement of knowledge base to improve the performance of call quality over time. Finally, we discuss the advantages and uniqueness of our approach.

show abstract

Heuristic search techniques for cell to switch assignment in location area planning for cellular networks

Cited by 12 publications

References 9 publications

Post-deployment tuning of UMTS cellular networks through dual-homing of RNCs

Post-deployment tuning of UMTS cellular networks through dual-homing of RNCs

Tracking areas planning based on spectral clustering in small cell networks

VOIP Call Optimization in Diverse Network Scenarios Using Learning Based State-Space Search Technique

Contact Info

Product

Resources

About