Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cooperative Communication for Spatial Frequency Reuse Multihop Wireless Networks under Slow Rayleigh Fading
KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-2764-8099
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
2011 (English)In: 2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), New York: IEEE , 2011Conference paper, Published paper (Refereed)
Abstract [en]

Cooperative communication has been proposed as a means to increase the capacity of a wireless link by mitigating the path-loss, fading and shadowing effects of radio propagation. In this paper, we evaluate the efficiency of cooperative communication in large scale wireless networks under interference from simultaneous transmissions. Specifically, we consider tunable spatial reuse time division multiplexing and half-duplex decode-and-forward cooperative relaying on a hop-by-hop basis. We show that hop-by-hop cooperation improves the reliability of the transmissions particularly in the low-SINR or in the low-coding-rate regimes. Moreover, hop-by-hop cooperative relaying gains 15 - 20% more throughput compared to simple multihopping in the interference-limited regime, if the relay location and the reuse distance are jointly optimized.

Place, publisher, year, edition, pages
New York: IEEE , 2011.
Series
IEEE International Conference on Communications, ISSN 1550-3607
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-55285DOI: 10.1109/icc.2011.5962699ISI: 000296057101120Scopus ID: 2-s2.0-80052161350ISBN: 978-1-61284-233-2 (print)OAI: oai:DiVA.org:kth-55285DiVA: diva2:471173
Conference
IEEE International Conference on Communications (ICC) JUN 05-09, 2011 Kyoto, JAPAN
Projects
SRA TNG Network Layer Models
Funder
ICT - The Next Generation
Note
QC 20120102Available from: 2012-01-02 Created: 2012-01-02 Last updated: 2013-05-17Bibliographically approved
In thesis
1. Cooperative and Cognitive Communication in Wireless Networks
Open this publication in new window or tab >>Cooperative and Cognitive Communication in Wireless Networks
2013 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

In the last decade, significant efforts and progress have been made by both the industry and academia to meet the rapidly growing demand for wireless applications and services. To achieve more flexible, dynamic and intelligent use of the limited wireless spectrum, cooperative transmission and cognitive networking are proposed as two of the key technologies for the next generation wireless communication systems, such as Long-Term Evolution Advanced. Cooperative transmission techniques, such as cooperative relaying and Multiple-Input and Multiple-Output (MIMO) can increase spectrum efficiency by utilizing the diversity of wireless channels, while cognitive transmitters tune their transmission parameters according to the environment to optimize network level performance. In this thesis, we provide performance modeling and analysis of different cooperative and cognitive communication techniques to exploit their potential.

In the first part of the thesis, we investigate the performance of hop-by-hop cooperative communication on a multihop transmission path applying spatial reuse time division multiplexing, where interference from simultaneous transmissions exists. Based on the models, we compare the performance of hop-by-hop cooperation with the performance of traditional simple multihopping schemes, and give the regimes where hop-by-hop cooperation achieves significant gain. Considering random networks, we propose cooperative geographic routing, the integration of hop-by-hop cooperation with traditional geographic routing, and evaluate the effects of the topology knowledge range and the network density.

In the second part of the thesis, we discuss how cooperative transmission techniques can be utilized in cognitive and hierarchical spectrum sharing networks, where the primary users have transmission guarantees, and the coexisting secondary users need to be cognitive and adjust their transmissions in the shared spectrum bands to conform constraints from the primary users. We consider large-scale coexisting primary and secondary networks, where concurrent primary and secondary transmissions are allowed, and the secondary users provide cooperative relaying for the primary ones and control the interference at the primary receivers by tuning the probability of transmitting and by forming a primary exclusive region around each primary receiver within which all secondary users have to be silent. We define a unified analytic framework to model the performance of cooperative spectrum sharing and cognitive transmission control, characterize their achievable gains, and show that both of the networks have strong incentives to participate in the collaboration.

Finally, we investigate spectrum sharing networks where both primary and secondary users have stochastic packet arrival. Under the constraint that the performance of primary users does not degrade, we find the dilemma for the secondary users. That is, if a secondary user chooses to cooperate, it can transmit immediately even if the primary queue is not empty, but has additional costs for relaying primary packets, such as increased power consumption. We propose a dynamic cooperation scheme for the secondary user so that it can make sequential decision on whether to cooperate or not in each time slot based on the state of the network. We show that optimal sequential decision is necessary to efficiently trade off the cooperation cost and the packet delay of the secondary user.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2013. vii, 54 p.
Series
TRITA-EE, ISSN 1653-5146 ; 2013:18
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-122277 (URN)978-91-7501-731-0 (ISBN)
Public defence
2013-06-05, Q2, Osquldas väg 10, KTH, Stockholm, 10:00 (English)
Opponent
Supervisors
Note

QC 20130517

Available from: 2013-05-17 Created: 2013-05-16 Last updated: 2014-02-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Fodor, ViktoriaSkoglund, Mikael

Search in DiVA

By author/editor
Wang, LipingFodor, ViktoriaSkoglund, Mikael
By organisation
Communication NetworksACCESS Linnaeus CentreCommunication Theory
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 156 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf