Search

In this article, we demonstrate bringing the Internet to underwater environments by deploying a low power and compact underwater optical wireless system, called Aqua-Fi, to support today's Internet applications. Aqua-Fi uses an LED or laser to support bidirectional wide-range communication services with different requirements, low cost, and simple implementation. LEDs introduce robust short distance solutions with low power requirements. However, laser extends the communication distance and improves the transmission rate at the cost of higher power requirements. Throughout this work, we discuss the proposed Aqua-Fi system architecture, limitations, and solutions to improve data rates and deliver reliable communication links. [ABSTRACT FROM AUTHOR]

The multitier heterogeneous structure of 5G with dense small cells deployment, relays, and device-to-device (D2D) communications operating in an underlay fashion is envisioned as a potential solution to satisfy the future demand for cellular services. However, efficient power allocation among dense secondary transmitters that maintains quality of service (QoS) for macro (primary) cell users and secondary cell users is a critical challenge for operating such radio. In this paper, we focus on the power allocation problem in the multitier 5G network structure using a noncooperative methodology with energy efficiency consideration. Therefore, we propose a distributive intuition-based online learning scheme for power allocation in the downlink of the 5G systems, where each transmitter surmises other transmitters power allocation strategies without information exchange. The proposed learning model exploits a brief state representation to account for the problem of dimensionality in online learning and expedite the convergence. The convergence of the proposed scheme is proved and numerical results demonstrate its capability to achieve fast convergence with QoS guarantee and significant improvement in system energy efficiency. [ABSTRACT FROM AUTHOR]

In this paper, we study the optimisation problem of transmission power and delay in a multi-hop wireless network consisting of multiple nodes. The goal is to determine the optimal policy of transmission rates at various buffer and channel states in order to minimise the power consumption and the queueing delay of the whole network. With the assumptions of interference-free links and independently and identically distributed (i.i.d.) channel states, we formulate this problem using a semi-open Jackson network model for data transmission and a Markov model for channel states transition. We derive a difference equation of the system performance under any two different policies. The necessary and sufficient condition of optimal policy is obtained. We also prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate and the optimal transmission rate can be either maximal or minimal. That is, the ‘bang-bang’ control is an optimal control. This optimality structure greatly reduces the problem complexity. Furthermore, we develop an iterative algorithm to find the optimal solution. Finally, we conduct the simulation experiments to demonstrate the effectiveness of our approach. We hope our work can shed some insights on solving this complicated optimisation problem. [ABSTRACT FROM AUTHOR]

With the prevalence of orthogonal frequency-division multiplexing (OFDM) in many standards, e.g., IEEE 802.11, IEEE 802.16, DVB-T, and DVB-T2, a number of variant modulation schemes based on OFDM have been proposed, which resort to signal sparsity to further enhance spectral efficiency and mitigate the high peak-to-average ratio (PAPR) problem. Among these variants, OFDM with subcarrier number modulation (OFDM-SNM) has been proven to be efficient for simple communication systems with low constellation modulation orders and limited decoding capability. To rigorously verify the performance advantages of OFDM-SNM, we present the study of OFDM-SNM in this paper from the information-theoretic perspective. In particular, we determine an upper bound on the mutual information of OFDM-SNM in closed form by using the log sum inequality. Also, we analyze the optimal pattern utilization probabilities (PUPs) for OFDM-SNM by channel-dependent coding and propose an easy-to-implement iterative algorithm to approach the optimal PUPs. Moreover, considering the practical achievability, we propose a Huffman coding based achievable PUP vector construction scheme to obtain the achievable PUPs and the corresponding achievable rate. We carry out numerical simulations to verify the effectiveness of this study and illustrate the efficiency of the obtained PUPs in comparison with several benchmarks. [ABSTRACT FROM AUTHOR]

Terahertz (THz) wireless technology is envisioned to enable terabit-per-second (Tbps) and secure transmissions in sixth-generation (6G) communication networks and has attracted attention from academia and industry in recent years. Because the transmission range of THz radios is restricted compared to that of microwave radios, frequency reuses in the THz band become much more flexible and even possible among transceiver pairs in close proximity. However, without appropriate spatial arrangement and coordination, the frequency reuse in the THz band can also lead to severe co-channel interference and result in a low signal-to-interference-plus-noise ratio (SINR) or a signal-to-interference ratio (SIR), which finally degrades signal detection and network reliability. To thoroughly study the co-channel interference in the THz band, we model the co-channel interference by the compound channel model and analyze it in detail. The adopted channel model captures the key features of THz communication, such as, spreading loss, molecular absorption loss, and dynamic shadowing, which is much different and complicated than those used in the low-frequency band. The resulted SINR and SIR are investigated by approximating the sum of co-channel interference as a gamma distribution. The generalized analytical results are also reduced to specialized forms for two special cases, i.e., the single-interferer case and the case of multiple independent and identically distributed (i.i.d.) interferers. Due to the generalized nature of the THz interference model constructed in this paper, the results play a meaningful role in practical implementation and can be easily extended to advanced performance analyses for THz communication systems. [ABSTRACT FROM AUTHOR]

In this article, we envision a hybrid opto-acoustic network design for IoUT. The software defined underwater network (SDUN) is presented as an enabler of hybridizing benefits of optic and acoustic systems and adapting IoUT nodes to the challenging and dynamically changing underwater environment. We explain inextricably interwoven relations among functionalities of different SDUN layers and analyze their impacts on key network attributes. The NFV concept is then introduced to realize application-specific cross-layer protocol suites through an NFV management and orchestration system. We finally discuss how SDUN and NFV can slice available network resources as per the diverging service demands of different underwater applications. Such a revolutionary architectural paradigm shift is not only a cure for chronic underwater networking problems but also a way of smoothly integrating IoUT and IoT ecosystems. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the performance degradation of a multi-hop decode-and-forward full-duplex relaying system caused by the residual self-interference (RSI) and hardware distortions (HWD) imposed by the FDR operation and imperfect hardware, respectively. In addition, we study the benefits of employing improper Gaussian signaling (IGS) in the MH-FDR system. Different from the traditional symmetric signaling scheme, i.e., proper Gaussian signaling (PGS), IGS has non-zero pseudo-variance that can limit the impact of RSI and HWD in the MH-FDR system. To evaluate the system performance gain using IGS, first we express the end-to-end achievable rate of the MH system as the minimum rate supported by all participating links. Then, we optimize the pseudo-variance of all participating transmitters, including source and relays to compensate the interference impact and improve the end-to-end achievable rate. We propose two network optimization schemes based on the system characteristics, i.e., joint optimization framework and distributed optimization scenario. Interestingly, IGS-based scheme outperforms its counterpart PGS-based scheme, especially at higher interference-to-noise ratio. Our findings reveal that using IGS in single-user detection systems that suffer from both RSI and HWD can effectively mitigate the degradation in the achievable rate performance. [ABSTRACT FROM AUTHOR]

Traditional wired data center networks (DCNs) suffer from cabling complexity, lack flexibility, and are limited by the speed of digital switches. In this paper, we alternatively develop a top-down traffic grooming (TG) approach to the design and provisioning of mission-critical optical wireless DCNs. While switches are modeled as hybrid optoelectronic cross-connects, links are modeled as wavelength division multiplexing capable free-space optic channels. Using the standard TG terminology, we formulate the optimal mixed-integer TG problem considering the virtual topology, flow conversation, connection topology, non-bifurcation, and capacity constraints. Thereafter, we develop a fast yet efficient sub-optimal solution, which grooms mice flows (MFs), mission-critical flows (CFs), and forward on predetermined rack-to-rack (R2R) lightpaths. On the other hand, elephant flows (EFs) are forwarded over dedicated server-to-server express lightpaths whose routes and capacity are dynamically determined based on the availability of wavelength and capacity. To prioritize the CFs, we consider low and high-priority queues and analyze the delay characteristics such as waiting times, maximum hop counts, and blocking probability. As a result of grooming, the sub-wavelength traffic and adjusting the wavelength capacities, numerical results show that the proposed solutions can achieve significant performance enhancement by utilizing the bandwidth more efficiently, completing the flows faster than delay sensitivity requirements, and avoiding the traffic congestion by treating EFs and MFs separately. [ABSTRACT FROM AUTHOR]

Future wireless technologies, such as fifth-generation (5G), are expected to support real-time applications with high data throughput, e.g., holographic meetings. From a bandwidth perspective, cognitive radio (CR) is a promising technology to enhance the system's throughput via sharing the licensed spectrum. From a delay perspective, it is well known that increasing the number of decoding blocks will improve system robustness against errors while increasing delay. Therefore, optimally allocating the resources to determine the tradeoff of tuning the length of the decoding blocks while sharing the spectrum is a critical challenge for future wireless systems. In this paper, we minimize the targeted outage probability over the block-fading channels while utilizing the spectrum-sharing concept. The secondary user's outage region and the corresponding optimal power are derived, over two-block and $M$-block fading channels. We propose two suboptimal power strategies and derive the associated asymptotic lower and upper bounds on the outage probability with tractable expressions. These bounds allow us to derive the exact diversity order of the secondary user's outage probability. To further enhance the system's performance, we also investigate the impact of including the sensing information on the outage problem. The outage problem is then solved via proposing an alternating optimization algorithm, which utilizes the verified strict quasi-convex structure of the problem. Selected numerical results are presented to characterize the system's behavior and show the improvements of several sharing concepts. [ABSTRACT FROM AUTHOR]

Buffer sizing is an important network configuration parameter that impacts the quality of service characteristics of data traffic. With falling memory costs and the fallacy that "more is better," network devices are being overprovisioned with large buffers. This may increase queueing delays experienced by a packet and subsequently impact stability of core protocols such as TCP. The problem has been studied extensively for wired networks. However, there is little work addressing the unique challenges of wireless environments such as time-varying channel capacity, variable packet inter-service time, and packet aggregation, among others. In this article we discuss these challenges, classify the current state-of-the-art solutions, discuss their limitations, and provide directions for future research in the area. [ABSTRACT FROM PUBLISHER]

The integration between the satellite network and the terrestrial network will play a key role in the upcoming sixth-generation (6G) of mobile cellular networks thanks to the wide coverage and bandwidth offered by satellite networks. To leverage this integration, we propose a proactive traffic offloading scheme in an integrated multi-satellite terrestrial network (IMSTN) that considers the future networks’ heterogeneity and predicts their variability. Our proposed offloading scheme hinges on traffic prediction to answer the stringent requirements of data-rate, latency and reliability imposed by heterogeneous and coexisting services and traffic namely enhanced mobile broadband (eMBB), massive machine-type communications (mMTC) and ultra-reliable low latency communication (URLLC). However, the fulfilment of these requirements during offloading in dynamic IMSTN comes at the expense of significant energy consumption and introduces inherently supplementary latency. Therefore, our offloading scheme aims to balance the fundamental trade-offs first between energy consumption and the achievable data-rate and second between energy consumption and latency while meeting the respective needs of the present traffic. Our findings prove the importance of the cooperation between the multi-satellite network and the terrestrial network conditioned by traffic prediction to enhance the performance of IMTSN in terms of latency and energy consumption. [ABSTRACT FROM AUTHOR]

This paper studies the temporal characteristics of the intelligent reflecting surface (IRS)-based visible light communication (VLC) channel using radiometric concepts. Throughout this study, we account for the delays experienced by the transmitted power along the continuum of paths originating at the source, passing through the IRS, reaching the detector. Then, we derive the impulse response of multi-element phase-tunable metasurface and orientation-tunable mirror array-based reflector setups for a general setting of source, reflector, and detector dimensions and relative positions. In addition, we derive simpler expressions for the two special cases, namely, the point source and the large-source small-reflector. Moreover, we present the exact expression for the delay spread and derive lower, upper bounds and asymptotic expressions when the number of reflecting elements increases for both reflector types. Finally, we study the impact of several system parameters on the temporal characterization of the two IRS-based VLC systems. [ABSTRACT FROM AUTHOR]

This paper introduces a novel multi-copy routing protocol, called predict and forward (PF), for delay tolerant networks, which aims to explore the possibility of using mobile nodes as message carriers for end-to-end delivery of the messages. With PF, the message forwarding decision is made by manipulating the probability distribution of future inter-contact and contact durations based on the network status, including wireless link condition and nodal buffer availability. In particular, PF is based on the observations that the node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. We implemented the proposed protocol and compared it with a number of existing encounter-based routing approaches in terms of delivery delay, delivery ratio, and the number of transmissions required for message delivery. The simulation results show that PF outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study. [ABSTRACT FROM AUTHOR]

To expedite research progress on terahertz (THz) communications, we analyze the outage performance of THz communication systems by a compound channel model in this paper. Different from existing models, the compound channel model incorporates the effects of spreading loss, molecular absorption loss, shadowing, and multi-path fading via a composite distribution. By using this model, we maintain an equilibrium of the outage performance analysis between mathematical tractability and the fidelity of realistic THz channels. Specifically, by utilizing the compound channel model, outage performance analysis can get rid of sophisticated case-specific channel modeling relying on field measurement and the ray-tracing assessment. To facilitate the application of the proposed channel model, we also design a maximum likelihood estimation (MLE) based channel parameter estimation approach for the compound channel model. The analytical results of outage performance by using the compound channel model are given in closed form and verified by numerical results. [ABSTRACT FROM AUTHOR]

Hardware distortions (HWDs) render drastic effects on the performance of communication systems. They are recently proven to bear asymmetric signatures; and hence can be efficiently mitigated using improper Gaussian signaling (IGS), thanks to its additional design degrees of freedom. Discrete asymmetric signaling (AS) can practically realize the IGS by shaping the signals’ geometry or probability. In this paper, we adopt the probabilistic shaping (PS) instead of uniform symbols to mitigate the impact of HWDs and derive the optimal maximum a posterior detector. Then, we design the symbols’ probabilities to minimize the error rate performance while accommodating the improper nature of HWD. Although the design problem is a non-convex optimization problem, we simplified it using successive convex programming and propose an iterative algorithm. We further present a hybrid shaping (HS) design to gain the combined benefits of both PS and geometric shaping (GS). Finally, extensive numerical results and Monte Carlo (MC) simulations highlight the superiority of the proposed PS over conventional uniform constellation and GS. Both PS and HS achieve substantial improvements over the traditional uniform constellation and GS with up to one order magnitude in error probability and throughput. [ABSTRACT FROM AUTHOR]

In this paper, we propose studying the disease spread mechanism in the atmosphere as an engineering problem. Aerosol transmission is the most significant mode among the viral transmission mechanisms that do not include physical contact, where airflows carry virus-laden droplets over long distances. Throughout this work, we study the transport of these droplets as a molecular communication problem, where one has no control over the transmission source, but a robust receiver can be designed using bio-sensors. To this end, we present a complete system model and derive an end-to-end mathematical model for the transmission channel under certain constraints and boundary conditions. We derive the system response for both continuous sources such as breathing and jet or impulsive sources such as coughing and sneezing. In addition to transmitter and channel, we assumed a receiver architecture composed of air sampler and Silicon Nanowire field-effect transistor. Then, we formulate a detection problem to maximize the likelihood decision rule and minimize the corresponding missed detection probability. Finally, we present several numerical results to observe the impact of parameters that affect the performance and justify the feasibility of the proposed setup in related applications. [ABSTRACT FROM AUTHOR]

The continuous improvement in optical energy harvesting devices motivates the development of visible light communication systems that utilize such available free energy. In this paper, an outdoor visible light communications (VLC) system is considered where a VLC base station sends data to multiple users that are capable of harvesting optical energy. The proposed VLC system serves multiple users using time division multiple access (TDMA) with unequal time and power allocation, which are allocated to achieve the system communications and illumination objectives. In an outdoor setup, the system lighting objective is to maximize the average illumination flux, while the communication design objective is to maximize the spectral efficiency (SE). A multiobjective optimization problem is formulated to obtain the Pareto front of the SE-illumination region. To this end, the marginal optimization problems are solved first using low complexity algorithms. Then, based on the proposed algorithms, a Karush-Kuhn-Tucker-based algorithm is developed to obtain an inner bound of the Pareto front for the SE-illumination tradeoff. The inner bound for the Pareto-front is shown to be close to the optimal Pareto-frontier via several simulation scenarios for different system parameters. [ABSTRACT FROM AUTHOR]

Exhaled breath can be used in retrieving information and creating innovative communication systems. It contains several volatile organic compounds and biological entities that can act as health biomarkers. For instance, the breath of an infected human contains a nonnegligible amount of pathogenic aerosol that can spread or remain suspended in the atmosphere. Therefore, the exhaled breath can be exploited as a source's message in a communication setup to remotely scan the bio-information via an aerosol transmission channel. An overview of the basic configuration is presented along with a description of system components with a particular emphasis on channel modeling. Furthermore, the challenges that arise in theoretical analysis and system development are highlighted. Finally, several open issues are discussed to concretize the proposed communication concept. [ABSTRACT FROM AUTHOR]

In this paper, we propose and derive a slotted-time model for analyzing the burst blocking probability in Optical Burst Switched (OBS) networks. We evaluated the immediate and delayed signaling reservation schemes. The proposed model compares the performance of both just-in-time (JIT) and just-enough-time (JET) signaling protocols associated with of void/non-void filling link scheduling schemes. It also considers none and limited range wavelength conversions scenarios. Our model is distinguished by being adaptable to different offset-time and burst length distributions. We observed that applying a limited range of wavelength conversion, burst blocking probability is reduced by several orders of magnitudes and yields a better burst delivery ratio compared with full wavelength conversion. [ABSTRACT FROM AUTHOR]

Reliable data transmission is a fundamental challenge in resource-constrained wireless sensor networks. In current implementations, a single bit error requires retransmitting the entire frame. This incurs extra processing overhead and power consumption, especially for large frames. Frame fragmentation into small blocks with individual error detection codes can reduce the unnecessary retransmission of the correctly received blocks. The optimal block size, however, varies based on the wireless channel conditions. In this paper, we propose an interference-aware frame fragmentation scheme called iFrag. iFrag dynamically adjusts the number of blocks inside a frame based on current channel conditions, and effectively addresses all challenges associated with such dynamic partitioning. Through analytical and experimental results, we show that iFrag achieves up to $$3\times$$ improvement in goodput when the channel is noisy, while reducing the delay by 12 % compared to other static fragmentation approaches. On average, it shows a 13 % gain in goodput across all channel conditions used in our experiments. Our testbed results also show that iFrag lowers the energy consumed per useful bit by 60 %, as improved data transmission reliability reduces the number of frame retransmissions which increases the motes energy efficiency. [ABSTRACT FROM AUTHOR]

This paper introduces a novel multicopy routing protocol, called Self-Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of devices in miniature such as smart phones of heterogeneous capacities in terms of energy resources and buffer spaces. SAURP is characterized by the ability of identifying potential opportunities for forwarding messages to their destinations via a novel utility function-based mechanism, in which a suite of environment parameters, such as wireless channel condition, nodal buffer occupancy, and encounter statistics, are jointly considered. Thus, SAURP can reroute messages around nodes experiencing high-buffer occupancy, wireless interference, and/or congestion, while taking a considerably small number of transmissions. The developed utility function in SAURP is proved to be able to achieve optimal performance, which is further analyzed via a stochastic modeling approach. Extensive simulations are conducted to verify the developed analytical model and compare the proposed SAURP with a number of recently reported encounter-based routing approaches in terms of delivery ratio, delivery delay, and the number of transmissions required for each message delivery. The simulation results show that SAURP outperforms all the counterpart multicopy encounter-based routing protocols considered in the study. [ABSTRACT FROM AUTHOR]

Multicopy routing strategies have been considered the most applicable approaches to achieve message delivery in Delay Tolerant Networks (DTNs). Epidemic routing and two-hop forwarding routing are two well-reported approaches for delay tolerant networks routing which allow multiple message replicas to be launched in order to increase message delivery ratio and/or reduce message delivery delay. This advantage, nonetheless, is at the expense of additional buffer space and bandwidth overhead. Thus, to achieve efficient utilization of network resources, it is important to come up with an effective message scheduling strategy to determine which messages should be forwarded and which should be dropped in case of buffer is full. This paper investigates a new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive simulation results show that the proposed message scheduling framework can achieve better performance than its counterparts. [ABSTRACT FROM AUTHOR]