frequency management and channel assignment in mobile communication

• Advanced Search

Dynamic channel assignment in wireless communication networks

Department of Electrical Engineering, University of Hawaii at Manoa, Honolulu, Hawaii

New Citation Alert added!

This alert has been successfully added and will be sent to:

You will be notified whenever a record that you have chosen has been cited.

To manage your alert preferences, click on the button below.

New Citation Alert!

Please log in to your account

• Publisher Site

International Journal of Network Management

We propose a new Cochannel information based Dynamic Channel Assignment (CDCA) strategy for small and microcell systems and a new Group Dynamic Channel Assignment (GDCA) strategy which handles multichannel traffic in wireless networks. Copyright © 1999 John Wiley & Sons, Ltd.

Index Terms

Computer systems organization

Dependable and fault-tolerant systems and networks

General and reference

Cross-computing tools and techniques

Performance

Network performance evaluation

Network services

Network management

Network types

Mobile networks

Wireless access networks

Recommendations

Channel assignment and hand-off policies in cluster-based micro/ picocellular wireless networks.

In this paper, we consider cluster-based micro/picocellular networks with overlapped cell-clusters. Channel assignment and hand-off policies are essential and important policies in cellular wireless networks. The issue of how different channel ...

Joint routing and channel assignment algorithms in cognitive wireless mesh networks

Multiple channels can increase network capacity by transmitting traffic on different channels in an interference area. To resolve the channel interference problem in cognitive wireless mesh networks, first, a new channel assignment algorithm based on ...

Optimal channel assignment in wireless communication networks with distance and frequency interferences

Fixed channel assignment in wireless communication networks is a significant combinatorial optimization problem that must be solved. Since the combinatorial optimization problem is NP-hard, many different heuristics have been proposed for its solution. ...

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

• Information
• Contributors

Published in

In-cooperation.

John Wiley & Sons, Inc.

United States

Publication History

• Published: 1 March 1999

Funding Sources

Other metrics.

• Bibliometrics
• Citations 1

Article Metrics

• 1 Total Citations View Citations
• 827 Total Downloads
• Downloads (Last 12 months) 0
• Downloads (Last 6 weeks) 0

Digital Edition

View this article in digital edition.

Share this Publication link

https://dl.acm.org/doi/10.5555/336760.336766

Share on Social Media

• 0 References

Export Citations

• Please download or close your previous search result export first before starting a new bulk export. Preview is not available. By clicking download, a status dialog will open to start the export process. The process may take a few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress. Download
• Download citation
• Copy citation

We are preparing your search results for download ...

We will inform you here when the file is ready.

Your file of search results citations is now ready.

Your search export query has expired. Please try again.

• DOI: 10.1109/98.511762
• Corpus ID: 263866108

Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

• Irene Katzela , M. Naghshineh
• Published in IEEE Communications Surveys… 1 June 1996
• Computer Science, Engineering

Tables from this paper

1,278 Citations

Analysis of channel allocation schemes for cellular mobile communication networks.

• Highly Influenced

The study of a channel sharing scheme in wireless cellular networks including handoffs

Vcb: an efficient resource sharing scheme for cellular mobile systems, dynamic channel allocation schemes for overlay cellular architectures, performance analysis of a threshold based distributed channel allocation algorithm for cellular networks, a new localized channel sharing scheme for cellular networks, fixed channel allocation scheme performance enhancement for cellular mobile systems, survey of channel allocation algorithms research for cellular systems, improved channel assignment scheme in cellular mobile communication, adaptive radio resource management in f/tdma cellular networks using smart antennas, 73 references, on dynamic channel allocation in cellular/wireless networks, the nonuniform compact pattern allocation algorithm cellular mobile systems, traffic capacity of cellular mobile communications systems, a strategy for flexible channel assignment in mobile communication systems, a simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system, all-channel concentric allocation in cellular systems, distributed dynamic channel assignment schemes, a simulation study of a hybrid channel assignment scheme for cellular land-mobile radio systems with erlang-c service.

• Highly Influential

Strategies for handover and dynamic channel allocation in micro-cellular mobile radio systems

Prioritized channel assignment in a cellular radio network, related papers.

Showing 1 through 3 of 0 Related Papers

• Open access
• Published: 10 November 2016

Evaluation of a channel assignment scheme in mobile network systems

• Nahla Nurelmadina 1 ,
• Ibtehal Nafea 1 &
• Muhammad Younas 2  

Human-centric Computing and Information Sciences volume  6 , Article number:  21 ( 2016 ) Cite this article

8411 Accesses

7 Citations

Metrics details

The channel assignment problem is a complex problem which requires that under certain constraints a minimum number of channels have to be assigned to mobile calls in the wireless mobile system. In this paper, we propose a new scheme, which is based on double band frequency and channel borrowing strategy. The proposed scheme takes into account factors such as limited bandwidth of wireless networks and the capacity of underlying servers involved in processing mobile calls. It aims to ensure end-to-end performance by considering the characteristics of mobile devices. This is achieved by determining the position of users (or mobile stations) in wireless mobile systems. The proposed scheme is simulated in order to investigate its efficiency within a specific area of a large city in Saudi Arabia. Experimental results demonstrate that the proposed scheme significantly improves the performance of mobile calls as well as reduces the blocking when the number of mobile call increases.

Mobile devices and particularly mobile phones have been used for a variety of purposes ranging from voice calls through to sending SMS/emails to online banking and shopping. Mobile phones generally use cellular network system as one of the main communication network. The rate of increase in the popularity of mobile phone usage has far outpaced the availability of usable frequencies which are necessary for the communication between mobile users and the base stations of cellular networks. This constitutes an important bottleneck in the provided capacity of mobile cellular systems. Careful design of a network is necessary to ensure efficient use of limited frequency resources. One of the most important issues in the design of a cellular radio network is to determine a spectrum-efficient and conflict-free allocation of channels among the cells while satisfying both the traffic demand and the electromagnetic compatibility (EMC) constraints [ 1 ]. This is usually referred to as channel assignment or frequency assignment. The problem of channel assignment becomes increasingly important, i.e., how do we assign calls to available channels so as to improve performance and to minimize interference. This paper proposes a new scheme for channel assignment, which is called Double Band Frequency Channel Borrowing (DBFCB) scheme. The objective of the proposed scheme is to optimize channel utilization, improve performance and to reduce the blocking probability of calls in a wireless mobile network system.

The proposed scheme is systematically developed and validated through various simulation experiments. It has been applied to the central area of a large city, Madina Monwara, in the Kingdom of Saudi Arabia, using two bands (900, 1800 MHz). Channel borrowing techniques were simulated to investigate the efficiency of this scheme and to make sure that the scheme is viable. The theoretical analysis of the tele traffic was validated through MATLAB simulation analysis [ 2 ]. The simulation model is based on the number of users within a specific area which has BTSs. This is based on data collected from the famous local mobile operator, Zain Telecom Company‎.

The main contributions of the proposed scheme are to reduce the call blocking and call dropping probabilities. Such probabilities generally increase with the increase in the number of mobile users. Thus reduction in call blocking/dropping will enable improved service provisioning in mobile wireless network. In addition, DBFCB algorithm improves response time by using both benchmark and heavy traffic demands with the same known constraints.

The remainder of the paper is structured as follows. ‘‘ Mobile network architecture and communication ’’ section describes an architecture of a mobile network and a mobile communications process. ‘‘ Related work ’’ section reviews and analyses related work. ‘‘ The proposed scheme ’’ section presents the proposed scheme. ‘‘ Modelling of the proposed scheme ’’ section describes modelling of the proposed scheme. ‘‘ Experimental results ’’ section describes the experimental results and analysis. ‘‘ Conclusion ’’ section presents the conclusion.

Mobile network architecture and communication

This section describes the fundamental principles and concepts of wireless mobile network systems. It first presents a generalized architecture of mobile networks and describes its main components. It then describes mobile communications process.

Mobile network architecture

Figure  1 shows an mobile network architecture. The process of call handling in mobile network is carried out in different steps. First, a mobile device (making call) establishes a connection with the access point which is the base station. If the connection is successful the base station responds to the call of mobile device. Radio frequency connection establishment is triggered by sending a channel request message. This message requests the Base station system (BSS) for allocation of radio resources for radio connection setup. The mobile device then waits for an assignment of the access channel. At this point the mobile device is listening to the access channel for a reply. The BSS allocates a channel to the mobile device. This channel allocation assigns a frequency and a timeslot on that frequency. After the mobile device receives this message, it will only use the specified resources for communication within the mobile network.

The main components, of Fig.  1 , involved in mobile call handling, are explained as follows.

Mobile switching center (MSC) It provides call control and telephony switching services between telephone and data systems, and it also provides access to the fixed Public Switched Telephone Network. The MSC manages handoff and switching processes between cells. It communicates with each relevant BS (Base Station) in order to drop the call from the old BS and to set up a new one in the new BS (as a part of the handoff process). MSCs also orchestrate the process of creating new voice calls. An MS initiates a call by using a reverse control channel to make a request. The MSC has then to grant the request, after which a pair of voice channels is assigned to the call. The MSC includes one database for storing location information and call details of a mobile terminal. The MSC is also connected to a second database in which information about a subscriber registered in its mobile communication service is stored. The base stations route the communications to the MSC via a serving BSC. The MSC routes the communications to another subscribing wireless unit via a BSC/base station path or via the PSTN/Internet/other network to terminating destination. Between MSCs, circuit connections provide the handover mechanism that services calls as users roam from one service zone to another.

Home location register (HLR) It is a central master database within the GSM network, which maintains a permanent store of subscribers’ information, and location information for the mobile network. The HLR provides information on the services (subscribed) to the network users. It is also an important source of data to support the roaming process which enables incoming calls that are to be routed to the location of the subscriber.

AC or AUC This is the Authentication Center which contains a secured database handling authentication and encryption keys. It is also a key component of the HLR. It validates the mobile SIM (Security Information Management) card which attempts to connect to a mobile network. It verifies a mobile device by sending a randomly generated number to the mobile device. The mobile device then performs a calculation against it with a number it has stored and sends the result back. If the switch gets the number it expects then the call proceeds. The AC stores all data needed to authenticate a call and to encrypt both voice traffic and signaling messages [ 3 ].

Base station system (BSS) All radio-related functions are performed in the BSS, which consists of base station controllers (BSCs) and the base transceiver stations (BTSs) [ 3 ].

BSC It provides all the control functions and physical links between the MSC and BTS. It is a high-capacity switch that provides functions such as handover, cell configuration data, and control of radio frequency (RF) power levels in base transceiver stations. A number of BSCs are served by an MSC.

BTS It handles the radio interface to the mobile station. The BTS is the radio equipment (transceivers and antennas) needed to service each cell in the network. A group of BTSs are controlled by a BSC.

Mobile communication

Each mobile device uses a separate, temporary radio channel in order to communicate with the cell site. The cell site talks to many mobile devices at once, using one channel per mobile device. Channels use a pair of frequencies for communication (see Fig.  2 )—one frequency (the forward link) for transmission from the cell site and one frequency (the reverse link) for the cell site to receive calls from the mobile device. Mobile devices must stay near the base station to maintain communications. The basic structure of mobile networks includes telephone systems and radio services. Mobile radio service operates in a closed network and has no access to the telephone system. But mobile telephone service allows interconnection with the telephone network.

Mobile communication system

Related work

Various techniques and models have been developed in order to improve the performance of mobile calls and related services in mobile wireless networks. Different factors contribute to the performance aspects such as network traffic, bandwidth, computing devices, and the wireless signals between the mobile devices and nearby base stations of cellular radio networks.

Various channel assignment schemes have been widely investigated with a goal to maximize the frequency reuse. The channel assignment schemes in general can be classified into three strategies: fixed channel assignment (FCA), dynamic channel assignment (DCA) and the hybrid channel assignment (HCA) [ 4 , 5 ]. In FCA, a set of channels are permanently allocated to each cell based on pre-estimated traffic intensity. In this case, the co-channel interference (Transmission on same frequency), adjacent channel interference (Transmission on close frequencies), and the co-site channel interference lead to the main problem, i.e., it does not adapt to changing traffic conditions and user distribution. Moreover, the frequency planning becomes more difficult in a microcellular environment as it is based on the accurate knowledge of traffic and interference conditions. The main problem of FCA is the poor channel utilization wherein some users are unable to find any channel to use.

In DCA, there is no permanent allocation of channels to cells. Rather, the entire set of available channels is accessible to all the cells, and the channels are assigned on a call-by-call basis in a dynamic manner. This means that base station chooses frequencies depending on the frequencies already used in neighboring cells. But the issue with the DCA is to handle more traffic in a particular cell [ 6 , 7 ].

Kyasanur et al. [ 8 ] propose to improve the capacity of multi-channel wireless networks. This work exploits multiple interfaces but with the constraint that the number of available channels is greater than the number of available interfaces. It also proposes a strategy that maintains the autonomy of IEEE 802.11 such that it is not required to be modified.

Rajagopalan et al. [ 9 ] take into account quality of service parameters such as residual bandwidth, number of subscribers, duration of calls, frequency of calls and their priority. This work is based on the optimization of dynamic channel allocation using genetic algorithm (GA). It attempts to allocate channels to users such that overall congestion in the network is minimized by reusing already allocated frequencies. This work utilizes GA in order to ensure optimization. The optimized channels are then compared with non-optimized channels in order to check the efficiency of the proposed algorithm.

Shindeet al. [ 10 ] propose a multi-channel allocation model. It uses an evolutionary strategy with an allocation distance in order to enable efficient use of frequency spectrum. The problem of determining an optimal allocation of channels to mobile users that minimizes call blocking and call dropping probabilities is also emphasized in this work.

In order to ensure efficient and smooth service provisioning in the presence of network congestion, link failures, and mobile service station failures, Boukerche et al. [ 11 ] propose that the cellular network be divided into hexagonal cells as shown in Fig.  3 . This approach divides the cells into five groups of varying sizes. The request for a channel can be granted if the requesting cell receives the reply from all members of a group. However, this algorithm may not work properly if the replies received by the requesting cell do not satisfy the above mentioned criteria. The algorithm is successful in the scenarios when the area of coverage is divided into hexagonal cells and the reuse distance is fixed for all cells.

Frequency reuse (channel allocation)

The proposed scheme

The assignment of channels to cells or mobile devices is one of the fundamental resource management issues in a mobile communication system as it involves different cellular components, handover scenarios, and the complex roles of the base station (BS) and the mobile switching center (MSC). In order to appropriately plan a mobile cellular radio network it is necessary to allocate channels to base stations (BS) so as to ensure that the network can carry sufficient traffic while avoiding interference problem [ 12 ].

In a mobile communication system the total number of channels made available (free) to a system depends on the allocated spectrum and the bandwidth of each channel. However, in the current mobile communication system, the available frequency spectrum is limited and the number of mobile users is increasing. Hence the channels must be reused as much as possible in order to increase the system capacity. Thus it is important to allocate channels to cells or mobile devices in such a way so as to minimize the dropping probability of incoming and outgoing calls and the probability that the carrier-to interference ratio of any call falls below a pre-specified value; i.e. the blocking probability which is one of the most important quality of service (QoS) parameters in the channel assignment schemes.

The overall objective is to serve the maximal number of network users over limited transmission resources. The transmission resource is an available radio spectrum which consists of a limited number of frequencies or (channels). Channel assignment problem involves assigning frequencies to each radio cell in such a way that a set of constraints is satisfied [ 13 ]. These include the limited number of available frequencies in the radio spectrum as well as the traffic constraints corresponding to the minimum number of frequencies indispensable for covering communication between mobile devices moving in a particular cell. In addition, the electromagnetic compatibility constraints (EMC) may happen between channels in the same cell (co-site channel constraint), interference between neighboring cells (adjacent channel constraint) and interference between other cells utilizing the same channel (co-channel constraint) [ 14 ].

This paper proposes a new scheme (or algorithm) in order to optimize the frequency assignment and to enable the reuse of same frequency by sufficiently distant cell. This is to maximize the number of communication (calls) but with a limited number of frequencies. The proposed scheme is called dual band frequency channel borrowing (DBFCB). In Simple Borrowing, channel assignments are borrowed from the adjacent cells and are returned to that cell after it has become free. When a new call initiates and reaches to a cell, and if currently, all the permanent channels allocated to the cell are busy, then channels are borrowed from adjacent cell provided the channels are available (in adjacent cell) and minimum reusable distance constraint is met. In Channel Borrowing algorithms, a database is maintained for the record of channels as per their status either currently in use, borrowed or free. Mobile switch center (MSC), taking care of the channel borrowing activities, runs the channel borrowing procedure, so that channels available are borrowed from the cell having relatively more free channels. Channel borrowing is done under minimum reusable distance constraint. The performance may be reduced for ongoing connections, due to increase of overheads in the base stations of the cellular Mobile system [ 15 ].

The main steps of the working mechanism of the DBFCB scheme are illustrated as follows. These steps are diagrammatically shown in Fig.  4 .

Flow chart of the dual band frequency channel borrowing (DBFCB) scheme

When a mobile user wants to communicate with another user or a base station, it must first obtain a channel from one of the base stations that hears it. That is, when a user (mobile device) wants to starts a call, the base station (BS) is identified [ 16 ]. BS is then made aware about user’s location.

Based on the location, users close to the BS get higher priority compare to users who are away from the BS.

When a call request occurs within a cell, the channel allocation (with frequency 900 MHz) of this cell are tested.

The channels are tested in an order starting from the first channel of the list. This is to look for the availability of a free channel.

If a free channel is found, it is assigned to the call associated with the user (mobile device).

If no free channel can be found and all the channels are busy then a channel allocation (with frequency 1800 MHz) is borrowed from the adjacent cell. The adjacent cell is required to have the largest number of channels available for borrowing.

If all channels in the adjacent cell are busy then it borrows channels from the next cell (with frequency 1800 MHz), if available.

Modelling of the proposed scheme

This section explains the main elements which are involved in order to model the proposed scheme. Based on these the proposed scheme is then tested and evaluated through simulation experiments [ 17 ].

Modelling of the geographical area

In order to test the proposed scheme we model the (simulated) geographical area with respect to a real geographical area of one of the major cities in Saudi Arabia, called Madina Monwara. This city attracts a large number visitors and thus providing a good venue for testing the proposed scheme. It represents the user mobility and traffic behavior within a certain area such as the Haram Area in the city, as shown in Fig.  5 . For the proposed scheme, this area represents one cluster (as in related studies of modelling city areas [ 18 ]). In line with the related studies, the area under consideration (as in Fig.  5 ) exhibits specific characteristics such as population distribution, and distribution of MAPs (Movement Attraction Point).

Geographical area in the city of Madina Monwara, Saudi Arabia

Population distribution Population of people in a geographical area can be grouped into different classes including: visitors, cars, and local working people. The classification of groups is based on the mobility behavior of a population. However, in the proposed scheme, we consider a representative sample of people which are mobile users (making mobile calls). This is because mobile communication systems focus merely on the mobility behavior of mobile users.

Movement attraction points (MAP) MAPs represent locations that attract the population movements and at which people spend considerable time. Examples are work places, residences, shopping centers, etc. Each MAP characterizes the people group type it attracts. The proposed scheme considers the MAP (shown in Fig.  5 ) which is the main attraction for visitors in the city of Madina Monwara. Other types of MAPs include residences, work places, shopping centers, etc.

Traffic modelling

We consider the arrival of both incoming and outgoing calls. The call arrival rate refers to the total number of incoming and outgoing calls during busy hour conditions. The call arrival process follows Poisson distribution. For high mobility users, the rate of incoming calls is assumed to be higher than the corresponding outgoing calls.

Consider the scenario in wireless mobile network consisting of two cells in a series. New calls arrive in the first cell with Poisson rate and are served for a time interval that is negative exponentially distributed with mean calls carried in the first cell (block call). After completion of service, calls are offered to the second cell with a fixed handoff probability. These calls are serviced in the second cell for time intervals that are negative exponentially distributed with mean. For simplicity, we assume that cell receives no new calls and also generates no block calls to be given to the first cell. The blocking experienced by the new calls of mobile network in the first cell is given by the Erlang. The traffic load, in Erlang, is the product of the call arrival time and the call duration [ 19 ]. The call arrival time represents the cumulative sum of calls inter-arrival time, which follows a Poisson distribution with an average time (λ). Note that we characterize the joint probability distribution of the number of calls in the cells in such a way that we take into account that the users perform random motions. The inter-arrival time define the time period between two consecutive calls.

During the first part of simulation, λ was kept constant in order to investigate the performance at a certain time period with a fixed traffic load. In the second part, the traffic load varied with the simulation time, thus the performance was according to the traffic load. The call duration is chosen as a negative exponentially distributed because for all calls the arrival time and call duration are treated as independent random variables.

Experimental results

The proposed scheme is simulated using the MATLAB software [ 20 ]. The simulation model is divided into three parts. The first part deals with simulation parameters, such as the size of simulation area. The second part deals with the traffic generation parameters, such as inter-arrival time, call arrival time, call duration time and random variable generation (e.g., mobile location in the simulation window). The third part deals with the channel assignment mechanism.

Simulation model

The simulation model consists of a fixed window with four-overlapped cells. Each cell consists of two bands frequency, 900 MHz and 1800 MHz. The simulation area is equal to 4 Km 2 . Every cell covers 1 Km 2 ; assume that the cell type used can cover up to 1 Km 2 , macrocell. As shown in Fig.  6 , the simulation area is divided into four cells, each associated with one BTS (Base Transceiver Station). The coordinates for each BTS are as follows.

Distribution of mobile users in the simulation area

BTS(1) in X-pos starts from 0 to 1000 m and in y-pos from 0 to 1000 m.

BTS(2) in X-pos starts from 0 to 1000 m and in y-pos starts from 1000 m to 2000 m.

BTS(3) in X-pos starts from 1000 m to 2000 m and in y-pos starts from 1000 m to 2000 m.

BTS(4) in X-pos starts from 1000 to 2000 m and in y-pos starts from 0 to 1000 m.

The main parameters considered in the simulation are number of cells, number of channels, population size and the maximum number of iterations.

Simulation results

The proposed algorithm was investigated using four different cases. Each simulation was run ten times in order to obtain an average value in each case.

Case 1 The number of mobile users in the simulation area is 5000 and the channels are 72 in each cell in the entire BTS. The algorithm was investigated under extremely high traffic intensity. The average holding time call was adjusted to 60 s and the average arrival time was adjusted to 1 s. The simulation results are shown in Fig.  7 . The blocking call values show that all channels were consumed; i.e., value of channel availability is zero because all channels are busy and there is no free channel at BST. The negative value of channel availability means that new calls have no free channels. The positive value of channel availability means that free channels are available.

Channel consumption results at the end of simulation time in case 1

The results show, that in the case of frequency 900 band (1 to 4 BTS) all channels were consumed in 4 Base station that means no free channel (all channels locations were busy in cell) use the other frequency 1800 band.

In the case of frequency 1800 band (5 to 8 BTS), the following observations were made:

BTS 1 consumed all channels and 25 new calls were blocked no channel free available;

BTS 2 consumed all channels and 23 new calls were blocked no channel free available;

BTS 4 consumed all channels and 7 new calls were blocked no channel free available;

BTS 3 consumed 66 channels and 6 new channels were available channel free available.

Case 2 In this case, the algorithm was investigated under high traffic intensity. The average holding time was adjusted to 180 s and the average arrival time was adjusted to 1 s. Figure  8 shows the simulation results:

Channel consumption result at the end of simulation time in case 2

The results show that in frequency 900 band, all channels were consumed and no channels were free in the band 900 of all 4BTS. In using the other frequency 1800 band, the following observations were made:

BTS 1 consumed all channels and 4 calls were blocked. All channel in this base station are busy and thus 4 new calls were blocked;

BTS 2 consumed all channels and no free channel was available. All channels were busy in the cell and thus 6 new calls were blocked;

BTS 4 consumed all channels. 23 calls were blocked as there was no free channel available;

BTS 3 consumed 59 channels. 7 channels were available channel so calls are not blocked.

Case 3 In this case, the average holding time was adjusted to 180 s and the average arrival time was adjusted to 30 s. The simulation results are shown in Fig.  9 .

Channel consumption result at the end of simulation time in case 3

The results indicate that in frequency 900 band:

BTS 1 consumed 4 channels and 68 channels are available. Thus no call was blocked;

BTS 2 consumed 3 channels and 69 channels are available. Thus no call was blocked;

BTS 3 consumed 4 channels and 68 channels are available. Thus no call was blocked;

BTS 4 consumed 6 channels and 65 channels are available. Thus no call was blocked.

On the other hand, in frequency 1800 band, there were no channels consumed. All channels were available.

The algorithm was investigated under medium traffic intensity. Total channels in each cell were 72.

Case 4 The average holding time was adjusted to 180 s and the average arrival time was adjusted to 120 s. Figure  10 shows the simulation results.

Channel consumption result at the end of simulation time in case 4

According to the results gathered with frequency 900 band, the following observations were made:

BTS-1 consumed 1 busy channel and 71 channels were available, and no call attempted was blocked;

BTS-2 consumed 1 busy channel and 71 channels were available, and no call attempted was blocked;

BTS-3 consumed 2 busy channels and 70 channels were available, and no call attempted was blocked;

BTS-4 consumed no channel and all channel were available, and no call attempted was blocked;

But in the case of 1800 band there were no channels consumed. All channels were available and no call attempted was blocked. The algorithm in case 4 had lower call blocking as compared to the other cases. This shows the improvement of the proposed scheme in reducing the call blocking.

In mobile network systems, assigning a channel to a call in a cell in order to achieve high spectral efficiency is crucial to maintaining call quality and reducing call blocking. This paper proposed a new scheme in order to improve channel assignment problem in the mobile network systems. The proposed scheme takes into account double band frequency channel borrowing. It shows greater response to both benchmark and heavy traffic demands and it enhances network performance with optimum load on the network. The algorithm was evaluated using MATLAB that simulated the network and user distribution behavior in a specific (and busy) area of the city of Madina Monwara in Saudi Arabia. Various experiments were conducted. The results showed that the proposed scheme has the capability of reducing the probability of call blocking and call dropping. It also optimizes channel utilization in mobile network systems. The results also show the effectiveness of the algorithm in borrowing and assigning channels in a high traffic intensity and crowded area. Overall the proposed algorithm reduces the blocking rates of calls and improves the response time even under heavy traffic conditions.

Pathak NR (2014) Channel allocation in wireless communication using genetic algorithm. Int J Eng and Innov Technol 4:161–164

Google Scholar  

Xue D, Chen YQ (2014) Modeling, analysis and design of control systems in MATLAB and Simulink. World Scientific Publishing Company, Singapore

Book   Google Scholar  

Redl SM, Weber MK, Oliphant MW (1998) GSM and personal communications handbook. Artech House Inc., Boston

Mathar R, Mattfeldt J (1993) Channel assignment in cellular radio networks. IEEE Trans Veh Technol 42:647–656

Article   Google Scholar  

Elnoubi SM, Singh R, Gupta SC (1982) A new frequency channel assignment algorithm in high capacity mobile communication systems. IEEE Trans Veh Technol 31:125–131

Rappaport TS (2001) Wireless communication principles and practice. Prentice Hall Communications Engineering & Emerging Technologies Series, New Jersey

Papazoglou PM, Karras DA, Papademetriou RC. A dynamic channel assignment simulation system for large scale cellular telecommunications. In: Proceedings of the international conference HERCMA, Athens, Greece, September, 2005, 45–52

Kyasanur P, Vaidya NH. Routing and interface assignment in multi-channel multi interface wireless networks. In: Proceedings of the IEEE wireless communications and networking conference, New Orleans, LA, USA, 13–17 March 2005; 2051 – 2056

Rajagopalan N, Mala C (2011) Optimization of quality of service parameters for dynamic channel allocation scheme for cellular networks using genetic algorithm. Int J of Next Gener Netw 3:43–53

Shinde SR, Chowdhary GV, Dhore ML, Shinde AS Hybrid channel allocation in wireless network using evolutionary strategy. In: Proceedings of IEEE 2nd international advance computing conference (IACC), Patiala, India, 19–20 February, 2010, 72–77

Boukerche A, El-Khatib K, Huang T. A performance comparison of dynamic channel and resource allocation protocols for mobile cellular networks. In: Proceedings of the 2nd international workshop on mobility management &wireless access protocols, Philadelphia, PA, USA, 26 Sep – 1 Oct, 2004; 27 – 34

Xiao M, Shroff NB, Chong EKP (2001) Resource management in power-controlled cellular wireless systems. Int J Wirel Commun Mob Comput. 1:185–199

Dorne R, Hao J-K. An evolutionary approach for frequency assignment in cellular radio networks. In: Proceedings of the IEEE international conference on evolutionary computation, Perth, WA, 29 Nov–01 Dec 1995, 539 – 544

Silva AP, Mateus GR. Performance analysis for data service in third generation mobile telecommunication networks. In: Proceedings of the 35th Annual Simulation Symposium, San Diego, California, USA, 14–18 April 2002, 227 – 234

Mishra MP, Saxena PC (2012) Survey of channel allocation algorithms research for cellular systems. Int J Netw Commun 2(5):75–104

Sidi M, Starobinski D. New call blocking versus handoff blocking in cellular networks. In: Proceedings of the INFOCOM’96: IEEE 15th annual joint conference of the IEEE computer societies. Networking the Next Generation, San Francisco, CA, USA, 24–28 Mar 1996, 35–42

Beck R, Panzer H. Strategies for handover and dynamic channel allocation in micro-cellular mobile radio systems. In: Proceedings of the IEEE 39th vehicular technology conference, San Francisco, CA, USA, 1989, 178–185

Stüber GL (2001) Principles of mobile communication, 2nd edn. Kluwer Academic Publishers, Dordrecht

MATH   Google Scholar  

Abdalla AGE (2002) Channel assignment and handover strategies in an integrated mobile satellite telecommunication system. Fakulti Kejuruteraan, UKM, Bangi

Matlab: http://www.mathworks.com/products/matlab/ Accessed on 20 Feb 2015

Download references

Authors’ contributions

NN and IN carried out related studies and analysis of the literature. NN, IN and MY participated in the design and development of the proposed scheme which is based on double band frequency and channel borrowing strategy. NN and IN collected simulation data and carried out experiments. MY participated in its design and coordination and helped to draft the manuscript. All authors have read and approved the final manuscript.

Competing interests

The authors declare that they have no competing interests.

Author information

Authors and affiliations.

College of Computer Science and Engineering, Taibah University, Medina, Saudi Arabia

Nahla Nurelmadina & Ibtehal Nafea

Department of Computing and Communication Technologies, Oxford Brookes University, Oxford, OX33 1HX, UK

Muhammad Younas

You can also search for this author in PubMed   Google Scholar

Corresponding author

Correspondence to Muhammad Younas .

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License ( http://creativecommons.org/licenses/by/4.0/ ), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Reprints and permissions

About this article

Cite this article.

Nurelmadina, N., Nafea, I. & Younas, M. Evaluation of a channel assignment scheme in mobile network systems. Hum. Cent. Comput. Inf. Sci. 6 , 21 (2016). https://doi.org/10.1186/s13673-016-0075-0

Download citation

Received : 02 July 2016

Accepted : 05 August 2016

Published : 10 November 2016

DOI : https://doi.org/10.1186/s13673-016-0075-0

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

• Mobile network systems
• Channel borrowing
• Dynamic channel assignment

IEEE Account

• Change Username/Password
• Update Address

Purchase Details

• Payment Options
• Order History
• View Purchased Documents

Profile Information

• Communications Preferences
• Profession and Education
• Technical Interests
• US & Canada: +1 800 678 4333
• Worldwide: +1 732 981 0060
• Contact & Support
• About IEEE Xplore
• Accessibility
• Terms of Use
• Nondiscrimination Policy
• Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. © Copyright 2024 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

• Engineering Mathematics
• Discrete Mathematics
• Operating System
• Computer Networks
• Digital Logic and Design
• C Programming
• Data Structures
• Theory of Computation
• Compiler Design
• Computer Org and Architecture

Channel Allocation Strategies in Computer Network

• Channel Allocation Problem in Computer Network
• Capacity of a channel in Computer Network
• CATA protocol in Computer Network
• What is Broadcasting in Computer Network?
• Multiplexing (Channel Sharing) in Computer Network
• Circuit Switching in Computer Network
• Collision-Free Protocols in Computer Network
• Virtual Circuit in Computer Network
• Computer Network - Cheat Sheet
• Multiple Access Protocols in Computer Network
• How do Packets Find a Computer in a Network?
• Controlled Access Protocols in Computer Network
• Congestion Control techniques in Computer Networks
• Computer Network | Leaky bucket algorithm
• Computer Networks | Set 6
• Computer Networks | Set 4
• Commonly asked Computer Networks Interview Questions | Set 1
• Storage Allocation Strategies in Compiler Design
• Computer Networking Aptitude Questions for Bank Exams

Channel Allocation means to allocate the available channels to the cells in a cellular system. When a user wants to make a call request then by using channel allocation strategies their requests are fulfilled. Channel Allocation Strategies are designed in such a way that there is efficient use of frequencies, time slots and bandwidth. 

Types of Channel Allocation Strategies:  

These are Fixed, Dynamic, Hybrid Channel Allocation and Borrowing Channel Allocation as explained as following below.

Fixed Channel Allocation (FCA):  

Fixed Channel Allocation is a strategy in which fixed number of channels or voice channels are allocated to the cells. Once the channels are allocated to the specific cells then they cannot be changed. In FCA channels are allocated in a manner that maximize Frequency reuse.

• Advantages : 
• Simple to implement and manage
• Does not require complex equipment or algorithms
• Disadvantages :
• Limited channel utilization as unused channels remain unused.
• Susceptible to interference and congestion.

Dynamic Channel Allocation (DCA): 

Dynamic Channel allocation is a strategy in which channels are not permanently allocated to the cells. When a User makes a call request then Base Station (BS) send that request to the Mobile Station Center (MSC) for the allocation of channels or voice channels. This way the likelihood of blocking calls is reduced. As traffic increases more channels are assigned and vice-versa.

• Advantages :
• Efficient use of available bandwidth.
• Reduces call blocking and improves call quality.
• Allows for dynamic allocation of resources.
• Requires more complex equipment and algorithms.
• May result in call drops or poor quality if resources are not available

Hybrid Channel Allocation (HCA): 

Hybrid Channel Allocation is a combination of both Fixed Channel Allocation (FCA) and Dynamic Channel Allocation (DCA). The total number of channels or voice channels are divided into fixed and dynamic set. When a user make a call then first fixed set of channels are utilized but if all the fixed sets are busy then dynamic sets are used. The main purpose of HCA is to work efficiently under heavy traffic and to maintain a minimum S/I.

•   Provides the benefits of both FCA and DCA.
•   Allows for dynamic allocation of resources while maintaining predictable call quality and reliability.
• Requires more complex equipment and algorithms than FCA.
•  May not provide the same level of efficiency as pure DCA.

Borrowing Channel Allocation (BCA) :

 when a cell experiences high traffic demand and all of its channels are occupied, it can borrow channels from neighboring cells that are not being used at that time. The borrowed channels are assigned to the busy cell and are used to support the additional traffic demand. Once the demand subsides, the borrowed channels are released and returned to their home cell. BCA can be implemented manually or automatically using algorithms or policies but the main disadvantage is that if the borrowed channel is reclaimed by the original cell the call drop may occur.

•  Efficient use of available bandwidth.
•  Reduces call blocking and improves call quality.
• Increases interference between cells.
• Can cause call drops if borrowed channels are reclaimed by the home cell.

Please Login to comment...

Similar reads, improve your coding skills with practice.

What kind of Experience do you want to share?

Assigning Frequencies in GSM Networks

• Conference paper
• Cite this conference paper

• Andreas Eisenblätter 4  

Part of the book series: Operations Research Proceedings 2002 ((ORP,volume 2002))

442 Accesses

1 Citations

Mobile communication is a key technology in today’s information age. Despite the ongoing improvements in equipment design, interference remains a limiting factor for the use of radio communication. The author investigates in his PhD thesis how to largely prevent interference in GSM networks by carefully assigning the available frequencies to the installed base stations. The topic is addressed from two directions: first, new algorithms are presented to compute “good” frequency assignments fast; second, a novel approach, based on semidefinite programming, is employed to provide lower bounds for the amount of unavoidable interference.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

• Available as PDF
• Read on any device
• Instant download
• Own it forever
• Compact, lightweight edition
• Dispatched in 3 to 5 business days
• Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Unable to display preview.  Download preview PDF.

Aardal K.I., van Hoesel S.C.P.M., Koster A.M.C.A., Mannino C., Sassano A. (2001). Models and solution techniques for the frequency assignment problem. ZIB-report 01-40, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Germany. URL http://www.zib.de/PaperWeb/abstracts/ZR-01-40/ /PaperWeb/abstracts/ZR-01-40/.

Google Scholar  

Amaldi E., Capone A., Malucelli F. (2002). Planning UMTS base station locations: Optimization models with power control and algorithms. IEEE Transactions on Wireless Communications,1.

Burer S., Monteiro R.D., Zhang Y. (1999). Interior-point algorithms for semidefinite programming based on a nonlinear programming formulation. Tech. Rep. TR 99-27, Department of Computational and Applied Mathematics, Rice Unviversity.

Correia L.M. (ed.) (2001). COST259: Wireless Flexible Personalized Communications. John Wiley & Sons Ltd.

Eisenblätter A. (2001). Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds. Cuvillier-Verlag.URL ftp://1Iftp.zib.de/pub/zib-publications/books/PhD_eisenblaetter.ps.Z. /pub/zib-publications/books/PhD_eisenblaetter.ps.Z.

Eisenblätter A., Grötschel M., Koster A.M.C.A. (2002). Frequency assignment and ramifications of coloring Discussiones Mathematicae Graph Theory, 22:51–88. URL http://www.zib.de/PaperWeblabstracts/ZR-OO-47/ /PaperWeblabstracts/ZR-OO-47/

Article   Google Scholar  

Eisenblätter A., Grötschel M., Koster A.M.C.A. (2002). Frequenzplanung im Mobilfunk. DMV-Mitteilungen, (1):18-25. URL http://www.zib.de In German.

Eisenblätter A., Koch T., Martin A., Achterberg T., Fügenschuh A., Koster A., Wegel 0., Wessäly R. (2002). Modelling feasible network configurations for UMTS. In Telecommunications Network Design and Management, pp. 1-24. Kluwer Academic Publishers.

FAP web (2000). FAP web-A website about Frequency Assignment Problems. Eisenblätter A., Koster A. URL http://fap.zib.de/.

Helmberg C. (2000). Semidefinite programming for combinatorial optimization. Habilitationsschrift. Technische Universität Berlin, Germany.

Jaumard B., Marcotte 0., Meyer C. (1999). Mathematical models and exact methods for channel assignment in cellular networks. In Sansò B., Soriano P. (eds.) Telecommunications Network Planning chap. 13, pp. 239-255. Kluwer Academic Publishers.

Chapter   Google Scholar  

Koster A.M.C.A. (1999). Frequency Assignment - Models and Algorithms. Ph.D. thesis, Universiteit Maastricht, The Netherlands.

Mathar R., Schmeink M. (2000). Optimal base station positioning and channel assignment for 3G mobile networks by integer programming. Tech. rep., RWTH Aachen, Germany.

MOMENTUM (2001). Models and simulations for network planning and control of UMTS. URL http://momentum.zib.de. European Information Society Technologies (1ST) project, IST-2000-28088.

Murphey R.A., Pardalos P.M., Resende M.G.C. (1999). Frequency assignment problems. In Du D.Z., Pardalos P.M. (eds.), Handbook of Combinatorial Optimization, Kluwer Academic Publishers.

Download references

Author information

Authors and affiliations.

Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB), Takustr. 7, D-14195, Berlin, Germany

Andreas Eisenblätter

You can also search for this author in PubMed   Google Scholar

Editor information

Editors and affiliations.

Institut für Statistik und Operations Research, Universität Graz, Universitätsstraße 15/E3, 8010, Graz, Austria

Ulrike Leopold-Wildburger

Institut für Mathematik, Universität Klagenfurt, 9020, Klagenfurt, Austria

Franz Rendl

Fakultät für Wirtschaftswissenschaften BWL VIII: Management Science, Otto-von-Guericke-Universität Magdeburg, 39016, Postfach 4120, Magdeburg, Germany

Gerhard Wäscher

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper.

Eisenblätter, A. (2003). Assigning Frequencies in GSM Networks. In: Leopold-Wildburger, U., Rendl, F., Wäscher, G. (eds) Operations Research Proceedings 2002. Operations Research Proceedings 2002, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55537-4_5

Download citation

DOI : https://doi.org/10.1007/978-3-642-55537-4_5

Publisher Name : Springer, Berlin, Heidelberg

Print ISBN : 978-3-540-00387-8

Online ISBN : 978-3-642-55537-4

eBook Packages : Springer Book Archive

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

• Publish with us

Policies and ethics

• Find a journal
• Track your research

• Today's news
• Reviews and deals
• Climate change
• 2024 election
• Fall allergies
• Health news
• Mental health
• Sexual health
• Family health
• So mini ways
• Unapologetically
• Buying guides

Entertainment

• How to Watch
• My watchlist
• Stock market
• Biden economy
• Personal finance
• Stocks: most active
• Stocks: gainers
• Stocks: losers
• Trending tickers
• World indices
• US Treasury bonds
• Top mutual funds
• Highest open interest
• Highest implied volatility
• Currency converter
• Basic materials
• Communication services
• Consumer cyclical
• Consumer defensive
• Financial services
• Industrials
• Real estate
• Mutual funds
• Credit cards
• Balance transfer cards
• Cash back cards
• Rewards cards
• Travel cards
• Online checking
• High-yield savings
• Money market
• Home equity loan
• Personal loans
• Student loans
• Options pit
• Fantasy football
• Pro Pick 'Em
• College Pick 'Em
• Fantasy baseball
• Fantasy hockey
• Fantasy basketball
• Download the app
• Daily fantasy
• Scores and schedules
• GameChannel
• World Baseball Classic
• Premier League
• CONCACAF League
• Champions League
• Motorsports
• Horse racing
• Newsletters

New on Yahoo

• Privacy Dashboard

15 men brought to military enlistment office after mass brawl in Moscow Oblast

Local security forces brought 15 men to a military enlistment office after a mass brawl at a warehouse of the Russian Wildberries company in Elektrostal, Moscow Oblast on Feb. 8, Russian Telegram channel Shot reported .

29 people were also taken to police stations. Among the arrested were citizens of Kyrgyzstan.

A mass brawl involving over 100 employees and security personnel broke out at the Wildberries warehouse in Elektrostal on Dec. 8.

Read also: Moscow recruits ‘construction brigades’ from Russian students, Ukraine says

We’re bringing the voice of Ukraine to the world. Support us with a one-time donation, or become a Patron !

Read the original article on The New Voice of Ukraine

Follow Puck Worlds online:

• Follow Puck Worlds on Twitter

Site search

Filed under:

• Kontinental Hockey League

Gagarin Cup Preview: Atlant vs. Salavat Yulaev

Share this story.

• Share this on Facebook
• Share this on Twitter
• Share this on Reddit
• Share All sharing options

Share All sharing options for: Gagarin Cup Preview: Atlant vs. Salavat Yulaev

Gagarin cup (khl) finals:  atlant moscow oblast vs. salavat yulaev ufa.

Much like the Elitserien Finals, we have a bit of an offense vs. defense match-up in this league Final.  While Ufa let their star top line of Alexander Radulov, Patrick Thoresen and Igor Grigorenko loose on the KHL's Western Conference, Mytischi played a more conservative style, relying on veterans such as former NHLers Jan Bulis, Oleg Petrov, and Jaroslav Obsut.  Just reaching the Finals is a testament to Atlant's disciplined style of play, as they had to knock off much more high profile teams from Yaroslavl and St. Petersburg to do so.  But while they did finish 8th in the league in points, they haven't seen the likes of Ufa, who finished 2nd. 

This series will be a challenge for the underdog, because unlike some of the other KHL teams, Ufa's top players are generally younger and in their prime.  Only Proshkin amongst regular blueliners is over 30, with the work being shared by Kirill Koltsov (28), Andrei Kuteikin (26), Miroslav Blatak (28), Maxim Kondratiev (28) and Dmitri Kalinin (30).  Oleg Tverdovsky hasn't played a lot in the playoffs to date.  Up front, while led by a fairly young top line (24-27), Ufa does have a lot of veterans in support roles:  Vyacheslav Kozlov , Viktor Kozlov , Vladimir Antipov, Sergei Zinovyev and Petr Schastlivy are all over 30.  In fact, the names of all their forwards are familiar to international and NHL fans:  Robert Nilsson , Alexander Svitov, Oleg Saprykin and Jakub Klepis round out the group, all former NHL players.

For Atlant, their veteran roster, with only one of their top six D under the age of 30 (and no top forwards under 30, either), this might be their one shot at a championship.  The team has never won either a Russian Superleague title or the Gagarin Cup, and for players like former NHLer Oleg Petrov, this is probably the last shot at the KHL's top prize.  The team got three extra days rest by winning their Conference Final in six games, and they probably needed to use it.  Atlant does have younger regulars on their roster, but they generally only play a few shifts per game, if that. 

The low event style of game for Atlant probably suits them well, but I don't know how they can manage to keep up against Ufa's speed, skill, and depth.  There is no advantage to be seen in goal, with Erik Ersberg and Konstantin Barulin posting almost identical numbers, and even in terms of recent playoff experience Ufa has them beat.  Luckily for Atlant, Ufa isn't that far away from the Moscow region, so travel shouldn't play a major role. 

I'm predicting that Ufa, winners of the last Superleague title back in 2008, will become the second team to win the Gagarin Cup, and will prevail in five games.  They have a seriously well built team that would honestly compete in the NHL.  They represent the potential of the league, while Atlant represents closer to the reality, as a team full of players who played themselves out of the NHL. 

• Atlant @ Ufa, Friday Apr 8 (3:00 PM CET/10:00 PM EST)
• Atlant @ Ufa, Sunday Apr 10 (1:00 PM CET/8:00 AM EST)
• Ufa @ Atlant, Tuesday Apr 12 (5:30 PM CET/12:30 PM EST)
• Ufa @ Atlant, Thursday Apr 14 (5:30 PM CET/12:30 PM EST)

Games 5-7 are as yet unscheduled, but every second day is the KHL standard, so expect Game 5 to be on Saturday, like an early start. 

Loading comments...

635th Anti-Aircraft Missile Regiment

635-й зенитно-ракетный полк

Military Unit: 86646

Activated 1953 in Stepanshchino, Moscow Oblast - initially as the 1945th Anti-Aircraft Artillery Regiment for Special Use and from 1955 as the 635th Anti-Aircraft Missile Regiment for Special Use.

1953 to 1984 equipped with 60 S-25 (SA-1) launchers:

• Launch area: 55 15 43N, 38 32 13E (US designation: Moscow SAM site E14-1)
• Support area: 55 16 50N, 38 32 28E
• Guidance area: 55 16 31N, 38 30 38E

1984 converted to the S-300PT (SA-10) with three independent battalions:

• 1st independent Anti-Aircraft Missile Battalion (Bessonovo, Moscow Oblast) - 55 09 34N, 38 22 26E
• 2nd independent Anti-Aircraft Missile Battalion and HQ (Stepanshchino, Moscow Oblast) - 55 15 31N, 38 32 23E
• 3rd independent Anti-Aircraft Missile Battalion (Shcherbovo, Moscow Oblast) - 55 22 32N, 38 43 33E

Disbanded 1.5.98.

Subordination:

• 1st Special Air Defence Corps , 1953 - 1.6.88
• 86th Air Defence Division , 1.6.88 - 1.10.94
• 86th Air Defence Brigade , 1.10.94 - 1.10.95
• 86th Air Defence Division , 1.10.95 - 1.5.98

• Yekaterinburg
• Novosibirsk
• Vladivostok

• Tours to Russia
• Practicalities
• Russia in Lists

Rusmania • Deep into Russia

Out of the Centre

Savvino-storozhevsky monastery and museum.

Zvenigorod's most famous sight is the Savvino-Storozhevsky Monastery, which was founded in 1398 by the monk Savva from the Troitse-Sergieva Lavra, at the invitation and with the support of Prince Yury Dmitrievich of Zvenigorod. Savva was later canonised as St Sabbas (Savva) of Storozhev. The monastery late flourished under the reign of Tsar Alexis, who chose the monastery as his family church and often went on pilgrimage there and made lots of donations to it. Most of the monastery’s buildings date from this time. The monastery is heavily fortified with thick walls and six towers, the most impressive of which is the Krasny Tower which also serves as the eastern entrance. The monastery was closed in 1918 and only reopened in 1995. In 1998 Patriarch Alexius II took part in a service to return the relics of St Sabbas to the monastery. Today the monastery has the status of a stauropegic monastery, which is second in status to a lavra. In addition to being a working monastery, it also holds the Zvenigorod Historical, Architectural and Art Museum.

Belfry and Neighbouring Churches

Located near the main entrance is the monastery's belfry which is perhaps the calling card of the monastery due to its uniqueness. It was built in the 1650s and the St Sergius of Radonezh’s Church was opened on the middle tier in the mid-17th century, although it was originally dedicated to the Trinity. The belfry's 35-tonne Great Bladgovestny Bell fell in 1941 and was only restored and returned in 2003. Attached to the belfry is a large refectory and the Transfiguration Church, both of which were built on the orders of Tsar Alexis in the 1650s.  

To the left of the belfry is another, smaller, refectory which is attached to the Trinity Gate-Church, which was also constructed in the 1650s on the orders of Tsar Alexis who made it his own family church. The church is elaborately decorated with colourful trims and underneath the archway is a beautiful 19th century fresco.

Nativity of Virgin Mary Cathedral

The Nativity of Virgin Mary Cathedral is the oldest building in the monastery and among the oldest buildings in the Moscow Region. It was built between 1404 and 1405 during the lifetime of St Sabbas and using the funds of Prince Yury of Zvenigorod. The white-stone cathedral is a standard four-pillar design with a single golden dome. After the death of St Sabbas he was interred in the cathedral and a new altar dedicated to him was added.

Under the reign of Tsar Alexis the cathedral was decorated with frescoes by Stepan Ryazanets, some of which remain today. Tsar Alexis also presented the cathedral with a five-tier iconostasis, the top row of icons have been preserved.

Tsaritsa's Chambers

The Nativity of Virgin Mary Cathedral is located between the Tsaritsa's Chambers of the left and the Palace of Tsar Alexis on the right. The Tsaritsa's Chambers were built in the mid-17th century for the wife of Tsar Alexey - Tsaritsa Maria Ilinichna Miloskavskaya. The design of the building is influenced by the ancient Russian architectural style. Is prettier than the Tsar's chambers opposite, being red in colour with elaborately decorated window frames and entrance.

At present the Tsaritsa's Chambers houses the Zvenigorod Historical, Architectural and Art Museum. Among its displays is an accurate recreation of the interior of a noble lady's chambers including furniture, decorations and a decorated tiled oven, and an exhibition on the history of Zvenigorod and the monastery.

Palace of Tsar Alexis

The Palace of Tsar Alexis was built in the 1650s and is now one of the best surviving examples of non-religious architecture of that era. It was built especially for Tsar Alexis who often visited the monastery on religious pilgrimages. Its most striking feature is its pretty row of nine chimney spouts which resemble towers.

Plan your next trip to Russia

Ready-to-book tours.

Your holiday in Russia starts here. Choose and book your tour to Russia.

REQUEST A CUSTOMISED TRIP

Looking for something unique? Create the trip of your dreams with the help of our experts.