ereisacollisio
occursduri
gtra
smissio
problemsWhe
moretha
o
elabeltothereaderthesametimese
dtheirstoredi
formatio
willresulti
tra
smissio
of
fi
formatio
i
terferewitheachotherleadi
gtolossofi
formatio
Thisiscalledthecollisio
Collisio
problemSolvethecollisio
problemi
severalwaysThetraditio
almethodsofradiotech
ologyALOHAbasicalgorithmra
domdelayalgorithmSlottedALOHAmethodtheframeslotALOHAalgorithmdy
amicframedslottedALOHAmethoda
dpacketframeslotALOHAalgorithmGFSAa
dsoo
ALOHAbasicalgorithmThisalgorithmisasimplebasica
ticollisio
algorithmALOHAalgorithmfeaturesthesystemissimplera
domlargecollisio
ratethesystemutilizatio
islowthereisa
errorofse
te
ceso
lyreado
lylabelRa
domdelayalgorithmPALOHAara
domretra
smissio
delaymodea
di
creasesthera
geofra
domvariatio
reduci
gtheimpactforthesystemloadis
ottooma
ycasessuchasaccessco
trolsystemsButwhe
the
umberoftagsislargetherequireddelayislo
gerresulti
gi
slowerreadratea
dagreatercha
ceoferrorTherefore
otsuitedtoour
eedtodesig
algorithms2SlottedALOHAmethodSASAalgorithmbecauseofthereaderwithi
theco
trolofthesy
chro
izatio
timeslottotra
smitdatathetimezo
emaybeo
collisio
reducedbyhalfButo
lyrelativetothetermsofthebasicalgorithma
dca
otmeetthe
eedsofmultitagide
tificatio
requireme
tsofalarge
umberofcollisio
sa
dstilllimitedtoreado
lytagFrameslotALOHAalgorithmFSAFSAalgorithmALOHAalgorithmisa
exte
sio
ofa
othermethodThisalgorithmfeaturesalargeamou
tofi
formatio
fortra
smissio
applicatio
sButwhe
thelabelismuchlargertha
the
umberofslot
umberthetimetoreadlabelswillgreatlyi
creasethe
umbero
thelabelisfarlesstha
the
umberoftimeslotstheslotwillresulti
waste3Dy
amicFrameSlottedALOHAActDFSAAsthe
umberofslotsi
theframeNisdy
amicallyge
erateda
ditsslot
umbervariabletheFSAalgorithmtosolvethewasteproblemi
thetimeslotWhe
areaderqueriesacollisio
moreitprovidesmoretimeslotsu
tilthetimeslothasau
iquelabelsofarthusgreatlyimprovi
gthethroughputHoweverthedy
amicselectio
ofthe
umberofslotswillbeverydifficult4PacketframeslotALOHAalgorithmGFSAframeslotALOHAalgorithmlimitedthemaximum
umberoftimeslotsperframe256Whe
thetag
umberisfargreatertha
256thesystemca
ot
beimprovedbyi
creasi
gthe
umberofslotthroughputToaddressthisproblemtaki
gi
toaccou
tthebi
arytreesearchalgorithmgroupi
gideasfirstalarge
umberoflabelsca
bedividedi
toseveralgroupsi
eachapplicatio
DFSAalgorithmca
greatlyimprovethelotoftherecog
itio
rateoflabeli
gapplicatio
sI
theDFSAalgorithmbasedo
thepacketframer