TL;DR: This complete guide to physical-layer security presents the theoretical foundations, practical implementation, challenges and benefits of a groundbreaking new model for secure communication by exploiting the noise inherent to communications channels.
Abstract: 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.
TL;DR: This paper provides a systematic overview on CR networking and communications by looking at the key functions of the physical, medium access control (MAC), and network layers involved in a CR design and how these layers are crossly related.
Abstract: Cognitive radio (CR) is the enabling technology for supporting dynamic spectrum access: the policy that addresses the spectrum scarcity problem that is encountered in many countries. Thus, CR is widely regarded as one of the most promising technologies for future wireless communications. To make radios and wireless networks truly cognitive, however, is by no means a simple task, and it requires collaborative effort from various research communities, including communications theory, networking engineering, signal processing, game theory, software-hardware joint design, and reconfigurable antenna and radio-frequency design. In this paper, we provide a systematic overview on CR networking and communications by looking at the key functions of the physical (PHY), medium access control (MAC), and network layers involved in a CR design and how these layers are crossly related. In particular, for the PHY layer, we will address signal processing techniques for spectrum sensing, cooperative spectrum sensing, and transceiver design for cognitive spectrum access. For the MAC layer, we review sensing scheduling schemes, sensing-access tradeoff design, spectrum-aware access MAC, and CR MAC protocols. In the network layer, cognitive radio network (CRN) tomography, spectrum-aware routing, and quality-of-service (QoS) control will be addressed. Emerging CRNs that are actively developed by various standardization committees and spectrum-sharing economics will also be reviewed. Finally, we point out several open questions and challenges that are related to the CRN design.
TL;DR: This article offers a tutorial on several prevalent methods to enhance security at the physical layer in wireless networks based on their characteristic features into five categories, each of which is discussed in terms of two metrics.
Abstract: Wireless networking plays an extremely important role in civil and military applications. However, security of information transfer via wireless networks remains a challenging issue. It is critical to ensure that confidential data are accessible only to the intended users rather than intruders. Jamming and eavesdropping are two primary attacks at the physical layer of a wireless network. This article offers a tutorial on several prevalent methods to enhance security at the physical layer in wireless networks. We classify these methods based on their characteristic features into five categories, each of which is discussed in terms of two metrics. First, we compare their secret channel capacities, and then we show their computational complexities in exhaustive key search. Finally, we illustrate their security requirements via some examples with respect to these two metrics.
TL;DR: In this article, the theoretical foundations, practical implementation, challenges and benefits of a groundbreaking new model for secure communication are presented, using a bottom-up approach from the link level all the way to end-to-end architectures.
Abstract: 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.
TL;DR: A cooperative wireless network in the presence of one or more eavesdroppers, and node cooperation for achieving physical (PHY) layer based security is considered, and an analytical solution is obtained for the DF scheme with a single eavesdropper and the multivariate problem is reduced to a problem of one variable.
Abstract: We consider a cooperative wireless network in the presence of one or more eavesdroppers, and exploit node cooperation for achieving physical (PHY) layer based security. Two different cooperation schemes are considered. In the first scheme, cooperating nodes retransmit a weighted version of the source signal in a decode-and-forward (DF) fashion. In the second scheme, referred to as cooperative jamming (CJ), while the source is transmitting, cooperating nodes transmit weighted noise to confound the eavesdropper. We investigate two objectives: i) maximization of the achievable secrecy rate subject to a total power constraint and ii) minimization of the total power transmit power under a secrecy rate constraint. For the first design objective, we obtain the exact solution for the DF scheme for the case of a single or multiple eavasdroppers, while for the CJ scheme with a single eavesdropper we reduce the multivariate problem to a problem of one variable. For the second design objective, existing work introduces additional constraints in order to reduce the degree of difficulty, thus resulting in suboptimal solutions. Our work raises those constraints, and obtains either an analytical solution for the DF scheme with a single eavesdropper, or reduces the multivariate problem to a problem of one variable for the CJ scheme with a single eavesdropper. Numerical results are presented to illustrate the proposed results and compare them to existing work.
TL;DR: This correspondence studies cooperative jamming to increase the physical layer security of a wiretap fading channel via distributed relays and shows that the optimization problem can be solved using a combination of convex optimization and a one-dimensional search.
Abstract: This correspondence studies cooperative jamming (CJ) to increase the physical layer security of a wiretap fading channel via distributed relays. We first provide the feasible conditions on the positiveness of the secrecy rate and then show that the optimization problem can be solved using a combination of convex optimization and a one-dimensional search. Distributed implementation to realize the CJ solution and extension to deal with per group relays' power constraints are discussed.
TL;DR: Various defenses against the security threats in an optical network are discussed, including optical encryption, optical code-division multiple access (CDMA) confidentiality, self-healing survivable optical rings, anti-jamming, and optical steganography.
Abstract: The physical layer of an optical network is vulnerable to a variety of attacks, including jamming, physical infrastructure attacks, eavesdropping, and interception. As the demand for network capacity grows dramatically, the issue of securing the physical layer of optical network cannot be overlooked. In this survey paper, we discuss the security threats in an optical network as well as present several existing optical techniques to improve the security. In the first part of this paper, we discuss various types of security threats that could appear in the optical layer of an optical network, including jamming, physical infrastructure attacks, eavesdropping, and interception. Intensive research has focused on improving optical network security, in the above specific areas. Real-time processing of the optical signal is essential in order to integrate security functionality at the physical layer while not undermining the true value of optical communications, which is its speed. Optical layer security benefits from the unique properties of optical processing-instantaneous response, broadband operation, electromagnetic immunity, compactness, and low latency. In the second part of this paper, various defenses against the security threats outlined in this paper are discussed, including optical encryption, optical code-division multiple access (CDMA) confidentiality, self-healing survivable optical rings, anti-jamming, and optical steganography.
TL;DR: Reliable physical layer network coding takes this idea one step further: using judiciously chosen linear error-correcting codes, intermediate nodes in a wireless network can directly recover linear combinations of the packets from the observed noisy superpositions of transmitted signals.
Abstract: When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted interference. This property of the wireless medium is typically viewed as a hindrance to reliable communication over a network. However, using a recently developed coding strategy, interference can in fact be harnessed for network coding. In a wired network, (linear) network coding refers to each intermediate node taking its received packets, computing a linear combination over a finite field, and forwarding the outcome towards the destinations. Then, given an appropriate set of linear combinations, a destination can solve for its desired packets. For certain topologies, this strategy can attain significantly higher throughputs over routing-based strategies. Reliable physical layer network coding takes this idea one step further: using judiciously chosen linear error-correcting codes, intermediate nodes in a wireless network can directly recover linear combinations of the packets from the observed noisy superpositions of transmitted signals. Starting with some simple examples, this paper explores the core ideas behind this new technique and the possibilities it offers for communication over interference-limited wireless networks.
TL;DR: The use of a secrecy guard zone is shown to give a significant improvement on the throughput of networks with high security requirements, and the throughput cost of achieving a moderate level of security is quite low, while throughput must be significantly sacrificed to realize a highly secure network.
Abstract: This paper studies the throughput of large-scale decentralized wireless networks with physical layer security constraints. In particular, we are interested in the question of how much throughput needs to be sacrificed for achieving a certain level of security. We consider random networks where the legitimate nodes and the eavesdroppers are distributed according to independent two-dimensional Poisson point processes. The transmission capacity framework is used to characterize the area spectral efficiency of secure transmissions with constraints on both the quality of service (QoS) and the level of security. This framework illustrates the dependence of the network throughput on key system parameters, such as the densities of legitimate nodes and eavesdroppers, as well as the QoS and security constraints. One important finding is that the throughput cost of achieving a moderate level of security is quite low, while throughput must be significantly sacrificed to realize a highly secure network. We also study the use of a secrecy guard zone, which is shown to give a significant improvement on the throughput of networks with high security requirements.
TL;DR: This paper develops an optimal polynomial time algorithm, called ORA, that achieves the minimum data rate among all pairs in a cooperative ad hoc network environment, and gives a formal proof of optimality for ORA.
Abstract: Recently, cooperative communications, in the form of having each node equipped with a single antenna and exploit spatial diversity via some relay node's antenna, is shown to be a promising approach to increase data rates in wireless networks. Under this communication paradigm, the choice of a relay node (among a set of available relay nodes) is critical in the overall network performance. In this paper, we study the relay node assignment problem in a cooperative ad hoc network environment, where multiple source-destination pairs compete for the same pool of relay nodes in the network. Our objective is to assign the available relay nodes to different source-destination pairs so as to maximize the minimum data rate among all pairs. The main contribution of this paper is the development of an optimal polynomial time algorithm, called ORA, that achieves this objective. A novel idea in this algorithm is a "linear marking" mechanism, which maintains linear complexity of each iteration. We give a formal proof of optimality for ORA and use numerical results to demonstrate its capability.
TL;DR: It is shown that any system that relies on only using spreading code, and no other physical factors, to mitigate jamming must use at least codes, where is the number of jammers.
Abstract: Wireless communication systems are often susceptible to the jamming attack where adversaries attempt to overpower transmitted signals by injecting a high level of noise. Jamming is difficult to mitigate in broadcast networks because transmitting and receiving are inherently symmetric operations: A user that possesses the key to decode a transmission can also use that key to jam the transmission. We describe a code tree system that provides input to the physical layer and helps the physical layer circumvent jammers. In our system, the transmitter has more information than any proper subset of receivers. Each receiver cooperates with the transmitter to detect any jamming that affects that receiver. In the resulting system, each benign user is guaranteed to eliminate the impact of the attacker after some finite number of losses with arbitrarily high probability. We show that any system that relies on only using spreading code, and no other physical factors, to mitigate jamming must use at least j + 1 codes, where j is the number of jammers. We then propose an optimized scheme that is power-efficient: Each transmission is sent on at most 2j+1 codes simultaneously. Finally, we demonstrate that our scheme approaches the best possible performance by performing an extensive analysis of the system using both event-driven ns-2 and chip-accurate MATLAB simulations.
TL;DR: In this paper, an impairment aware network planning and operation tool (NPOT) is proposed to consider the impact of physical layer impairments in the planning of all-optical (and translucent) networks.
Abstract: Core optical networks using reconfigurable optical switches and tunable lasers appear to be on the road towards widespread deployment and could evolve to all-optical mesh networks in the coming future. Considering the impact of physical layer impairments in the planning and operation of all-optical (and translucent) networks is the main focus of the Dynamic Impairment Constraint Optical Networking (DICONET) project. The impairment aware network planning and operation tool (NPOT) is the main outcome of DICONET project, which is explained in detail in this paper. The key building blocks of the NPOT, consisting of network description repositories, the physical layer performance evaluator, the impairment aware routing and wavelength assignment engines, the component placement modules, failure handling, and the integration of NPOT in the control plane are the main contributions of this study. Besides, the experimental result of DICONET proposal for centralized and distributed control plane integration schemes and the performance of the failure handling in terms of restoration time is presented in this study.
TL;DR: In this article, the authors formulated an analytical framework for resource allocation in a downlink orthogonal frequency-division multiple access (OFDMA)-based broadband network with coexistence of secure users (SUs) and normal users (NUs).
Abstract: Providing physical-layer security for mobile users in future broadband wireless networks is of both theoretical and practical importance. In this paper, we formulate an analytical framework for resource allocation in a downlink orthogonal frequency-division multiple access (OFDMA)-based broadband network with coexistence of secure users (SUs) and normal users (NUs). The SUs require secure data transmission at the physical layer while the NUs are served with conventional best-effort data traffic. The problem is formulated as joint power and subcarrier allocation with the objective of maximizing average aggregate information rate of all NUs while maintaining an average secrecy rate for each individual SU under a total transmit power constraint for the base station. We solve this problem in an asymptotically optimal manner using dual decomposition. Our analysis shows that an SU becomes a candidate competing for a subcarrier only if its channel gain on this subcarrier is the largest among all and exceeds the second largest by a certain threshold. Furthermore, while the power allocation for NUs follows the conventional water-filling principle, the power allocation for SUs depends on both its own channel gain and the largest channel gain among others. We also develop a suboptimal algorithm to reduce the computational cost. Numerical studies are conducted to evaluate the performance of the proposed algorithms in terms of the achievable pair of information rate for NU and secrecy rate for SU at different power consumptions.
TL;DR: A hierarchical cooperative relay-based heterogeneous network (HCRHeNet) to support both unicast and multicast services, where hierarchical Cooperative relay nodes are deployed to provide a cost-effective coverage extension based on the convergence of heterogeneous radio networks is presented.
Abstract: This article presents a hierarchical cooperative relay-based heterogeneous network (HCRHeNet) to support both unicast and multicast services, where hierarchical cooperative relay nodes are deployed to provide a cost-effective coverage extension based on the convergence of heterogeneous radio networks. The underlined HCR-HeNet divides its coverage into three layers: hierarchical cooperative basic layer, homogeneous cooperative enhanced layer, and heterogeneous cooperative extended layer. In the hierarchical cooperative basic layer, highspeed data transmission is enabled using highorder modulation and coding schemes for unicast services, and hierarchical modulation schemes for multicast services. In the homogeneous cooperative enhanced layer, where users may be located near a cell boundary and thus need the help of relay nodes, cooperative homogeneous diversity gain can be achieved. In the heterogeneous cooperative extended layer, heterogeneous cooperative diversity gain guarantees the convergence and interworking of multiradio access networks. The key techniques in the physical and MAC layers are identified. Issues in the application of cognitive radio and self-organized networking techniques in HCR-HeNet are also discussed. Finally, a physical layer testbed for the proposed HCR-HeNet with multicast services is introduced.
TL;DR: The ITU-T G.hnem standard is defined, which defines a unified NB-PLC OFDM-based technology targeting multiple smart grid applications: smart metering, distributed automation, in-home energy management, generic home automation, car charging, and others, using IPv6 as the main networking protocol.
Abstract: Narrowband power line communications (NB-PLC) systems operating in the frequency range 3-500 kHz were developed and used in the past few decades for telecommunications, metering, control, and automation. Recently, OFDM-based NB-PLC solutions known as G3 and PRIME came to the market after a long monopoly of single-carrier technologies, offering higher bit rates, robustness, and flexibility, which are vital for smart grid applications. However, it was realized that an international standard is important to ensure worldwide interoperable products and avoid market fragmentation. In the beginning of 2010, the IEEE Standards Association and ITU-T started standardization of NBPLC technologies based on OFDM, launching the P1901.2 and G.hnem projects, respectively. This article gives a technical overview of the ITU-T G.hnem standard, which defines a unified NB-PLC OFDM-based technology targeting multiple smart grid applications: smart metering, distributed automation, in-home energy management, generic home automation, car charging, and others, using IPv6 as the main networking protocol. ITU-T Recommendations G.9955 (G.hnem physical layer) and G.9956 (G.hnem data link layer) were consented for approval in February 2011; their final approval is expected in December 2011.
TL;DR: Simulation results show that the proposed approach can effectively exploit beneficial cooperation, thereby improving system performance and shedding some light on the tradeoff between multi-user diversity gain at the physical layer and the helper contention overhead at the MAC layer.
Abstract: In this paper, we study medium access control (MAC) protocol design for distributed cooperative wireless networks. We focus on beneficial node cooperation by addressing two fundamental issues of cooperative communications, namely when to cooperate and whom to cooperate with, from a cross-layer protocol design perspective. In the protocol design, taking account of protocol overhead we explore a concept of cooperation region, whereby beneficial cooperative transmissions can be identified. We show that a rate allocation in the cooperation region provides higher link utilization than in a non-cooperation region. To increase network throughput, we propose an optimal grouping strategy for efficient helper node selection, and devise a greedy algorithm for MAC protocol refinement. Analysis of a successful transmission probability with cooperative or direct transmission is presented. Simulation results show that the proposed approach can effectively exploit beneficial cooperation, thereby improving system performance. Further, analytical and simulation results shed some light on the tradeoff between multi-user diversity gain at the physical layer and the helper contention overhead at the MAC layer.
TL;DR: An analytical framework for resource allocation in a downlink orthogonal frequency-division multiple access (OFDMA)-based broadband network with coexistence of secure users (SUs) and normal users (NUs), and develops a suboptimal algorithm to reduce the computational cost.
Abstract: Providing physical-layer security for mobile users in future broadband wireless networks is of both theoretical and practical importance. In this paper, we formulate an analytical framework for resource allocation in a downlink OFDMA-based broadband network with coexistence of secure users (SU) and normal users (NU). The SU's require secure data transmission at the physical layer while the NU's are served with conventional best-effort data traffic. The problem is formulated as joint power and subcarrier allocation with the objective of maximizing average aggregate information rate of all NU's while maintaining an average secrecy rate for each individual SU under a total transmit power constraint for the base station. We solve this problem in an asymptotically optimal manner using dual decomposition. Our analysis shows that an SU becomes a candidate competing for a subcarrier only if its channel gain on this subcarrier is the largest among all and exceeds the second largest by a certain threshold. Furthermore, while the power allocation for NU's follows the conventional water-filling principle, the power allocation for SU's depends on both its own channel gain and the largest channel gain among others. We also develop a suboptimal algorithm to reduce the computational cost. Numerical studies are conducted to evaluate the performance of the proposed algorithms in terms of the achievable pair of information rate for NU and secrecy rate for SU at different power consumptions.
TL;DR: Evaluating the performance of available transmission modes in IEEE 802.11b confirmed the increase in the coverage area of the physical layer in the 802.
Abstract: Several transmission modes are defined in IEEE 802.11 a/b/g WLAN standards. A very few transmission modes are considering for IEEE 802.11 a/b/g in physical layer parameters and wireless channel characteristics. In this paper, we evaluated the performance of available transmission modes in IEEE 802.11b [1]. However, the performance analysis can be done straightforward using the evaluation of IEEE 802.11b. The performance of transmission modes are evaluated by calculating the probability of Bit Error Rate (BER) versus the Signal Noise Ratio (SNR) under the frequently used three wireless channel models (AWGN, Rayleigh and Rician) [2]. We consider the data modulation and data rate to analyze the performance that is BER vs. SNR. We also consider multipath received signals. The simulation results had shown the performance of transmission modes under different channel models and the number of antennas. Based on simulation results, we observed that some transmission modes are not efficient in IEEE 802.11b. The evaluation of performance confirms the increase in the coverage area of the physical layer in the 802.11b WLAN devices. General Terms Digital Modulation, Fading, BER (Bit Error Ratio), SNR (Signal to Noise Ratio)
TL;DR: This paper considers a two-hop wireless relay network in the presence of an eavesdropper over a four-node network model including a source, a destination, a trusted relay, and an untrusted eavesdroppers in which the relay forwards the source message in a decode-and-forward (DF) fashion.
Abstract: Relying on physical layer security is an attractive alternative of utilizing cryptographic algorithms at upper layers of protocol stack for secure communications In this paper, we consider a two-hop wireless relay network in the presence of an eavesdropper Our scenario of interest spans over a four-node network model including a source, a destination, a trusted relay, and an untrusted eavesdropper in which the relay forwards the source message in a decode-and-forward (DF) fashion The source and relay are allowed to use some of their available power to transmit jamming signals in order to create interference at the eavesdropper The relay and destination are assumed to have the knowledge of the jamming signals An important question is how to allocate the transmission power of the message signal and that of the jamming signal First, we propose an optimal power allocation solution in which the knowledge of global channel state information (CSI) is required To facilitate practical system design, two simple yet sub-optimal power allocation solutions are proposed which do not rely on eavesdropper's channels For the purpose of performance comparisons, power allocation problems for two benchmark schemes without jamming are also analyzed
TL;DR: Efficient RA algorithms for multicommodity multichannel wireless networks are developed by applying complementary geometric programming and homotopy methods to analyze the quantitative impact of gains that can be achieved at the network layer in terms of end-to-end rates and network congestion by incorporating different RA algorithms.
Abstract: The cross-layer utility maximization problem, which is subject to stability constraints for a multicommodity wireless network where all links share the same number of orthogonal channels, is considered in this paper. We assume a time-slotted network, where the channel gains randomly change from one slot to another. The optimal cross-layer network control policy can be decomposed into the folloing three subproblems: 1) flow control; 2) next-hop routing and in -node scheduling; and 3) power and rate control, which is also known as resource allocation (RA). These subproblems span the layers from the physical layer to the transport layer. In every time slot, a network controller decides the amount of each commodity data admitted to the network layer, schedules different commodities over the network's links, and controls the power and rate allocated to every link in every channel. To fully exploit the available multichannel diversity, we consider the general case, where multiple links can be activated in the same channel during the same time slot, and the interference is controlled solely through power and rate control. Unfortunately, the RA subproblem is not yet amendable to a convex formulation, and in fact, it is NP-hard. The main contribution of this paper is to develop efficient RA algorithms for multicommodity multichannel wireless networks by applying complementary geometric programming and homotopy methods to analyze the quantitative impact of gains that can be achieved at the network layer in terms of end-to-end rates and network congestion by incorporating different RA algorithms. Although the global optimality of the solution cannot be guaranteed, the numerical results show that the proposed algorithms perform close to the (exponentially complex) optimal solution methods. Moreover, they efficiently exploit the available multichannel diversity, which provides significant gains at the network layer in terms of end-to-end rates and network congestion. In addition, the assessment of the improvement in performance due to the use of multiuser detectors at the receivers is provided.
TL;DR: The key features encompassing the physical layer, network layer and back-hauling aspects of time-domain ICIC in Rel-10 are surveyed.
Abstract: Heterogeneous networks (het-nets) - comprising of conventional macrocell base stations overlaid with femtocells, picocells and wireless relays - offer cellular operators burgeoning traffic demands through cell-splitting gains obtained by bringing users closer to their access points. However, the often random and unplanned location of these access points can cause severe near-far problems, typically solved by coordinating base-station transmissions to minimize interference. Towards this direction, the 3rd generation partnership project Long Term Evolution-Advanced (3GPP-LTE or Rel-10) standard introduces time-domain inter-cell interference coordination (ICIC) for facilitating a seamless deployment of a het-net overlay. This article surveys the key features encompassing the physical layer, network layer and back-hauling aspects of time-domain ICIC in Rel-10.
TL;DR: This letter proposes and experimentally demonstrates a secure orthogonal frequency-division-multiplexing passive optical network (OFDM-PON) based on the chaos scrambling in the OFDM frequency domain, and the results indicate the robustness against eavesdropping.
Abstract: This letter proposes and experimentally demonstrates a secure orthogonal frequency-division-multiplexing passive optical network (OFDM-PON) based on the chaos scrambling in the OFDM frequency domain. The Logistic map is adopted for the chaos mapping. The chaos scrambling algorithm can dynamically allocate the scrambling matrices for different OFDM frames according to the initial condition, which enhance the confidentiality of the physical layer. It achieves a secure transmission at physical layer in OFDM-PON for data encryption. The experiment successfully transmits 8.37-Gb/s OFDM data with Logistic mapped chaos scrambling over 25-km single-mode fiber (SMF), and the results indicate the robustness against eavesdropping.
TL;DR: This article derives a metric called the energy per successfully received bit, which specifies the expected energy required to transmit a bit successfully over a particular distance given a channel noise model, and finds the energy-optimal relay distance and the optimal transmit energy as a function of channel noise level and path loss exponent.
Abstract: As wireless sensor networks utilize battery-operated nodes, energy efficiency is of paramount importance at all levels of system design. In order to save energy in the transfer of data from the sensor nodes to one or more sinks, the data may be routed through other nodes rather than transmitting it directly to the sink(s). In this article, we investigate the problem of energy-efficient transmission of data over a noisy channel, focusing on the setting of physical-layer parameters. We derive a metric called the energy per successfully received bit, which specifies the expected energy required to transmit a bit successfully over a particular distance given a channel noise model. By minimizing this metric, we can find, for different modulation schemes, the energy-optimal relay distance and the optimal transmit energy as a function of channel noise level and path loss exponent. These results enable network designers to select the hop distance, transmit power, and/or modulation scheme that maximize network lifetime.
TL;DR: This paper proposes the application of the spatial reuse concept and the exploitation of direct sequence spread spectrum used at the UWAC physical layer to obtain a new hybrid spatial reuse time-division multiple-access (HSR-TDMA) protocol that adaptively optimizes the set of active communication nodes and overcomes problems of UWAC networks.
Abstract: Underwater acoustic communication (UWAC) is often the only viable solution to establish an ad hoc underwater communication network. The specific features of UWAC, arising from the physics of underwater acoustics, make the design of resource-efficient media access control (MAC) protocols important as well as challenging. In this paper, we tackle this task considering ad hoc UWAC networks that support high-traffic broadcast communication. To this end, we propose the application of the spatial reuse concept and the exploitation of direct sequence spread spectrum used at the UWAC physical layer to obtain a new hybrid spatial reuse time-division multiple-access (HSR-TDMA) protocol. By tracking the time-varying network topology, our protocol adaptively optimizes the set of active communication nodes and overcomes problems of UWAC networks such as the near-far problem, flickering, and formation of islands. Pertinent performance parameters, namely network availability, message reliability, and transmission rate, are analyzed for the proposed protocol. Evaluation of these analytical performance expressions demonstrates the significant advantages of HSR-TDMA over commonly used conventional TDMA for broadcast UWAC networks. We also report performance results for both the HSR-TDMA and the conventional TDMA protocol from a sea trial at the Haifa harbor, which corroborate the results obtained from the analysis.
TL;DR: A cross-layer framework is developed in which orthogonal frequency division multiplexing (OFDM) is employed at the physical layer and the proposed power and sub-carrier assignment policy works at the data link layer, showing that both the optimal power allocation and the optimal sub- carrier assignment depend on the delay aware QoS requirements of each user.
Abstract: To improve power efficiency in vehicle-to-roadside infrastructure (V2I) communication networks, this paper proposes a joint power and sub-carrier assignment policy under delay aware quality of service (QoS) requirements. Due to the real-time nature of the V2I transmissions, the proposed policy should satisfy delay aware QoS requirements with a minimized power consumption. In particular, we develop a cross-layer framework in which orthogonal frequency division multiplexing (OFDM) is employed at the physical layer and the proposed power and sub-carrier assignment policy works at the data link layer. Under the assumption that the instantaneous channel state information (CSI) of all users is known, the optimization problem can be formulated and solved with the help of a time-sharing factor. The obtained results show that both the optimal power allocation and the optimal sub-carrier assignment depend on the delay aware QoS requirements of each user. We also theoretically prove that the proposed power allocation policy converges to the classical water-filling policy if we do not consider the QoS requirements. Experimental results reveal that the proposed policy offers a superior performance over the existing resource allocation policies.
TL;DR: The results show that, despite its simplicity, the PHLAME protocol is able to support densely populated nanonetworks by exploiting the peculiarities of the Terahertz band.
Abstract: Nanotechnology is enabling the development of integrated devices just a few hundred nanometers in size. Communication among these nano-devices will boost the applications of nanotechnology in the biomedical, environmental and military fields. Within the communication alternatives at the nanoscale, the state of the art in nanomaterial research points to the Terahertz band (0.1–10 THz) as the frequency range of operation of graphene-based electromagnetic (EM) nano-transceivers. This frequency band supports very large transmission bit-rates and enables simple communication mechanisms suited to the limited capabilities of nano-devices. Due to an expectedly very large number of nano-devices sharing the same channel, it is necessary to develop new Medium Access Control (MAC) protocols which will be able to capture the peculiarities of nanonetworks in the Terahertz band. In this paper, PHLAME, a physical layer aware MAC protocol for electromagnetic nanonetworks, is introduced. This protocol is built on top of a novel communication scheme based on the exchange of femtosecond-long pulses spread in time, and exploits the benefits of novel low-weight channel coding schemes. In the PHLAME protocol, the transmitting and receiving nano-devices jointly select the communication parameters that minimize the interference in the nanonetwork and maximize the probability of successfully decoding the received information. The performance of the protocol is analyzed in terms of energy consumption, delay and achievable throughput, by taking also into account the energy limitations of nano-devices. The results show that, despite its simplicity, the PHLAME protocol is able to support densely populated nanonetworks by exploiting the peculiarities of the Terahertz band.
TL;DR: This paper proposes 4C, a novel link estimator that applies link quality prediction along with link estimation to improve the average cost of delivering a packet and finds that logistic regression works well among the three models with small computational cost.
Abstract: As an integral part of reliable communication in wireless networks, effective link estimation is essential for routing protocols. However, due to the dynamic nature of wireless channels, accurate link quality estimation remains a challenging task. In this paper, we propose 4C, a novel link estimator that applies link quality prediction along with link estimation. Our approach is data-driven and consists of three steps: data collection, offline modeling and online prediction. The data collection step involves gathering link quality data, and based on our analysis of the data, we propose a set of guidelines for the amount of data to be collected in our experimental scenarios. The modeling step includes offline prediction model training and selection. We present three prediction models that utilize different machine learning methods, namely, naive Bayes classifier, logistic regression and artificial neural networks. Our models take a combination of PRR and the physical layer information, i.e., Received Signal Strength Indicator (RSSI), Signal to Noise Ratio (SNR) and Link Quality Indicator (LQI) as input, and output the success probability of delivering the next packet. From our analysis and experiments, we find that logistic regression works well among the three models with small computational cost. Finally, the third step involves the implementation of 4C, a receiver-initiated online link quality prediction module that computes the short temporal link quality. We conducted extensive experiments in the Motelab and our local indoor testbeds, as well as an outdoor deployment. Our results with single and multiple senders experiments show that with 4C, CTP improves the average cost of delivering a packet by 20% to 30%. In some cases, the improvement is larger than 45%.
TL;DR: In this paper, the authors presented an augmentation protocol for the physical layer of the Medical Implant Communications Service (MICS) with focus on the energy efficiency of deployed devices over the MICS frequency band.
Abstract: The use of wireless implant technology requires correct delivery of the vital physiological signs of the patient along with the energy management in power-constrained devices. Toward these goals, we present an augmentation protocol for the physical layer of the Medical Implant Communications Service (MICS) with focus on the energy efficiency of deployed devices over the MICS frequency band. The present protocol uses the rateless code with the Frequency Shift Keying (FSK) modulation scheme to overcome the reliability and power cost concerns in tiny implantable sensors due to the considerable attenuation of propagated signals across the human body. In addition, the protocol allows a fast start-up time for the transceiver circuitry. The main advantage of using rateless codes is to provide an inherent adaptive duty-cycling for power management, due to the flexibility of the rateless code rate. Analytical results demonstrate that an 80% energy saving is achievable with the proposed protocol when compared to the IEEE 802.15.4 physical layer standard with the same structure used for wireless sensor networks. Numerical results show that the optimized rateless coded FSK is more energy efficient than that of the uncoded FSK scheme for deep tissue (e.g., digestive endoscopy) applications, where the optimization is performed over modulation and coding parameters.
TL;DR: While rate-adaptive direct transmission provides better video quality than conventional multicast, all three proposed randomized cooperative schemes outperform both strategies significantly as long as the network has enough nodes.
Abstract: With the increased popularity of mobile multimedia services, efficient and robust video multicast strategies are of critical importance. Cooperative communications has been shown to improve the robustness and the data rates for point-to-point transmission. In this paper, a two-hop cooperative transmission scheme for multicast in infrastructure-based networks is used, where multiple relays forward the data simultaneously using randomized distributed space time codes (RDSTC). This randomized cooperative transmission is further integrated with layered video coding and packet level forward error correction (FEC) to enable efficient and robust video multicast. Three different schemes are proposed to find the system operating parameters based on the availability of the channel information at the source station: RDSTC with full channel information, RDSTC with limited channel information, and RDSTC with node count. The performance of these three schemes are compared with rate adaptive direct transmission and conventional multicast that does not use rate adaptation. The results show that while rate-adaptive direct transmission provides better video quality than conventional multicast, all three proposed randomized cooperative schemes outperform both strategies significantly as long as the network has enough nodes. Furthermore, the performance gap between RDSTC with full channel information and RDSTC with limited channel information or node count is relatively small, indicating the robustness of the proposed cooperative multicast system using RDSTC.
TL;DR: In this paper, the authors integrated a detailed physical layer simulator into the NS-3 network simulator, which aims to bridge the gap between the physical and network layer perspectives, allow for more accurate channel and physical layer models, and enable studies on cross-layer optimization.
Abstract: Vehicle-to-vehicle and vehicle-to-roadside com- munications is required for numerous applications that aim at improving traffic safety and efficiency. In this setting, however, gauging system performance through field trials can be very expensive especially when the number of studied vehicles is high. Therefore, many existing studies have been conducted using either network or physical layer simulators; both approaches are problematic. Network simulators typically abstract physical layer details (coding, modulation, radio channels, receiver algorithms, etc.) while physical layer ones do not consider overall network characteristics (topology, net- work traffic types, and so on). In particular, network simulators view a transmitted frame as an indivisible unit, which leads to several limitations. First, the impact of the vehicular radio channel is typically not reflected in its appropriate context. Further, interference due to frame collisions is not modeled accurately (if at all) and, finally, the benefits of advanced signal processing techniques, such as interference cancellation, are difficult to assess. To overcome these shortcomings we have integrated a detailed physical layer simulator into the popular NS-3 network simulator. This approach aims to bridge the gap between the physical and network layer perspectives, allow for more accurate channel and physical layer models, and enable studies on cross-layer optimization. In this paper, we exemplify our approach by integrating an IEEE 802.11a and p physical layer simulator with NS-3. Further, we validate the augmented NS-3 simulator against an actual IEEE 802.11 wireless testbed and illustrate the additional value of this integration.