Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.

com
Volume 1, Issue 3, September – October 2012 ISSN 2278-6856

Improved Channel Assignment Scheme in

Cellular Mobile Communication
Swati Sonavane1 and Dr. R. R. Sedamkar2
1
University of Mumbai, Thakur College of Engineering & Technology,
Mumbai, India.
2
University of Mumbai, Thakur College of Engineering & Technology,
Mumbai, India.

Abstract: This technique is giving an efficient dynamic resource flexibility is one of the most important
allocation of communications channels which is essential for requirements in third-generation networks.
ensuring good performance of cellular networks. The work in This thesis proposes a distributed channel allocation
this project demonstrates that intelligent agent acting scheme using intelligent software agents for cellular
collaboratively in a multi-agent system is able to increase the
robustness of the cellular network as a whole, to distribute the
mobile networks. The main reason for using intelligent
knowledge and to allow negotiation of radio resources. software agents is to give greater autonomy to the base
The performance of the Distributed Fixed Channel Allocation stations; this autonomy allows
& Dynamic Channel Allocation schemes are compared and
the we found that the average call dropping probability of decrease in centralized information.
FCA scheme is 96% to 98% and the average call dropping Agent technology is an interdisciplinary area of research
probability of DCA is 26% to 28% in different conditions, so
that has received special
the Distributed Dynamic Channel Allocation scheme is
efficient than the FCA scheme. 1990s. The
Keywords: Efficiency, Intelligent Agent, Mobile definition of an agent is controversial, but in general
communication, Resource flexibility, Traffic Profiles. terms an agent can be described as a hardware or software
system with social ability that performs tasks with specific
1. INTRODUCTION aims in a complex and dynamic environment. Agents are
capable of autonomous
Techniques for increasing the efficiency of channel usage
in mobile networks are essential in order to handle the
unexpected events.
complexity of third generation mobile communications.
This thesis applies agents to the problem of mobile
Previous work on analogue and second generation mobile
resource allocation in such a way that they do not work in
communications has led to several algorithms being
isolation, but as a community. A community of agents is a
proposed to maximize the channel usage and minimize
multi-agent system, such a system being defined as a
the call blocking probability. Some channel assignment
group of agents with specific roles in an organisational
schemes presented in the literature [1]-[7] have improved
structure. The agents interact with the environment and
the performance of the basic fixed channel assignment
with each other in a co-ordinate way, as collaborators or
strategy for different traffic densities (macro/micro/pico
competitors, seeking to fulfill the local or global aims of the
cellular networks) over different traffic load conditions.
organization.
However, most of the solutions proposed have an entirely
reactive approach: the response to a series of events
follows an algorithm that is prepared to react to specific
situations. This limits their efficiency. Even those
A multi-agent system is able to provide this flexibility and
schemes that contain adaptive features are not ideal.
also is able to increase the robustness of the network by
Some schemes are completely centralized (which is
allowing negotiation when conflicts occur. This project
impractical for real implementation because of
describes the framework we are adopting to verify the
computational complexity making them too slow, or
feasibility of multi-agent systems in controlling resource
because the network would become overloaded with
assignment in mobile networks. Our agent architecture is
signaling messages) or are distributed, but restricted to
hierarchical, with a reactive part and a deliberative part.
individual base stations which again limits their
The reactive part is the lowest layer, ensuring fast
efficiency.
response to the needs of the cells in terms of channel
In order to accommodate multiple networks and services
allocation. The deliberative part is concerned with
with multiple bit rates within a limited frequency band,
optimization of the allocation of channels among cells
Volume 1, Issue 3, September – October 2012 Page 186
 Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 1, Issue 3, September – October 2012
and consists of two layers: one to meet the local goals of
the individual base stations and another (the co-operative
layer) for load balancing in the network.
We are assuming a macro-cellular scenario where base
stations are not able to share information by interference
measurements, but only by explicit exchange of
information, and the resources are complete frequency
carriers. Although the results in this paper are based on
an AMPS [8] model, the concept is completely generic
and the work could be extended to TDMA/CDMA.
Different cell structures (such as microcellular or
hierarchical) could also be included.
2. MOBILE NETWORK
The first generation of mobile communication started in
1974; the Federal Communication Commission (FCC)
allocated a 40 MHz band in the 800 to 900 MHz
frequency range for cellular communications. The
Advanced Mobile Phone Systems (AMPS) standard was
introduced in 1979 and adopted by the FCC [4]. Licenses
were issued in the market in 1982. An additional 10 MHz
band was allocated in 1988 and called Expanded
Spectrum (ES). The licenses were divided into bands:
Band A and band B. Cellular communication is full-
duplex and the frequency band is divided between both
communication paths: 25 MHz is allocated to the forward
path, which is the path from the base station transmitter
towards the mobile terminal receiver. The other half is for
the reverse path in the opposite direction. The paths are
separated by a 45 MHz guard band in order to avoid
interference between the transmission and reception
channels.
Bands A and B each occupy 12.5 MHz: 10 MHz is Non-
Expanded Spectrum (NES) and 2.5 MHz is ES. The 12.5
MHz bands are divided into 30 kHz channels, making a
total of 416 channels per band. Twenty-one of these
channels are used for specific procedure like channel
assignment, paging, messaging, etc. they are called
control channels. The remaining channels are used for
conversation and called voice channels. In AMPS, each
frequency channel corresponds to a frequency carrier and
only one mobile can be assigned per channel. Therefore,
AMPS is solely Frequency Division Multiple Access
(FDMA) and is an analogue cellular system.
Figure 1 Cellular Band Allocation
The second generation of mobile communications, i.e. the
digital cellular systems, emerged in the 1990’s. In North
Volume 1, Issue 3, September – October 2012
ISSN 2278-6856
America, additional standards were introduced for digital
cellular systems using the same frequency spectrum as
AMPS. These standards integrated other multiple access
techniques in addition to FDMA.
The IS-54 standard, known as North American TDMA
(NA-TDMA) or Digital AMPS (D-AMPS), has integrated
the Time Division Multiple Access (TDMA) technique,
where each frequency carrier is shared using time
division by up to 6 mobile users (currently 3 mobile
users).
In 1994, the IS-95 standard introduced the Code Division
Multiple Access (CDMA) technique. It is based on the
spread-spectrum modulation in which multiple users have
access to the same band. Each mobile user is assigned a
unique orthogonal code called a Walsh code. The 12.5
MHz of a band is divided in 10 CDMA bands of 1.25
MHz Each CDMA band supports 64 Walsh codes.
CDMA can offer about eight times the capacity of
analogue [8].
The drastic growth in the use of mobile communications
by public and business sectors increased the pressure to
integrate fixed and mobile networks. Now, mobile
networks are expected to have the same diversity of
services offered by fixed networks with the same quality
of service and security. Also, full mobility capability is
expected. The mobile system needs to have the flexibility
to integrate world-wide the different types of mobile
communication systems available today, such as public
and private cellular systems, data radio and satellite
systems. These demands are beyond the technological
capabilities of the second generation of mobile
communications. These pressures and developments in
component technology, network management and service
engineering made inevitable the emergence of a third
generation of mobile communications. The aim of third
generation systems is to provide communication services
from any person to any person at any place and at any
time through any medium using a compact light-weight
terminal with guaranteed quality of service and security.
Frequency management in mobile networks has been a
hot topic for research in the past 20 years and the
solutions proposed still present a lack of intelligence and
flexible behaviour. The technological advances made in
software and hardware in the last decade is providing the
means to introduce intelligence in control and
management of networks. The introduction of more
intelligence and flexible behaviour in the management of
channel allocation is the objective of this work.
3. The Cellular Concept
The cellular concept, conceived by Bell Systems under the
AMPS standard in 1979[9], is a mobile network
architecture composed ideally of hexagonal cells. The
cells represent geographic areas. Inside the cells, the
users, called mobile telephone switching office (MTSO)
Page 187
 Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 1, Issue 3, September – October 2012
responsible for controlling the calls and acting as a
gateway to other networks. When an active user (i.e. a
mobile station using a frequency channel) reaches the
boundary of the cell, it needs to change its current
frequency channel for another belonging to the
neighbouring cell. This network procedure is known as
handoff or handover. Hand over can be either soft
handover or hard handover.
Figure 2 Handoff between MS and BS
The main objectives of AMPS for supplying a large-scale
mobile-telephone service were [9]:
Large subscriber capacity
Efficiency use of spectrum
Nationwide compatibility
Widespread availability
Adaptability to traffic density
Service to vehicles and portables
Regular telephone services and special services
Quality of service in telephony
Affordability
Figure 3 Cellular Band Allocation
The essential features of the cellular system that made
possible the achievement of the above objectives were
frequency reuse and cell splitting.
Frequency reuse refers to the use of the same frequency
carrier in different areas that are distant enough so that the
interference caused by the use of the same carrier is not a
problem. The reason for the application of frequency reuse is
twofold:
To reduce the cost of the land transmitter/receiver site by
placing several moderate
network operator.
Volume 1, Issue 3, September – October 2012
ISSN 2278-6856
To greatly increase the number of simultaneous calls
that can be covered by the same number of allocated
channel frequencies.
Cell splitting is the reconfiguration of a cell into smaller
cells. This feature makes it possible for the same network to
service different densities of demand for channels. Larger
cells can serve low demand areas and smaller cells high
demand areas. Cell splitting is a long-term configuration
planning that allows the system to adjust to a
increase in the spectrum allocation.
Frequency Reuse the distribution of the frequency
channels in a cellular network is dependent on several
parameters, such as cellular geometry, signal propagation
characteristics and signal interference [10].
The assignment of frequency channels in the cellular
concept is fixed, i.e. a set of frequency channels is
statically allocated to a cell. This same set is reused in
another
cell distant enough to allow the use of the frequency
channels with acceptable signal interference. Cells that
use the same set of frequency channels are called co-
channel
cells and the distance between them is called co-channel
reuse distance. The total number of frequency carriers
allocated to a network operator is divided in sets and
pattern. The pattern is
reused according to the co-channel reuse distance. The
choice
considerations. A better
understanding about signal propagation and cellular
geometry is needed in order to understand how frequency
assignment is performed in a mobile cellular system (e.g.
AMPS).
One main issue in cellular system design reduces to one
of economics. Essentially we have a limited resource
transmission spectrum that must be shared by several
users. Unlike wired communications which benefits from
isolation provided by cables, wireless users within close
proximity of one another can cause significant
interference? To address this issue, the concept of cellular
communications was introduced around in 1968 by
researchers at AT&T Bell Labs. The basic concept being
that a given geography is divided into polygons called
cells.
Each cell is allocated a portion of the total frequency
spectrum. As users move into a given cell, they are then
permitted to utilize the channel allocated to that cell. The
virtue of the cellular system is that different cells can use
the same channel given that the cells are separated by a
minimum distance according to the system propagation
characteristics; otherwise, intercellular or co channel
interference occurs. The minimum distance necessary to
Page 188
 Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 1, Issue 3, September – October 2012
reduce co channel interference is called the reuse
distance. The reuse distance is defined as the ratio of the
distance, D, between cells that can use the same channel
without causing interference and the cell radius, R. Note
that R is the distance from the centre of a cell to the
outermost point of the cell in cases when the cells are not
circular.
4. CHANNEL ALLOCATION SCHEME
Channel allocation deals with the allocation of channels
to cells in a cellular network. Once the channels are
allocated, cells may then allow users within the cell to
communicate via the available channels. Channels in a
wireless communication system typically consist of time
slots, frequency bands and/or CDMA pseudo noise
sequences, but in an abstract sense, they can represent any
generic transmission resource. There are three major
categories for assigning these channels to cells (or base-
stations). They are
Fixed Channel Allocation Scheme,
Dynamic Channel Allocation Scheme and
Hybrid Channel Allocation Scheme which is a
combination of the first two methods.
Fixed Channel Allocation Scheme
Figure 4 Reuse of Channel
The frequency channel assignment in the cellular concept is
static, i.e. after careful frequency planning, channels are
assigned to cell sites and these sets will not change
except for a new long-term reconfiguration. Cell sites will
only make use of the assigned channel set or individual
assigned channel sets per sector. This frequency channel
assignment strategy is known as fixed channel
assignment (FCA). After the cellular system has been
configured, the fixed channel assignment is simple to use.
However, it does constrain channel utilisation. If the
traffic demand in a cell is greater than the number of
nominal channels, (i.e. the frequency channels assigned
to that cell) all the excess demand is blocked, regardless
of the traffic conditions in other cells. This constraint is
very limiting for mobile networks and several strategies
have
probability.
borrowing (with or without channel locking).
Volume 1, Issue 3, September – October 2012
ISSN 2278-6856
transmission from the neighbouring cell almost as well as
that in their own. When there is a call attempt and no
more available channels [11] or when the channel
occupancy reaches a pre-defined threshold, the MSC may
advise some mobile users of the cell to check the
transmission quality of channels in neighbouring cells.
neighbouring cell, a handoff
request will be made to that cell and the mobile moved,
mobile user. In this way,
the congested cell can have some of its nominal channels
freed and use them in the new call requests. This load
sharing strategy is also known as directed retry.
Schemes using a channel borrowing strategy differ from the
original FCA concept by allowing a cell to use some of the
channels of other channel sets apart from its
own. The channel borrowing is performed when there are
no more nominal channels to serve call requests (new
calls or handoffs) or when the channel occupancy reaches
a pre-defined threshold. Borrowed channels normally
belong to other sectors of the cell, neighbouring cells and in
some cases from the cells of the compact pattern which
are not neighbours of the borrowing cell site.
Channel borrowing with channel locking strategy
borrows a channel from an adjacent cell, but prevents
(totally or partially)the use of the borrowed channel in the
co-channel cells of the lender that are near to the
borrower, taking into account the co-channel interference
constraints. Channel locking reduces the traffic capability
of the network. To overcome this penalty, the schemes
have also adopted channel reassignment strategies.
Channel reassignment is an intra cellular handoff, i.e. a
mobile user is asked to change its current frequency
channel for another one under
the control of the same base station. The channel
reassignment is performed in such a
Channel borrowing without locking (CBWL) [12]
strategy proposes the use of a channel of a neighbouring
cell. However, the borrowed channel is used with
reduced transmission power to avoid interference with the
co-channel cells of the lender that are near the borrower
(inside the co-channel reuse distance).Fixed Channel
Allocation (FCA) systems allocate specific channels to
specific cells. This allocation is static and cannot be
changed. For efficient operation, FCA systems typically
allocate channels in a manner that maximizes frequency
reuse. Thus, in a FCA system, the distance between cells
using the same channel is the minimum reuse distance for
that system. The problem with FCA systems is quite
simple and occurs whenever the offered traffic to a
network of base stations is not uniform. Consider a case
Page 189
 Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 1, Issue 3, September – October 2012
in which two adjacent cells are allocated N channels each.
There clearly can be situations in which one cell has a
need for N+k channels while the adjacent cell only
requires N-m channels (for positive integer’s k and m). In
such a case, k users in the first cell would be blocked from
making calls while m channels in the second cell would
go unused. Clearly in this situation of non-uniform spatial
offered traffic, the available channels are not being used
efficiently. FCA has been implemented on a widespread
level to date.
Dynamic Channel Allocation Scheme
assignment of
frequency channels to the cells of the cellular network.
All frequency
station, the MSC
chooses the appropriate frequency channel that gives
maximum channel efficiency taking into account all the
signal interference constraints. The channels are assigned
for the duration of a call; after the call has finished, the
channel is returned to the central pool or reallocated to a
mobile user inside the same cell site that was controlling
the channel before.
Dynamic Channel Allocation (DCA) attempts to alleviate
the problem mentioned for FCA systems when offered
traffic is non-uniform. In DCA systems, no set
relationship exists between channels and cells. Instead,
channels are part of a pool of resources. Whenever a
channel is needed by a cell, the channel is allocated under
the constraint that frequency reuse requirements cannot
be violated. There are two problems that typically occur
with DCA based systems.
First, DCA methods typically have a degree of
randomness associated with them and this leads to the
fact that frequency reuse is often not maximized unlike
the case for FCA systems in which cells using the same
channel are separated by the minimum reuse distance.
Secondly, DCA methods often involve complex
algorithms for deciding which available channel is most
efficient. These algorithms can be very computationally
intensive and may require large computing resources in
order to be real-time.
Hybrid Channel Allocation
The third category of channel allocation methods includes
all systems that are hybrids of fixed and dynamic channel
allocation systems. Several methods have been presented
that fall within this category and in addition, a great deal
of comparison has been made with corresponding
simulations and analyses [1]-[2].
5. INTELLIGENT AGENT
Agent based technology is an interdisciplinary area of
research and it has received special attention from the
research community since the beginning of the 1990’s. The
definition of an agent is controversial, but in general terms,
Volume 1, Issue 3, September – October 2012
ISSN 2278-6856
an agent can be described as a hardware or software system
with social ability that performs tasks with specific
aims in a complex and dynamic environment. Agents are
capable of autonomous actions to pursue their objectives,
despite the occurrence of expected or limited unexpected
events. This thesis interests in the application of
intelligent co-operative software agents.
The characteristics of software agents have inherited
aspects from distributed computing, such as; modularity,
speed (parallelism) and reliability (redundancy), and
from Artificial Intelligence (AI) in the knowledge
level; easier maintenance, reusability and platform
independence.
Agents can present different degrees of complexity,
normally known as granularity. Simple agents with little
or no intelligence regarding their behaviour are called
reactive agents. More complex agents such as those
possessing symbolic internal models, capable of knowing
their environment and able to reason about their goals are
called cognitive or deliberative agents. As the complexity
of agents can be so broad, it is difficult to find the
boundary between an agent and other types of control
software. However, agents do present special properties
that distinguish them from other software systems. The
main properties that software agents exhibit are autonomy,
social ability and reactivity.
Autonomy is the ability to have control over its own actions
and states. An agent is able to make decisions and
complete actions based on its internal representation of
the world without direct intervention of a human or a
central entity.
homogeneous or heterogeneous
software agents) via some kind of communication
language in a co-ordinate manner. Agents may co-operate
in order to solve a problem or to achieve a task. The terms
and conditions of the co-operation may be negotiated at
runtime.
Reactivity is the ability to perceive changes in the
environment and react timely and appropriately.
Software agents may also present other properties such as
pro-activity, learning, adaptability or mobility.
Pro-activity is the ability to plan ahead and take the
initiative to perform actions that will contribute to the
goal achievement without waiting for external
instructions or only responding to events in the environment.
actions as the agent reacts with
the environment and/or with other agents, in order to
avoid past mistakes or increase performance over time.
Adaptability is the ability to adapt to changes in the
environment, in order to continue to pursue its objectives.
Learning is one of the factors that allow agents to have an
adaptive behaviour.
Mobility is the ability to move around a network.
Page 190
 Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 1, Issue 3, September – October 2012
Figure 5 Agent Types Based In Their Predominant
Features.
A different approach to defining agents by classifying
them uses different criteria: mobility, granularity,
predominant attributes and roles. In the first two criteria,
the agents can be mobile or static and deliberative or
reactive. Cooperation, autonomy and learning are the
three basic attributes of agents and from them three types
of agents can be identified: collaborative agents, interface
agents and smart agents, as can be seen in Figure 4.1.1.
Each type giving more emphasis to
attributes equally, but the applicability of the agent
to certain problem will dictate which type of agent is more
suitable for each case.
The last criterion to classify agents is by their roles, for
example, World Wide Web
Web
Crawlers, Lycos and Spiders.
Of course, the total classification of an agent would be a
combination of these criteria. For example, an agent
could be a mobile deliberative information agent or a
deliberative part inside a single agent. These agents
would be classified as hybrid agents.
6. PROBLEM DEFINITION
Fixed channel assignment (FCA) is too limiting for
mobile networks and several strategies have been
proposed to maximize frequency channel allocation and
minimize call blocking probability. A detailed survey
describing dynamic channel assignment (DCA) schemes
and FCA-based schemes, including those with channel
borrowing is given in [7]. In that paper it is noted that
there is a trade-off between the implementation
complexity of the channel allocation algorithms and
spectrum utilization efficiency. DCA schemes perform
better under low traffic intensity; modified FCA schemes
have superior performance in high traffic loads. DCA
schemes use channels more efficiently and for the same
blocking rate have a lower forced call termination than
Volume 1, Issue 3, September – October 2012
ISSN 2278-6856
FCA-based schemes. However, the near-optimum channel
allocation is at the expense of high overheads through its
use of centralized allocation schemes. This overhead
means that such schemes are not practicable for large
networks.
Distributed DCA schemes with limited inter-cell
communication suffer less overhead, but lead to sub-
optimum allocations. Such schemes are being proposed
for microcellular systems as this cell structure allows
inter-cell information sharing by interference
measurements and passive non-intrusive monitoring at
each base station (busy/idle status of the carriers). For
macro cellular systems, where explicit communication is
needed, FCA with channel borrowing offers good results
and less computational complexity than DCA. However,
those FCA schemes with the best results used centralized
control inside the Mobile Switching Centre (MSC).
Although that is less complex than DCA schemes, there
is still a need to maintain an up-to-date global knowledge
of the entire mobile network, leading to a slow response
and a heavy signaling load. To alleviate this problem,
several authors have proposed modifications to make the
schemes more distributed. One example is the distributed
load balancing with selective borrowing scheme (D-
LBSB) [6] that performs better than its centralized
version [5] and also outperforms other existing schemes
like direct retry [3] and CBWL [4]. The D-LBSB scheme
is a distributed FCA algorithm with selective borrowing,
channel locking and channel reassignment. It takes into
consideration the position of the mobile users when
borrowing and reassigning channels; it triggers the
execution of the algorithm when the usage of the nominal
channels in a cell reaches a pre-determined threshold (h,
when a previously cold cell becomes hot). It also controls
the number of the channels to be borrowed from or lent to
a cell according to the traffic load of the whole cellular
network. We selected this algorithm as the basic
comparison for our work.
7. ARCHITECTURE DESIGN
There are 49 cells and each cell has 10 nominal channels.
The compact pattern is a 7-cell cluster with the reuse
distance being three cell units. Mobile users have their
own trajectories inside the mobile network. Call
establishments and handoff requests are simulated as they
are requested in AMPS systems. For each cell, a Poisson
distribution is used to generate calls, which have an
exponentially distributed duration with a mean of three
minutes. Each call attempt is performed by an idle mobile
inside the cell, chosen randomly. This is a more detailed
simulation than those presented in the literature, which
make broader assumptions. These differences need to be
taken into account when comparing results. A distributed
borrowing algorithm based on D-LBSB was implemented
Page 191
 Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 1, Issue 3, September – October 2012 ISSN 2278-6856

generally following the descriptions in [5], [6]. The

distribution elements of the system were located in the
base stations, the messages between base stations passing
through the MSC. We used a value of 0.2 for the cold/hot
threshold (h). Unlike the original algorithm where the
departing region (r) varies with the number of channels to
be borrowed and the average density of mobile users in
the cell, we chose r to be constant and dependent on
signal strength. Some necessary parameters for
implementation have not been described fully in the
references so that while our algorithm generally follows
that of D-LBSB it is not exactly the same. We refer to our
scheme as the distributed borrowing algorithm (BA). To Figure 8 Total Loads on Network
analyze the performance of the scheme, we chose the
system layout with non-uniform traffic distributions. The
number in the bottom of each cell is the cell
identification; the number in the middle gives the Poisson
arrival rates in calls/hour (ranging from 20 to
200calls/hour). Simulation result 1 shows the blocking
rate of our BA compared with the FCA as the traffic rates
increase over the load. Overall, BA outperforms FCA
from moderate to heavy load; the maximum improvement
achieved in this case is a reduction in call blocking
probability by around 20%. However, individual cells
with higher traffic rates present a better improvement.
Figure 9 Percentage of Call Drop for FCA

Figure 6 Seven-Cell Clusters with Frequency Reuse Plan

& Hexagonal Model

8. SIMULATION RESULTS
Figure 10 Percentage of Call Drop for DCA

Figure 7 Inputs given for simulation
Volume 1, Issue 3, September – October 2012
9. CONCLUSION
The cellular network implemented has nineteen cells, ten
nominal frequency channels per cell in a 7-cell cluster.
The network is a macro cellular structure. In each cell a
source call generator process generates the call requests
and randomly chooses an idle mobile station located
inside the cell to place the call. The pdf for the call inter-
arrival time and its mean value are changeable simulation
parameters. In the scenarios simulated in this work, a
negative exponential distribution was selected for call
inter-arrival time with different mean values depending
on the desired traffic load in the cell. The call length
distribution is also a simulation parameter. Constant and
exponential call length distributions were used in the
Page 192
 Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 1, Issue 3, September – October 2012 ISSN 2278-6856

simulations. Communications Magazine, vol. 3, no. 3, pp. 10-31,

The performance of Distributed DCA scheme of a cellular June 1996.
network using the multi-agent system was compared with [8]
the distributed FCA scheme. The simulation results Systems Implementation.
demonstrated that the use of intelligent software agents Prentice Hall Communication Engineering and
brought more flexibility than the other approaches and Emerging Technologies. Series Editor - Theodore S.
the distributed DCA scheme is more efficient than the Rapp port. Prentice Hall PTR. 2000
other schemes of FCA. [9] V. H. MacDonald, “Advanced mobile phone
services: the cellular concept,” Bell Systems
The performances of the Distributed FCA & DCA
Technology Journal, vol. 58, no. 1, pp. 15-41,
schemes are compared and the results are given in table
January 1979.
1. [10] William C. Y. Lee. Mobile Cellular
Table 1 Performance of the Distributed FCA & DCA Telecommunications: Analog and Digital Systems.
Schemes Second Edition. McGraw-Hill, Inc. ISBN 0-07-
Ch. Allocation Call Drop Rate Status 038089-9. 1995.
Scheme (%) [11] E. L. Bodanese and L. Cuthbert, “Distributed
FCA 96% To 98% High channel allocation scheme for cellular networks
DCA 26% To 28% Low using intelligent agents,” 7th International
Conference in Telecommunication Systems, pp. 156-
Overall, the distributed DCA scheme using multi-agent 165, Nashville TN, USA, March 18-21 1999.
system proved to be efficient and feasible. [12] R. G. Smith, “The contract net protocol: high-level
communication and control in a distributed problem
solver,” In Readings in Distributed Artificial
REFERENCES Intelligence. Morgan Kaufman Publishers, Bond, A.
[1] S. M. Elnoubi , R. Singh and S. C. Gupta, “A new and Gasser, L. editors, 1988.
frequency channel assignment algorithm in high
capacity mobile communication systems,” IEEE
Transactions on Vehicular Technology, vol. 31, no.
3, pp. 125-131, August 1982.
[2] M. Zhang and T.-S. P. Yum, “Comparisons of
channel assignment strategies in cellular mobile
telephone systems,” IEEE Transactions on
Vehicular Technology, vol. 38, no. 4, pp. 211-215,
November 1989.
[3] J. Karlsson and B. Eklundh, “A cellular mobile
telephone system with load sharing - an
enhancement of directed retry,” IEEE Transactions
on Communications, vol. 37, no. 5, pp. 530-535.
[4] H. Jiang and S. S. Rapp aport, “CBWL: A new
channel assignment and sharing method for cellular
communication systems,” IEEE Transactions on
Vehicular Technology, vol. 43, no. 2, pp. 313-322,
May 1994.
[5] S. K. Das and S. K. Sen and R. Jayaram, “A
dynamic load balancing strategy for channel
assignment using selective borrowing in cellular
mobile environment,” Wireless Networks, vol. 3, pp.
333-347, 1997.
[6] S. K. Das and S. K. Sen, R. Jayaram and P.
Agrawal, “A distributed load balancing algorithm
for the hot cell problem in cellular mobile
networks,” Proceedings of the 1997 6th IEEE
International Symposium on High Performance
Distributed Computing, pp. 254-263, Portland,
USA, August 5-8 1997.
[7] I.Katzela and M. Naghshineh, “Channel assignment
schemes for cellular mobile telecommunication
systems: a comprehensive survey,” IEEE Personal

Volume 1, Issue 3, September – October 2012 Page 193