10/ 05/ 2012

1
Cognitive Networks
Prof. Luiz DaSilva
Theory and Practice of Cognitive Radio
Aalborg University
May 9-11, 2012
CognitiveNetworks:
ArchitecturesandPrinciples
OpportunisticChannelAccess
andRendezvous
MACsforCognitiveNetworks
CrossLayerDesign
10/ 05/ 2012
2
Bringingthenetworkintothepicture
Inanetworkofautonomous,adaptiveradios,
doindividualoptimizationsresultinnetwork
wideoptimalperformance?
Howmuchinformationaboutnetwork
conditionsmustindependentradioshaveto
makeeffectiveadaptations?
Learningandreasoningareneededtomanage
complexcrosslayeroptimizations
Adefinition
Acognitivenetworkhasacognitiveprocess thatcanperceive
currentnetworkconditions,andthenplan,decideandacton
thoseconditions.Thenetworkcanlearn fromthese
adaptationsandusethemtomakefuturedecisions,allwhile
takingintoaccountendtoendgoals
Criticalcomponents:
Cognition (asopposedtoreactive,localizedschemes)
Endtoend goals(asopposedtolayerlevelgoals)
Doesnotspecifyapplicationormechanism
R.W.Thomas,L.A.DaSilva,andA.B.MacKenzie,Cognitive
Networks,IEEEDySPAN,2005.
10/ 05/ 2012
3
Node
Link
Network
Dynamic
frequency
selection
Beam
forming/
nulling
Power
control
MIMO
Topology
control
Spectrum
negotiation
Cooperative
Comms.
Waveform
selection
Adaptive
routing
Inacognitiveradionetwork,adaptationscanoccurat
multiplelayers,andtheyinteractwithoneanother
Network
coding
10/ 05/ 2012
4
CognitiveNetworkArchitectures:Example1
Cognitive
element
element goal
cognitive element
element goal
end-to-end goal
end-to-end goal
end-to-end goal
cognitive element
element goal
cognitive
element
element goal(s)
cognitive
element
element goal
cognitive
element
element goal
CSL
Requirements
Layer
Cognitive
Process
Software
Adaptable
Network
configurable
element
configurable
element
configurable
element
network
status
sensor
network
status
sensor
cognitive
element
element goal(s)
element
status
transfer
SAN API
R.W.Thomas,D.H.Friend,L.A.DaSilva,andA.B.MacKenzie,
CognitiveNetworks:AdaptationandLearningtoAchieve
EndtoendPerformanceObjectives,IEEECommunications
Magazine,Dec.2006
CognitiveNetworkArchitectures:Example2
P.Sutton,L.Doyle,andK.Nolan,AReconfigurablePlatform
forCognitiveNetworks,Proc.CROWNCOM,2006
10/ 05/ 2012
5
CognitiveNetworkArchitectures:Example3
P.Mahonen,M.Petrova,J.Riihijarvi,andM.Wellens,
CognitiveWirelessNetworks:YourNetworkJustBecamea
Teenager,INFOCOM(poster),2006
Opportunisticchannelaccess:cognitive
radioperspective
Scenario:asetofchannels{1,2,,N}is
allocatedtoanincumbent/primaryuser
(PU)andcanbeopportunisticallyutilized,
onanoninterferingbasis,byasecondary
user(SU)
Problem:theSUmustselectthebest
channelinwhichtooperate
Challenges:
Accurate,reliablesensing
Learningpatternsofutilizationof
channelsbyPU
Abidingbyinterferenceconstraints
1
2
3
N
channels
primary
user
1
secondary
user
10/ 05/ 2012
6
Opportunisticchannelaccess:cognitive
networkperspective
Scenario:asetofMcognitiveradiosnow
competeforopportunisticaccesstotheN
channelsthatareallocatedtoaPU
Problem:theSUsmustselectagood
channelbutalsotocoexistefficiently
(andpeacefully)withotherSUs
Additionalchallenges:
IntraSUcompetitionand/or
cooperation
Fairnessandefficiencyinresource
allocation
Topologycontrol,routing
1
2
3
N
channels
primary
user
1
secondary
users
M
Extendedexample:channel
selectionbyautonomous,
frequencyagileradios
Problem:Mcognitiveradio
pairssensefromasetofN
channels.WhenaCRfindsa
freechannel,ittransmitsfor
theremainderofthetime
slot.
ACRsthroughputisaffected
byotherCRssuccessin
findingavacantchannel,as
wellasbyPUactivity.
Thereisthepotentialtolearn
frompastchoicesand
observations.
Z.Khan,J.J.Lehtomaki,L.A.DaSilva,andM.Latvaaho,
AutonomousSensingOrderSelectionStrategies
ExploitingChannelAccessInformation,IEEETrans.on
MobileComputing (inpress,2012)
10/ 05/ 2012
7
Extendedexample:channel
selectionbyautonomous,
frequencyagileradios
Objective Amechanismto
enableCRstoautonomously
arriveatcollisionfreesensing
orders
Problemiscomplicatedbythe
presenceofthePUandbythe
possibilityoffalsealarms
Extendedexample:channelselection
byautonomous,frequencyagile
radios
SensingordersselectedfromaLatin
square.
Initially,eachCRselectsanysensing
orderwithequalprobability.
Wheneversuccessful,orifitfinds
allchannelsbusy,theCRselectsthe
samesensingorderinthenextslot.
Inthecaseofacollision,theCR
multiplicativelydecreasesthe
probabilityofpickingthesame
sensingorder,byafactor,withall
othersensingordersequallylikely.
all permutations
of 4 channels
a Latin square
10/ 05/ 2012
8
Extendedexample:channelselection
byautonomous,frequencyagile
radios
[Thm]WhenN=M,and0P[false
alarm]<0.5,forany0< <1the
networkconvergestocollisionfree
sensingorders
WhenN>M,convergencetocollision
freesensingordersisevenfaster(N=
Mistheworstcaseforconvergence)
[Proposition]WhenP[PUpresent]=0,
theexpectednumberofslotsuntil
collisionfreesensingordersare
obtainedisO(N)
N = M = 10
TTC = time to
arrive at
collision-free
sensing orders
Extendedexample:channelselectionby
autonomous,frequencyagileradios
Analyticalresults
An(ugly)analyticalexpressionforM=2
AboundforM>2
10/ 05/ 2012
9
Extendedexample:channelselection
byautonomous,frequencyagile
radios
Comparison:
RPS:randomsensingorderselection
fromallpermutationsofchannels
LS:randomsensingorderselection
fromaLatinsquare
randAP/LS:randomizeaftercollision
MxP[N,M,]:average#ofsuccessful
transmissionsinatimeslot
RadioRendezvous
Ameetingatanestablishedtimeandplace
FromtheFrenchrendez vous,forpresentyourself
Theabilityoftwoormoreradiostomeetandestablishalink
onacommonchannel,bootstrapping communication
Arequirementofanymultichannelsystem
Inopportunisticspectrumaccess,particularlychallenging
duetolargenumberofpotentiallyusablechannelsand
presenceofincumbents
Rendezvousalsoincludeslinkmaintenanceaschannel
availabilitychanges
10/ 05/ 2012
10
RendezvousTaxonomy
Rendezvous
Unaided
Single
control
channel
Multiple
control
channels
No control
channel
Aided
Dedicated
control
channel
Aidedvs.UnaidedRendezvous
Aided(infrastructurebased)
Accomplishedwiththehelpofaserver
Serverperiodicallybroadcastschannelavailability
information
Servermayalsoserveasaclearinghouseforlink
establishmentandschedulingoftransmissions
Typicallyusesawellknowncontrolchannel
Unaided(infrastructureless)
Radiosareontheirown
Mayormaynotusededicatedcontrolchannels
10/ 05/ 2012
11
ControlChannelTradeoffs
Useofacontrolchannelforrendezvousandchannel
reservation
Simplifiestherendezvousandnegotiationprocesses
Butcreatesabottleneckandsinglepointoffailure
Useoflocallyselectedcontrolchannels
Improvesscalabilityandreducesbottlenecks
Butimposestheoverheadofclusterformationandcontrol
channelselection
Controlmessagesexchangedoverdatachannels
Scalable,flexible,distributedsolution
Butaddscomplexitytorendezvous
DedicatedControlChannel:
InfrastructureNetworks
Spectruminformation
channels
Clientsdedicateaninterface
toscanthesechannels
Basestationbroadcastsinfo
aboutchannelavailability,
interferenceconditions
Clientsusethesamechannel
torequesttheuseofan
availabledatachannelfor
theirtraffic
M.Buddhikot etal.,DIMSUMNet:NewDirectionsin
WirelessNetworkingUsingCoordinatedDynamic
SpectrumAccess,IEEEWOWMOM,2005.
10/ 05/ 2012
12
DedicatedControlChannel:AdHocNetworks
Radiosperiodicallymonitoraknowncontrolchannel
Or,ifmultipletransceiversareavailable,oneisdedicated
tothatpurpose
Channeloccupancyannouncementsareperiodically
broadcastbyallnodesonthischannel
Negotiationofdatachannels
Forexample,throughtheexchangeofRTS/CTS
Oncenegotiationiscompleted,transmitterandreceivermove
tothereserveddatachannel
Andstartbroadcastingchanneloccupancyannouncements
onthecontrolchannel
DynamicallyChangingControlChannel
Example:radiosareprogrammedtoalwaysattemptto
rendezvousonlowestnumberedchannelnotcurrently
occupiedbyanincumbent
Robustnessissue
Transmitter/receivermaynotbothbeabletosense
presenceofincumbentsduetodifferencesinlocation,
range,andsensingcapabilities
PU
Channel 1
SUA
SUB
10/ 05/ 2012
13
NoControlChannel
Allchannels{1,2,,N}potentiallyavailableforrendezvous
Radiosvisitthesechannelsinrandomorprescribedorder,
alternativelytransmittingbeaconsandlisteningforresponses
untilrendezvousissuccessful
Blindrendezvous
Timetorendezvous(TTR)isonemetricofinterest
IncreaseswithN
BlindRendezvousProcess
Sense
medi um
Tr ansmi t
beacon
Li st en
Sense
medi um
Sense
medi um
Radio A
Radio B
Radio C
Time Slot
Request
r endez-
vous
10/ 05/ 2012
14
Randomvs.SequencebasedBlindRendezvous
Random:radioswantingtoestablishalinkvisittheNpotential
channelsinrandomorder
E[TTR]=N
RendezvousisequallylikelytohappeninanyoftheN
channels
Sequencebased:radiosfollowapreestablishedsequencein
visitingchannels
PossibletoconstructasequencethatminimizesMax(TTR)
orE[TTR]
Possibletoprovidedeterministicguarantees
Prioritizescertainchannelsforrendezvous
SequencebasedRendezvousExample
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
PermutationP(N)
PermutationP(N)
PermutationP(N) PermutationP(N)

) 1 ( 3
3 6 2
] [
2 4
+
+ +
=
N N
N N N
TTR E
Afamilyofsequences
L.DaSilva andI.Guerreiro,SequencebasedRendezvous
forDynamicSpectrumAccess,IEEEDySPAN,2008.
10/ 05/ 2012
15
SequencebasedRendezvousExample(contd)
N Samplesequence(oneperiod) MaxTTR E[TTR]
3 112322133312 8 2.75
4 111234222134333124444123 13 3.96
5 2354112543453214253134512
34251
11 4.23
ModularClockAlgorithm
Cryptographyinspired
=startingchannelindex
r=numberofchannelsradio
skipsinatimeslot
Guaranteesthatrendezvous
willoccurevenifradiossense
differentsetsofavailable
channels(aslongassetsare
notdisjoint)
N.Theis,R.W.Thomas,andL.A.DaSilva,Rendezvousfor
CognitiveRadios,IEEETrans.MobileComputing,vol.10,
no.2,Feb.2011.
10/ 05/ 2012
16
LinkMaintenance
Evenaftersuccessfulrendezvous,theappearanceofan
incumbentmayrequirethelinktobereestablishedinan
alternatechannel
Alternatives
Returntorendezvousphase
Ifthereisenoughtime,firstradiotodetecttheincumbent
informstheotherofnewchannel
Negotiateafallbackdictionarywhilethelinkisstillactive
(priortotheappearanceoftheincumbent)
CognitiveMediumAccessControl(MAC)
ArbitratesamongCRscoexistinginashared/broadcast
medium(similartothetraditionalMACfunction)
Competitionand/orcooperationamongCRs
Multichanneloperation:opportunisticselectionofwhich
channeltotransmiton
Channelavailabilitymayvarytemporallyandspatially
Interferenceconstraints:aCRmustvacatethemediumwhen
thePUbecomesactive
Controlinformation
Inband
Outofband(acontrolchannel)
Hybrid:abasechannelforcontrolanddata,with
additionaldataonlychannels
10/ 05/ 2012
17
CommonControlChannel
Channelavailabilityinformationandhandshakefor
opportunisticaccesscanbeexchangedoverthischannel
Cognitivepilotchannel
Regulatoryissues:Whatchanneltodedicateforthis?How
isaccessmanaged?
Thecommoncontrolchannelmayvaryspatially
OnetransceivermaybetunedtotheCCCatalltimes
A.DeDomenico,E.Strinati,andM.DiBenedetto,A
SurveyonMACStrategiesforCognitiveRadioNetworks,
IEEEComm.SurveysandTutorials,vol.14,no.1,2012.
SplitPhaseApproach
Channelreservationphase,followedbythetransmission
phase
Canbeadoptedwithasinglecontrolchannel,oronevery
channel
Someportionofthebandwidthiswastedduringthecontrol
phase
10/ 05/ 2012
18
NoDedicatedControlChannel
Rendezvous:radiosthatwanttocommunicateselecta
channel(possiblyusingapredefinedsequenceinwhich
channelsarevisited)andthenperformahandshakefor
channelreservation
Hybridapproachesarepossible
Controlinformationexchangedononechannel,indicating
whatadditionalchannelscanbeexploitedinparallel
(Carvalho,DaSilva,2012)
Example1:CognitiveMAC(CMAC)
Rendezvouschannel(RC)andabackupchannelincaseofthe
appearanceofaPU
Superframes:beaconperiodanddatatransferperiod
Beaconperiodsareslotted
SUperiodicallytunestotheRCandissuesabeacon
Beaconingisusedforsynchronization,exchangeof
neighborhoodtopologyinformation,establishmentof
communicationsinanotherchannel
Superframe structureisthenadoptedinthenewchannel
C.Cordeiro andK.Challapali,CMAC:ACognitiveMAC
ProtocolforMultiChannelWirelessNetworks,IEEE
DySPAN,2007.
10/ 05/ 2012
19
CMAC,contd
Beaconscarrytraffic
reservationinformationfor
currentsuperframe
Loadbalancingpossible
Scalabilityissues
AssumesallSUswillconverge
onthechoiceofthesameRC,
whichisnotalwayspossible
Example2:StochasticMultichannelLoadBalancing
Probabilisticchannelselectionwithmultichannelexponential
backoff
RadiosmaintainestimatedprobabilityofappearanceofaPU
withineachofthechannels(p
i
)
Channelselectionalgorithm
Radioinitializesacounterforeachchannelw/arandomly
selectedinteger
Ineachslot,radiocountsdownforachannelw/
probabilityp
i
Firstchanneltocountdownto0isselected,triggeringan
RTS/CTSexchangeonacommoncontrolchannel
K.Ghaboosi,A.B.MacKenzie,L.A.DaSilva,A.S.Abdallah,andM.
Latvaaho,AChannelSelectionMechanismBasedon
IncumbentAppearanceExpectationforCognitiveNetworks,
IEEEWCNC,2009.
10/ 05/ 2012
20
SMLB,contd
CognitiveNetworksandCross
LayerOptimization
Cognitivenetwork
architecturespresuppose
crosslayeroptimization
10/ 05/ 2012
21
CrossLayerApproaches
V.Srivastava andM.Motani,CrosslayerDesign:ASurveyand
theRoadAhead,IEEECommunicationsMagazine,2005.
ImportantCrossLayerCouplings
Channelsensinginformation(PHY)iscriticalforMAClayer
decisionsforopportunisticspectrumaccess
JointNETandMACoptimizationsarebeneficialinmultihop
wirelessnetworks
Explicitnotificationfromlowerlayersareimportantfor
properoperationofTCPinwirelessenvironments
Adaptationsatalllayersmayprofitfromobjectivesdefinedat
theapplicationlayer
10/ 05/ 2012
22
Challenges
Preservingmodularity
DevelopmentofAPIsthatenablereusability
Abstractionfromunderlyingtechnology
Informationdissemination
Knowledgerepresentationlanguage
Contextforinterpretationofthisinformationatthe
differentlayersoftheprotocolstack
Indicationofimprecisionanduncertainty
Complexityandscalability
Example1:FuzzyLogic
Variablesandparametersidentifiedateachlayerand
representedusingfuzzyvariables
Fuzzification bythelayerthatexportsthevariable
Interpretationoffuzzyinformation(SNRisgood)
requireslesscontext
Modularityispreserved
Alllayersperformadaptationsbasedonexportedvariables
Example:link,routing,andtransportlayerscharacterizedby
reliability,congestion,bandwidthanddelay
10/ 05/ 2012
23
Example1,contd
N.Baldo andM.Zorzi,FuzzyLogicforCrossLayerOptimization
inCognitiveRadioNetworks,IEEECommunicationsMagazine,
2008.
Example2:ARQbased
NetworklayerexportsACK/NACKinformationforeachpacket
Decisionvariables
PHY:transmissionpowerandmodulationorderforeach
subcarrier
MAC:framesize,minandmaxcontentionwindowsize
NET:variabletransmissionrange(controlsnumberofhops
intheroute),indexofAPtoassociatewith(assumes
multipleAPswithinrange)
Multiobjectivefunction:weightedsum(minpower
consumption,maxthroughput,minbit/packeterrorrate,min
transmissiondelay)
Approach:geneticalgorithm
10/ 05/ 2012
24
Example2,contd
A.DeBaynast etal.,ARQbasedCrossLayerOptimizationfor
WirelessMulticarrierTransmissiononCognitiveRadio
Networks,ComputerNetworks,2008.
Itsimportanttoconsidercognitiveradios
notonlyfromasinglelinkperspectivebutin
thecontextofabroadernetwork
Opportunisticchannelselectionand
rendezvousareelementsofacognitiveradio
mediumaccessscheme
Thecontrolchannel(fixed,dynamic,
exclusiveorsharedwithdatatraffic)playsan
importantroleinthedesignofcognitive
MACs
Gradually,cognitivenetworkresearchis
startingtotakeintoaccountdecisionmaking
atlayers3andabove