1
Cooperative Spectrum-Aware Opportunistic Routing in Cooperative Spectrum-Aware Opportunistic Routing in Cognitive Radio Ad Hoc Networks Cognitive Radio Ad Hoc Networks Cuimei Cui* Cuimei Cui* , Hong Man , Hong Man , Yiming Wang* , Yiming Wang* *School of Electronics and Information Engineering, Soochow *School of Electronics and Information Engineering, Soochow University University Dept. of Electrical and Computer Engineering, Stevens Dept. of Electrical and Computer Engineering, Stevens Institute of Technology Institute of Technology [email protected], [email protected], [email protected] [email protected], [email protected], [email protected] I. Motivations & Contributions Motivations Motivations Cognitive radio (CR) technology has been recognized Cognitive radio (CR) technology has been recognized as an viable solution to counteract both as an viable solution to counteract both spectrum spectrum inefficiency inefficiency and and spectrum scarcity spectrum scarcity problems. problems. To fully unleash the potentials of CR Ad Hoc To fully unleash the potentials of CR Ad Hoc networks (CRAHNs), new challenges must be addressed networks (CRAHNs), new challenges must be addressed at the network layer by tightly coupling with at the network layer by tightly coupling with physical layer spectrum sensing physical layer spectrum sensing and and MAC layer MAC layer spectrum sharing spectrum sharing , taking into account the unique , taking into account the unique properties of the cognitive environment. properties of the cognitive environment. How to extend opportunistic routing adopting How to extend opportunistic routing adopting cooperative spectrum sensing technology is still an cooperative spectrum sensing technology is still an open research issue. open research issue. Contributions Contributions Propose a Dual-stage Collaborative Spectrum Sensing Propose a Dual-stage Collaborative Spectrum Sensing (DCSS) routing protocol to discover the established (DCSS) routing protocol to discover the established routing opportunity. routing opportunity. Metrics of cooperative spectrum-aware opportunistic Metrics of cooperative spectrum-aware opportunistic routing were defined and derived routing were defined and derived Evaluate the performance of the proposed routing Evaluate the performance of the proposed routing protocol in CRAHNs. protocol in CRAHNs. II. Opportunistic Cognitive Routing Protocol Network Model Network Model Model the CRAHN with a direct temporal graph: Model the CRAHN with a direct temporal graph: Vertex denotes an CR routing Vertex denotes an CR routing node or an CR sensing relay, and an edge node or an CR sensing relay, and an edge denotes the routing link from CR node U denotes the routing link from CR node U i to U to U j j at t time . at t time . If PU is not active, the route with the minimum If PU is not active, the route with the minimum hop count and the longest single-hop distance U hop count and the longest single-hop distance U s s - - U U i i -U -U j j -U -U d d will be established. will be established. Otherwise, the route with a higher hop count, as Otherwise, the route with a higher hop count, as shown in dashed line, will be selected. shown in dashed line, will be selected. Channel Sensing Channel Sensing The occupancy rate of PU at m-th channel, The occupancy rate of PU at m-th channel, The transition probability after a duration of The transition probability after a duration of for Ui in busy(ON) state, for Ui in busy(ON) state, (t) (U ,E(t)) G ,SR i i U U () () ij e t Et The probability that a channel at U The probability that a channel at U i i stays in busy stays in busy state during the sensing period t state during the sensing period t s s adopting DCSS adopting DCSS scheme, scheme, Path Selection Path Selection The successful routing probability between U The successful routing probability between U i i and and U U j j in the channel m, in the channel m, Select the optimal channel as routing path, Select the optimal channel as routing path, The successful routing opportunity of the path The successful routing opportunity of the path 1 m on 1 m off ( ) , ( ) , if H =0 ( ) (1 ) , if H =1 m m m off on m m m i off on t m m m m m busy U t m m m u u e p t u u e m t The mean time of PU in ON /OFF state is / on, , 1 1 , 0 0 (t) ( )( (( ,1 , (1 )) (1 ( ,1 , (1 )) )) (1 ( )) ( ( ,1, )(1 ( ,1, )) ) i i i N m m m m m m U s busy U N m Ui SRi mK N m m m m Ui SRi busy U N m m N m N m m mK Q p t C P P P P p t C , 1 () ()(1 (1 ())) j k m m m link ij ij ic j p t t p t , [1,N ] arg m ax{ ()} m link ij m m p t , 1 () () n m sd link ij x p t p t III.Performance Evaluation , Simulations are presented to evaluate the Simulations are presented to evaluate the performance of cooperative spectrum-aware performance of cooperative spectrum-aware opportunistic routing in terms of accuracy and opportunistic routing in terms of accuracy and optimality. optimality. Fig.1 & Fig.2 illustrate the routing breakage Fig.1 & Fig.2 illustrate the routing breakage probability of DCSS is more closer to the probability of DCSS is more closer to the practical result than these of SCSS and NCS practical result than these of SCSS and NCS when selecting optimal relay. when selecting optimal relay. Fig.2 & Fig.3 show that the longer the average Fig.2 & Fig.3 show that the longer the average time of a PU is in ON state, the higher is the time of a PU is in ON state, the higher is the breakage probability of end-to-end routing, the breakage probability of end-to-end routing, the less is the opportunity of routing. less is the opportunity of routing. Fig.4 presents that the successful end-to-end Fig.4 presents that the successful end-to-end opportunity routing probability using the DCSS opportunity routing probability using the DCSS increases as the number of usable channels increases as the number of usable channels increases, and decreases as the number of increases, and decreases as the number of routing hops. routing hops. Fig.1 Fig.3 Fig.2 Fig.4 From accuracy and optimality of view, DCSS From accuracy and optimality of view, DCSS scheme is more accuracy to find routing access scheme is more accuracy to find routing access opportunity than other spectrum sensing opportunity than other spectrum sensing approaches. approaches. Simulation results suggest the benefit of using Simulation results suggest the benefit of using DCSS in CRAHNs is considerable. DCSS in CRAHNs is considerable. In the future work, we will investigate how to In the future work, we will investigate how to adapt metric to optimize the routing performance adapt metric to optimize the routing performance in dynamic CRAHNs. in dynamic CRAHNs. [ ] [ ] [ ] m m off m on m m m m on off on off ET u ET ET iv.Conclusions

Cooperative Spectrum-Aware Opportunistic Routing in Cognitive Radio Ad Hoc Networks

Embed Size (px)

DESCRIPTION

Cooperative Spectrum-Aware Opportunistic Routing in Cognitive Radio Ad Hoc Networks. ,. Cuimei Cui* † , Hong Man † , Yiming Wang* *School of Electronics and Information Engineering, Soochow University † Dept. of Electrical and Computer Engineering, Stevens Institute of Technology - PowerPoint PPT Presentation

Citation preview

Page 1: Cooperative Spectrum-Aware Opportunistic Routing in Cognitive Radio Ad Hoc Networks

Cooperative Spectrum-Aware Opportunistic Routing in Cooperative Spectrum-Aware Opportunistic Routing in Cognitive Radio Ad Hoc NetworksCognitive Radio Ad Hoc Networks

Cuimei Cui*Cuimei Cui* † †, Hong Man, Hong Man†† , Yiming Wang* , Yiming Wang*

*School of Electronics and Information Engineering, Soochow University*School of Electronics and Information Engineering, Soochow University†† Dept. of Electrical and Computer Engineering, Stevens Institute of TechnologyDept. of Electrical and Computer Engineering, Stevens Institute of Technology

[email protected], [email protected], [email protected]@126.com, [email protected], [email protected]

I. Motivations & Contributions

MotivationsMotivations Cognitive radio (CR) technology has been recognized as an Cognitive radio (CR) technology has been recognized as an

viable solution to counteract both viable solution to counteract both spectrum inefficiency spectrum inefficiency andand spectrum scarcity spectrum scarcity problems.problems.

To fully unleash the potentials of CR Ad Hoc networks To fully unleash the potentials of CR Ad Hoc networks (CRAHNs), new challenges must be addressed at the network (CRAHNs), new challenges must be addressed at the network layer by tightly coupling with layer by tightly coupling with physical layer spectrum sensing physical layer spectrum sensing and and MAC layer spectrum sharingMAC layer spectrum sharing, taking into account the unique , taking into account the unique properties of the cognitive environment.properties of the cognitive environment.

How to extend opportunistic routing adopting cooperative How to extend opportunistic routing adopting cooperative spectrum sensing technology is still an open research issue.spectrum sensing technology is still an open research issue.

ContributionsContributions Propose a Dual-stage Collaborative Spectrum Sensing (DCSS) Propose a Dual-stage Collaborative Spectrum Sensing (DCSS)

routing protocol to discover the established routing opportunity.routing protocol to discover the established routing opportunity.

Metrics of cooperative spectrum-aware opportunistic routing Metrics of cooperative spectrum-aware opportunistic routing were defined and derivedwere defined and derived

Evaluate the performance of the proposed routing protocol in Evaluate the performance of the proposed routing protocol in CRAHNs. CRAHNs.

II. Opportunistic Cognitive Routing Protocol

Network ModelNetwork Model

Model the CRAHN with a direct temporal graph:Model the CRAHN with a direct temporal graph:

Vertex denotes an CR routing node or an CR sensing Vertex denotes an CR routing node or an CR sensing relay, and an edge denotes the routing link from CR relay, and an edge denotes the routing link from CR node Unode Uii to U to Uj j at t time . at t time .

If PU is not active, the route with the minimum hop count and If PU is not active, the route with the minimum hop count and the longest single-hop distance Uthe longest single-hop distance Uss-U-Uii-U-Ujj-U-Udd will be established. will be established.

Otherwise, the route with a higher hop count, as shown in Otherwise, the route with a higher hop count, as shown in dashed line, will be selected.dashed line, will be selected.

Channel SensingChannel Sensing The occupancy rate of PU at m-th channel,The occupancy rate of PU at m-th channel,

The transition probability after a duration of for Ui in The transition probability after a duration of for Ui in busy(ON) state,busy(ON) state,

(t) (U,E(t))G

, SRi iU U

( ) ( )ije t E t

The probability that a channel at UThe probability that a channel at Uii stays in busy state during stays in busy state during

the sensing period tthe sensing period tss adopting DCSS scheme, adopting DCSS scheme,

Path SelectionPath Selection The successful routing probability between UThe successful routing probability between U i i and Uand Ujj in the in the

channel m,channel m,

Select the optimal channel as routing path,Select the optimal channel as routing path,

The successful routing opportunity of the pathThe successful routing opportunity of the path

1 mon 1 m

off

( )

, ( )

, if H =0( )

(1 ) , if H =1

m m moff on

m m mioff on

tm m mm mbusy U tm m m

u u ep t

u u e

mt

The mean time of PU in ON /OFF state is /

on, , 1

1 ,

0 0

(t ) ( ) ( ( ( ,1 , (1 ))

(1 ( ,1 , (1 )) )) (1 ( ))

( ( ,1, ) (1 ( ,1, )) )

i i

i

Nm m m m m mU s busy U N m Ui SRi

m K

N m m mm Ui SRi busy U

Nm m N mN m m

m K

Q p t C P P

P P p t

C

,1

( ) ( ) (1 (1 ( )))j

km m mlink ij ij ic

j

p t t p t

,[1,N]

arg max{ ( )}mlink ij

mm p t

,1

( ) ( )n

msd link ij

x

p t p t

III. Performance Evaluation

,

Simulations are presented to evaluate the performance of Simulations are presented to evaluate the performance of cooperative spectrum-aware opportunistic routing in terms of cooperative spectrum-aware opportunistic routing in terms of accuracy and optimality.accuracy and optimality. Fig.1 & Fig.2 illustrate the routing breakage probability of Fig.1 & Fig.2 illustrate the routing breakage probability of

DCSS is more closer to the practical result than these of DCSS is more closer to the practical result than these of SCSS and NCS when selecting optimal relay.SCSS and NCS when selecting optimal relay.

Fig.2 & Fig.3 show that the longer the average time of a PU Fig.2 & Fig.3 show that the longer the average time of a PU is in ON state, the higher is the breakage probability of is in ON state, the higher is the breakage probability of end-to-end routing, the less is the opportunity of routing.end-to-end routing, the less is the opportunity of routing.

Fig.4 presents that the successful end-to-end opportunity Fig.4 presents that the successful end-to-end opportunity routing probability using the DCSS increases as the routing probability using the DCSS increases as the number of usable channels increases, and decreases as number of usable channels increases, and decreases as the number of routing hops.the number of routing hops.

Fig.1

Fig.3

Fig.2

Fig.4

From accuracy and optimality of view, DCSS scheme is more From accuracy and optimality of view, DCSS scheme is more accuracy to find routing access opportunity than other accuracy to find routing access opportunity than other spectrum sensing approaches.spectrum sensing approaches.

Simulation results suggest the benefit of using DCSS in Simulation results suggest the benefit of using DCSS in CRAHNs is considerable.CRAHNs is considerable.

In the future work, we will investigate how to adapt metric to In the future work, we will investigate how to adapt metric to optimize the routing performance in dynamic CRAHNs.optimize the routing performance in dynamic CRAHNs.

[ ]

[ ] [ ]

mmoffm on

m m m mon off on off

E Tu

E T E T

iv. Conclusions