Throughput maximization in multi-hop wireless networks under a secrecy constraint

dc.contributor.authorNardelli, Pedro H.J.
dc.contributor.authorAlves, Hirley
dc.contributor.authorde Lima, Carlos H.M. [UNESP]
dc.contributor.authorLatva-aho, Matti
dc.contributor.institutionUniversity of Oulu
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2018-12-11T16:43:11Z
dc.date.available2018-12-11T16:43:11Z
dc.date.issued2016-11-09
dc.description.abstractThis paper analyzes the achievable throughput of multi-hop sensor networks for industrial applications under a secrecy constraint and malicious jamming. The evaluation scenario comprises sensors that measure some relevant information of the plant that is first processed by an aggregator node and then sent to the control unit. To reach the control unit, a message may travel through relay nodes, which form a multi-hop wireless link. At every hop, eavesdropper nodes attempt to acquire the messages transmitted through the legitimate link. The communication design problem posed here is how to maximize the multi-hop throughput from the aggregator to the control unit by finding the best combination of relay positions (i.e. hop length: short or long) and coding rates (i.e. high or low spectral efficiency) so that the secrecy constraint is satisfied. Using a stochastic-geometry formulation, we show that the optimal choice of coding rate is normally high and depends on the path-loss exponent only, while a greater number of shorter hops are preferable to smaller number of longer hops in any situation. For the investigated scenarios, we prove that the optimal throughput subject to the secrecy constraint achieves the unconstrained optimal performance – if a feasible solution exists.en
dc.description.affiliationDepto. of Communications Engineering (DCE) Centre for Wireless Communications (CWC) University of Oulu
dc.description.affiliationSão Paulo State University (UNESP), São João da Boa Vista
dc.description.affiliationUnespSão Paulo State University (UNESP), São João da Boa Vista
dc.format.extent13-20
dc.identifierhttp://dx.doi.org/10.1016/j.comnet.2016.06.020
dc.identifier.citationComputer Networks, v. 109, p. 13-20.
dc.identifier.doi10.1016/j.comnet.2016.06.020
dc.identifier.file2-s2.0-84978427883.pdf
dc.identifier.issn1389-1286
dc.identifier.scopus2-s2.0-84978427883
dc.identifier.urihttp://hdl.handle.net/11449/168811
dc.language.isoeng
dc.relation.ispartofComputer Networks
dc.relation.ispartofsjr0,500
dc.rights.accessRightsAcesso aberto
dc.sourceScopus
dc.subjectMachine-to-machine communications
dc.subjectMulti-hop wireless networks
dc.subjectSecurity and jamming
dc.subjectStochastic geometry
dc.subjectThroughput
dc.titleThroughput maximization in multi-hop wireless networks under a secrecy constrainten
dc.typeArtigo

Arquivos

Pacote Original
Agora exibindo 1 - 1 de 1
Carregando...
Imagem de Miniatura
Nome:
2-s2.0-84978427883.pdf
Tamanho:
812.48 KB
Formato:
Adobe Portable Document Format
Descrição:

Coleções