Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Secrecy Analysis on Network Coding in Bidirectional Multibeam Satellite Communications
Show others and affiliations
2015 (English)In: IEEE Transactions on Information Forensics and Security, ISSN 1556-6013, E-ISSN 1556-6021, Vol. 10, no 9, p. 1862-1874Article in journal (Refereed) Published
Abstract [en]

Network coding is an efficient means to improve the spectrum efficiency of satellite communications. However, its resilience to eavesdropping attacks is not well understood. This paper studies the confidentiality issue in a bidirectional satellite network consisting of two mobile users who want to exchange message via a multibeam satellite using the XOR network coding protocol. We aim to maximize the sum secrecy rate by designing the optimal beamforming vector along with optimizing the return and forward link time allocation. The problem is nonconvex, and we find its optimal solution using semidefinite programming together with a 1-D search. For comparison, we also solve the sum secrecy rate maximization problem for a conventional reference scheme without using network coding. Simulation results using realistic system parameters demonstrate that the bidirectional scheme using network coding provides considerably higher secrecy rate compared with that of the conventional scheme. © 2005-2012 IEEE.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2015. Vol. 10, no 9, p. 1862-1874
Keywords [en]
mathematical programming;network coding;protocols;satellite communication;telecommunication security;1D search;XOR network coding protocol;bidirectional multibeam satellite communications;bidirectional satellite network;forward link time allocation;mobile user;optimal beamforming vector;return link time allocation;secrecy analysis;semidefinite programming;sum secrecy rate maximization problem;Array signal processing;Feeds;Network coding;Satellite broadcasting;Satellites;Security;Physical layer security;bidirectional satellite communications;network coding;secrecy rate;semidefinite programming
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-259147DOI: 10.1109/TIFS.2015.2432732ISI: 000358518300006Scopus ID: 2-s2.0-84937885696OAI: oai:DiVA.org:kth-259147DiVA, id: diva2:1350609
Note

QC 20191025

Available from: 2019-09-11 Created: 2019-09-11 Last updated: 2019-10-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Ottersten, Björn
In the same journal
IEEE Transactions on Information Forensics and Security
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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