2009 IEEE International Advance Computing Conference (IACC 2009)
Patiala, India, 6–7 March 2009
An Autonomous Learning Protocol for Optimal
Performance in
Wireless Ad Hoc Networks
Authors
1
N.Karthick N. Kalyana Sundaram2
III B.E/CSE Dept. of CSE,
.
Valliammai Engineering College SRM University
b.d.best.4ever@gmail.com kalyansundar1983@yahoo.com
Abstract:
In most of the broadcast systems, the main problem exist is
smart subscriber allocation. A broad range of fixed
assignment, demand assignment and random access protocols
have been proposed so far, as solutions to this problem. In
broadcast communication systems with bursty traffic
conditions, the station which is granted permission to utilize
the channel is identified by an autonomous learning protocol
which provides fair bandwidth allocation for all the stations.
This protocol uses a probabilistic approach to identify which
station is ready to use the channel with minimum delay and
maximum utilization of the channel. The entire frequency
range is divided into slots and utilized effectively using proper
scheduling algorithm. The number of idle slots is minimized.
This protocol is compared with the existing learning automata
based protocol and proved considerably performs well.
Index terms: autonomous learning protocol, broadcast
communication system, bursty traffic, fair bandwidth allocation.
I. INTRODUCTION
Aim of autonomous learning protocol:
The aim of our system is to be able to efficiently work
in wireless environments with the known history about the
stations. In such a case our systems need to possess the
ability to acquire knowledge regarding the behavior of each
station.
The autonomous learning protocol improves its
performance by interacting with the medium in which it
operates [1]. A fair bandwidth allocation is made according
to the number of idle slots in the medium based on a priori
information as our protocol learnt and act autonomously.
Wireless communication brings fundamental
challenges to data networking and telecommunications, and
makes integrated networks a reality. Wireless Networks
focuses on networking and user aspects. Network
architecture for personal communications systems, wireless
LANs, radio, tactical and other wireless networks, and
design and analysis of protocols are addressed on a regular
basis.
A wireless network utilizes spread spectrum
technology based on radio waves to enable communication
between devices in a limited area, also known as the basic
service set.
This gives users the mobility to move around within a broad
coverage area and still be connected to the network.
1348
Mrs. B. Amutha3
Research Scholar/CSE
SRM University
amudha@cse.srmuniv.ac.in
As the subscribers of a mobile network face lot of
problems due to heavy traffic in the network and connection
disconnect during hand off periods, we propose this
technology which will become more useful especially with
the rapid emergence of small portable devices such as PDAs
(personal digital assistants) and wireless sensor networks.
The paper is organized as follows. Section II defines
the objectives and Section III describes the system
architecture. Section IV describes the fair bandwidth
allocation algorithm. Section V is the conclusion and
performance analysis.
II. OBJECTIVES
In order to qualify as a spread spectrum signal, the
following criteria must be met:
The transmitted signal bandwidth is greater than the
minimal information bandwidth needed to successfully
transmit the signal.
Some function other than the information itself if being
employed to determine the resultant transmitted bandwidth.
The stations which want to access the medium should be
categorized according to the availability of free slots.
Requirements:
High performance irrespective of bursty traffic.
A fair bandwidth allocation scheme according to
the needs of the station.
Distributed operation among the stations.
A simple Fault-tolerant scheme.
High throughput and low latency
No connection disconnect during hand off.
2.1.1 Transmission slots:
1. Successful slots (True):
This is a slot perceived by a station, when it is
transforming from idle state to processing state.
Successful slots (False):
This is a slot not perceived by a station, since it lies in
out of courage area.
2. Collision slot (True):
This is a slot when more than one station are accessing
the medium.
Collision slot (False):
This is a slot, when one station is accessing the medium;
other station tries to access the medium.
3. Failure slot (True):
This is a slot, when no station is able to access the
medium due to poor power capturing phenomena.
 Failure slot (False):
This is a slot, when one station accesses the medium
without proper transmission characteristics.
2.1.2 Autonomous learning (Station selection):
Algorithm: 1
Polling the medium periodically.
Divide the spectrum equally according to the
number of channels.
Get the feedback report from the stations.
Sort the stations according to the usage criteria.
Apply the protocol to pick the station with
highest probability.
Compare the probable station with the free slots.
If the station probability <= free slots allow
station with fair bandwidth.
Check for the next probable station.
Repeat the procedure and sort the stations.
according to the available bandwidth and free
slots.
Allocate each station with required bandwidth
2.1.3 Autonomous Learning (Bandwidth Allocation):
Algorithm: 2
Divide the spectrum in equal slots.
Divide the slots into one of the stations.
Allow stations to access slots.
If slot time is less, add additional slots, else wait
for the station to finish its slot and quit the slot.
Add the remaining slot time to the next slot.
Repeat the procedure.
III. SYSTEM ARCHITECTURE
The system architecture has been divided into the
following sections:
3.1 Base Station controllers
3.2 Subscribers Allocation scheme
3.3 Channel section according to subscriber
3.4 Fair Bandwidth Allocation Scheme
3.5 Data Call forwarding
3.6 Audio call forwarding
3.7 Call block/ Call drop
Base station:
Base stations can be local controlled or remote
controlled. Local controlled base stations are operated by
front panel controls on the base station cabinet. Remote
control base stations can be operated over tone or DC-
private line telephone circuits or radio links.
3.1) Base Station Controller:
The part of the wireless system's infrastructure that
controls one or multiple cell sites’ radio signals. Thus it
reduces the load on the switch. It performs radio signal
management functions for base transceiver stations,
managing functions such as frequency assignment and
handoff.
2009 IEEE International Advance Computing Conference (IACC 2009)
3.2 ) Subscribers Allocation Scheme:
By acquiring the statistical mobility patterns of cellular
subscribers and applying the knowledge to allocate
resources, handover failures can be minimized. In each
cellular area, typically a metropolitan area, a centralized or
distributed database containing the mobility profiles of
subscribers of the mobile network is created and maintained.
This can be accomplished by creating, for each subscriber
ID (e.g., mobile phone number and electronic serial
number), records having information including cells
traversed, time-of-day, day-of-week, etc.
The wireless resources required for the subscriber can be
dynamically allocated using one of the subscriber's profiles.
The resource allocation service scheme can be implemented
for a subset of users or all users. Once a subscriber turns on
their mobile unit, a user profile is created which
continuously tracks the subscriber along a route travel.
When the mobile communications system anticipates that
the mobile unit will be reaching the end of a geographic or
cell service area, the system dynamically allocates channel
resources for an ongoing call in the next cell so that the call
will continue uninterrupted. This process continues as the
subscriber moves from cell to cell until the call terminates.
It is to be understood that a base station may be assigned to
a cell or a sector.
List of mobile
Stations + List of subscribers
Controller
Subscriber Autonomous
Allocation Learning
Scheme protocol
Selected for fair
bandwidth allocation
Data Voice
Voice or
Data call
Data Audio
Call
Call
Fig.1: Subscriber Allocation
If the subscriber's mobile unit is not a targeted unit, then
normal call processing functions take place whenever the
subscriber initiates or receives a call. If the mobile unit is a
targeted unit, then the MSC (Mobile Station Controller)
determines whether other predefined conditions are satisfied
which indicate whether the resource allocation service is
appropriate to use.
The cellular handset may be adapted to allow the
1349
 subscriber to save a few typical travel routes which activate stations slots
reqd.
the service. Illustratively, the subscriber, responsive to a
prompt on the handset pad, may select a route which 1 2 3 2 5 5 3 20
corresponds to a route to or from the user's home to a
particular place. In this instance, a signal is passed to the 2 3 4 4 4 4 4 23
mobile network informing the network of the route to be 3 4 5 5 3 2 5 24
traveled, at which time the mobile network implements
further processing as necessary. Alternatively, the user may 4 5 4 4 2 2 2 19
create profiles which are stored in the network and which
5 5 3 3 1 1 1 14
can be subsequently activated when needed.
3.3) Channel Selection according to subscriber: 6 5 2 2 5 5 5 24
In order to provide multiple services to a subscriber
from a telephone central office, receiving and transmitting 7 3 1 1 5 5 4 19
cables, preferably each being a single fiber optic strand, are 8 4 2 2 2 2 3 15
coupled between the subscriber and the central office.
Multiple signals, such as telephone signals, television 9 3 2 1 3 2 1 12
signals, digital data, and FM radio signals are multiplexed
10 5 4 4 1 1 1 16
onto the receiving cable. These signals are demultiplexed at
the subscriber station to allow individual utilization of the The dynamic fair bandwidth allocation scheme
services by the subscriber. analyzes the maximum number of time slots utilized by the
3.4 ) Fair bandwidth allocation scheme: mobile stations and make a fair and dynamic bandwidth
This scheme focuses on how to allocate the bandwidth allocation scheme to all requesting mobile stations.
fairly for new calls and handoff calls in multimedia cellular Here optimal performance is not taken into
networks. A new bandwidth allocation scheme based on consideration. Consider that all mobile stations should
guard policy is introduced as a test scheme. Accordingly, require equal number of time slots. To make optimal
new calls are blocked if the amount of occupied bandwidth performance, two factors must be analyzed.
is greater than a predefined bandwidth threshold. 1) Utilization factor
To make a flexible management of bandwidth in a fair 2) Network feedback information.
way, the wireless base station must know the needs of the Equal slot allotment to all mobile stations.
mobile stations it is communicating with. The bandwidth No. of t=1 t=2 t=3 t=4 t=5 Total
allocation protocols are expected to maintain a balance mobile no. of
stations slots
between link utilization and quality of service parameters. reqd.
As the needs of the mobile stations are not known in
advance, a predictive approach is essential which
1 2 3 4 5 1 15
incorporate the periodic recalculation and reassignment
portions of bandwidth according to traffic rate and QoS 2 3 2 1 4 5 15
parameters.
Congestion mainly lasts for several time slots and 3 4 5 3 2 1 15
therefore the bandwidth requirements remain constant until
4 5 4 3 2 1 15
the temporary congestion is over.
Proportional Linear Algorithm: 5 1 2 3 4 5 15

6 2 3 1 4 5 15
The most intuitive and frequently used approach is to
allocate the available capacity V in linear proportion to the 7 3 1 4 5 2 15
requirements (voice call and data call forwarding). Let voice
8 4 5 3 2 1 15
call be xjk and data call be yjk. Taking the buffer content as
M and traffic flow as N. N M. 9 5 4 2 3 1 15

Based on the increasing and decreasing needs of the 10 1 2 3 4 5 15

traffic, the buffer size has to be adjusted dynamically [8].
Let n be the number of mobile stations is equal to 1 to n. 3.5) Data Call Forwarding:
The random assignment of the requirement expected by n Dropping an on ongoing data call is very annoying
mobile stations at 6 different time slots be displayed in the if it is approaching to its end, whereas it is not that much
following table as an example. annoying if it has just started. Therefore, the reverse
Random Assignment of time slots for mobile stations strategy is applied to data calls. Accordingly, data handoff
according to the requirements: calls that have elapsed time greater than time threshold ted,
No. of t=0 t=1 t=2 t=3 t=4 t=5 Total are prioritized. That is , such handoff calls are accepted as
mobile no. of long as the occupied amount of bandwidth in the cell is

1350 2009 IEEE International Advance Computing Conference (IACC 2009)

smaller than the total capacity B-1. On the other hand,
handoff calls that have elapsed real time smaller than or
equal to time threshold ted, and new data calls are treated
according to the guard policy.. It is worth to mention that Bv
is taken to be greater than Bd, so that higher priority is given
to voice handoff calls [5].
3.6) Audio Call Forwarding:
A Audio handoff call that have elapsed real time
smaller than time threshold tev, are prioritized. That is , such
handoff calls are accepted as long as the occupied amount of
bandwidth in the cell is smaller than the total capacity, B.
On the other hand, handoff calls that have elapsed real time
greater than or equal to time threshold tev, and new voice
calls are treated according to the guard policy. That is, such
calls are accepted as long as the occupied amount of
bandwidth in the cell is less than a bandwidth threshold Bv,
where Bv, is a value less than B [5].
The self adaptive scheduling algorithm:
The autonomous learning protocol is applied to the
design of self adaptive medium access control protocols,
imaging systems, queuing theory, pattern recognition, neural
networks and digital traffic systems. The broadcast schedule
describes a priori knowledge of the station population
demands from data items which leads to incorporate errors
when dynamic station change occurs.
3.7) Call blocking:
Call Blocking is a service that prevents calls from up to
six preselected numbers to ring through to our phone. Call
blocking lets we decide which calls to block. With Call
blocking we no longer have to regret answering the phone.
Call dropping:
The call admission control is based on estimation of the
call dropping probability. When a new call is generated, the
call admission scheme estimates the call dropping
probability of the cell where the new call exists and accepts
the call only when the estimated probability does not exceed
a certain value of thresold set in advance.
IV. FAIR BANDWIDTH ALLOCATION
The MAC protocol of the wireless link has to adhere a
number of problems. Base station must have knowledge
about the transmission needs of the mobile terminals so that
the uplink and downlink are made possible with the mobile
terminals will become proper with the mobile terminals. The
base station contains the master scheduler which is
responsible for allocation of mobile terminal activation to
users.
Algorithm : 3
1. For every ni m, n =number of mobile users
m=base station.
2. Initial allocated unit ai =0.
3. Available bandwidth B=(ni/m>0)
4. while n m ai<c, there is available bandwidth
5. ai+=1
6. Update B. B=-B.
7. Iterate for the required number of PDUs.
2009 IEEE International Advance Computing Conference (IACC 2009)
8. Check for completion.
9. If yes, check for ni+1
10. Update B,-B.
11. Normalize the load.
12. Iterate the steps for next mobile station.
Proposed Bandwidth allocation and loss compensation
mechanism:
Assumptions:
One base station of 1.5 Mbps capacity
8 connections – 8 MTS.
Weights of the connections –
1;1;2;2;4;4;8;8;respectively.
1) Hand off Metrics:
In traditional handoffs, such as a handoff between
cellular networks, the handoff decision is mainly based on
RSS (Relative Signal Strength) in the border region of two
cells, and may also be based on a call drop rate for resource
management reasons.
2) Handoff Decision Algorithm:
Based on the handoff metrics mentioned above, the
decision about how and when to switch the interface to
which network will be made.
3) Mobility Management:
When a mobile station transfers a user’s session from
one network to other, the IP address will change. In order to
allow the Corresponding Node that the MS is
communicating with to find it correctly and allow the
session to continue,.the most common method is to use SIP
(Session Initiation Protocol) and Mobile IP.
Handoff procedure:
The handoff procedure specifies the control signaling
used to perform the handoff and is invoked by the handoff
decision algorithm.
A Context-Aware Vertical Handover Decision
Algorithm for Multimode Mobile Terminals and Its
Performance:
Traditional handover decision algorithms for mobile
devices mainly depend on signal strength. The traffic
patterns applied to Base stations have a major impact on the
mobile terminals. We need to supply different traffic
patterns each giving a different correlation, ranging from a
high negative to a perfect positive correlation, against the
numerical value of the correlation between the traffic
patterns, calculated using Equation (1).
n xy- x y
r=
(n x2 –( x)2 ) - (n y2 – ( y)2 ) (1)
r = coefficient of correlation n = number of pairs of values
x, y = traffic pattern values for autonomous algorithm.
The current algorithms needs to assume that a carrier for
each of the base station can support a certain amount of
load, in order to estimate how many carriers will be required
during the forthcoming subscriber allocation interval [6].
1351
 the performance of our algorithm. [7].
Traffic Pattern of x Traffic Pattern of r (the coefficient of
values y values correlation) No. Description
0 0.0 1

1 Choose the Base Station allocating most mobile terminals, or the

2 0.1
4 0.2
1
one with fewest allocated spectrum for the next allotment. Make
the choice according to the previous usage history if more than
1
one mobile terminal is on request. Repeat.

6 0.3 1
2 Choose the mobile terminal and allocate the spectrum. Use the
8 0.4 1 algorithm to calculate the connected period. Repeat.

10 0.5 1 3 Choose the mobile terminal with fewest allocated frequency

spectrum. Use the algorithm if more than one mobile terminal
have the same allocated spectrum. Repeat.
12 0.6 1
4 Generate weightings for mobile terminals as per equation (2) with
14 0.7 1 Wn=0.8 and WT=0.2. Choose mobile terminal with largest
weighting, or make a random choice if they have the same
16 0.8 1 weighting. Repeat.

18 0.9 1
TABLE 2: CHANNEL ALLOCATION ALGORITHM
20 1.0 1 Prediction Accuracy:
If the load prediction is inaccurate, then our
TABLE 1: TRAFFIC PATTERN VS CORRELATION Autonomous learning protocol will allocate spectrum to the
Performance changing in traffic
mobile terminals in a random manner which may not give
correlation optimum performance for channel allocation with subscriber
satisfaction. Prediction can be inaccurate when unexpected
Traffic pattern of x

25
20
traffic events happen, as the load history becomes invalid.
values

15 Traffic values
10
of x 5. Simulation Parameters and Performance Metrics:
Traffic values
5
of y
We used J-SIM simulator for implementing the
0
coefficient of autonomous learning protocol. The simulation parameters
1 3 5 7 9 11 correlation
Traffic pattern of y
we used are presented in a table.
values Mobility ( ) 0.5,1,1.5,2
Load ( ) 3 Erlangs
Time threshold values (tev, 15,30,60,90,120,150 and 165 sec.
Fig.4: Performance analysis ted)
Total bandwidth (B) 100 units
Channel Fairness: Bandwidth threshold for 90 units
The channel fairness refers to how easily the allotted voice calls (Bv )
frequency spectrum can be taken away from one mobile Bandwidth threshold for data 85 units
calls (Bd )
terminal and given to another. One important aspect of this New call average service time 180 sec.
relates to the constraint in the algorithm that spectrum can (1/ n )
only be taken away from a mobile terminal if there are no Handoff call average service 180 sec.
ongoing calls currently on that carrier. This constraint is time (1/ h )
Average elapsed time of a 100 sec.
being prevented by our algorithm from dropping calls from handoff call
one mobile terminal to benefit another.
The other aspect is the allocation algorithm. These TABLE 3: SIMULATION PARAMETERS.
algorithms are used when there is contention for the
spectrum uses the equation below: The design goals of handoff schemes should also include
minimizing the Grade of Service (GoS) cost function.
Although sophisticated cost functions have been proposed,
ARx RRx in practice a simple weighted average is useful for most
WRx=Wa 1- + Wr design purposes. The weighted sum of the new voice call
ARx + ARy RRx + RRy (2) blocking probability (Pnv), prioritized voice handoff call
dropping probability (Ph2v), new data call blocking
where: WRx = weighting of mobile terminal x, Wa = probability (Pnd), prioritized data handoff call dropping
allocated carrier factor, Wr = reqd. carrier factor, ARx = probability (Ph1d) and non-prioritized data handoff call
carriers allocated to mobile terminal x, RRx = carriers reqd. dropping probability (Ph2d) is introduced as a measure of
by mobile terminal x. The channel fairness can prevent the grade of service (GoS) and can be defined as
spectrum allocations from being optimum, and can lower GoS=Pnv+k1.Ph1v+Ph2v+Pnd+k2.Ph1d+Ph2d
where k1 and k2 are the penalty factors used to reflect the

1352 2009 IEEE International Advance Computing Conference (IACC 2009)

effect of the handoff dropping over the new call blocking
probability. A penalty of 5 to 20 times is commonly
recommended. In accordance with our proposed scheme, we
used the penalty for the prioritized handoff calls, whereas
the non-prioritized handoff calls have the same weight as
the new calls. Of course, from the mobile user’s point of
view, the objective is to minimize the GoS cost function in
order to improve the performance of the system. Therefore,
the performance of a system can be defined as
Performance=1/GoS.
Another objective, from the service provider’s
perspective is to decrease the cost by increasing utilization
of the system. Therefore, the cost of a system can be defined
as Cost=1/Utilization. In order to make a fair balance
between both user satisfaction and service provider
satisfaction, a crucial performance metric Z is introduced to
measure the performance of different bandwidth allocation
schemes and compare them. It is clear that, Z is a function
of new call blocking probability, handoff dropping
probability and system utilization all together and it can be
defined as
Z= Performance/Cost.
The design goals of a handoff scheme are increasing the
performance and decreasing the cost, which means
maximizing Z [5]. Fig 6. Usage criteria

V. CONCLUSION
IV. RESULT ANALYSIS The autonomous learning protocol in wireless Ad Hoc
networks should be able to efficiently handle the bursty
traffic that is expected to be generated by wireless network
applications. The autonomous learning protocol is able to
achieve fault tolerance, high throughput and low latency.
The characteristics of this protocol are:
It achieves a high performance. It is self –adaptive and fully
distributed. No centralized network is required. It is very
simple to implement.
REFERENCES
[1] P.Nicopolitidis, G.I.Papadimitriou, A.S.Pomportsis, “Learning
automata-based polling protocols for wireless LANs”, IEEE Transactions
on Communications vol.51, no.3, March 2003, pp.453-463.
[2] P.Nicopolitidis, G.I.Papadimitriou, A.S.Pomportsis, “Using learning
automata for adaptive push-based data broadcasting in asymmetric wireless
environments”, IEEE Transactions on Vehicular Technology vol.51, no.6,
November 2002, pp.1652-1660.
[3] G.I.Papadimitriou, A.S.Pomportsis, “Self-adaptive TDMA protocols: a
learning automata-based approach” in: IEEE Photonics Technology Letters,
Volume 11 No.10, October 1999, pp.1322-1324.
[4] G.I.Papadimitriou, A.S.Pomportsis, “Learning automata-based TDMA
protocols for broadcast communication systems with bursty traffic”, IEEE
Communication Letters, vol. 4, no. 3, March 2000, pp. 107-109.
[5] M. Salamah and I. Candan, “A fair bandwidth allocation scheme for
multimedia handoff calls in cellular networks”, 2005, pp.1-10.
[6] P.Leaves, S.Ghaheri-Niri, R.Tafazolli, J.Huschke, J.Salter, M.Ek,
“Performance Evaluation of Dynamic Spectrum Allocation for Multi-Radio
Environments”, 2002, pp.1-6.
[7] P.Leaves and R.Tafazolli, “A Time-Adaptive Dynamic Spectrum
Allocation Scheme for a converged cellular and broadcast system”, 2003,
pp.1-5.
[8] Subir K.Biswas and Rauf Izmailov, “Design of a Fair Bandwidth
Fig 5. Utilization factor Allocation Policy for VBR Traffic in ATM Networks”, IEEE/ACM
transactions on Networking, vol.8, no.2, April 2000. pp.212-223.
[9]. University of Washington, Seattle, “JSim: A Simulation Analysis
Platform”, 3/1/02-2/28/07.

2009 IEEE International Advance Computing Conference (IACC 2009) 1353