Joao Barros

Joao Barros

Auto-generated profile, based on publicly available information

Joao Barros

Instituto de Telecomunicações, FEUP DEEC, University of Porto, Portugal

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 May 2008 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MBMatthieu Bloch
Matthieu Bloch
JBJoão Barros
João Barros
MRMiguel R. D. Rodrigues
Miguel R. D. Rodrigues
SMSteven W. McLaughlin
Steven W. McLaughlin
This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of fading is characterized in terms of average secure communication rates and outage probability. Based on the insights from this analysis, a practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security: (i) common randomness via opportunistic transmission, (ii) message reconciliation, (iii) common key generation via privacy amplification, and (iv) message protection with a secret key. A reconciliation procedure based on multilevel coding and optimized low-density parity-check (LDPC) codes is introduced, which allows to achieve communication rates close to the fundamental security limits in several relevant instances. Finally, a set of metrics for assessing average secure key generation rates is established, and it is shown that the protocol is effective in secure key renewal-even in the presence of imperfect channel state information.

22 September 2011
Verified
Book
Closed access
MBMatthieu Bloch
Matthieu Bloch
JBJoão Barros
João Barros
This complete guide to physical-layer security presents the theoretical foundations, practical implementation, challenges and benefits of a groundbreaking new model for secure communication. Using a bottom-up approach from the link level all the way to end-to-end architectures, it provides essential practical tools that enable graduate students, industry professionals and researchers to build more secure systems by exploiting the noise inherent to communications channels. The book begins with a self-contained explanation of the information-theoretic limits of secure communications at the physical layer. It then goes on to develop practical coding schemes, building on the theoretical insights and enabling readers to understand the challenges and opportunities related to the design of physical layer security schemes. Finally, applications to multi-user communications and network coding are also included.

1 July 2006
Verified
Conference Paper
Closed access
JBJoao Barros
Joao Barros
MRMiguel R. D. Rodrigues
Miguel R. D. Rodrigues
We consider the transmission of confidential data over wireless channels with multiple communicating parties. Based on an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmission through another independent quasi-static fading channel, we define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading information-theoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver - fading thus turns out to be a friend and not a foe

30 December 2010 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
MBMate Boban
Mate Boban
TVTiago T. V. Vinhoza
Tiago T. V. Vinhoza
MFMichel Ferreira
Michel Ferreira
JBJoao Barros
Joao Barros
OTOzan K. Tonguz
Ozan K. Tonguz
A thorough understanding of the communications channel between vehicles is essential for realistic modeling of Vehicular Ad Hoc Networks (VANETs) and the development of related technology and applications. The impact of vehicles as obstacles on vehicle-to-vehicle (V2V) communication has been largely neglected in VANET research, especially in simulations. Useful models accounting for vehicles as obstacles must satisfy a number of requirements, most notably accurate positioning, realistic mobility patterns, realistic propagation characteristics, and manageable complexity. We present a model that satisfies all of these requirements. Vehicles are modeled as physical obstacles affecting the V2V communication. The proposed model accounts for vehicles as three-dimensional obstacles and takes into account their impact on the LOS obstruction, received signal power, and the packet reception rate. We utilize two real world highway datasets collected via stereoscopic aerial photography to test our proposed model, and we confirm the importance of modeling the effects of obstructing vehicles through experimental measurements. Our results show considerable obstruction of LOS due to vehicles. By obstructing the LOS, vehicles induce significant attenuation and packet loss. The algorithm behind the proposed model allows for computationally efficient implementation in VANET simulators. It is also shown that by modeling the vehicles as obstacles, significant realism can be added to existing simulators with clear implications on the design of upper layer protocols.

16 April 2014 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
MBMate Boban
Mate Boban
JBJoao Barros
Joao Barros
OTOzan K. Tonguz
Ozan K. Tonguz
Due to the dynamic nature of vehicular traffic and the road surroundings, vehicle-to-vehicle (V2V) propagation characteristics vary greatly on both small and large scale. Recent measurements have shown that both large static objects (e.g., buildings and foliage) and mobile objects (surrounding vehicles) have a profound impact on V2V communication. At the same time, system-level vehicular ad hoc network (VANET) simulators by and large employ simple statistical propagation models, which do not account for surrounding objects explicitly. We designed Geometry-based Efficient propagation Model for V2V communication (GEMV 2 ), which uses outlines of vehicles, buildings, and foliage to distinguish the following three types of links: line of sight (LOS), non-LOS (NLOS) due to vehicles, and NLOS due to static objects. For each link, GEMV 2 calculates the large-scale signal variations deterministically, whereas the small-scale signal variations are calculated stochastically based on the number and size of surrounding objects. We implement GEMV 2 in MATLAB and show that it scales well by using it to simulate radio propagation for city-wide networks with tens of thousands of vehicles on commodity hardware. We make the source code of GEMV 2 freely available. Finally, we validate GEMV 2 against extensive measurements performed in urban, suburban, highway, and open-space environments.

13 January 2011 in Proceedings of the IEEE
Verified
Journal Article
Open access
JSJay Kumar Sundararajan
Jay Kumar Sundararajan
DSDevavrat Shah
Devavrat Shah
MMMuriel Médard
Muriel Médard
SJSzymon Jakubczak
Szymon Jakubczak
MMMichael Mitzenmacher
Michael Mitzenmacher
JBJoão Barros
João Barros
The theory of network coding promises significant benefits in network performance, especially in lossy networks and in multicast and multipath scenarios. To realize these benefits in practice, we need to understand how coding across packets interacts with the acknowledgment (ACK)-based flow control mechanism that forms a central part of today's Internet protocols such as transmission control protocol (TCP). Current approaches such as rateless codes and batch-based coding are not compatible with TCP's retransmission and sliding-window mechanisms. In this paper, we propose a new mechanism called TCP/NC that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the source transmits random linear combinations of packets currently in the congestion window. At the heart of our scheme is a new interpretation of ACKs-the sink acknowledges every degree of freedom (i.e., a linear combination that reveals one unit of new information) even if it does not reveal an original packet immediately. Thus, our new TCP ACK rule takes into account the network coding operations in the lower layer and enables a TCP-compatible sliding-window approach to network coding. Coding essentially masks losses from the congestion control algorithm and allows TCP/NC to react smoothly to losses, resulting in a novel and effective approach for congestion control over lossy networks such as wireless networks. An important feature of our solution is that it allows intermediate nodes to perform re-encoding of packets, which is known to provide significant throughput gains in lossy networks and multicast scenarios. Simulations show that our scheme, with or without re-encoding inside the network, achieves much higher throughput compared to TCP over lossy wireless links. We present a real-world implementation of this protocol that addresses the practical aspects of incorporating network coding and decoding with TCP's window management mechanism. We work with TCP-Reno, which is a widespread and practical variant of TCP. Our implementation significantly advances the goal of designing a deployable, general, TCP-compatible protocol that provides the benefits of network coding.