Filter by subject:
- Codes [5608]
- Electrical and electronic engineering [5596]
- Communications [5596]
- Information and communication theory [5596]
- Modulation and coding methods [5596]
- Telecommunication [2324]
- General topics, engineering mathematics and materials science [1911]
- Engineering mathematics and mathematical techniques [1861]
- Radio links and equipment [1665]
- Computer and control engineering [1363]
- [1193]
- http://iet.metastore.ingenta.com/content/subject/b0240,http://iet.metastore.ingenta.com/content/subject/b6150,http://iet.metastore.ingenta.com/content/subject/b0240z,http://iet.metastore.ingenta.com/content/subject/c1000,http://iet.metastore.ingenta.com/content/subject/c5000,http://iet.metastore.ingenta.com/content/subject/c1200,http://iet.metastore.ingenta.com/content/subject/b5000,http://iet.metastore.ingenta.com/content/subject/b5200,http://iet.metastore.ingenta.com/content/subject/b6140c,http://iet.metastore.ingenta.com/content/subject/b0290,http://iet.metastore.ingenta.com/content/subject/c5200,http://iet.metastore.ingenta.com/content/subject/c1260,http://iet.metastore.ingenta.com/content/subject/b6150e,http://iet.metastore.ingenta.com/content/subject/b6250f,http://iet.metastore.ingenta.com/content/subject/c5260,http://iet.metastore.ingenta.com/content/subject/c6000,http://iet.metastore.ingenta.com/content/subject/c6100,http://iet.metastore.ingenta.com/content/subject/b5230,http://iet.metastore.ingenta.com/content/subject/b6260,http://iet.metastore.ingenta.com/content/subject/b6210,http://iet.metastore.ingenta.com/content/subject/b0290f,http://iet.metastore.ingenta.com/content/subject/c6130,http://iet.metastore.ingenta.com/content/subject/b1000,http://iet.metastore.ingenta.com/content/subject/c1250,http://iet.metastore.ingenta.com/content/subject/b6110,http://iet.metastore.ingenta.com/content/subject/b1200,http://iet.metastore.ingenta.com/content/subject/b6400,http://iet.metastore.ingenta.com/content/subject/b0260,http://iet.metastore.ingenta.com/content/subject/c1100,http://iet.metastore.ingenta.com/content/subject/c5260b,http://iet.metastore.ingenta.com/content/subject/b5270,http://iet.metastore.ingenta.com/content/subject/b0210,http://iet.metastore.ingenta.com/content/subject/b1265,http://iet.metastore.ingenta.com/content/subject/c4000,http://iet.metastore.ingenta.com/content/subject/b6150m,http://iet.metastore.ingenta.com/content/subject/c6130s,http://iet.metastore.ingenta.com/content/subject/b6150d,http://iet.metastore.ingenta.com/content/subject/b6130,http://iet.metastore.ingenta.com/content/subject/b6300,http://iet.metastore.ingenta.com/content/subject/b6250g,http://iet.metastore.ingenta.com/content/subject/b6220,http://iet.metastore.ingenta.com/content/subject/b6420,http://iet.metastore.ingenta.com/content/subject/b6430,http://iet.metastore.ingenta.com/content/subject/c4100,http://iet.metastore.ingenta.com/content/subject/a,http://iet.metastore.ingenta.com/content/subject/b6140m,http://iet.metastore.ingenta.com/content/subject/b6150c,http://iet.metastore.ingenta.com/content/subject/b4000,http://iet.metastore.ingenta.com/content/subject/b6135,http://iet.metastore.ingenta.com/content/subject/b5270d,http://iet.metastore.ingenta.com/content/subject/b0250,http://iet.metastore.ingenta.com/content/subject/b2000,http://iet.metastore.ingenta.com/content/subject/c7000,http://iet.metastore.ingenta.com/content/subject/b7000,http://iet.metastore.ingenta.com/content/subject/b0230,http://iet.metastore.ingenta.com/content/subject/b2500,http://iet.metastore.ingenta.com/content/subject/c5100,http://iet.metastore.ingenta.com/content/subject/b6135c,http://iet.metastore.ingenta.com/content/subject/b0100,http://iet.metastore.ingenta.com/content/subject/b0290z,http://iet.metastore.ingenta.com/content/subject/b1265b,http://iet.metastore.ingenta.com/content/subject/c1140,http://iet.metastore.ingenta.com/content/subject/b2570,http://iet.metastore.ingenta.com/content/subject/b4100,http://iet.metastore.ingenta.com/content/subject/b6320,http://iet.metastore.ingenta.com/content/subject/b0170,http://iet.metastore.ingenta.com/content/subject/c5600,http://iet.metastore.ingenta.com/content/subject/b6210l,http://iet.metastore.ingenta.com/content/subject/a4000,http://iet.metastore.ingenta.com/content/subject/b0170n,http://iet.metastore.ingenta.com/content/subject/c1140z,http://iet.metastore.ingenta.com/content/subject/b6120d,http://iet.metastore.ingenta.com/content/subject/a4200,http://iet.metastore.ingenta.com/content/subject/b5270b,http://iet.metastore.ingenta.com/content/subject/b6220m,http://iet.metastore.ingenta.com/content/subject/c4200,http://iet.metastore.ingenta.com/content/subject/b5210,http://iet.metastore.ingenta.com/content/subject/b6140b,http://iet.metastore.ingenta.com/content/subject/b6260c,http://iet.metastore.ingenta.com/content/subject/b0290h,http://iet.metastore.ingenta.com/content/subject/c7400,http://iet.metastore.ingenta.com/content/subject/b5210c,http://iet.metastore.ingenta.com/content/subject/b6260m,http://iet.metastore.ingenta.com/content/subject/c7410,http://iet.metastore.ingenta.com/content/subject/c5620,http://iet.metastore.ingenta.com/content/subject/c1180,http://iet.metastore.ingenta.com/content/subject/a4280,http://iet.metastore.ingenta.com/content/subject/c4190,http://iet.metastore.ingenta.com/content/subject/c4130
- b0240,b6150,b0240z,c1000,c5000,c1200,b5000,b5200,b6140c,b0290,c5200,c1260,b6150e,b6250f,c5260,c6000,c6100,b5230,b6260,b6210,b0290f,c6130,b1000,c1250,b6110,b1200,b6400,b0260,c1100,c5260b,b5270,b0210,b1265,c4000,b6150m,c6130s,b6150d,b6130,b6300,b6250g,b6220,b6420,b6430,c4100,a,b6140m,b6150c,b4000,b6135,b5270d,b0250,b2000,c7000,b7000,b0230,b2500,c5100,b6135c,b0100,b0290z,b1265b,c1140,b2570,b4100,b6320,b0170,c5600,b6210l,a4000,b0170n,c1140z,b6120d,a4200,b5270b,b6220m,c4200,b5210,b6140b,b6260c,b0290h,c7400,b5210c,b6260m,c7410,c5620,c1180,a4280,c4190,c4130
- [991],[936],[872],[770],[646],[642],[617],[615],[571],[528],[467],[424],[415],[404],[378],[372],[372],[365],[364],[338],[336],[332],[310],[307],[300],[299],[298],[286],[281],[266],[231],[224],[219],[219],[214],[199],[195],[190],[169],[162],[154],[154],[153],[152],[147],[146],[146],[143],[143],[139],[137],[130],[121],[119],[118],[118],[115],[108],[106],[106],[106],[105],[103],[102],[102],[100],[98],[97],[96],[93],[92],[90],[88],[83],[81],[77],[76],[73],[73],[72],[72],[69],[69],[69],[68],[67],[65],[64],[63]
- /search/morefacet;jsessionid=4ae1tkcsmfrn4.x-iet-live-01
- /content/searchconcept;jsessionid=4ae1tkcsmfrn4.x-iet-live-01?option1=pub_concept&sortField=prism_publicationDate&pageSize=20&sortDescending=true&value1=b6120b&facetOptions=2&facetNames=pub_concept_facet&operator2=AND&option2=pub_concept_facet&value2=
- See more See less
Filter by content type:
Filter by publication date:
- 1995 [331]
- 1997 [285]
- 1996 [238]
- 1994 [237]
- 1998 [202]
- 2011 [170]
- 2006 [158]
- 2012 [158]
- 2005 [151]
- 2008 [146]
- 1993 [142]
- 2007 [142]
- 1999 [140]
- 2000 [140]
- 2009 [135]
- 2010 [132]
- 2019 [129]
- 2015 [126]
- 2013 [122]
- 2004 [121]
- 2003 [120]
- 1991 [116]
- 1992 [115]
- 2016 [108]
- 2014 [94]
- 1989 [92]
- 2018 [91]
- 2001 [89]
- 2002 [89]
- 2020 [89]
- 2017 [88]
- 1988 [83]
- 1990 [83]
- 1987 [55]
- 1984 [42]
- 1986 [41]
- 1980 [34]
- 1982 [34]
- 1976 [33]
- 1985 [31]
- 1983 [30]
- 1978 [28]
- 1975 [27]
- 1981 [27]
- 1974 [25]
- 1979 [22]
- 1977 [21]
- 1972 [15]
- 1973 [15]
- 1966 [7]
- 2021 [7]
- 1967 [6]
- 1971 [5]
- 1969 [4]
- 1970 [4]
- 1954 [2]
- 1962 [1]
- 1964 [1]
- 1968 [1]
- See more See less
Filter by author:
- B. Honary [76]
- P.G. Farrell [47]
- L. Hanzo [39]
- M. Ghanbari [33]
- M. Darnell [30]
- B.G. Evans [29]
- A.M. Kondoz [24]
- P. Sweeney [24]
- L. Harn [23]
- R.A. Carrasco [23]
- I.S. Reed [22]
- A.G. Burr [20]
- B. Vucetic [20]
- R. Steele [20]
- T.K. Truong [20]
- V.K. Bhargava [19]
- A. Popplewell [18]
- J.J. O'Reilly [18]
- M. Tomlinson [18]
- X. Wang [18]
- H.C. Ferreira [16]
- P.M. Grant [16]
- Y. Li [16]
- R.J. Clarke [15]
- G. Markarian [14]
- L.F. Turner [14]
- P.Z. Fan [14]
- Yang Xiao [14]
- J. Wang [13]
- Xiao Ma [13]
- A.H. Aghvami [12]
- A.K. Khandani [12]
- H. Weinrichter [12]
- J. Jiang [12]
- L.H.C. Lee [12]
- M. Benaissa [12]
- M.J.N. Sibley [12]
- S. Benedetto [12]
- F. Adachi [11]
- F.H. Ali [11]
- G. Benelli [11]
- G. Montorsi [11]
- J.P. Fonseka [11]
- Moon Ho Lee [11]
- P. Coulton [11]
- G.M. Drury [10]
- I.J. Fair [10]
- J.-G. Zhang [10]
- Jing Lei [10]
- Q. Wang [10]
- A.D. Fagan [9]
- C.-S. Laih [9]
- E.A.B. da Silva [9]
- F. Eryurtlu [9]
- L. Wang [9]
- M.R. Aref [9]
- Mohammad Reza Aref [9]
- S. Papaharalabos [9]
- T.J. Dennis [9]
- X. Zhang [9]
- X.-H. Peng [9]
- A.G. Constantinides [8]
- Aijun Liu [8]
- C.-C. Chang [8]
- D.A. Bell [8]
- D.H. Green [8]
- D.R. Bull [8]
- E. Dawson [8]
- E.V. Jones [8]
- Fengfan Yang [8]
- H. Lee [8]
- J. Wu [8]
- J. Yuan [8]
- J.M. Hannah [8]
- J.S. Thompson [8]
- K. Kitayama [8]
- Li Ping [8]
- Lin Wang [8]
- M. Tomizawa [8]
- P.S. Moharir [8]
- R.M.F. Goodman [8]
- S.T.J. Fenn [8]
- T. Matsumoto [8]
- T.C. Chuah [8]
- W.G. Chambers [8]
- Yu Zhang [8]
- Ü. Aygölü [8]
- B.M. Popović [7]
- B.S. Sharif [7]
- C. Berrou [7]
- Choong WoongLee [7]
- D.E. Pearson [7]
- D.G. Sampson [7]
- E. Salari [7]
- F. Said [7]
- F.C.M. Lau [7]
- G. Wade [7]
- G.R. Higgie [7]
- H. Gharavi [7]
- H.F. Rashvand [7]
- See more See less
Filter by access type:
In this chapter, we present a new hardware test-bed to demonstrate closed-loop precoded communications for interference mitigation in multibeam ultrahigh throughput satellite systems under realistic payload and channel impairments. We build the test-bed to demonstrate a real-time channel aided precoded transmission under realistic conditions such as the power constraints and satellite-payload nonlinearities. We develop a scalable architecture of an SDR platform with the DVB-S2X piloting. The SDR platform consists of two parts: analog-to-digital (ADC) and digital-to-analog (DAC) converters preceded by radio frequency (RF) front end and field-programmable gate array (FPGA) backend. The former introduces realistic impairments in the transmission chain such as carrier frequency and phase misalignments, quantization noise of multichannel ADC and DAC, and nonlinearities of RF components. It allows evaluating the performance of the precoded transmission in a more realistic environment rather than using only numerical simulations. We benchmark the performance of the communication standard in realistic channel scenarios, evaluate received signal SNR, and measure the actual channel throughput using LDPC codes.
Satellite precoding is a promising technique to meet the target data rates of the future high throughput satellite systems and the costs per bit as required by 5G applications and networks, but it requires strict synchronization among the transmitted waveforms, in addition to accurate channel state information. Most of the published work about this topic consider ideal oscillators, but in practice, the output of an oscillator is not a single spectral line at the nominal frequency. This chapter proposes a model for the oscillator phase noise and analyzes the resulting received signal to interference plus noise ratio (SNIR) in a satellite communication system using precoding. Simulations of a communication satellite system with a two-beam transponder and two receivers were performed to compute the effective SNIR. This work uses a simulator which also considers practical impairments such as time misalignment, errors in the channel state information, interference, thermal noise, and phase noise masks for satellite oscillators. The precoding methods used for the analysis are zero forcing (ZF) and minimum mean square error (MMSE). The obtained results prove that there is a degradation in the performance due to the use of independent oscillators but this effect is compensated by the precoding matrix.
The increasing demand of highly efficient wireless communication systems that supports high data-rates has been manifest with the fifth-generation (5G) system of systems. Satellite communications systems are to play significant role in supporting this system in terms of significant capacity enhancement, in addition to its ability to serve area where the terrestrial infrastructure is unable to provide services. The DVB-S2 standards are the candidates that will support this quest. The extension of the second generation of the DVB-S2X has further justified this advantage by incorporating higher modulation and coding schemes (MODCODs) such as the 64-APSK, 128-APSK, and 256-APSK. However, with the increasing utilization of on-the-move applications and services, the classical limitations of the satellite links in a mobile environment pose a problem to the seamless realization of capacity. These problems include signal fading due to path blockage, multipath propagation, and shadowing. A realistic mobile satellite channel has been modeled in MATLAB® using realistic terrain data which is processed in Systems Tool Kits simulator (STK) in order to determine the satellite-receiver access time leading to the determination of the Markovian Transition Matrix used for channel state condition. The performance of a good selection of DVB-S2X MODCODs has been presented and the new mobile channel has been used to test the effect on mobility on system performance. The result indicated that the mobility of the earth station causes degradation to the link performance, with scenarios of higher values of Rician K-factor, denoting the dominance of line-of-sight (LOS) being the best. Therefore, the need for further highly efficient receiver processing and optimal thresholds switching techniques that can support mobile channels in terms of high data-rate and availability is more than a prerequisite for the satellite component of the 5G systems.
The work investigates the feasibility of massive multiple-input multiple-output (MIMO) in SatCom. Toward this, the necessary channel models, system parameters, and scenarios are identified and a basic simulator is developed. The work then considers an efficient implementation of the massive MIMO transmission through the use of hybrid analog/digital precoder. Efficient algorithmic solutions are proposed for the partially connected precoder architecture which enables efficiency in power/hardware complexity and its performance evaluated.
In this chapter, we investigate a DVB-RCS2-based satellite communication system consisting of a gateway, a satellite, and a return channel satellite terminal (RCST). We formulate an optimization problem to maximize the transmission rate of the system. To solve the problem, we propose an adaptive coding and modulation (ACM) and power control scheme for return link transmission based on the return channel condition and power headroom of the RCST. Simulation results show that the proposed ACM and power control scheme increases the transmission rate as the transmit power of RCST and satellite increases or the power headroom of RCST increases.
In this chapter, we first review the state-of-the-art schemes for nonorthogonal multiple access where multiple users share the satellite channel radio resources. Among different grant-based and grant-free access schemes, we focus on nonslotted techniques, we study some decoding strategies to improve the performance of asynchronous contention resolution diversity ALOHA. Our preliminary results show that the performance of the decoder can be improved significantly if the information on overlapping bursts' powers and the exact differential delay among the incoming bursts are known at the receiver. We present the simulation results for a simple model and discuss the possible generalizations to a more realistic system scenario. Finally, we shortly discuss the efficiency of the physical layer abstraction methods under our model assumptions.
This chapter revisits the impact of channel phase in multibeam multicast satellite precoding. First, we analyze the unicast case showing that the phase components relative to the different slant paths to each user do not affect the precoding performance. Then, we indicate that for the multicast transmission, the mentioned phase effect may have impact depending on the employed clustering technique. Finally, we propose an alternative clustering solution based on normalizing out the phase components relative to the different slant paths. According to our simulation results, this novel clustering technique provides robustness to these phase components and also behaves better than previously reported clustering schemes.
To achieve reliable and green communication in the internet of things (IoT) networks, the authors extend the traditional half-duplex quantise-and-forward (QF) cooperation into the simultaneous wireless information and power transfer (SWIPT) regime. This study investigates the achievable rate of the SWIPT-based half-duplex QF cooperation with the channel state information available only at the receivers. The source and destination are provided by the external power supply and the relay simultaneously implements the information transmission and the energy harvesting by SWIPT technology with the power-splitting protocol. The achievable rate of the proposed system over the additive white Gaussian noise channels is analysed and further maximised by optimising the power-splitting factor. Furthermore, the expected rate of the proposed system over the slow-fading channels is analysed. Theoretical analysis and simulation results show that the achievable rate or expected rate of the SWIPT-based QF cooperation is obviously superior to that of the SWIPT-based amplify-and-forward or SWIPT-based decode-and-forward cooperation. Meanwhile, the SWIPT-based QF cooperation can achieve similar performance to the traditional QF cooperation when the external power supply at the relay is not provided.
Non-reciprocity limits the potential of time division duplexing (TDD) massive multiple-input and multiple-output (MIMO) systems. Due to the reciprocal channel, there is no need for downlink (DL) pilot transmission implies computational complexity reduction and saving precious time resources. In this study, the DL channel matrix is estimated using the uplink channel matrix by a novel reciprocity calibration technique. Non-reciprocity arises due to the hardware mismatch (HM) across the base station (BS) and the user terminal (UT)/both. Its detrimental effect causes amplitude and phase impairment in the downlink signal transmission. Since a massive MIMO network has a large number of antenna elements across the BS, hence the instantaneous HM coefficient cannot be determined accurately. For solving such a problem, the authors use the statistical response of the hardware unit. Considering a complex Gaussian hardware response across each antenna terminal, the probability density function (PDF) of amplitude and phase mismatch is derived. They also derive the joint PDF of amplitude and phase mismatch, considering the HM. Simulation results address the sensitivity and complexity for evaluating the sum-rate capacity under three linear precoders (matched filter, regularized zero-forcing, and zero-forcing), which validate their effectiveness in this scenario.
In this work, the authors proposed the iterative access point (AP) selection (APS), linear minimum mean-square error (MMSE) precoding and power allocation techniques for cell-free massive multiple-input multiple-output (MIMO) systems. They considered the downlink channel with single-antenna users and multiple-antenna APs. They derive sum-rate expressions for the proposed iterative APS techniques followed by MMSE precoding and optimal, adaptive, and uniform power allocation schemes. Simulations show that the proposed approach outperforms existing conjugate beamforming and zero-forcing schemes and that performance remains excellent with APS, in the presence of perfect and imperfect channel state information.
This work proposes a machine learning detection scheme for wireless orbital angular momentum (OAM) communication systems. The new scheme works for single-input–single-output (SISO) and multiple-input–single-output (MISO) wireless communication between the transmitter and the receiver. The transmitter encodes its data in OAM modes which are constructed using Laguerre–Gaussian beam form. The transmitted beams travel through a wireless channel with weak to medium turbulence strength and they arrive at random positions on the same receiver area. The authors proposed detection scheme allows the reception of multiple overlapping beams without prior knowledge of beams centre positions. The proposed scheme uses a novel technique of receiver segmentation and space filtering along with neural network to decode the received beams. Simulations show the detection efficiency and the enhanced performance of their proposed scheme for the SISO case and the MISO case with 2, 4, and 16 beams.
This study presents the design analysis and correlation properties of a new spreading code for the incoherent synchronous pulse position modulation-optical code division multiple access (PPM-OCDMA) networks. The proposed code called optimised modified prime code (OMPC), which refers to the modified prime codes (MPCs) family. Additionally, this new code designed at a higher code length, optimised code weight and good correlation characteristics to enhance communication security and improve the bit error rate (BER) performance. In this study, the proposed code is used as source code for different kinds of multimedia services such as data, voice, and video. Furthermore, the characteristics and correlation properties of the OMPC in comparison with the other MPCs families that utilised in the PPM-OCDMA networks are presented. Moreover, for the PPM-OCDMA networks, the effect of OMPC auto- and cross-correlation properties on the multiple access interference (MAI) was investigated. Consequently, the MAI is considered in the BER analysis and calculations. Finally, the results show that the proposed OMPC is better than the other existing codes with respect to the channel capacity and system performance.
MIMO systems employing sphere decoding (SD) algorithm are known to achieve near maximum likelihood (ML) performance at a reduced complexity by restricting the candidate search space to a sphere of a certain radius. The performance of SD depends on the precise estimation of its soft output. In this paper, a low complexity modified Likelihood Ascent Search (LAS) algorithm is proposed to be used within a SD receiver in order to precisely estimate the counter-hypothesis for its winner candidates. The LAS algorithm is modified to search for the best counter-hypothesis in only one-half of the signal lattice thereby improving the performance of MIMO receiver. Our results challenge the popular perception that for a SD receiver a large number of candidates within the search sphere is essential for good performance. Instead, it is shown that accurate estimation of the counter-hypothesis is equally important and in fact, the performance of the proposed augmented SD receiver with only single candidate approaches that of a classical SD with multiple candidates. Bit error rate performance of the proposed method when compared with the existing research works on soft output generation for the same number of candidates shows that our proposed method outperforms them by upto 3 dB.
In this study, a simple two-user multiple-input multiple-output (MIMO) relaying scenario is considered. To efficiently exploit the spectrum resources, a generalised singular value decomposition (GSVD) based precoding scheme with non-orthogonal multiple access (NOMA) is proposed, which converts the multiple channels into several parallel single channels. The performance of the proposed GSVD-MIMO relaying scheme is evaluated by using the distribution characteristics of squared generalised singular values of two users' channel matrices and the eigenvalues of the relay's channel matrix to obtain the expressions of the average data rate and outage probabilities. Both the asymptotic case and a practical scenario with nodes equipped with finite numbers of antennas are analysed because the distribution characteristics of squared generalised singular values in the two cases are different. Two special cases, single-input multiple-output and multiple-input single-output are considered. Simulation experiments are carried out to verify the effectiveness and accuracy of the obtained analytical results.
In this study, secure communications in a two-way relaying wiretap system with a silent eavesdropper are studied. Under the assumption that the channel state information relating to the eavesdropper is unknown at legitimate nodes, the precoding vectors at the two source nodes are jointly designed to decrease the wiretap capacity at the eavesdropper. The derived relationship between the two precoding vectors is partially similar in nature to the linear minimum mean squared error (MMSE) equaliser. An iterative process is proposed to jointly achieve two precoding vectors, and its convergence is proved. Simulation results are presented to demonstrate that the proposed MMSE-based precoding algorithm can be used for source nodes with any number of antennas, and outperforms its conventional zero-forcing- and matched-filter-based counterparts. Signal leakage from the relay node to the eavesdropper is nearly completely suppressed by the proposed precoding design.
The achievable secrecy rate regions of various multi-user channels with Gaussian inputs are well-known in the literature. To gain more practical insights into the achievable rates, it is more useful to consider channels with inputs from finite constellations, such as M-ary quadrature amplitude modulation (M-QAM), M-ary phaseshift keying (MPSK), M-ary amplitude phase-shift keying (M-APSK) etc. The authors study the achievable secrecy rates with a constrained constellation input for a multiple access wiretap channel with an eavesdropper. They also show that if the constellation points are rotated relatively for the two users then the secrecy sum-rate can be improved. They perform Monte–Carlo simulations for computing these secrecy rates for classical modulation schemes including BPSK, quadrature phase-shift keying, M-QAM, M-PSK, M-PAM, and M-APSK. They also derived an approximate function, whose argument of supremum provides an approximately optimal rotation angle for obtaining a maximum secrecy sum-rate. they also show, via simulations, that rotation of constellation is helpful for some range of signal-to-noise ratio only, which is contrary to the results of multiple access channel without security constraint. Finally, they consider a more realistic scenario, where the channel from transmitters to receivers and eavesdroppers is time-varying. They consider the case of complex circularly symmetric Gaussian random channel gains and compute the optimal rotation angle, which will maximise the expected value of an upper bound of the secrecy sum-rate.
This study presents an analysis for evaluating the physical layer (PHY) security performance of a two-hop amplify-and-forward cooperative relaying system employing Alamouti orthogonal space–time block coding (OSTBC) in the presence of an eavesdropper, where the transmit antennas for OSTBC are assumed to be spatially correlated. It is also assumed that the authorised main channels as well as the non-authorised eavesdropper channels follow Rayleigh fading distribution. Closed-form mathematical expressions are derived for three performance metrics for evaluating the PHY security, namely the probability of non-zero secrecy capacity, the secrecy outage probability, and the average secrecy capacity. Using the extensive numerical results obtained from the derived mathematical expressions, the impact of antennas correlation on the PHY secrecy performance of the system is studied and evaluated under different parameters. It is also shown that the antennas correlation corresponding to the main channels has more impact than the antennas correlation corresponding to the eavesdropper channels.
Network coding is a promising technique to improve the throughput and robustness of wireless ad hoc networks. However, the packet-mixing nature of network coding also renders it more prone to pollution attacks. Most existing schemes to combat pollution attacks did not consider the defender's resource limit, nor the trade-off between defensive performance and other metrics such as delay and resource consumption. The authors investigate how to achieve such a trade-off optimally by proposing a two-player strategic game model between the attack and the defender. In this model, the utilities of both players are well defined, and thus the defender can obtain its best strategy by maximising its utility. To do so, a graph-based simulated annealing algorithm is proposed to derive the utility-maximising strategy. Finally, they conduct extensive experiments to evaluate their scheme from different aspects. The results show that their scheme can achieve better utility than existing schemes, and is more computationally efficient in the meanwhile. Moreover, their scheme can obtain a sub-optimal solution within a small number of iterations, which implies that it can be implemented in the short-session communication scenario where it is required to find a sufficiently good solution within a short time.
Optimising the coding bit-rates and activity rates of sensor nodes is essential for the functionality and survival of wireless sensor networks as these rates not only affect the amount of information collected by the network, but also affect its power consumption. This study proposes a framework for joint coding bit-rates and activity rates optimisation (CARO) of sensor nodes in wireless visual sensor networks under limited energy constraints. The framework uses the concept of accumulative visual information (AVI) as a measure of the amount of visual information collected from a sensor node. The authors propose two optimisation algorithms for the following two cases: (I) networks with predetermined operation time, where algorithm CARO I maximises the AVI of the network over its predetermined operation time. (II) Best effort networks, where algorithm CARO II maximises the network operation time under constraints on the collected visual information. Simulations show that optimising the rates using CARO maximises the AVI of the network and extends its operation time compared to the straightforward solution when all nodes have equal activity rates. This is because the authors' framework takes into consideration that different nodes in different locations may operate under different conditions and collect information of different significance.
In this study, the authors consider the problem of exchanging secrete messages in cyber-physical systems (CPSs) without resorting to cryptographic solutions. In particular, they consider a CPS where the networked controller wants to send a secrete message to the plant. They show that such a problem can be solved by exploiting a Wyner wiretap-like encoding scheme taking advantage of the closed-loop operations typical of feedback control systems. Specifically, by resorting to the control concept of one-step reachable sets, they first show that a wiretap-like encoding scheme exists whenever there is an asymmetry in the plant model knowledge available to control system (the defender) and to the eavesdropper. The effectiveness of the proposed scheme is confirmed by means of a numerical example. Finally, they conclude the study by presenting open design challenges that can be addressed by the research community to improve, in different directions, the secrete message exchange problem in CPSs.