Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networksi

Size: px
Start display at page:

Download "Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networksi"

Transcription

1 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networksi Zhuotao Liu 1, Xinbing Wang 1, Wentao Luan 1 and Songwu Lu 2 1 Department of Electronic Engineering Shanghai Jiao Tong University, China 2 Department of Computer Science University of California, Los Angeles June 15, 2012

2 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 2 Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

3 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Background Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

4 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 4 Background Cognitive Radio Networks Cognitive Radio (CR) Networks improved the spectrum efficiency. Primary users have priority to use spectra. Secondary users are opportunistic. Heterogeneity over time and space. Figure: Heterogeneity of CR networks

5 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 5 Background Delay of CR networks Delay or latency is a significant issue for the network architecture and design. Secondary network is suffering from delay penalty. Communication path may be impacted. Waiting for spectrum opportunities.

6 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 5 Background Delay of CR networks Delay or latency is a significant issue for the network architecture and design. Secondary network is suffering from delay penalty. Communication path may be impacted. Waiting for spectrum opportunities. What is the delay performance for secondary network in CR networks?

7 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 6 Background Related Works W. Ren et al., IT 2011 [11] Consider the dynamic connectivity in CR networks through Continuum Percolation Theory [1]. Overall connectivity in secondary network can be established if and only if λ S > λ S and λ PT < λ PT. Z. Kong et al., MOBIHOC 2008 [13] Study the latency in large scale homogenous networks through Subadditive Ergodic Theorem [2]. Delay is ignorable in supercritical network whereas it scales lineally with distance in subcritical network. S. Zhao et al., MOBICOM 2011 [14] Get the more precise description of the delay to distance ration. Great mathematical analysis and excellent simulation work.

8 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 7 Motivation Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

9 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 8 Motivation Motivation All the previous related work failed to consider the heterogeneity of network while studying the delay. What effect the arbitrariness and diversity of primary network will impose on the performance of secondary network? Is it possible to find a more precise description of the delay to distance ratio?

10 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 8 Motivation Motivation All the previous related work failed to consider the heterogeneity of network while studying the delay. What effect the arbitrariness and diversity of primary network will impose on the performance of secondary network? Is it possible to find a more precise description of the delay to distance ratio? How does the transmission delay scale with distance in large scale ad hoc CR networks?

11 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 9 Contributions Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

12 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Contributions Contributions Delay scaling is considered under both Boolean Model and Random Connection Model of continuum percolation theory [1]. More precise description of delay to distance ratio has been presented. the exact value, lower bound. Considerable amount of simulation has been conducted to verify the theoretical analysis.

13 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

14 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Network Model Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

15 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Network Model Primary Network Primary transmitters: Poisson Point Process P PT(t) with density λ PT. For one primary transmitter, its corresponding receivers are uniformly distributed within its transmission range R p. Time is slotted. Each primary transmitter is associated with an i.i.d. switching renewal process S P(t). E[Q 0 p(t)] β 0 lim Pr(SP(t) = 0) = t E[Q 0 p(t)] + E[Q 1 p(t)], E[Q 0 p(t)] β 1 lim Pr(SP(t) = 1) = t E[Q 0 p(t)] + E[Q 1 p(t)]. Primary network at time slot t: A P(λ PT; S P(t); R p). (A P for simplicity)

16 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Network Model Secondary Network Connection of two secondary nodes are modeled by BM or RCM. BM: connection function h(r) = 1, 0 < r r s. RCM: connection function 0 < f (r s) < f (r) < f (0) < 1, 0 < r < r s. Conditions for the openness of a path π between two secondary nodes. π is established through multiple links; messages can be forwarded by other nodes in π to the destination (Ad-hoc network). G t(λ S; h(r); A P), G t(λ S; f (r); A P): CR networks modeled by BM and RCM, respectively.

17 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Percolation Definitions Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

18 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Percolation Definitions Percolation for CR Networks For G t(λ S; h(r); A P), the percolation probability p λ is the probability that the connected component containing the origin C 0 O has infinite secondary nodes. The critical density of secondary users is defined as λ c(h(r)) = inf{λ S > 0 : p λ > 0}. λ c(f (r)): percolation density for G t(λ S; f (r); A P). Lemma 1. Two critical percolation densities: λ c(f (r)) > λ c(h(r)).

19 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Percolation Definitions Percolation for CR Networks For G t(λ S; h(r); A P), the percolation probability p λ is the probability that the connected component containing the origin C 0 O has infinite secondary nodes. The critical density of secondary users is defined as λ c(h(r)) = inf{λ S > 0 : p λ > 0}. λ c(f (r)): percolation density for G t(λ S; f (r); A P). Lemma 1. Two critical percolation densities: λ c(f (r)) > λ c(h(r)). If λ S < λ c(h(r)), the secondary network is subcritical. If λ S > λ c(h(r)), the secondary network is supercritical. If λ PT < λ PT, it is com-supercritical. If λ PT > λ PT, it is top-supercritical.

20 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Percolation Definitions Subcritical Secondary Network C 0 O is broken into infinite number of mutually disconnected clusters even no interference from primary network is composed. Overall connectivity cannot be established over entire secondary network. Figure: Subcritical network: mutually disconnected clusters.

21 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Percolation Definitions Supercritical Secondary Network Com-supercritical: C 0 O still exists as λ PT is small. An open path between source and destination can be found over secondary network. Delay tends to zero if ignoring propagation delay. Figure: Com-supercritical network.

22 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 1 Percolation Definitions Supercritical Secondary Network Top-supercritical: C 0 O does not exist as λ PT is large. The open path between source and destination is interfered by primary network. Delay: waiting time for spectrum opportunities. Figure: Top-supercritical network.

23 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 2 Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

24 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 2 Supercritical Network Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

25 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 2 Supercritical Network G t (λ S ; h(r); A P ) If λ PT < λ PT(λ S) (com-supercritical), γ(λ S, A P) lim d(u,v) T (π) d(u,v) = 0 π is open and messages can be forwarded. If λ PT > λ PT(λ S) (top-supercritical), open pathes cannot be found. Spectrum-to-Hop process is provided: Computation Flow: Spectrum-to-Hop Process (SHP) 1: x, y P S(t), they share a linkage l(x, y) whenever d(x, y) r s. 2: Messages can be forwarded through l(x, y) when it has spectrum opportunities. 3: The expected delay before l(x, y) owning spectrum opportunities is E[l(x, y)]. 4: The minimum number of hops (linkages) in an open path π(u, v) is Q(u, v). 5: The scaling behavior of hops number Q(u, v) is Q(u,v) lim d(u,v) = κ. d(u,v) 6: Obtain γ(λ S, A P) = κ E[l(x, y)].

26 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 2 Supercritical Network G t (λ S ; h(r); A P ) Each link l k in a path is interfered by some primary users: I(l k ). Figure: Interfered region: I(l k ).

27 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 2 Supercritical Network G t (λ S ; h(r); A P ) Step 2: Interfered region I(l k ) for each link: 1. if R p r k 2, ψ = [2πR 2 p F(r k, R p )]λ PT, where F(r k, R p ) = 2R 2 p arccos r k 2R p r k 2. if R p < r k 2 ψ = 2πR 2 pλ PT. 4R 2 p r 2 k 2. The expected number of primary transmitters ψ within I(l k ): πr 2 pλ PT ψ [2πR 2 p F(r s, R p)]λ PT.

28 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 2 Supercritical Network G t (λ S ; h(r); A P ) Step 3: H k (t) = 0 if all the ψ primary transmitters within I(l k ) are sleep. Otherwise, H k (t) = 1. The expected delay for (l k ): T p(l k ) = inf t 0 {t : H k(t) = 0} = X n=0 n(1 β ψ 0 )n β ψ 0 = 1 βψ 0 β ψ 0.

29 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 2 Supercritical Network G t (λ S ; h(r); A P ) Step 4 and 5: (Lemma 3)The minimum number of hops Q(u, v) in one path π(u, v) scales linearly with the distance d(u, v). Q(u, v) lim d(u,v) d(u, v) = κ. The proof is investigated by [13] and [14] through subadditive ergodic theorem.

30 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 2 Supercritical Network G t (λ S ; h(r); A P ) Step 6: γ(λ S, A P) = lim d(u,v) T (π) d(u, v) = Q(u, v) E[T p(l k )] = lim d(u,v) d(u, v) = κ 1 βψ 0 β ψ 0. P Tp(l lim k ) d(u,v),k d(u, v)

31 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 2 Supercritical Network G t (λ S ; f (r); A P ) The most significant issue is to reveal the relationship between G t(λ S; h(r); A P) and G t(λ S; f (r); A P). We introduce the REP algorithm to prove that Lemma 3 still holds for G t(λ S; f (r); A P). Figure: REP algorithm.

32 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 2 Subcritical Network Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

33 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Subcritical Network Subcritical Network Messages cannot be disseminated among G t(λ S; h(r); A P). Mobility is necessary. Messages is forwarded through Multi-cluster Hop Transmission Process. Figure: Multi-cluster Hop Transmission Process.

34 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Subcritical Network Subcritical Network Delay is composed by waiting delay for both connectivity and spectrum opportunities: Delay = cluster to cluster transmission delay + waiting delay for spectrum opportunities = T P(Υ) + T S(Υ).

35 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Subcritical Network Subcritical Network Delay is composed by waiting delay for both connectivity and spectrum opportunities: Delay = cluster to cluster transmission delay + waiting delay for spectrum opportunities = T P(Υ) + T S(Υ). T P(Υ) d(u,v) 1 E[M h(r) (λ S,A P )+r s]. T S(Υ) d(u,v) 1 β η 0 β η 0 E[M h(r) (λ S,A P )+r s].

36 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Subcritical Network Subcritical Network Delay is composed by waiting delay for both connectivity and spectrum opportunities: Delay = cluster to cluster transmission delay + waiting delay for spectrum opportunities = T P(Υ) + T S(Υ). T P(Υ) d(u,v) 1 E[M h(r) (λ S,A P )+r s]. T S(Υ) d(u,v) 1 β η 0 β η 0 E[M h(r) (λ S,A P )+r s]. γ(λ S, A P) 1 β η 0 E[M h(r) (λ S,A P )+r s].

37 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Propagation Delay Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

38 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Propagation Delay Impact of propagation delay Assume that the propagation delays τ is the same for different links. For supercritical network, a constant is added as the delay. (i) γ(λ S, A P) = κτ if λ PT < λ PT(λ S); (ii) if λ PT > λ PT(λ S), γ(λ S, A P) = κ ( 1 βψ 0 β ψ 0 + τ) For subcritical network, the maximum size of one cluster is bounded by min{m h(r) (λ S, A P)}. γ(λ S, A P) 1 β η 0 E[min{M h(r)(λ S, A P), rs τ } + rs].

39 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Simulations Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

40 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Simulations Simulations Constant ψ and κ are got through simulation. Figure: Simulation for constant ψ and κ.

41 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Simulations Simulations γ(λ S, A P): delay to distance ratio. Figure: γ(λ S, A P ) converges to a constant. Figure: γ(λ S, A P ) increases with λ PT.

42 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Conclusions and Future Work Outline Background Motivation Contributions Network Model Percolation Definitions Supercritical Network Subcritical Network Propagation Delay Simulations Conclusions and Future Work

43 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Conclusions and Future Work Conclusions In this paper, we have studied the transmission delay in large scale ad hoc CR networks by analyzing the ratio of delay to distance γ(λ S, A P). For com-supercritical CR networks, γ(λ S, A P) = 0. For both top-supercritical G t(λ S;h(r);A P) and G t(λ S;f (r);a P), γ(λ S, A P) = κ 1 βψ 0 In the subcritical network, γ(λ S, A P) > 1 β η 0 E[M h(r) (λ S,A P )+r s]. Propagation has been investigated to generalize our results. We do considerable simulation to verify our theoretical analysis. β ψ 0.

44 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 3 Conclusions and Future Work Future work γ(λ S, A P) has not been investigated for subcritical RCM network. More precise description of γ(λ S, A P) for subcritical BM network. Capacity and delay tradeoff (Our MOBICOM 2012 submission).

45 Transmission Delay in Large Scale Ad Hoc Cognitive Radio Networks 4 Conclusions and Future Work Q&A Thank you!

Transport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks

Transport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks Transport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks Yi Sun Department of Electrical Engineering The City College of City University of New York Acknowledgement: supported

More information

Scaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users

Scaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users Scaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users Y.Li, X.Wang, X.Tian and X.Liu Shanghai Jiaotong University Scaling Laws for Cognitive Radio Network with Heterogeneous

More information

Throughput-optimal number of relays in delaybounded multi-hop ALOHA networks

Throughput-optimal number of relays in delaybounded multi-hop ALOHA networks Page 1 of 10 Throughput-optimal number of relays in delaybounded multi-hop ALOHA networks. Nekoui and H. Pishro-Nik This letter addresses the throughput of an ALOHA-based Poisson-distributed multihop wireless

More information

Minimum-Energy Multicast Tree in Cognitive Radio Networks

Minimum-Energy Multicast Tree in Cognitive Radio Networks TECHNICAL REPORT TR-09-04, UC DAVIS, SEPTEMBER 2009. 1 Minimum-Energy Multicast Tree in Cognitive Radio Networks Wei Ren, Xiangyang Xiao, Qing Zhao Abstract We address the multicast problem in cognitive

More information

Cooperative Spectrum Sharing in Cognitive Radio Networks: A Game-Theoretic Approach

Cooperative Spectrum Sharing in Cognitive Radio Networks: A Game-Theoretic Approach Cooperative Spectrum Sharing in Cognitive Radio Networks: A Game-Theoretic Approach Haobing Wang, Lin Gao, Xiaoying Gan, Xinbing Wang, Ekram Hossain 2. Department of Electronic Engineering, Shanghai Jiao

More information

Mobility and Fading: Two Sides of the Same Coin

Mobility and Fading: Two Sides of the Same Coin 1 Mobility and Fading: Two Sides of the Same Coin Zhenhua Gong and Martin Haenggi Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556, USA {zgong,mhaenggi}@nd.edu Abstract

More information

Opportunistic cooperation in wireless ad hoc networks with interference correlation

Opportunistic cooperation in wireless ad hoc networks with interference correlation Noname manuscript No. (will be inserted by the editor) Opportunistic cooperation in wireless ad hoc networks with interference correlation Yong Zhou Weihua Zhuang Received: date / Accepted: date Abstract

More information

Fast and efficient randomized flooding on lattice sensor networks

Fast and efficient randomized flooding on lattice sensor networks Fast and efficient randomized flooding on lattice sensor networks Ananth Kini, Vilas Veeraraghavan, Steven Weber Department of Electrical and Computer Engineering Drexel University November 19, 2004 presentation

More information

Time-Efficient Protocols for Neighbor Discovery in Wireless Ad Hoc Networks

Time-Efficient Protocols for Neighbor Discovery in Wireless Ad Hoc Networks 1 Time-Efficient Protocols for Neighbor Discovery in Wireless Ad Hoc Networks Guobao Sun, Student Member, IEEE, Fan Wu, Member, IEEE, Xiaofeng Gao, Member, IEEE, Guihai Chen, Member, IEEE, and Wei Wang,

More information

Achievable Transmission Capacity of Cognitive Radio Networks with Cooperative Relaying

Achievable Transmission Capacity of Cognitive Radio Networks with Cooperative Relaying Achievable Transmission Capacity of Cognitive Radio Networks with Cooperative Relaying Xiuying Chen, Tao Jing, Yan Huo, Wei Li 2, Xiuzhen Cheng 2, Tao Chen 3 School of Electronics and Information Engineering,

More information

Sequential Multi-Channel Access Game in Distributed Cognitive Radio Networks

Sequential Multi-Channel Access Game in Distributed Cognitive Radio Networks Sequential Multi-Channel Access Game in Distributed Cognitive Radio Networks Chunxiao Jiang, Yan Chen, and K. J. Ray Liu Department of Electrical and Computer Engineering, University of Maryland, College

More information

Natasha Devroye, Mai Vu, and Vahid Tarokh ] Cognitive Radio Networks. [Highlights of information theoretic limits, models, and design]

Natasha Devroye, Mai Vu, and Vahid Tarokh ] Cognitive Radio Networks. [Highlights of information theoretic limits, models, and design] [ Natasha Devroye, Mai Vu, and Vahid Tarokh ] Cognitive Radio Networks BRAND X PICTURES [Highlights of information theoretic limits, models, and design] In recent years, the development of intelligent,

More information

Information-Theoretic Study on Routing Path Selection in Two-Way Relay Networks

Information-Theoretic Study on Routing Path Selection in Two-Way Relay Networks Information-Theoretic Study on Routing Path Selection in Two-Way Relay Networks Shanshan Wu, Wenguang Mao, and Xudong Wang UM-SJTU Joint Institute, Shanghai Jiao Tong University, Shanghai, China Email:

More information

Chapter 10. User Cooperative Communications

Chapter 10. User Cooperative Communications Chapter 10 User Cooperative Communications 1 Outline Introduction Relay Channels User-Cooperation in Wireless Networks Multi-Hop Relay Channel Summary 2 Introduction User cooperative communication is a

More information

Stability Analysis for Network Coded Multicast Cell with Opportunistic Relay

Stability Analysis for Network Coded Multicast Cell with Opportunistic Relay This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 00 proceedings Stability Analysis for Network Coded Multicast

More information

Scaling Laws of Cognitive Networks

Scaling Laws of Cognitive Networks Scaling Laws of Cognitive Networks Mai Vu, 1 Natasha Devroye, 1, Masoud Sharif, and Vahid Tarokh 1 1 Harvard University, e-mail: maivu, ndevroye, vahid @seas.harvard.edu Boston University, e-mail: sharif@bu.edu

More information

Cooperative Tx/Rx Caching in Interference Channels: A Storage-Latency Tradeoff Study

Cooperative Tx/Rx Caching in Interference Channels: A Storage-Latency Tradeoff Study Cooperative Tx/Rx Caching in Interference Channels: A Storage-Latency Tradeoff Study Fan Xu Kangqi Liu and Meixia Tao Dept of Electronic Engineering Shanghai Jiao Tong University Shanghai China Emails:

More information

On the Transmission Capacity of Wireless Multi-Channel Ad Hoc Networks with local FDMA scheduling

On the Transmission Capacity of Wireless Multi-Channel Ad Hoc Networks with local FDMA scheduling On the Transmission Capacity of Wireless Multi-Channel Ad Hoc Networks with local FDMA scheduling Jens P. Elsner, Ralph Tanbourgi and Friedrich K. Jondral Karlsruhe Institute of Technology, Germany {jens.elsner,

More information

Spectrum Opportunity Detection: How Good Is Listen-before-Talk?

Spectrum Opportunity Detection: How Good Is Listen-before-Talk? Spectrum Opportunity Detection: How Good Is Listen-before-Talk? Qing Zhao, Wei Ren, Ananthram Swami qzhao@ece.ucdavis.edu, wren@ucdavis.edu, aswami@arl.army.mil Department of Electrical and Computer Engineering,

More information

Analysis of Interference in Cognitive Radio Networks with Unknown Primary Behavior

Analysis of Interference in Cognitive Radio Networks with Unknown Primary Behavior EEE CC 22 - Cognitive Radio and Networks Symposium Analysis of nterference in Cognitive Radio Networks with Unknown Primary Behavior Chunxiao Jiang, Yan Chen,K.J.RayLiu and Yong Ren Department of Electrical

More information

Antennas and Propagation. Chapter 6b: Path Models Rayleigh, Rician Fading, MIMO

Antennas and Propagation. Chapter 6b: Path Models Rayleigh, Rician Fading, MIMO Antennas and Propagation b: Path Models Rayleigh, Rician Fading, MIMO Introduction From last lecture How do we model H p? Discrete path model (physical, plane waves) Random matrix models (forget H p and

More information

Performance of ALOHA and CSMA in Spatially Distributed Wireless Networks

Performance of ALOHA and CSMA in Spatially Distributed Wireless Networks Performance of ALOHA and CSMA in Spatially Distributed Wireless Networks Mariam Kaynia and Nihar Jindal Dept. of Electrical and Computer Engineering, University of Minnesota Dept. of Electronics and Telecommunications,

More information

Phase Transition of Message Propagation Speed in Delay Tolerant Vehicular Networks

Phase Transition of Message Propagation Speed in Delay Tolerant Vehicular Networks Phase Transition of Message Propagation Speed in Delay Tolerant Vehicular Networks A. Agarwal, D. Starobinski, and T.D.C. Little Department of Electrical and Computer Engineering Boston University, Boston,

More information

arxiv: v1 [cs.ni] 30 Jan 2016

arxiv: v1 [cs.ni] 30 Jan 2016 Skolem Sequence Based Self-adaptive Broadcast Protocol in Cognitive Radio Networks arxiv:1602.00066v1 [cs.ni] 30 Jan 2016 Lin Chen 1,2, Zhiping Xiao 2, Kaigui Bian 2, Shuyu Shi 3, Rui Li 1, and Yusheng

More information

Antennas and Propagation. Chapter 6d: Diversity Techniques and Spatial Multiplexing

Antennas and Propagation. Chapter 6d: Diversity Techniques and Spatial Multiplexing Antennas and Propagation d: Diversity Techniques and Spatial Multiplexing Introduction: Diversity Diversity Use (or introduce) redundancy in the communications system Improve (short time) link reliability

More information

Efficient Method of Secondary Users Selection Using Dynamic Priority Scheduling

Efficient Method of Secondary Users Selection Using Dynamic Priority Scheduling Efficient Method of Secondary Users Selection Using Dynamic Priority Scheduling ABSTRACT Sasikumar.J.T 1, Rathika.P.D 2, Sophia.S 3 PG Scholar 1, Assistant Professor 2, Professor 3 Department of ECE, Sri

More information

Spectrum Management and Cognitive Radios Alessandro Guidotti, XXIV ciclo

Spectrum Management and Cognitive Radios Alessandro Guidotti, XXIV ciclo Bologna, 24-25/01/2012 Spectrum Management and Cognitive Radios Alessandro Guidotti, XXIV ciclo DEIS Fondazione Ugo Bordoni Is spectrum lacking? Command & Control spectrum allocation model Static spectrum

More information

Scaling Laws of Cognitive Networks

Scaling Laws of Cognitive Networks Scaling Laws of Cognitive Networks Invited Paper Mai Vu, 1 Natasha Devroye, 1, Masoud Sharif, and Vahid Tarokh 1 1 Harvard University, e-mail: maivu, ndevroye, vahid @seas.harvard.edu Boston University,

More information

Fig.1channel model of multiuser ss OSTBC system

Fig.1channel model of multiuser ss OSTBC system IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 1, Ver. V (Feb. 2014), PP 48-52 Cooperative Spectrum Sensing In Cognitive Radio

More information

Analysis of Multi-tier Uplink Cellular Networks with Energy Harvesting and Flexible Cell Association

Analysis of Multi-tier Uplink Cellular Networks with Energy Harvesting and Flexible Cell Association Analysis of Multi-tier Uplin Cellular Networs with Energy Harvesting and Flexible Cell Association Ahmed Hamdi Sar and Eram Hossain Abstract We model and analyze a K-tier uplin cellular networ with flexible

More information

Minimum-Latency Beaconing Schedule in Duty-Cycled Multihop Wireless Networks

Minimum-Latency Beaconing Schedule in Duty-Cycled Multihop Wireless Networks Minimum-Latency Beaconing Schedule in Duty-Cycled Multihop Wireless Networks Lixin Wang, Peng-Jun Wan, and Kyle Young Department of Mathematics, Sciences and Technology, Paine College, Augusta, GA 30901,

More information

Learning and Decision Making with Negative Externality for Opportunistic Spectrum Access

Learning and Decision Making with Negative Externality for Opportunistic Spectrum Access Globecom - Cognitive Radio and Networks Symposium Learning and Decision Making with Negative Externality for Opportunistic Spectrum Access Biling Zhang,, Yan Chen, Chih-Yu Wang, 3, and K. J. Ray Liu Department

More information

Maximum Throughput for a Cognitive Radio Multi-Antenna User with Multiple Primary Users

Maximum Throughput for a Cognitive Radio Multi-Antenna User with Multiple Primary Users Maximum Throughput for a Cognitive Radio Multi-Antenna User with Multiple Primary Users Ahmed El Shafie and Tamer Khattab Wireless Intelligent Networks Center (WINC), Nile University, Giza, Egypt. Electrical

More information

Low-Latency Multi-Source Broadcast in Radio Networks

Low-Latency Multi-Source Broadcast in Radio Networks Low-Latency Multi-Source Broadcast in Radio Networks Scott C.-H. Huang City University of Hong Kong Hsiao-Chun Wu Louisiana State University and S. S. Iyengar Louisiana State University In recent years

More information

How (Information Theoretically) Optimal Are Distributed Decisions?

How (Information Theoretically) Optimal Are Distributed Decisions? How (Information Theoretically) Optimal Are Distributed Decisions? Vaneet Aggarwal Department of Electrical Engineering, Princeton University, Princeton, NJ 08544. vaggarwa@princeton.edu Salman Avestimehr

More information

Interference and Outage in Doubly Poisson Cognitive Networks

Interference and Outage in Doubly Poisson Cognitive Networks 1 Interference and Outage in Doubly Poisson Cognitive Networks Chia-han Lee and Martin Haenggi clee14,mhaenggi}@nd.edu Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556,

More information

Dynamic Spectrum Access in Cognitive Radio Networks. Xiaoying Gan 09/17/2009

Dynamic Spectrum Access in Cognitive Radio Networks. Xiaoying Gan 09/17/2009 Dynamic Spectrum Access in Cognitive Radio Networks Xiaoying Gan xgan@ucsd.edu 09/17/2009 Outline Introduction Cognitive Radio Framework MAC sensing Spectrum Occupancy Model Sensing policy Access policy

More information

Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents

Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents Walid Saad, Zhu Han, Tamer Basar, Me rouane Debbah, and Are Hjørungnes. IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10,

More information

Clock Synchronization

Clock Synchronization Clock Synchronization Chapter 9 d Hoc and Sensor Networks Roger Wattenhofer 9/1 coustic Detection (Shooter Detection) Sound travels much slower than radio signal (331 m/s) This allows for quite accurate

More information

Multi-Radio Channel Detecting Jamming Attack Against Enhanced Jump-Stay Based Rendezvous in Cognitive Radio Networks

Multi-Radio Channel Detecting Jamming Attack Against Enhanced Jump-Stay Based Rendezvous in Cognitive Radio Networks Multi-Radio Channel Detecting Jamming Attack Against Enhanced Jump-Stay Based Rendezvous in Cognitive Radio Networks Yang Gao 1, Zhaoquan Gu 1, Qiang-Sheng Hua 2, Hai Jin 2 1 Institute for Interdisciplinary

More information

Color of Interference and Joint Encoding and Medium Access in Large Wireless Networks

Color of Interference and Joint Encoding and Medium Access in Large Wireless Networks Color of Interference and Joint Encoding and Medium Access in Large Wireless Networks Nithin Sugavanam, C. Emre Koksal, Atilla Eryilmaz Department of Electrical and Computer Engineering The Ohio State

More information

Diversity and Freedom: A Fundamental Tradeoff in Multiple Antenna Channels

Diversity and Freedom: A Fundamental Tradeoff in Multiple Antenna Channels Diversity and Freedom: A Fundamental Tradeoff in Multiple Antenna Channels Lizhong Zheng and David Tse Department of EECS, U.C. Berkeley Feb 26, 2002 MSRI Information Theory Workshop Wireless Fading Channels

More information

A Backlog-Based CSMA Mechanism to Achieve Fairness and Throughput-Optimality in Multihop Wireless Networks

A Backlog-Based CSMA Mechanism to Achieve Fairness and Throughput-Optimality in Multihop Wireless Networks A Backlog-Based CSMA Mechanism to Achieve Fairness and Throughput-Optimality in Multihop Wireless Networks Peter Marbach, and Atilla Eryilmaz Dept. of Computer Science, University of Toronto Email: marbach@cs.toronto.edu

More information

Multihop Routing in Ad Hoc Networks

Multihop Routing in Ad Hoc Networks Multihop Routing in Ad Hoc Networks Dr. D. Torrieri 1, S. Talarico 2 and Dr. M. C. Valenti 2 1 U.S Army Research Laboratory, Adelphi, MD 2 West Virginia University, Morgantown, WV Nov. 18 th, 20131 Outline

More information

Interference Model for Cognitive Coexistence in Cellular Systems

Interference Model for Cognitive Coexistence in Cellular Systems Interference Model for Cognitive Coexistence in Cellular Systems Theodoros Kamakaris, Didem Kivanc-Tureli and Uf Tureli Wireless Network Security Center Stevens Institute of Technology Hoboken, NJ, USA

More information

Imperfect Monitoring in Multi-agent Opportunistic Channel Access

Imperfect Monitoring in Multi-agent Opportunistic Channel Access Imperfect Monitoring in Multi-agent Opportunistic Channel Access Ji Wang Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements

More information

Efficiency and detectability of random reactive jamming in wireless networks

Efficiency and detectability of random reactive jamming in wireless networks Efficiency and detectability of random reactive jamming in wireless networks Ni An, Steven Weber Modeling & Analysis of Networks Laboratory Drexel University Department of Electrical and Computer Engineering

More information

BANDWIDTH-PERFORMANCE TRADEOFFS FOR A TRANSMISSION WITH CONCURRENT SIGNALS

BANDWIDTH-PERFORMANCE TRADEOFFS FOR A TRANSMISSION WITH CONCURRENT SIGNALS BANDWIDTH-PERFORMANCE TRADEOFFS FOR A TRANSMISSION WITH CONCURRENT SIGNALS Aminata A. Garba Dept. of Electrical and Computer Engineering, Carnegie Mellon University aminata@ece.cmu.edu ABSTRACT We consider

More information

Generalized Signal Alignment For MIMO Two-Way X Relay Channels

Generalized Signal Alignment For MIMO Two-Way X Relay Channels Generalized Signal Alignment For IO Two-Way X Relay Channels Kangqi Liu, eixia Tao, Zhengzheng Xiang and Xin Long Dept. of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China Emails:

More information

MULTI-HOP wireless networks consist of nodes with a

MULTI-HOP wireless networks consist of nodes with a IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 Minimum Latency Broadcast Scheduling in Duty-Cycled Multi-Hop Wireless Networks Xianlong Jiao, Student Member, IEEE, Wei Lou, Member, IEEE, Junchao

More information

Cooperative Diversity Routing in Wireless Networks

Cooperative Diversity Routing in Wireless Networks Cooperative Diversity Routing in Wireless Networks Mostafa Dehghan, Majid Ghaderi, and Dennis L. Goeckel Department of Computer Science, University of Calgary, Emails: {mdehghan, mghaderi}@ucalgary.ca

More information

Bandwidth-SINR Tradeoffs in Spatial Networks

Bandwidth-SINR Tradeoffs in Spatial Networks Bandwidth-SINR Tradeoffs in Spatial Networks Nihar Jindal University of Minnesota nihar@umn.edu Jeffrey G. Andrews University of Texas at Austin jandrews@ece.utexas.edu Steven Weber Drexel University sweber@ece.drexel.edu

More information

Base Station Cooperation for Energy Efficiency: A Gauss-Poisson Process Approach

Base Station Cooperation for Energy Efficiency: A Gauss-Poisson Process Approach Base Station Cooperation for Energy Efficiency: A Gauss-Poisson Process Approach Pengcheng Qiao, Yi Zhong and Wenyi Zhang, Senior Member, IEEE Abstract Base station cooperation is an effective means of

More information

On Collision-Tolerant Transmission with Directional Antennas

On Collision-Tolerant Transmission with Directional Antennas Macau University of Science and Technology From the SelectedWorks of Hong-Ning Dai 28 On Collision-Tolerant Transmission with Directional Antennas Hong-Ning Dai, Chinese University of Hong Kong Kam-Wing

More information

Cross-Layer Game Theoretic Mechanism for Tactical Mobile Networks

Cross-Layer Game Theoretic Mechanism for Tactical Mobile Networks Cross-Layer Game Theoretic Mechanism for Tactical Mobile Networks William J. Rogers Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of

More information

Performance study of node placement in sensor networks

Performance study of node placement in sensor networks Performance study of node placement in sensor networks Mika ISHIZUKA and Masaki AIDA NTT Information Sharing Platform Labs, NTT Corporation 3-9-, Midori-Cho Musashino-Shi Tokyo 8-8585 Japan {ishizuka.mika,

More information

Selective sensing and transmission for multi-channel cognitive radio networks

Selective sensing and transmission for multi-channel cognitive radio networks RESEARCH Selective sensing and transmission for multi-channel cognitive radio networks You Xu 1*, Yunzhou Li 2,4, Yifei Zhao 2, Hongxing Zou 1 and Athanasios V Vasilakos 3 Open Access Abstract In this

More information

Channel Probing in Communication Systems: Myopic Policies Are Not Always Optimal

Channel Probing in Communication Systems: Myopic Policies Are Not Always Optimal Channel Probing in Communication Systems: Myopic Policies Are Not Always Optimal Matt Johnston Massachusetts Institute of Technology Joint work with Eytan Modiano and Isaac Keslassy 07/11/13 Opportunistic

More information

Attack-Proof Collaborative Spectrum Sensing in Cognitive Radio Networks

Attack-Proof Collaborative Spectrum Sensing in Cognitive Radio Networks Attack-Proof Collaborative Spectrum Sensing in Cognitive Radio Networks Wenkai Wang, Husheng Li, Yan (Lindsay) Sun, and Zhu Han Department of Electrical, Computer and Biomedical Engineering University

More information

Routing versus Network Coding in Erasure Networks with Broadcast and Interference Constraints

Routing versus Network Coding in Erasure Networks with Broadcast and Interference Constraints Routing versus Network Coding in Erasure Networks with Broadcast and Interference Constraints Brian Smith Department of ECE University of Texas at Austin Austin, TX 7872 bsmith@ece.utexas.edu Piyush Gupta

More information

Improving Ad Hoc Networks Capacity and Connectivity Using Dynamic Blind Beamforming

Improving Ad Hoc Networks Capacity and Connectivity Using Dynamic Blind Beamforming Improving Ad Hoc Networks Capacity and Connectivity Using Dynamic Blind Beamforming Nadia Fawaz, Zafer Beyaztas, David Gesbert Mobile Communications Department, Eurecom Institute Sophia-Antipolis, France

More information

On the Unicast Capacity of Stationary Multi-channel Multi-radio Wireless Networks: Separability and Multi-channel Routing

On the Unicast Capacity of Stationary Multi-channel Multi-radio Wireless Networks: Separability and Multi-channel Routing 1 On the Unicast Capacity of Stationary Multi-channel Multi-radio Wireless Networks: Separability and Multi-channel Routing Liangping Ma arxiv:0809.4325v2 [cs.it] 26 Dec 2009 Abstract The first result

More information

Near-Optimal Radio Use For Wireless Network Synch. Synchronization

Near-Optimal Radio Use For Wireless Network Synch. Synchronization Near-Optimal Radio Use For Wireless Network Synchronization LANL, UCLA 10th of July, 2009 Motivation Consider sensor network: tiny, inexpensive embedded computers run complex software sense environmental

More information

Phase Transition of Message Propagation Speed in Delay Tolerant Vehicular Networks

Phase Transition of Message Propagation Speed in Delay Tolerant Vehicular Networks Phase Transition of Message Propagation Speed in Delay Tolerant Vehicular Networks Ashish Agarwal, David Starobinski and Thomas D.C. Little Abstract Delay tolerant network (DTN architectures have recently

More information

PHED: Pre-Handshaking Neighbor Discovery Protocols in Full Duplex Wireless Ad Hoc Networks

PHED: Pre-Handshaking Neighbor Discovery Protocols in Full Duplex Wireless Ad Hoc Networks PHED: Pre-Handshaking Neighbor Discovery Protocols in Full Duplex Wireless Ad Hoc Networks Guobao Sun, Fan Wu, Xiaofeng Gao, and Guihai Chen Shanghai Key Laboratory of Scalable Computing and Systems Department

More information

The Primary Exclusive Region in Cognitive Networks

The Primary Exclusive Region in Cognitive Networks The Primary Exclusive Region in Cognitive Networks Mai Vu, Natasha Devroye, and Vahid Tarokh Harvard University, e-mail: maivu, ndevroye, vahid @seas.harvard.edu Invited Paper) Abstract In this paper,

More information

On the Optimal SINR in Random Access Networks with Spatial Reuse

On the Optimal SINR in Random Access Networks with Spatial Reuse On the Optimal SINR in Random ccess Networks with Spatial Reuse Navid Ehsan and R. L. Cruz Department of Electrical and Computer Engineering University of California, San Diego La Jolla, C 9293 Email:

More information

A survey on broadcast protocols in multihop cognitive radio ad hoc network

A survey on broadcast protocols in multihop cognitive radio ad hoc network A survey on broadcast protocols in multihop cognitive radio ad hoc network Sureshkumar A, Rajeswari M Abstract In the traditional ad hoc network, common channel is present to broadcast control channels

More information

THE rapid growth of mobile traffic in recent years drives

THE rapid growth of mobile traffic in recent years drives Optimal Deployment of mall Cell for Maximizing Average m Rate in Ultra-dense Networks Yang Yang Member IEEE Linglong Dai enior Member IEEE Jianjun Li Richard MacKenzie and Mo Hao Abstract In future 5G

More information

Adaptive Rate Transmission for Spectrum Sharing System with Quantized Channel State Information

Adaptive Rate Transmission for Spectrum Sharing System with Quantized Channel State Information Adaptive Rate Transmission for Spectrum Sharing System with Quantized Channel State Information Mohamed Abdallah, Ahmed Salem, Mohamed-Slim Alouini, Khalid A. Qaraqe Electrical and Computer Engineering,

More information

Chapter 12. Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks

Chapter 12. Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks Chapter 12 Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks 1 Outline CR network (CRN) properties Mathematical models at multiple layers Case study 2 Traditional Radio vs CR Traditional

More information

Degrees of Freedom of Bursty Multiple Access Channels with a Relay

Degrees of Freedom of Bursty Multiple Access Channels with a Relay Fifty-third Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 29 - October 2, 205 Degrees of Freedom of Bursty Multiple Access Channels with a Relay Sunghyun im and Changho Suh Department

More information

Improved Throughput Scaling in Wireless Ad Hoc Networks With Infrastructure

Improved Throughput Scaling in Wireless Ad Hoc Networks With Infrastructure Improved Throughput Scaling in Wireless Ad Hoc Networks With Infrastructure Won-Yong Shin, Sang-Woon Jeon, Natasha Devroye, Mai H. Vu, Sae-Young Chung, Yong H. Lee, and Vahid Tarokh School of Electrical

More information

Optimal Rate-Diversity-Delay Tradeoff in ARQ Block-Fading Channels

Optimal Rate-Diversity-Delay Tradeoff in ARQ Block-Fading Channels Optimal Rate-Diversity-Delay Tradeoff in ARQ Block-Fading Channels Allen Chuang School of Electrical and Information Eng. University of Sydney Sydney NSW, Australia achuang@ee.usyd.edu.au Albert Guillén

More information

EasyChair Preprint. A User-Centric Cluster Resource Allocation Scheme for Ultra-Dense Network

EasyChair Preprint. A User-Centric Cluster Resource Allocation Scheme for Ultra-Dense Network EasyChair Preprint 78 A User-Centric Cluster Resource Allocation Scheme for Ultra-Dense Network Yuzhou Liu and Wuwen Lai EasyChair preprints are intended for rapid dissemination of research results and

More information

Networks: how Information theory met the space and time. Philippe Jacquet INRIA Ecole Polytechnique France

Networks: how Information theory met the space and time. Philippe Jacquet INRIA Ecole Polytechnique France Networks: how Information theory met the space and time Philippe Jacquet INRIA Ecole Polytechnique France Plan of the talk History of networking and telecommunication Physics, mathematics, computer science

More information

Antonis Panagakis, Athanasios Vaios, Ioannis Stavrakakis.

Antonis Panagakis, Athanasios Vaios, Ioannis Stavrakakis. Study of Two-Hop Message Spreading in DTNs Antonis Panagakis, Athanasios Vaios, Ioannis Stavrakakis WiOpt 2007 5 th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless

More information

Cognitive Radio: From Theory to Practical Network Engineering

Cognitive Radio: From Theory to Practical Network Engineering 1 Cognitive Radio: From Theory to Practical Network Engineering Ekram Hossain 1, Long Le 2, Natasha Devroye 3, and Mai Vu 4 1 Department of Electrical and Computer Engineering, University of Manitoba ekram@ee.umanitoba.ca

More information

Analysis of massive MIMO networks using stochastic geometry

Analysis of massive MIMO networks using stochastic geometry Analysis of massive MIMO networks using stochastic geometry Tianyang Bai and Robert W. Heath Jr. Wireless Networking and Communications Group Department of Electrical and Computer Engineering The University

More information

Randomized Channel Access Reduces Network Local Delay

Randomized Channel Access Reduces Network Local Delay Randomized Channel Access Reduces Network Local Delay Wenyi Zhang USTC Joint work with Yi Zhong (Ph.D. student) and Martin Haenggi (Notre Dame) 2013 Joint HK/TW Workshop on ITC CUHK, January 19, 2013 Acknowledgement

More information

PHED: Pre-Handshaking Neighbor Discovery Protocols in Full Duplex Wireless Ad Hoc Networks

PHED: Pre-Handshaking Neighbor Discovery Protocols in Full Duplex Wireless Ad Hoc Networks Globecom 212 - Ad Hoc and Sensor Networking Symposium PHED: Pre-Handshaking Neighbor Discovery Protocols in Full Duplex Wireless Ad Hoc Networks Guobao Sun, Fan Wu, Xiaofeng Gao, and Guihai Chen Shanghai

More information

Strongly nonlinear elliptic problem without growth condition

Strongly nonlinear elliptic problem without growth condition 2002-Fez conference on Partial Differential Equations, Electronic Journal of Differential Equations, Conference 09, 2002, pp 41 47. http://ejde.math.swt.edu or http://ejde.math.unt.edu ftp ejde.math.swt.edu

More information

Relay Scheduling and Interference Cancellation for Quantize-Map-and-Forward Cooperative Relaying

Relay Scheduling and Interference Cancellation for Quantize-Map-and-Forward Cooperative Relaying 013 IEEE International Symposium on Information Theory Relay Scheduling and Interference Cancellation for Quantize-Map-and-Forward Cooperative Relaying M. Jorgovanovic, M. Weiner, D. Tse and B. Nikolić

More information

Control issues in cognitive networks. Marko Höyhtyä and Tao Chen CWC-VTT-Gigaseminar 4th December 2008

Control issues in cognitive networks. Marko Höyhtyä and Tao Chen CWC-VTT-Gigaseminar 4th December 2008 Control issues in cognitive networks Marko Höyhtyä and Tao Chen CWC-VTT-Gigaseminar 4th December 2008 Outline Cognitive wireless networks Cognitive mesh Topology control Frequency selection Power control

More information

arxiv: v1 [cs.it] 12 Jan 2011

arxiv: v1 [cs.it] 12 Jan 2011 On the Degree of Freedom for Multi-Source Multi-Destination Wireless Networ with Multi-layer Relays Feng Liu, Chung Chan, Ying Jun (Angela) Zhang Abstract arxiv:0.2288v [cs.it] 2 Jan 20 Degree of freedom

More information

Relay Selection and Scheduling for Millimeter Wave Backhaul in Urban Environments

Relay Selection and Scheduling for Millimeter Wave Backhaul in Urban Environments 2017 IEEE 14th International Conference on Mobile Ad Hoc and Sensor Systems Relay Selection and Scheduling for Millimeter Wave Backhaul in Urban Environments Qiang Hu and Douglas M. Blough School of Electrical

More information

Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks

Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks Yu Wang Weizhao Wang Xiang-Yang Li Wen-Zhan Song Abstract We study efficient interference-aware joint routing and

More information

Analysis of k-hop Connectivity Probability in 2-D Wireless Networks with Infrastructure Support

Analysis of k-hop Connectivity Probability in 2-D Wireless Networks with Infrastructure Support Analysis of k-hop Connectivity Probability in 2-D Wireless Networks with Infrastructure Support Seh Chun Ng and Guoqiang Mao School of Electrical and Information Engineering, The University of Sydney,

More information

How Much Improvement Can We Get From Partially Overlapped Channels?

How Much Improvement Can We Get From Partially Overlapped Channels? How Much Improvement Can We Get From Partially Overlapped Channels? Zhenhua Feng and Yaling Yang Department of Electrical and Computer Engineering Virginia Polytechnic and State University, Blacksburg,

More information

Topology Analysis of Wireless Sensor Networks for Sandstorm Monitoring

Topology Analysis of Wireless Sensor Networks for Sandstorm Monitoring University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln CSE Conference and Workshop Papers Computer Science and Engineering, Department of 2011 Topology Analysis of Wireless Sensor

More information

Index Terms Deterministic channel model, Gaussian interference channel, successive decoding, sum-rate maximization.

Index Terms Deterministic channel model, Gaussian interference channel, successive decoding, sum-rate maximization. 3798 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 58, NO 6, JUNE 2012 On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels Yue Zhao, Member, IEEE, Chee Wei Tan, Member,

More information

FULL-DUPLEX COGNITIVE RADIO: ENHANCING SPECTRUM USAGE MODEL

FULL-DUPLEX COGNITIVE RADIO: ENHANCING SPECTRUM USAGE MODEL FULL-DUPLEX COGNITIVE RADIO: ENHANCING SPECTRUM USAGE MODEL Abhinav Lall 1, O. P. Singh 2, Ashish Dixit 3 1,2,3 Department of Electronics and Communication Engineering, ASET. Amity University Lucknow Campus.(India)

More information

Permutations with short monotone subsequences

Permutations with short monotone subsequences Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2,..., n 2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres

More information

Non-Orthogonal Multiple Access (NOMA) in 5G Cellular Downlink and Uplink: Achievements and Challenges

Non-Orthogonal Multiple Access (NOMA) in 5G Cellular Downlink and Uplink: Achievements and Challenges Non-Orthogonal Multiple Access (NOMA) in 5G Cellular Downlink and Uplink: Achievements and Challenges Presented at: Huazhong University of Science and Technology (HUST), Wuhan, China S.M. Riazul Islam,

More information

Cognitive Relaying and Opportunistic Spectrum Sensing in Unlicensed Multiple Access Channels

Cognitive Relaying and Opportunistic Spectrum Sensing in Unlicensed Multiple Access Channels Cognitive Relaying and Opportunistic Spectrum Sensing in Unlicensed Multiple Access Channels Jonathan Gambini 1, Osvaldo Simeone 2 and Umberto Spagnolini 1 1 DEI, Politecnico di Milano, Milan, I-20133

More information

Two Models for Noisy Feedback in MIMO Channels

Two Models for Noisy Feedback in MIMO Channels Two Models for Noisy Feedback in MIMO Channels Vaneet Aggarwal Princeton University Princeton, NJ 08544 vaggarwa@princeton.edu Gajanana Krishna Stanford University Stanford, CA 94305 gkrishna@stanford.edu

More information

Understanding the Flooding in Low-Duty-Cycle Wireless Sensor Networks

Understanding the Flooding in Low-Duty-Cycle Wireless Sensor Networks International Conference on Parallel Processing Understanding the Flooding in Low-Duty-Cycle Wireless Sensor Networks Zhenjiang Li,MoLi, Junliang Liu, and Shaojie Tang School of Computer Engineering, Nanyang

More information

Power Control and Resource Allocation for QoS-Constrained Wireless Networks

Power Control and Resource Allocation for QoS-Constrained Wireless Networks Power Control and Resource Allocation for QoS-Constrained Wireless Networks Ziqiang Feng Computer Laboratory University of Cambridge This dissertation is submitted for the degree of Doctor of Philosophy

More information

Wireless Network Coding with Local Network Views: Coded Layer Scheduling

Wireless Network Coding with Local Network Views: Coded Layer Scheduling Wireless Network Coding with Local Network Views: Coded Layer Scheduling Alireza Vahid, Vaneet Aggarwal, A. Salman Avestimehr, and Ashutosh Sabharwal arxiv:06.574v3 [cs.it] 4 Apr 07 Abstract One of the

More information

Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks

Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks J Comb Optim 2015) 29:815 835 DOI 10.1007/s10878-013-9623-y Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks Zhipeng Cai Yueming Duan Anu G. Bourgeois Published

More information