Satellite Communications

Access Schemes in Satellite Networks

EARTH STATION TRAFFIC MATRIX:
Satellite Network organisation
Satellite Networks
-Fixed and Demand Assignment-
Basic multiple access techniques
FRE!ENC" D#$#S#%N &!'(#)'E
ACCESS *FD&A+
,
(here are two la-ers o. multiple access/
0 Access to an- earth station 1- se2eral users
0 Access to the satellite 1- all earth stations
, At each la-er3 the access pro1lem is sol2ed using one or a com1ination
o. the 1asic multiple access techniques
$arious la-ers o. multiple access
FD&A (echniques
FD&A
-4 carrier per link-
, 5ith N earth stations/
0 Each earth station transmits *N-4+ carriers to the other
stations
0 (he satellite repeater handles N*N-4+ carriers
FD&A
-4 carrier per station-
,
5ith N earth stations
0
Each earth station transmits to one carrier modulated 1- a
multiplex o. the signals to the other earth stations
0
(he satellite repeater handles N carriers
%ne carrier per station
FD&A throughput
FD&A Summar-
,
Access Channel/ gi2e .requenc- 1and
,
Ad2antages
0
!se o. existing hardware to a greater extent than other
techniques
0
Network timing not required
,
Disad2antages
0
As the num1er o. accesses increases3 intermodulation
noise reduces the usa1le repeater output power *(5(
1ack-o..+6 7ence there is a loss o. capacit- relati2e to
single carrier8transponder capacit-
0
(he .requenc- allocation ma- 1e di..icult to modi.-
0
!plink power coordination is required
, #n a (D&A s-stem3 each earth station transmits tra..ic 1ursts3 s-nchroni9ed so that the-
occup- ASS#:NED N%N-%$ER'A))#N: time slots6 (ime slots are organised within a
periodic structure called (#&E FRA&E6
, A 1urst is recei2ed 1- all stations in the downlink 1eam and an- station can extract its tra..ic
.rom an- o. the 1ursts

a B!RS( ; link .rom one station to se2eral stations *(D&A;one-link-per-station

scheme+
(D&A Satellite S-stem
Burst :eneration
Reco2er- o. data messages
Frame Structure
-Example/ #N(E'SA(8E!(E'SA(
S-nchronisation -)ro1lem statement-
S-nchronisation -)ro1lem statement-
,
Space-time graph
illustrating (D&A
s-nchronisation
S-nchronisation
-Determination o. <stat o. local (D&A .rame= instant
(D&A s-nchronisation
S-nchronisation o. multiple 1eam (D&A s-stems
%pen loop s-nchronisation
- &easurements o. round trip dela- are per.ormed 1- three ranging stations using closed
loop s-nchroni9ation6
- Satellite position is deri2ed 1- triangulation and range .rom each ordinar- station to satellite
is calculated at re.erence station6
- Satellite-to-station range in.ormation and .rame timing is distri1uted to all ordinar- stations
1- re.erence station
Frame e..icienc-
(D&A throughput
(D&A summar-
,
Access Channel/ gi2en time slot within time .rame
,
Ad2antages
0
Digital signalling pro2ides eas- inter.acing with de2eloping digital
networks on ground
0
Digital circuitr- has decreasing cost
0
7igher throughput compared to FD&A when num1er o. accesses is
large
,
Disad2antages
0 Stations transmit high 1it rate 1ursts3 requiring large peak power
0 Network control is required
, :eneration and distri1ution o. 1urst time plans to all tra..ic stations
, )rotocols to esta1lish how stations enter the network
, )ro2ision o. redundant re.erence stations with automatic switcho2er to
control the tra..ic stations
, &eans .or monitoring the network
CD&A
-Spread spectrum communications
, (ransmitter spreads 1ase1and signal .rom 1andwidth 5 to B6
, B85 ; spreading .actor *4>> to 4 >>> >>>+6
, Recei2er despreads onl- signal with proper address6
, Recei2ed signals with other addresses and ?ammer are spread 1-
recei2er and act as noise6
, Addresses are periodic 1inar- sequences that either modulate the carrier
directl- *D#REC( SE!ENCE S"S(E&S+ or change the .requenc- state
o. the carrier *FRE!ENC" 7%))#N: S"S(E&S+6
Direct sequence s-stems
Direct sequence s-stems
-power spectrum o. data and o. spread signal-
Direct sequence s-stems
-practical recei2er implementation-
CD&A
-Frequenc- hopping s-stems
Code generation
Code S-nchronisation
-direct sequence s-stems-
Exercise- Capacit- o. a CD&A s-stem
Exercise- Capacit- o. a CD&A s-stem
&ultiple access
-Comparison o. multiple access techniques
Ad2antages8disad2antages o. 2arious
multiple access techniques
Type of multiple access Advantages Disadvantages
FD&A Network timing not required #ntermodulation products
cause degradation and poor
power utilisation
Compati1le to existing
hardware
!plink control power required
(D&A No mutual inter.erence
1etween accesses
Network control required
!plink power control not
needed
'arge peak power
transmission .or earth station
&aximum use o. satellite
transponder power3 most
e..icient
Being digital in nature
inter.ace with analogue
s-stem is expensi2e
CD&A Network timing not required 5ide 1andwidth per user
required
Anti-?amming capa1ilit- Strict code s-nc6needed
Random Access Schemes *4+
,
FD&A8(D&A8CD&A .ixed access ha2e 1een
designed .or circuit8stream tra..ic
,
Burst- data tra..ic 0e6g6 packets- more
e..icientl- dealt with 2ia random access
schemes
,
#n random access there is no permanent
assignments 0resource is allocated when
needed on a random 1asis
Random Access Schemes *@+
,
Simplest s-stem is A'%7A 0transmit packets and i.
collide3 retransmit with random time di..erence6
,
)er.ormance 2ia <throughput 2ersus dela-=
,
(hroughput ; N '8R
0
N; no transmissions
; packet generation rate *S
-4
+
0
'; packet length *1its+
0
R; transmission 1it rate *1its8s+
,
A'%7A doesn=t need s-nchronisation
,
&aximum throughput 4AB
Random Access Schemes *C+
,
S'%((ED-A'%7A con.ines transmission to slot 1oundaries
and needs time s-nchronisation
,
&aximum throughput is increased to CDB
,
As s-stem rapidl- 1ecomes unsta1le as collisions 1uild up3
usual to operate 1elow maxima
C
h
a
n
n
e
l

t
h
r
o
u
g
h
p
u
t

(
S
)
Channel load (G)
0!"
0#$
S-ALOHA
(S=Ge
-G
)
ALOHA
(S=Ge
-2G
)
Random Access Schemes *E+
,
For 2aria1le length messages need to
emplo- more complex scheme e6g6 slotted
re?ect A'%7A
,
!se multi-packet message and onl- re-
transmit su1-packets that collide
,
#ncreases throughput *>6CF+ independent o.
message length
Random Access Schemes *G+
,
Comparison o. random access
Random Access Schemes *D+
,
Comparison per.ormances
0
For stream or .ile tra..ic need to use reser2ation
(D&A *DA-(D&A+ schemes
A%OHA
S&A%OHA S&RA%OHA
'A&T'MA
'
e
l
a
(
Throughput
Random Access Schemes *F+
,
Reser2ation 0 (D&A
,
RSF; Reser2ation Su1 Frame
,
#SF ; #n.ormation Su1 Frame
,
RSF used to 1ook space in next #SF .rame according to
demand
,
RSF can 1e operated in .ixed (D&A3 A'%7A3 S-A'%7A3
etc6
i
th
.rame *iH4+ .rame
RS
F
i
#SFi
R
S
F
iH4
#SF*iH4+
Random Access Schemes *A+
,
Summar-
0
Select RA scheme .or tra..ic t-pe and
dela-8throughput * num1er o. tx=s+
0
(ake care to achie2e sta1ilit-
0
A'%7A/ short 1urst- tra..ic
0
S-A'%7A/ short 1urst- tra..ic 01etter throughput
0
S-R6A'%7A/ 2aria1le length messages
0
RA-(D&A/ stream or .ile trans.ers