Search

As a means of spread spectrum communication, frequency-hopping technology has good performance in anti-jamming, multiple-access, security, covert communications, and so on. In order to meet the needs of different frequency-hopping multiple-access (FHMA) communication scenarios, the research on frequency-hopping sequence (FHS) sets with a low-hit-zone (LHZ) is now becoming more and more crucial. In this paper, a general construction to obtain new families of LHZ-FHS sets is achieved via interleaving technique. Subsequently, based on two different shift sequences, two classes of LHZ-FHS sets with new flexible parameters not covered in the related literature are presented. The requirements for our new LHZ-FHS sets to obtain optimality or near-optimality with respect to the Peng–Fan–Lee bound are also introduced. Furthermore, as long as the base FHS set is fixed, the performances of new LHZ-FHS sets can be analyzed, such that the parameters of all appropriate shift sequences to obtain desired LHZ-FHS sets are also fixed. [ABSTRACT FROM AUTHOR]

Abstract To obtain better spectral efficiency and higher bit rate, a novel carrier index M‐ary differential chaos shift keying modulation scheme is proposed. In this system, part of subcarriers is assigned to the chaotic reference so that it can carry extra data bits through carrier index modulation, while one of the remaining subcarriers is activated to transmit the data‐bearing signal. In addition, M‐ary DCSK modulation is also applied to data‐bearing signals based on the constellation theory and Walsh codes. Theoretical bit error rate expressions are derived over the multipath Rayleigh fading and additive white Gaussian noise channels. Simulations and comparisons are performed with various combinations of chaotic sequence lengths, subcarrier numbers and constellation sizes. Results show that the proposed scheme can outperform other counterparts in both spectral efficiency and bit error rate performances.

Abstract Spread spectrum technology has been widely employed for positioning and communicating with autonomous underwater vehicles (AUVs), but conventional spread spectrum sequences lack confidentiality and reliability in UWA channel. Considering the limitations of conventional sequences and the characteristics of underwater acoustic (UWA) channel, a composite chaotic orthogonal sequence (CCOS) based on the UWA channel is proposed. The confidentiality of the CCOS is superior to that of the m‐sequence, while the autocorrelation performance of the CCOS is superior to that of the orthogonal sequence. Moreover, the CCOS can compensate for the imbalance of logistic chaotic sequence when assigned certain initial values. Acquisition is a crucial component of accessing the spread spectrum signal; therefore, the acquisition performance indicates the applicability of the CCOS. The source–target model is established to simulate communication with an underwater moving target. To simulate the acquisition process, a parallel algorithm based on fast Fourier transform is adopted, and the entire simulation process is completed based on the BELLHOP ray acoustic model. Through data processing, the Doppler shift error is less than half of the frequency‐search element. Furthermore, the acquisition probabilities of the CCOS with different numbers of bits are over 90%, which demonstrates the reliability of the CCOS.

Spread spectrum technology has been widely employed for positioning and communicating with autonomous underwater vehicles (AUVs), but conventional spread spectrum sequences lack confidentiality and reliability in UWA channel. Considering the limitations of conventional sequences and the characteristics of underwater acoustic (UWA) channel, a composite chaotic orthogonal sequence (CCOS) based on the UWA channel is proposed. The confidentiality of the CCOS is superior to that of the m‐sequence, while the autocorrelation performance of the CCOS is superior to that of the orthogonal sequence. Moreover, the CCOS can compensate for the imbalance of logistic chaotic sequence when assigned certain initial values. Acquisition is a crucial component of accessing the spread spectrum signal; therefore, the acquisition performance indicates the applicability of the CCOS. The source–target model is established to simulate communication with an underwater moving target. To simulate the acquisition process, a parallel algorithm based on fast Fourier transform is adopted, and the entire simulation process is completed based on the BELLHOP ray acoustic model. Through data processing, the Doppler shift error is less than half of the frequency‐search element. Furthermore, the acquisition probabilities of the CCOS with different numbers of bits are over 90%, which demonstrates the reliability of the CCOS. [ABSTRACT FROM AUTHOR]

In this study, we designed ranging parameters and refined a loop filtering algorithm to solve the problem of parameter compatibility with the phasemeter and low ranging accuracy under bidirectional communication conditions. This enables the ranging and communication system to be integrated directly into the phasemeter as an auxiliary module. Experimental results compare fiber measurement lengths under different clock sources, indicating that the system achieves an ranging accuracy of 82.1 cm with an rms error of 9.14 cm. Additionally, the data communication rate reaches 19.5 kbps with a bit error rate below 10−6, all while ensuring that the implementation of the laser ranging and data communication system utilizes only 1% of the optical power to avoid introducing excessive phase noise to the scientific interferometer.

In this letter, a cost-effective sensing-capable multihop router network architecture has been designed for the hotel indoor surveillance system with the help of wemos D1 R2, Arduino Mega, relays, and sensors (WARS). To make each router, there are mainly three components, i.e., one access point (AP), one station (STA), and one controller. These components have different working functionalities. Though we have focused on hotel surveillance systems but the network will be useful for broad application purposes, including home, hospital, restaurant, agriculture, etc., according to the requirement of sensors. To regulate the information of the sensor, a smartphone application (APP) has been designed. With this architecture, the proposed multihop network can increase the regularity performance of the hotel without violating customers’ privacy. [ABSTRACT FROM AUTHOR]

As a means of spread spectrum communication, frequency-hopping technology has good performance in anti-jamming, multiple-access, security, covert communications, and so on. In order to meet the needs of different frequency-hopping multiple-access (FHMA) communication scenarios, the research on frequency-hopping sequence (FHS) sets with a low-hit-zone (LHZ) is now becoming more and more crucial. In this paper, a general construction to obtain new families of LHZ-FHS sets is achieved via interleaving technique. Subsequently, based on two different shift sequences, two classes of LHZ-FHS sets with new flexible parameters not covered in the related literature are presented. The requirements for our new LHZ-FHS sets to obtain optimality or near-optimality with respect to the Peng–Fan–Lee bound are also introduced. Furthermore, as long as the base FHS set is fixed, the performances of new LHZ-FHS sets can be analyzed, such that the parameters of all appropriate shift sequences to obtain desired LHZ-FHS sets are also fixed.

In the process of the vigorous development of satellite internet of things, random access protocol is regarded as the most suitable communication protocol due to its characteristics of low signaling overhead, high transmission efficiency, high flexibility and easy implementation.However, due to drastic load changes, conventional random access mode only has advantages in the specific load range.Dynamic allocation of random access resources requires the accurate number of time slot access applications.In view of the above problems, a random access adaptive scheme was proposed, which could adaptively selected the appropriate random access mode according to the future load size, so as to improved the system throughput.The load size could be obtained through the proposed load estimation and prediction scheme.When narrowband interference exists in the transmission environment, the spread-spectrum communication means was introduced to made the adaptive scheme of random access run successfully.Moreover, the proposed adaptive scheme also improved the system throughput.

Abstract This paper proposes a multilevel cyclic shift index modulation aided differential chaotic shift keying (MCSI‐DCSK) system to improve data rate and energy efficiency. In the MCSI‐DCSK system, the bit stream is divided into blocks with N(M+1) bits which are further divided into N groups equally. In each group, the first M bits are mapped into an index of cyclic shift in the chaotic reference sequence, while the last bit is used to modulate the shifted chaotic reference sequence. Finally, the all modulated shifted chaotic reference sequences are superimposed to form the information‐bearing signal. So the proposed system improves the data rate. The analytical bit‐error‐rate (BER) expressions of the MCSI‐DCSK system are derived over additive white Gaussian noise and multipath Rayleigh fading channels and validated via simulations. In addition, the BER performance of the proposed system is compared with other non‐coherent, chaotic communication systems. Simulation results indicate that the MCSI‐DCSK system has better performance in data rate and BER.

This paper proposes a multilevel cyclic shift index modulation aided differential chaotic shift keying (MCSI‐DCSK) system to improve data rate and energy efficiency. In the MCSI‐DCSK system, the bit stream is divided into blocks with N(M+1)$N(M+1)$ bits which are further divided into N groups equally. In each group, the first M bits are mapped into an index of cyclic shift in the chaotic reference sequence, while the last bit is used to modulate the shifted chaotic reference sequence. Finally, the all modulated shifted chaotic reference sequences are superimposed to form the information‐bearing signal. So the proposed system improves the data rate. The analytical bit‐error‐rate (BER) expressions of the MCSI‐DCSK system are derived over additive white Gaussian noise and multipath Rayleigh fading channels and validated via simulations. In addition, the BER performance of the proposed system is compared with other non‐coherent, chaotic communication systems. Simulation results indicate that the MCSI‐DCSK system has better performance in data rate and BER. [ABSTRACT FROM AUTHOR]

Copyright of Space-Integrated-Ground Information Networks is the property of Beijing Xintong Media Co., Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Harbin Institute of Technology. Social Sciences Edition / Haerbin Gongye Daxue Xuebao. Shehui Kexue Ban is the property of Harbin Institute of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Digital chaotic sequence spread spectrum (CSSS) communication systems provide a number of advantages for secure communications due to the apparent bandlimited Gaussian noise-like signal characteristics and the non-repeating nature of the underlying chipping sequence. The Rayleigh magnitude distribution of the signal represents a challenge, however, for transmission through linear high-power amplifiers (HPA), both due to the high peak-to-average power ratio (PAPR) and the impacts of selective signal compression on the tails of the time-domain Gaussian signals, which becomes observable by cyclostationary low probability of detection (LPD) metrics. This paper first provides an analysis of HPA compression effects on a single-carrier CSSS signal to understand the HPA-induced artifacts when pushed into compression. This work also defines and evaluates time-domain pre-distortion techniques for memoryless HPAs, validating those formulations through Matlab simulations and live measurements of predistorted CSSS signals transmitted through physical HPAs. Unlike computationally expensive statistical models used to predistort multi-carrier waveforms, this technique is shown to be a computationally efficient method to minimize the increased likelihood of adversarial detection of single-carrier waveforms. The proposed pre-distortion techniques are measured as achieving an average of 3.35-dB in improvements for linear operating range, enabling transmission of CSSS waveforms at an HPA backoff of 4.80-dB without adversely affecting kurtosis-based signal detectability.

In non‐cooperative scenarios, the spreading sequences or waveforms of the direct sequence spread spectrum (DSSS) signals is unknown to the receiver. This paper focuses on addressing the problem of blind estimation of the spreading waveform under multipath channels. In the scenario of direct signal path transmission, the spreading sequences can be directly obtained based on the estimated spreading waveforms. However, in the presence of multipath channels, the spreading waveform becomes the convolution of the spreading sequence and channel response, thus deconvolution should also be performed after estimating the spreading waveforms. In order to perform blind despreading and deconvolution of asynchronous multiuser DSSS signals under multipath channels, the authors propose to exploit the finite symbol characteristics of information and spreading sequences and then the iterative least square with projection method is adopted. Besides, the Cramer‐Rao bound of spreading waveforms is derived in such a circumstance as a performance benchmark. The effectiveness of the proposed method is verified via simulation experiments. [ABSTRACT FROM AUTHOR]

With the increasing demand of applications for the spread spectrum technique, especially the demand for data transmission rates and spectral efficiency, the advantages of the traditional direct sequence spread spectrum (DSSS) system are limited. Therefore, multi‐ary spread spectrum (M‐ary) technology, parallel combinatory spread spectrum (PCSS) technology, and code index modulation (CIM) technology have been proposed. Although these three new technologies can improve the data rate, they all face the problem of the large consumption of pseudo‐code resources. In order to solve the problem of pseudo‐code resources, a bit‐activation code index modulation (BA‐CIM) method is proposed. At the transmitter, considering the good correlation among multiple pseudo‐codes, the corresponding pseudo‐code activation principle is established, and the corresponding spreading pseudo‐code is activated by using the status of each bit of the index data according to the pseudo‐code activation principle. Then, multicode superposition processing is carried out to spread the modulation data. At the receiver, the corresponding activation pseudo‐code is obtained using the maximum peak‐to‐average ratio (MPAR) and secondary peak‐to‐average ratio (SPAR) judgement mechanisms to decode the multibit index data. Compared with existing methods, the proposed BA‐CIM method can not only achieve a better bit error rate performance but also use the least pseudo‐code resources. Moreover, BA‐CIM has the best comprehensive performance improvement and is far superior to other methods. This research can provide technical support for the application of efficient spread spectrum communication. [ABSTRACT FROM AUTHOR]

This paper is devoted to software-defined radio (SDR) implementation of frequency modulated antipodal chaos shift keying (FM-ACSK) transceiver and presents results of prototype testing in real conditions. This novel and perspective class of spread-spectrum communication systems employs chaotic synchronization for the acquisition and tracking of the analog chaotic spreading code and does not need resource-demanding cross-correlation. The main motivation of the given work is to assess the performance of FM-ACSK in real conditions and demonstrate that chaotic synchronization can be considered an efficient spread-spectrum demodulation method. The work focuses on the real-time implementation aspects of the modulation-demodulation algorithms, forward error correction (FEC) and symbol timing synchronization approach in MATLAB Simulink. The performance of the presented prototype is assessed via extensive testing, which includes measurement of bit error ratio (BER) in single-user and multi-user scenarios, estimation of carrier frequency offset (CFO) impact and image transmission over-the-air between two independent sites and comparison with classical frequency hopping spread spectrum (FHSS). The paper shows that the presented class of the spread spectrum communication systems demonstrates good performance in low signal-to-noise ratio (SNR) conditions and in terms of BER significantly outperforms the classic spread-spectrum modulation schemes which employ correlation-based detection. [ABSTRACT FROM AUTHOR]

Abstract A method based on beam tracking in an underwater acoustic (UWA) time‐varying channel was proposed to improve the performance of UWA spread spectrum communication systems using arrays. In the ocean, the acoustic signal reaches the receiver through various paths, and the signal on each path has its own propagation delay and incidence angle. To effectively use the time and space characteristics of the received signal in a typical time‐varying or all types of UWA channels of mobile communication scenarios, the multiple signal classification (MUSIC) algorithm constantly updates the beam orientation. In addition, the receiving signal beamforming and maximum ratio combination can solve the severe inter‐symbol interference in a sea channel and significantly improve the signal‐to‐noise ratio of the received signal; the UWA spread spectrum communication system is more reliable. Through computer simulation and an actual pool experiment, a space–time receiver for an UWA spread spectrum communication system with beam tracking was successfully implemented.

This paper proposes and analyzes a modification to the standard matched filtering operation utilized in filter-bank multicarrier spread spectrum (FB-MC-SS) communications. This modification suppresses the impact of partial-band interferers without a priori knowledge of their location within the band of transmission and/or their power characteristics. A performance analysis of the proposed matched filter, which indicates its usefulness in environments where interference is likely to be experienced, is presented. It is shown that whereas the standard matched filter proves to be ineffective for packet detection and timing acquisition in such harsh environments, the modified matched filter successfully removes the harmful effects of interferers. This is found to be a unique feature of FB-MC-SS which is non-existent in other alternative spread spectrum methods.

As Internet users interacting with their different friends in different social networks, the de-anonymization problem has been raising improving concern. Since the assailants may de-anonymize a social network by matching it with a correlated sanitized network and identifying anonymized user identities, multifarious arts study on the theoretical conditions or practical algorithms for correctly de-anonymizing a social network. Except for the structural information of these social networks, there has also been bounteous works taking advantage of some pre-identified seed nodes for reference in the anonymized network. In this paper, we systematically probe the theoretical conditions and algorithmic approaches for correctly matching two different-sized social networks by leveraging the multi-hop neighborhood relationships. A limited number of seeds are also taken into consideration as auxiliary information. To this end, we introduce the de-anonymization problem with the aid of the collectiveness and the collective adjacency disagreements, which are the collection of disagreements of different multi-hop adjacency matrices. We theoretically demonstrate that minimizing the collective adjacency disagreements can help match two social networks even in a very sparse circumstance, as it significantly enlarges the difference between the mismatched node pairs and the correctly matched pairs. Besides, the seeds is proved to bring positive influence in improving the de-anonymization accuracy. Algorithmically, we relax the domain of the matching function to continuum and adopt the conditional gradient descending method on the collective-form objective, to efficiently minimize the collective adjacency disagreements of two networks. We conduct tremendous experiments on different networks with or without seeds, the results of which return desirable de-anonymization accuracies and reveal the advantages of the collectiveness: the collectiveness manifests rich structural information, thereby most nodes can be correctly matched with their correspondences even in some sparse networks, where merely utilizing the 1-hop adjacency relationships might fail to work. [ABSTRACT FROM AUTHOR]

The objective of this study is to evaluate Grassmannian constellations combined with a spread spectrum multiple access scheme for underwater acoustic mobile multiple access communication systems. These communication systems enable the coordination of a fleet of Autonomous Underwater Vehicles (AUVs) from a surface or bottom control unit, e.g., a boat. Due to its robustness against phase rotation, the demodulator of Grassmannian constellations uses non-coherent detection, and the main advantage of such modulation lies in the spectrum efficiency gain with respect to conventional differential modulation. The communication system under study in this paper consists of (i), at the transmitter side, a Grassmannian modulation used in an orthogonal spread spectrum multiple access scheme called Multiuser Hyperbolic Frequency Modulation (MU-HFM) and (ii), at the receiver side, a non-coherent array decoder. The modulation and demodulation are presented as well as the considered spreading sequences. Finally, performances of the proposed transmission scheme are evaluated over replayed underwater acoustic channel responses collected at sea by a multi-sensor acoustic acquisition system. [ABSTRACT FROM AUTHOR]

Many-core systems are susceptible to attacks launched by thermal covert channel (TCC) attacks. Detection of TCC attacks often relies on the use of threshold-based approaches or variants, and a countermeasure to thwart the channel can be applied only after an attack is deemed to be present. In this article, we describe a direct sequence spread spectrum (DSSS)-based TCC, where its thermal data are modulated by a pseudo-random bit sequence. Unfortunately, such DSSS-based TCC has an extremely low signal strength that the signal is nearly indistinguishable from the noise and thus cannot be detected by any existing threshold-based detection methods. To combat this stealthy TCC, we propose a novel detection scheme that lets the received signal pass through a differential filter where irrelevant frequency components occupied mainly by the noise gets eliminated and the filtered signal is next compared against a threshold for successful detection. Experimental results show that the DSSS-based TCC can effectively survive detection by the existing detection methods with its BER as low as 4%. In contrast, with the proposed detection and countermeasure applied, the detection accuracy jumps to 89%, and the BER of the DSSS-based TCC soars to 50%, which indicates that the TCC is practically shut down. [ABSTRACT FROM AUTHOR]

This paper provides a comprehensive performance comparison between a current robust military waveform; namely, MIL-STD-188-110D, Waveform 0, and a filter bank multicarrier spread-spectrum (FBMC-SS) waveform proposed for communications through ionospheric/skywave HF channels. Waveform 0 is effectively a direct sequence spread spectrum waveform that uses Walsh multi-codes to enhance the information transmission rate. It may thus be referred to as Walsh-DSSS. FBMC-SS, on the other hand, makes use of filter banks to provide excellent performance when the received signal is subject to partial band interference. Successful application of FBMC-SS for communications across skywave HF channels has been previously demonstrated, both theoretically and through experimental work. However, very little has been done to contrast FBMC-SS against Walsh-DSSS. The goal of this paper is to first add new features to FBMC-SS to bring it on par with Walsh-DSSS. These features include: (i), introduction of multi-codes that achieve a comparable (or better) data rate to Walsh-DSSS; and (ii), addition of a scrambling step applied to the multi-codes to make the receiver detection robust against widely spread multipaths. With this established, in the second part of the paper, we examine the performance of the developed FBMC-SS against Walsh-DSSS when both are applied for communications across skywave HF channels. The two waveforms are compared both through a theoretical study and through experimental works across several skywave channels ranging from hundreds to thousands of kilometers. [ABSTRACT FROM AUTHOR]

In this paper, we aim to improve the connectivity, scalability, and energy efficiency of machine-type communication (MTC) networks with different types of MTC devices (MTCDs), namely Type-I and Type-II MTCDs, which have different communication purposes. To this end, we propose two transmission schemes called connectivity-oriented machine-type communication (CoM) and quality-oriented machine-type communication (QoM), which take into account the stochastic geometry-based deployment and the random active/inactive status of MTCDs. Specifically, in the proposed schemes, the active Type-I MTCDs operate using a novel Bernoulli random process-based simultaneous wireless information and power transfer (SWIPT) architecture. Next, utilizing multi-user power-domain non-orthogonal multiple access (PD-NOMA), each active Type-I MTCD can simultaneously communicate with another Type-I MTCD and a scalable number of Type-II MTCDs. In the performance analysis of the proposed schemes, we prove that the true distribution of the received power at a Type-II MTCD in the QoM scheme can be approximated by the Singh-Maddala distribution. Exploiting this unique statistical finding, we derive approximate closed-form expressions for the outage probability (OP) and sum-throughput of massive MTC (mMTC) networks. Through numerical results, we show that the proposed schemes provide a considerable sum-throughput gain over conventional mMTC networks. [ABSTRACT FROM AUTHOR]

Uneven clustering is an effective solution to solve the energy hole problem in multihop cognitive radio sensor networks (CRSNs). However, current literature leaves control overhead and multihop intercluster routing out of consideration and adopts constant weight coefficients for cluster radius calculation instead of reasonably setting their values according to specific network configurations. To solve the above problems, a distributed energy balance-oriented uneven clustering routing protocol (EBUCRP) is proposed in this article. First, by fully considering the energy consumption of control information exchange and data transmission, EBUCRP theoretically derives the optimal cluster radius of each unit within which distributed clusters are formed. Second, communication capability-based selection criteria are defined from joint energy and spectral efficiency perspectives to help select high-quality cluster heads and next-hop relays. In this case, the monitoring information can be transferred to the sink through efficient intracluster data aggregation and intercluster multihop forwarding. Third, EBUCRP strictly restricts the energy consumption of control information exchange during network operation. Simulation results show that EBUCRP gains obvious advantages over competing protocols in enhancing the lifetime and supervision capability of both single-hop and multihop CRSNs. [ABSTRACT FROM AUTHOR]

Multihop relaying is a potential technique to mitigate channel impairments in optical wireless communications (OWC). In this paper, multiple fixed-gain amplify-and-forward (AF) relays are employed to enhance the OWC performance under the combined effect of atmospheric turbulence, pointing errors, and fog. We consider a long-range OWC link by modeling the atmospheric turbulence by the Fisher-Snedecor ${\mathcal {F}}$ distribution, pointing errors by the generalized non-zero boresight model, and random path loss due to fog. We also consider a short-range OWC system by ignoring the impact of atmospheric turbulence. We derive novel upper bounds on the probability density function (PDF) and cumulative distribution function (CDF) of the end-to-end signal-to-noise ratio (SNR) for both short and long-range multihop OWC systems by developing exact statistical results for a single-hop OWC system under the combined effect of ${\mathcal {F}}$ -turbulence channels, non-zero boresight pointing errors, and fog-induced fading. Based on these expressions, we present analytical expressions of outage probability (OP) and average bit-error-rate (ABER) performance for the considered OWC systems involving single-variate Fox's H and Meijer's G functions. Moreover, asymptotic expressions of the outage probability in high SNR region are developed using simpler Gamma functions to provide insights on the effect of channel and system parameters. The derived analytical expressions are validated through Monte-Carlo simulations, and the scaling of the OWC performance with the number of relay nodes is demonstrated with a comparison to the single-hop transmission. [ABSTRACT FROM AUTHOR]

In this paper, we consider a wireless multihop device-to-device (D2D) based mobile edge computing (MEC) system, where the destination wireless device (WD) is scheduled to compute nomographic functions. Under the MapReduce framework and motivated by reducing communication resource overhead, we propose a new multi-level over-the-air (OTA) aggregation scheme for the destination WD to collect the individual partially aggregated intermediate values (IVAs) for reduction from multiple source WDs in the data shuffling phase. For OTA aggregation per level, the source WDs employ a truncated channel-inverse structure multiplied by their individual transmit coefficients in transmission over the same time-frequency resource blocks, and the destination WD finally uses a receive filtering factor to construct the aggregated IVA. Under this setup, we develop a unified transceiver design framework that minimizes the mean squared error (MSE) of the aggregated IVA at the destination WD subject to the source WDs’ individual power constraints, by jointly optimizing the individual transmit coefficients of the source WDs and the receive filtering factor of the destination WD. The formulated power-constrained MSE minimization problem is non-convex. First, based on the primal decomposition method, we derive the closed-form solution under the special case of a common transmit coefficient. This shows that the common transmit coefficient of the source WDs is determined by the minimal transmit power budget among them. Next, for the general case, we transform the original problem into a quadratic fractional programming problem, and then develop a low-complexity algorithm to obtain the (near-) optimal solution by leveraging Dinkelbach’s algorithm along with the Gaussian randomization method. Numerical results are provided to demonstrate the significant performance gains achieved by the proposed multi-level OTA aggregation scheme over various existing schemes. [ABSTRACT FROM AUTHOR]

The transmission of huge amounts of data generated from various sensors is the basis and prerequisite for the analysis and prediction of the marine ecosystem. The special geographical conditions of the ocean determine that its data transmission is different from the common terrestrial data transmission. In this study, a marine environmental monitoring network architecture is proposed to collect environmental data from marine ecosystems using a heterogeneous network constructed by a multi-hop network and a satellite network. Considering the characteristics of satellite networks, such as high bandwidth delay product (BDP), long latency and high bit error rate, this work proposes a transmission scheme that improves the transmission performance of Transmission Control Protocol/Internet Protocol (TCP/IP)-based Internet networks over satellite networks. The improved scheme increases the monitoring data transmission rate, distinguishes between random data loss and congested data loss, rationalizes the threshold in fast recovery, and improves the overall transmission performance of the marine environmental monitoring network. The experimental results show that the proposed scheme can greatly improve the transmission performance of the monitoring network compared with traditional transmission protocols. The network model proposed in this study makes full use of current advanced network technologies, including multi-hop networks, wireless sensor networks, and satellite networks to expand the monitoring area at sea. This study provides a useful reference for the network model and data transmission for ocean monitoring. [ABSTRACT FROM AUTHOR]

The multi-hop unmanned aerial vehicle (UAV) network can serve as data relays where ground users (GUs) do not have reliable direct connections to the base station (BS). Existing works mainly focus on simple dual-hop system. In this paper, we investigate the packet routing problem in a multi-hop UAV relay network to minimize the data transmission time and enhance the network throughput. However, the dynamic network topology due to UAV mobility makes the packet routing challenging since the limited communication range of each UAV leads to volatile wireless connection. Moreover, the line-of-sight communication links may cause strong interference among UAVs. Towards this end, we propose a novel multi-agent deep reinforcement learning based algorithm, named as multi-agent QMIX (MAQMIX) to: 1) design proper UAVs’ trajectories to serve the moving GUs while maintaining the network connection; 2) allocate frequency resource properly among UAVs to alleviate the impact of interference; and 3) choose a proper next hop UAV for each data packet to reduce the transmission time and probability of network congestion. The proposed MAQMIX has two novel training mechanisms, i.e., intra-UAV and inter-UAV training mechanisms, which can tackle the large action space issue and coordinate the training among UAVs in the multi-hop UAV relay network. Simulation results demonstrate that the MAQMIX outperforms baseline schemes in terms of the network congestion avoidance, throughput, and transmission time. [ABSTRACT FROM AUTHOR]

Copyright of Systems Engineering & Electronics is the property of Journal of Systems Engineering & Electronics Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Many applications operating in the Internet of Things (IoT) require timely and fair data collection from devices. This has motivated research into a new metric called Age of Information (AoI). This paper contributes to this effort by proposing to minimize the maximum average AoI (min-max AoI) in a multi-hop IoT network comprising of solar-powered Power Beacons (PBs). It outlines a Mixed Integer Linear Program (MILP) that jointly optimizes: (i) the beamforming vector used by PBs to charge devices, and (ii) routing, which determines how samples from devices are forwarded to a sink node, and (iii) the sampling time of sources. It also presents two protocols: Centralized Linear Relaxation (CLR) and Distributed Path Selection (DPS), respectively. CLR is run by the sink to determine the transmit power of PBs and the path of each source using two Linear Programs (LPs). On the other hand, DPS is a distributed approach whereby PBs and sources make their own decisions using local information. Our simulation results show that min-max AoI increases with the number of sources, but reduces with increasing number of PBs. The number of paths available to a source, the number of frames, and solar panel size have limited impact on performance. The min-max AoI of CLR and DPS is $1.60\times $ and $1.95\times $ higher than that of MILP. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) is a promising 6G technology that can improve wireless communication capacity in a cost-effective and energy-efficient manner, by adjusting a large number of passive reflectors to appropriately change the signal propagation. In this study, we identified the achievable rate region of a two-hop interference channel with distributed multiple IRS relays. To do so, we formulated a non-convex problem that characterizes the rate-profile, and found its solution using successive convex approximation (SCA). We then proposed an alternating direction method of multipliers (ADMM) and alternating optimization (AO) based distributed and low-complex IRS control that maximizes the achievable sum-rate, and proved its convergence and optimality. We then compared the proposed IRS control with semi-definite relaxation (SDR)-, random phase-, deep reinforcement learning (DRL)- based IRS controls, and optimal amplify-and-forward (AF)-, interference neutralization (IN)-, and decode-and-forward (DF) based relaying schemes. We demonstrated that the proposed control with multiple IRS elements outperforms the benchmark controls in terms of the achievable rate region, achievable sum-rate, and energy efficiency under same power budget. We also confirmed that the discrete phase approximation of the proposed control provides near-optimal performance with fewer bits, and the proposed control is robust under imperfect CSI condition. The proposed controls can be efficiently applied to large-scale multi-pair multihop device-to-device and machine-type device communications in the interference-limited or low-powered dense networks of 5G and 6G environments. [ABSTRACT FROM AUTHOR]

Wireless sensor–actuator networks (WSAN) for real-time reliable communications are being embraced in the Industrial Internet of Things. One key property required for WSAN is adaptability with respect to dynamic environments. Most existing studies assume that a network manager computes global schedules and disseminates schedule information to every node whenever the network parameters need to be updated. Such a centralized approach may degrade control performance due to nonreal-time response to dynamic environments. In this article, we introduce a novel time division multiple access MAC protocol, AdaptiveHART, which updates the network parameters in real-time without the dissemination intervals. AdaptiveHART achieves a reduction in adaptation latency up to 74%, maximum schedulable ratio, and control performance up to 75% than the conventional WirelessHART. We assess our protocol using a stochastic response time analysis, which provides an accurate end-to-end delay distribution and a schedulability condition that can guarantee real-time performance in WSAN. [ABSTRACT FROM AUTHOR]

Wireless Multimedia Sensor Network (WMSN) is increasingly being deployed for surveillance, monitoring and Internet-of-Things (IoT) sensing applications where a set of cameras capture and compress local images and then transmit the data to a remote controller. Such captured local images may also be compressed in a multi-view fashion to reduce the redundancy among overlapping views. In this paper, we present a novel paradigm for compressed-sensing-enabled multi-view coding and streaming in WMSN. We first propose a new encoding and decoding architecture for multi-view video systems based on Compressed Sensing (CS) principles, composed of cooperative sparsity-aware block-level rate-adaptive encoders, feedback channels and independent decoders. The proposed architecture leverages the properties of CS to overcome many limitations of traditional encoding techniques, specifically massive storage requirements and high computational complexity. Then, we present a modeling framework that exploits the aforementioned coding architecture. The proposed mathematical problem minimizes the power consumption by jointly determining the encoding rate and multi-path rate allocation subject to distortion and energy constraints. Extensive performance evaluation results show that the proposed framework is able to transmit multi-view streams with guaranteed video quality at lower power consumption. [ABSTRACT FROM AUTHOR]

A directional airborne network consisting of nodes equipped with multibeam antennas is considered. These nodes use the frequency division duplex mode of communication. This allows formation of multiple routes between a pair of source and destination nodes, where every forward and reverse route completely overlaps. Each of these routes supports the bidirectional traffic. These routes are formed using the bidirectional ad hoc on-demand multipath distance vector (BAOMDV) routing protocol. In this article, we propose a local route repair scheme, called BAOMDV-LR, when these routes break due to node mobility. The proposed route repair scheme preserves the overlapping and link-disjoint (or node-disjoint) characteristics of the routes, while reducing the need for expensive route rediscovery. The proposed scheme significantly improves the overall network performance for bidirectional traffic (in terms of packet delivery ratio, end-to-end delay, and routing overhead) as compared to the BAOMDV and other existing routing schemes, especially at higher node speeds and data rates. [ABSTRACT FROM AUTHOR]

SMART (Single-cycle Multi-hop Asynchronous Repeated Traversal) Network-on-Chip (NoC), a recently proposed dynamically reconfigurable NoC, enables single-cycle long-distance communication by building single-bypass paths directly between distant communication pairs. However, such a single-cycle single-bypass path will be readily broken when contention occurs. Thus, packets will be buffered at intermediate routers with blocking latency from other contending packets, and extra router-stage latency to rebuild the remaining path when available, reducing the bypassing benefits that SMART NoC offers. In this article, we for the first time propose an effective contention-minimized routing algorithm to achieve maximal bypassing in SMART NoCs. Specifically, we identify two potential routes for packets: direct route, with which packets can reach the destination in a single bypass; and indirect route, with which packets can reach the destination in multiple bypasses via a (multiple) intermediate router(s). The novel feature of the proposed routing strategy is that, contrary to an intuitive approach, not the routes with minimal distance but the indirect routes via the arbitrary intermediate routers (even if they may be non-minimal) that avoid contentions yield the minimized end-to-end latency. Our new routing strategy can greatly enrich the path diversity, effectively minimize the conflicts between communication pairs, greatly balance the workloads and fully utilize bypass paths. Evaluation on realistic benchmarks demonstrates the effectiveness of the proposed routing strategy, which achieves average performance improvement by 35.48 percent in communication latency, 28.31 percent in application schedule length, and 37.59 percent in network throughput, compared with the current routing in SMART NoCs. [ABSTRACT FROM AUTHOR]

Until now, multi-hop device-to-device (MD2D) routing in mobile wireless networks has been designed to operate over a single-protocol routing framework. Consequently, to the best of our knowledge, no framework has been developed to enable the dynamic deployment and switching of multiple MD2D routing protocols under one framework. This paper proposes a multi-protocol framework to introduce the idea of clustering a cell and deploying different MD2D routing protocols for each cluster based on the cluster requirements. To this end, four clusters are developed with varying network conditions (i.e., node density, mobility rate, and the number of flows). Then, the performance of our two previously designed multi-hop routing protocols, namely hybrid SDN architecture for wireless distributed networks (HSAW) and source-based virtual ad hoc routing protocol (VARP-S), are investigated in each cluster in terms of energy consumption, end-to-end (E2E) delay, packet loss, and cellular-band overhead. Based on the achieved simulation results, a multiple-criteria decision-making (MCDM) approach based on the analytic hierarchy process (AHP) is developed to choose the most suitable protocol for each cluster to provide the best performance. The simulation results indicate that our proposed multi-protocol framework provides better performance compared to traditional single-protocol architectures. [ABSTRACT FROM AUTHOR]

This paper presents techniques that are expected to improve the bit error rate (BER) performance of Unmanned Aerial Vehicles (UAVs) communication systems. The decode-and-forward (DF)-based cooperative multi-hop Rician network using space shift keying (SSK) modulation is employed for this purpose. The SSK modulation and cooperative communication are merged and used together. This enhances the BER performance for multiple-input multiple-output (MIMO) channels, thus accentuating its significance as an important technique for consistently reliable communication methodology while, at the same time, eliminating wastage of energy. The new technique is named as high performance (HP) due to not only BER performance improvement but also increase of the diversity of the communication system. This new model is further used for multi-hop networks and the resulting BER characteristics are assessed for possible enhanced performance in Rician channels. The paper also showcases the generalized-n-hop BER equation for various multi-hop DF-based cooperative communication systems in diverse UAV models. The Monte Carlo simulations further confirm the theoretical results that already exist for transmit-receive antennas. This work also underlines the fact that the number of hops in a communication system has no bearing whatsoever on the BER performance diversity value. [ABSTRACT FROM AUTHOR]

Autonomous Vehicles (AVs) rely on a set of radar sensors operated on frequency modulated waveforms. Due to the large bandwidth requirement of frequency modulated radars, only a limited number of proximate vehicles can be allowed for a concurrent transmission within the available spectrum. However, with the explosive growth of AVs, the available spectrum may soon reach its capacity. As a results, the coexistence of multiple AVs working on same resource, may lead to the problem of Radar-to-Radar (R2R) interference, also known as radar blindness. In this paper, we propose the notion of coded waveforms to minimize the R2R interference among the vehicles operating on the same resource. Specifically, the spread spectrum codes have been used as another degree of freedom (i.e., along with time-frequency resources) to spread the inter-vehicular radar interference over the wider spectrum, which enable to orthogonalize more number of AVs over the available range of spectrum. In addition, we have formulated a Spread Spectrum-based Radar Transmission Scheme (SS-RTS), and described the transmission and reception through SS-RTS. Also, the SS-RTS has been compared with the existing Graph-based Resource Allocation (GRA) scheme. Further, simulation results verified that SS-RTS significantly reduces the inter-vehicular R2R interference and outperforms GRA in terms of blind probability. [ABSTRACT FROM AUTHOR]

Infrastructure-to-vehicle (I2V) and vehicle-to-vehicle (V2V) communications are often combined to extend the connectivity and coverage in the Intelligent Transportation System (ITS) and its applications, e.g., augmented reality, real-time parking management and online shopping. Through multi-hop I2V and V2V communications, requesting vehicles are always connected to road side units (RSUs) even when they do not reside within the RSUs’ coverage range. However, there may be not adequate network resource for several I2V and V2V links when multiple vehicles request services simultaneously. In this paper, we propose a joint frequency scheduling and power control scheme to enhance connectivity in multi-hop I2V/V2V networks. We associate I2V and V2V links with tuple-links, then formulate an NP-hard problem in which a frequency scheduler and a power controller are jointly designed for the tuple-links. The NP-hard problem is decomposed into two separate subproblems by employing the delayed column generation technique. Then, we employ a method for linear programming and a greedy algorithm to address these subproblems. Through numerical experiments with practical parameter settings, we demonstrate the proposed scheme outperforms several existing ones in terms of connectivity enhancement, measured by the service resumption number and average achieved throughput. Furthermore, the efficiency of our scheme is further enhanced when the number of available channels is high, and buffer size equipped to the requesting vehicles is large. [ABSTRACT FROM AUTHOR]

Aligned-Images Sum-set Inequalities are used in this work to study the Generalized Degrees of Freedom (GDoF) of the symmetric layered multi-hop interference channel under the robust assumption that the channel state information at the transmitters (CSIT) is limited to finite precision. First, the sum-GDoF value is characterized for the $2\times 2\times 2$ setting that is comprised of 2 sources, 2 relays, and 2 destinations. It is shown that the sum-GDoF does not improve even if perfect CSIT is allowed in the first hop, as long as the CSIT in the second hop is limited to finite precision. The sum GDoF characterization is then generalized to the $2\times 2\times \cdots \times 2$ setting that is comprised of $L$ hops. Remarkably, for large $L$ , the sum-GDoF value approaches that of the one-hop broadcast channel that is obtained by full cooperation among the two transmitters of the last hop, with finite precision CSIT. Previous studies of multi-hop interference networks either identified sophisticated GDoF optimal schemes under perfect CSIT, such as aligned interference neutralization and network diagonalization, that are powerful in theory but too fragile to be practical, or studied robust achievable schemes like classical amplify/decode/compress-and-forward without claims of information-theoretic optimality. In contrast, under finite precision CSIT, we show that the benefits of fragile schemes are lost, while a combination of classical random coding schemes that are simpler and much more robust, namely a rate-splitting between decode-and-forward and amplify-and-forward, is shown to be GDoF optimal. As such, this work represents another step towards bridging the gap between theory (optimality) and practice (robustness) with the aid of Aligned-Images Sum-set Inequalities. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Signal Processing is the property of Journal of Signal Processing and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Dual-function radar-communication (DFRC) based on frequency hopping (FH) MIMO radar (FH-MIMO DFRC) achieves symbol rate much higher than radar pulse repetition frequency. Such DFRC, however, is prone to eavesdropping due to the spatially uniform illumination of an FH-MIMO radar. In this paper, we reveal the potential of using permutations of hopping frequencies to achieve secure and high-speed FH-MIMO DFRC. Specifically, we identify the angle-dependent issue in detecting permutations and develop an element-wise phase compensation (EPC) to solve the issue for a legitimate user (Bob). EPC makes the demodulation at an eavesdropper (Eve) conditioned on knowing the angle-of-departure (AoD) of Bob. We also propose the random sign reversal (RSR) technique which randomly selects several antennas over hops and reverses their signs. Owing to EPC, there is a sign rule available for Bob. We employ the rule and develop a low-complexity algorithm for Bob to remove RSR. We further prove that, given the same signal-to-noise ratio, RSR plus EPC make the demodulation performance of Eve inferior to that of Bob in most angular regions. Confirmed by simulation, our design achieves substantially high physical layer security for FH-MIMO DFRC, improves demodulation performance compared with existing designs, and reduces mutual interference among radar targets. [ABSTRACT FROM AUTHOR]

Hop count distribution (HCD), generally formulated as a discrete probability distribution of the hop count, constitutes an attractive tool for performance analysis and algorithm design. This paper devotes to deriving an analytical HCD expression for a finite ad hoc network under the minimum hop-count routing protocols. Formulating the node distribution with binomial point process, the network is provided as a bounded area with all nodes randomly and uniformly distributed. Considering an arbitrary pair of source node (SN) and destination node, an innovative and straightforward definition is presented for HCD. In order to derive HCD out, an original mathematical framework, named as the equivalent area replacement method (EARM), is proposed and verified. Under the EARM, HCD is derived by first considering the special case where SN locates at the network center and then extending to the general case where SN is randomly distributed. For each case, the accuracy of our HCD model is evaluated by simulation comparison. Results show that our model matches well with the simulation results over a wide range of parameters. Particularly, the derived HCD outperforms the existing formulations in terms of the Kullback Leibler divergence, especially when SN is randomly distributed. [ABSTRACT FROM AUTHOR]

We study a heterogeneous wireless sensor network (WSN) where $N$ heterogeneous access points (APs) gather data from densely deployed sensors and transmit their sensed information to $M$ heterogeneous fusion centers (FCs) via multi-hop wireless communication. The heterogeneous optimal deployment of APs and FCs is modeled as an optimization problem with total wireless communication power consumption of the network as its objective function. We consider both static WSNs, where APs and FCs retain their deployed position, and mobile WSNs where APs and FCs can move from their initial deployment to their optimal locations. Based on the derived necessary conditions for the optimal deployment in static WSNs, we propose an iterative algorithm to deploy APs and FCs. In addition, we study the necessary conditions of the optimal movement-efficient deployment in mobile WSNs with constrained movement energy and present iterative algorithms to find such deployments, accordingly. Simulation results show that our proposed deployment algorithms outperform the existing methods in the literature, and achieve a lower total wireless communication power in both static and mobile WSNs. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) have attracted increasing attention in cross-regional communication. The interconnection between VANETs and satellite networks expands their communication range. To improve the transmission performance of heterogeneous networks composed of VANETs and satellite networks, this paper proposes an end-to-end transmission control scheme for satellite network-assisted VANETs, analyzes the bandwidth delay product of multihop VANETs through heterogeneous networks, and establishes a transmission control model applicable to cross-regional environments. To address the long delay and high bit error rate in heterogeneous networks, the model designs the congestion window in the slow start and congestion avoidance of the transmission scheme. The data transmission volume is increased in the slow start, and various packet losses are distinguished in congestion avoidance. The experimental results show that the scheme can achieve good transmission performance in heterogeneous networks composed of VANETs and satellite networks. The results show that VANETs data can be effectively transmitted in heterogeneous networks. Compared with the traditional transmission scheme, this simple and practical end-to-end transmission control scheme can improve speed by 83.49 kbps and reduce transmission duration time of FTP server by $4.72\times 10^{3}$ s. The results of this study provide a reference for massive data transmission in heterogeneous networks of VANETs and satellite networks. [ABSTRACT FROM AUTHOR]

We consider the problem of private polynomial computation (PPC) from a distributed storage system (DSS). In such setting a user wishes to compute a multivariate polynomial of degree at most $g$ over $f$ variables (or messages) stored in $n$ noncolluding coded databases, i.e., databases storing data encoded with an $[n,k]$ linear storage code, while revealing no information about the desired polynomial evaluation to the databases. For a DSS setup where data is stored using linear storage codes, we derive an outer bound on the PPC rate, which is defined as the ratio of the (minimum) desired amount of information and the total amount of downloaded information, and construct two novel PPC schemes. In the first scheme, we consider Reed-Solomon coded databases with Lagrange encoding, which leverages ideas from recently proposed star-product private information retrieval and Lagrange coded computation. The second scheme considers the special case of coded databases with systematic Lagrange encoding. Both schemes yield improved rates, while asymptotically, as $f\rightarrow \infty $ , the systematic scheme gives a significantly better computation retrieval rate compared to all known schemes up to some storage code rate that depends on the maximum degree of the candidate polynomials. [ABSTRACT FROM AUTHOR]