Professional Documents
Culture Documents
ARS : Ad-hoc
Relaying Stations
Each ARS and MH
has two interfaces
(celluar and relay)
ARS
MH
One example of relaying
A x B A x B
(a) (b)
An ARS differs from a BTS and a MH
Compared to BTS
Mobility
Air interface
Compared to MH
Mobility
Security,authentication,privacy
Billing
Basic Operations
Secondary Relay
Primary relay failed x
A B
Not covered by ARS
y
Reachable BTS is
congested too
(a)
Free the channel of
x
an active call which A B
can be relayed to a
y
neighbor cell
(b)
Basic Operations (Cont’d)
Cascaded Relay
Cascade the above relays more multiple times if they are failed.
x x
A B A B
y y
C z C z
CI and NCI
1 Km 1.5 Km 2 Km
R2 200m 50 114 200
n 2 2 350m 18 38 66
r 500m 8 18 32
Seed Growing Approach
With fewer ARS’s, relaying can still be effective.
Some can be seeds (placed at each pair of
shared edges), and others can grow from them
(placed nearby).
Number of Seed ARSs
For a fix coverage area, the system with fewer
UN-SHARED edges needs more seed ARSs.
The max number is obtained by considering a
circle area and count the number of shared
edges.
Proposition: For a n-cell
system, the maximum
number of seed ARS’s is
3n 4 n 4
Quality of Coverage
3 Seed
ARS’s
3'
Seed ARS’s: Edge v.s. Vertex
Preliminary results
Case1 : when TB<TA<50
Erlangs, Qvertex<QEdger.
Case2 : when TA, TB>50
Erlangs or TA<TB,
QVertex>QEdge.
Case2 is out of normal
operation range
Rule of Thumb 1
Place the seed ARS's
at edges of a hot spot
cell.
Seed ARS v.s. Grown ARS
Preliminary Results
Case1 : seed (ARS 2).
Assuming edge
placement of seed)
Case2 : grow (ARS 2’).
The QoC value of the
grown ARS is about
0.61•S •TA•(1-bB).
Rule of Thumb 2
Try to place an ARS as
a seed if it is possible.
Growing Direction
When there are already
sufficient seed ARS’s,
Additional ARS's can
grow
toward inside of a hot
cell A (ARS No.3)
toward outside of cell A
(ARS No.3')
Rule of Thumb 3
Place an ARS in the cell
with a higher traffic
intensity.
Outline
Motivations
Introduction of iCAR
ARS Placement
Seed ARS
Quality of Coverage
iCAR Performance
Theorems
Analysis
Simulations
Signaling Protocols
Future Work and Conclusion
Theorems
Theorems1
Assume that the total traffic in a n-cell system is
T Erlangs, then the (system wide) call
blocking probability is mininized when the
traffic in each cell is T/n Erlangs.
Why?
Assume there
n
are M channels in each cell, and the traffic intensity in cell i is Ti
(T
is
i 1
Ti ). According to Erlang B formula, the blocking probability in each cell
Theorem (Cont’d)
The average blocking probability of entire system is
Final result
Analysis (Cont’d)
An accurate
model of
primary
relaying for
a 2-cell
system.
Analysis (Cont’d)
Secondary
relaying
An approximate
model
Analysis (Cont’d)
An accurate model
Simulations
Simulation model
GloMoSim
25 cells
Cell A is a hot spot
Location dependent traffic
(ripple effect)
50 DCH’s per cell
56 seed ARS’s
25,600 MH’s
Call arrive rate is in
poisson distribution
Holding time is in
exponential
Simulations (cont’d)
Results
Blocking rate
Blocking rate can
be reduced by
primary relaying,
but not much
Secondary relaying
reduces the call
blocking rate
further
Simulations (Cont’d)
More results
Primary relaying
Protocol 1 (cont’d)
Secondary relaying
Protocol 2: a link-state
based protocol
Primary relaying
Protocol 2 (Cont’d)
Secondary relaying
Protocol 3: an aggressive
route-searching protocol
Primary relaying
Protocol 3 (cont’d)
Secondary relaying
Performance Comparison
Three protocols have their own
advantages and disadvantages
The PSC-assisted protocol will have the
lowest signaling overhead in terms of the
number of signaling messages. But in this
protocol, PSC becomes the performance
bottle neck and a signal point of failure.
Performance Comparison
(Cont’d)
The link-state based protocol is distributed. It
requires the ARSs to flood the update
messages. Also, the ARSs need large enough
memory to maintain topology and bandwidth
information, and high computation power to
compute the relaying route.
The aggressive route searching protocol does
not maintain the relaying bandwidth
information of other ARSs. It is an on-
demand and the simplest distributed protocol.
It requires fewest memory and computing
power.
Simulation
Mobility Tracking
With the help of GPS, we can keep track of
the position of MHs and ARSs, so that we can
move the ARSs to the best positions.
ARS Management/Moving
With the movement of ARSs, issues such as
route reestablishment, etc., need to be
addressed.
Future Works (Cont’d)