European Transactions on Telecommunications最新文献

英文中文

Joint EM channel and covariance estimation with sufficient-statistic chip combining for a SIMO MC-CDMA anti-jam system SIMO MC-CDMA抗干扰系统的联合电磁信道和充分统计芯片组合的协方差估计

European Transactions on Telecommunications

Pub Date : 2010-06-18 DOI: 10.1002/ett.1425

M. Asadullah, Gordon L. Stüber

Joint iterative channel and covariance estimation with sufficient-statistic-based chip combining is studied for the downlink of a multicarrier code division multiple access (MC-CDMA) system operating under partial-band noise jamming (PBNJ). To estimate the channel and AWGN-plus-PBNJ covariance, we apply the expectation-maximisation (EM) algorithm which exploits the log-likelihood ratio (LLR) from the decoder. The proposed chip combiner guarantees no loss of information in the soft output generated by the demapper. In our approach, the channel estimator or the chip combiner only requires the AWGN-plus-PBNJ power of each subcarrier to suppress jamming. Therefore, significant complexity reduction is achieved because the receiver does not need to estimate the jammer state information (JSI) and individual variances of the AWGN and PBNJ on each subcarrier for chip combining. Simulation results show that the sufficient-statistic chip combiner always offers a smaller bit error rate (BER) than the minimum mean square error (MMSE) chip combiner provided that reliable estimates of the channel impulse response and noise-plus-jamming covariance are available. Copyright © 2010 John Wiley & Sons, Ltd.

针对部分频带噪声干扰(PBNJ)下的多载波码分多址(MC-CDMA)系统，研究了基于充分统计的芯片组合联合迭代信道和协方差估计。为了估计信道和AWGN-plus-PBNJ协方差，我们应用了期望最大化(EM)算法，该算法利用了解码器的对数似然比(LLR)。所提出的芯片合成器保证由demapper产生的软输出中不丢失信息。在我们的方法中，信道估计器或芯片合并器只需要每个子载波的awgn + pbnj功率来抑制干扰。因此，由于接收器不需要估计每个子载波上的干扰机状态信息(JSI)和AWGN和PBNJ的个体方差，因此可以实现显著的复杂性降低。仿真结果表明，在可靠估计信道脉冲响应和噪声加干扰协方差的条件下，充分统计型芯片组合器的误码率(BER)总是比最小均方误差(MMSE)芯片组合器小。版权所有©2010 John Wiley & Sons, Ltd

{"title":"Joint EM channel and covariance estimation with sufficient-statistic chip combining for a SIMO MC-CDMA anti-jam system","authors":"M. Asadullah, Gordon L. Stüber","doi":"10.1002/ett.1425","DOIUrl":"https://doi.org/10.1002/ett.1425","url":null,"abstract":"Joint iterative channel and covariance estimation with sufficient-statistic-based chip combining is studied for the downlink of a multicarrier code division multiple access (MC-CDMA) system operating under partial-band noise jamming (PBNJ). To estimate the channel and AWGN-plus-PBNJ covariance, we apply the expectation-maximisation (EM) algorithm which exploits the log-likelihood ratio (LLR) from the decoder. The proposed chip combiner guarantees no loss of information in the soft output generated by the demapper. In our approach, the channel estimator or the chip combiner only requires the AWGN-plus-PBNJ power of each subcarrier to suppress jamming. Therefore, significant complexity reduction is achieved because the receiver does not need to estimate the jammer state information (JSI) and individual variances of the AWGN and PBNJ on each subcarrier for chip combining. Simulation results show that the sufficient-statistic chip combiner always offers a smaller bit error rate (BER) than the minimum mean square error (MMSE) chip combiner provided that reliable estimates of the channel impulse response and noise-plus-jamming covariance are available. Copyright © 2010 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"170 1","pages":"409-416"},"PeriodicalIF":0.0,"publicationDate":"2010-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84004519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

PAPR reduction technique using pilot symbols for OFDM systems OFDM系统中使用导频符号的PAPR降低技术

European Transactions on Telecommunications

Pub Date : 2010-06-18 DOI: 10.1002/ETT.1423

I. M. Mahafeno, Y. Louët, J. Hélard, Y. Nasser, A. Ho

High peak-to-average power ratio (PAPR) is a critical issue in any orthogonal frequency division multiplexing (OFDM) system, such as digital video broadcasting (DVB). Due to the nonlinearity of high power amplifier (HPA), it can result in low power efficiency and performance degradation of systems. In this paper, a tone reservation (TR) approach for PAPR reduction in OFDM systems is proposed by using pilot subcarriers simultaneously for PAPR reduction and channel estimation. At the receiver, a blind detection which avoids sending any side information (SI) is performed. The proposed approach improves the system spectral efficiency compared to the regular TR method that uses a set of useful subcarriers for PAPR reduction only. Simulation results using the current DVB-T2 parameters demonstrate its relevance for future DVB systems.† Copyright © 2010 John Wiley & Sons, Ltd.

在任何正交频分复用(OFDM)系统(如数字视频广播(DVB))中，高峰值平均功率比(PAPR)都是一个关键问题。由于大功率放大器的非线性特性，会导致系统的功率效率低下和性能下降。提出了一种在OFDM系统中使用导频子载波同时进行PAPR降低和信道估计的降低PAPR的音调保留方法。在接收端，执行盲检测，避免发送任何侧信息(SI)。与仅使用一组有用的子载波来降低PAPR的常规TR方法相比，该方法提高了系统的频谱效率。使用当前DVB- t2参数的仿真结果证明了它与未来DVB系统的相关性。†版权所有©2010 John Wiley & Sons, Ltd

引用次数: 6

Comparison of different channel estimation approaches for Block-IFDMA Block-IFDMA不同信道估计方法的比较

European Transactions on Telecommunications

Pub Date : 2010-06-08 DOI: 10.1002/ett.1427

Anja Sohl, A. Klein

SUMMARY In this paper, channel estimation for Discrete Fourier Transform (DFT) precoded Orthogonal Frequency Division Multiple Access (OFDMA) with block-interleaved subcarrier allocation per user, which is denoted as Block-Interleaved Frequency Division Multiple Access (B-IFDMA), is considered. Recent investigations are presented for new pilot insertion methods which exhibit different impact on the Peak-to-Average Power Ratio (PAPR) of the transmit signal and offer different possibilities of positioning the pilots in frequency domain. Each of these pilot insertion methods is combined with a corresponding algorithm to estimate the Channel Variations in Frequency Domain (CVFD). The Channel Variations in Time Domain (CVTD) are estimated by an improved Decision Directed Channel Estimation (DDCE) with joint iterative Wiener filtering which reduces the error propagation by considering certain neighbouring symbols jointly in each iteration step. The DDCE is compared to a Wiener interpolation filter for the estimation of CVTD. The combinations of pilot insertion method, estimation algorithm for CVFD and CVTD are compared in terms of the PAPR and the Mean Square Error (MSE) performance. Thereby, the impact of different pilot positions in frequency domain and time domain is investigated. Copyright © 2010 John Wiley & Sons, Ltd.

摘要本文研究了离散傅立叶变换(DFT)预编码正交频分多址(OFDMA)的信道估计问题，该方法被称为块交错频分多址(B-IFDMA)。近年来对导频插入方法进行了研究，这些方法对发射信号的峰均功率比(PAPR)有不同的影响，并提供了在频域定位导频的不同可能性。每种导频插入方法都与相应的算法相结合，以估计频域信道变化(CVFD)。采用改进的决策导向信道估计(DDCE)和联合迭代维纳滤波来估计时域信道变化，该方法通过在每个迭代步骤中联合考虑某些相邻符号来减少误差传播。将DDCE与用于估计CVTD的维纳插值滤波器进行了比较。比较了导频插入法、CVFD估计算法和CVTD估计算法的组合在PAPR和均方误差(MSE)方面的性能。因此，研究了不同导频位置在频域和时域上的影响。版权所有©2010 John Wiley & Sons, Ltd

{"title":"Comparison of different channel estimation approaches for Block-IFDMA","authors":"Anja Sohl, A. Klein","doi":"10.1002/ett.1427","DOIUrl":"https://doi.org/10.1002/ett.1427","url":null,"abstract":"SUMMARY In this paper, channel estimation for Discrete Fourier Transform (DFT) precoded Orthogonal Frequency Division Multiple Access (OFDMA) with block-interleaved subcarrier allocation per user, which is denoted as Block-Interleaved Frequency Division Multiple Access (B-IFDMA), is considered. Recent investigations are presented for new pilot insertion methods which exhibit different impact on the Peak-to-Average Power Ratio (PAPR) of the transmit signal and offer different possibilities of positioning the pilots in frequency domain. Each of these pilot insertion methods is combined with a corresponding algorithm to estimate the Channel Variations in Frequency Domain (CVFD). The Channel Variations in Time Domain (CVTD) are estimated by an improved Decision Directed Channel Estimation (DDCE) with joint iterative Wiener filtering which reduces the error propagation by considering certain neighbouring symbols jointly in each iteration step. The DDCE is compared to a Wiener interpolation filter for the estimation of CVTD. The combinations of pilot insertion method, estimation algorithm for CVFD and CVTD are compared in terms of the PAPR and the Mean Square Error (MSE) performance. Thereby, the impact of different pilot positions in frequency domain and time domain is investigated. Copyright © 2010 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"38 1","pages":"417-425"},"PeriodicalIF":0.0,"publicationDate":"2010-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81244052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Communication Networks Survivable routing algorithm with mixed shared protection in fault-tolerant GMPLS multi-layered optical networks 容错GMPLS多层光网络中混合共享保护的通信网络生存性路由算法

European Transactions on Telecommunications

Pub Date : 2010-06-01 DOI: 10.1002/ETT.1409

Lei Guo, Jiannong Cao, Xingwei Wang, Xuetao Wei, Qiming Gai, Zhaolong Ning, Cunqian Yu

In this paper, we studied survivability in general multi-protocol label switching (GMPLS) multi-layered optical networks and proposed a novel mixed shared protection algorithm (MSPA) based on the integrated layered graph (ILG) to tolerate single-fibre link failure. The ILG is composed of one virtual topology layer (VTL), corresponding to IP/MPLS layer; multiple wavelength-plane layers (WPLs), corresponding to the wavelength-division multiplexing (WDM) optical layer; and some virtual links that connect the VTL to each WPL in order to solve the problem on routing, wavelength assignment and low-speed traffic grooming. For every connection request, the MSPA first computes a single-hop or multi-hop label switching path (LSP) pair, involving a working LSP and a physical link-disjoint backup LSP in the VTL. If the LSP pair is not found in the VTL, the MSPA computes the new LSP pair in the WPL. Conversely, if the new LSP pair is not detected in the WPL, the MSPA computes the hybrid multi-hop LSP pair in the ILG. In the MSPA, if the two working LSPs are in physical link-disjoint, their corresponding backup LSPs can share the backup bandwidth. In addition, the working LSPs and the backup LSPs can also share the same mixed of wavelength, in which the different bandwidths can be assigned to different working and backup LSPs. Simulation results show that, compared to previous algorithm, the MSPA can obtain a better bandwidth utilisation ratio (BUR) with a lower blocking probability. Copyright © 2010 John Wiley & Sons, Ltd.

本文研究了通用多协议标签交换(GMPLS)多层光网络的生存性，提出了一种基于集成层图(ILG)的混合共享保护算法(MSPA)，以容忍单光纤链路故障。ILG由一个虚拟拓扑层(VTL)组成，对应IP/MPLS层;多个波长平面层(WPLs)，对应波分复用(WDM)光层;以及一些虚拟链路，将虚拟带库连接到每个WPL，以解决路由、波长分配和低速流量疏导问题。对于每个连接请求，MSPA首先计算一个单跳或多跳LSP (label switching path)对，包括一个工作LSP和VTL中一个物理链路断开的备份LSP。如果在VTL中没有找到该LSP对，则MSPA在WPL中计算新的LSP对。反之，如果WPL中没有检测到新的LSP对，则MSPA在ILG中计算混合多跳LSP对。在MSPA中，如果两个工作lsp处于物理链路断开状态，则其对应的备份lsp可以共享备份带宽。此外，工作lsp和备份lsp也可以共享相同的混合波长，这样可以为不同的工作lsp和备份lsp分配不同的带宽。仿真结果表明，与以前的算法相比，该算法可以在较低的阻塞概率下获得更高的带宽利用率(BUR)。版权所有©2010 John Wiley & Sons, Ltd

{"title":"Communication Networks Survivable routing algorithm with mixed shared protection in fault-tolerant GMPLS multi-layered optical networks","authors":"Lei Guo, Jiannong Cao, Xingwei Wang, Xuetao Wei, Qiming Gai, Zhaolong Ning, Cunqian Yu","doi":"10.1002/ETT.1409","DOIUrl":"https://doi.org/10.1002/ETT.1409","url":null,"abstract":"In this paper, we studied survivability in general multi-protocol label switching (GMPLS) multi-layered optical networks and proposed a novel mixed shared protection algorithm (MSPA) based on the integrated layered graph (ILG) to tolerate single-fibre link failure. The ILG is composed of one virtual topology layer (VTL), corresponding to IP/MPLS layer; multiple wavelength-plane layers (WPLs), corresponding to the wavelength-division multiplexing (WDM) optical layer; and some virtual links that connect the VTL to each WPL in order to solve the problem on routing, wavelength assignment and low-speed traffic grooming. For every connection request, the MSPA first computes a single-hop or multi-hop label switching path (LSP) pair, involving a working LSP and a physical link-disjoint backup LSP in the VTL. If the LSP pair is not found in the VTL, the MSPA computes the new LSP pair in the WPL. Conversely, if the new LSP pair is not detected in the WPL, the MSPA computes the hybrid multi-hop LSP pair in the ILG. In the MSPA, if the two working LSPs are in physical link-disjoint, their corresponding backup LSPs can share the backup bandwidth. In addition, the working LSPs and the backup LSPs can also share the same mixed of wavelength, in which the different bandwidths can be assigned to different working and backup LSPs. Simulation results show that, compared to previous algorithm, the MSPA can obtain a better bandwidth utilisation ratio (BUR) with a lower blocking probability. Copyright © 2010 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"76 1","pages":"312-323"},"PeriodicalIF":0.0,"publicationDate":"2010-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83861638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Information Theory Capacity of the two-way relay channel within a constant gap 信息论在一定间隙内双向中继信道的容量

European Transactions on Telecommunications

Pub Date : 2010-06-01 DOI: 10.1002/ett.1399

A. Avestimehr, A. Sezgin, David Tse

SUMMARY We study the capacity of the full-duplex bidirectional (or t wo-way) relay channel with two nodes and one relay. The channels in the forward direction are assumed to be different (in general) than the channels in the backward direction, i.e. channel reciprocity is not ass umed. We use the recently proposed deterministic approach to capture the essence of the problem and to determine a good transmission and relay strategy for the Gaussian channel. Depending on the ratio of the individual channel gains, we propose to use either a simple amplify-and-forward or a particular superposition coding strategy at the relay. We analyze the achievable rate region and show that the scheme achieves to within 3 bits the cut-set bound for all values of channel gains. Copyright c 0000 AEIT

引用次数: 96

Communication Theory Transforming the distribution of OFDM signals for peak-to-average power ratio reduction 通信理论变换OFDM信号的分布以降低峰均功率比

European Transactions on Telecommunications

Pub Date : 2010-06-01 DOI: 10.1002/ett.1395

Xiaodong Zhu, Guangxi Zhu, Pei Lin

Large peak-to-average power ratio (PAPR) is the main drawback of orthogonal frequency division multiplexing (OFDM) systems. In this paper, a novel nonlinear scheme is proposed to reduce the PAPR. This scheme transforms the amplitude of original OFDM signals from Rayleigh distribution into beta distribution. Moreover, given different parameters, this scheme has different transformation expressions. It is demonstrated that the well-known companding schemes based on exponential function and error function are actually the special cases of the proposed scheme. Further, we derive another simpler expression of the proposed scheme. Simulation results show that the new transformation can achieve a better tradeoff between PAPR reduction and bit-error rate (BER) performance than the exponential function and error function companding schemes. Copyright © 2010 John Wiley & Sons, Ltd.

大的峰均功率比(PAPR)是正交频分复用(OFDM)系统的主要缺点。本文提出了一种新的非线性方案来降低PAPR。该方案将原始OFDM信号的幅值由瑞利分布转换为beta分布。此外，给定不同的参数，该格式具有不同的变换表达式。结果表明，已知的基于指数函数和误差函数的扩展方案实际上是本文方案的特例。进一步，我们推导了该方案的另一种更简单的表达式。仿真结果表明，与指数函数和误差函数扩展方案相比，该方法能更好地平衡PAPR降低和误码率(BER)性能。版权所有©2010 John Wiley & Sons, Ltd

引用次数: 15

Communication Networks Opportunistic multiuser scheduling with reduced feedback load 通信网络减少反馈负载的机会多用户调度

European Transactions on Telecommunications

Pub Date : 2010-06-01 DOI: 10.1002/ett.1403

Y. Al-Harthi

In this paper, we propose a reduced feedback opportunistic scheduling (RFOS) algorithm that reduces the feedback load while preserving the performance of opportunistic scheduling (OS). The RFOS algorithm is a modified version of our previously proposed algorithm, the DSMUDiv algorithm. The main difference is that RFOS consists of a probing process (search process) and a requesting feedback process based on a threshold. The threshold value is variable, and it depends on the probing process. To reduce the feedback rate, a quantised value indicating the modulation level is fed back, instead of the full value of the signal-to-noise ratio (SNR), which we call quantised SNR. The paper includes the closed-form expressions of the probing load, feedback load and spectral efficiency. In addition, we investigate the effect of the scheduling delay on the system throughput (STH). Under slow Rayleigh fading assumption, we compare RFOS algorithm with the DSMUDiv and optimal (full feedback load) selective diversity scheduling algorithms. Copyright © 2010 John Wiley & Sons, Ltd.

本文提出了一种减少反馈机会调度(RFOS)算法，在保留机会调度(OS)性能的同时减少了反馈负载。RFOS算法是我们之前提出的算法(DSMUDiv算法)的改进版本。主要区别在于RFOS由探测过程(搜索过程)和基于阈值的请求反馈过程组成。阈值是可变的，它取决于探测过程。为了降低反馈速率，反馈的是一个量化值，表示调制电平，而不是信噪比(SNR)的全部值，我们称之为量化信噪比。本文给出了探测载荷、反馈载荷和频谱效率的封闭表达式。此外，我们还研究了调度延迟对系统吞吐量(STH)的影响。在慢瑞利衰落假设下，将RFOS算法与DSMUDiv算法和最优(全反馈负载)选择性分集调度算法进行了比较。版权所有©2010 John Wiley & Sons, Ltd

引用次数: 6

Wireless Systems A simplified MAP channel estimator for OFDM systems under Rayleigh fading 无线系统瑞利衰落下OFDM系统的一种简化MAP信道估计器

European Transactions on Telecommunications

Pub Date : 2010-06-01 DOI: 10.1002/ett.1415

Selva Muratoğlu Çürük, Y. Tanik

This paper presents a simplified Maximum A Posteriori (SMAP) channel estimator to be used in orthogonal frequency division multiplexing (OFDM) systems under the Rayleigh fading assumption for the subchannels, using a parametric correlation model and assuming that the channel is frequency selective and slowly time varying. Expressions for the mean-square error (MSE) of estimations are derived to evaluate the performance of the estimator. The relation between the correlation of subchannels taps and error variance is investigated. Dependencies of the proposed estimator's performance on the correlation parameter estimation error and signal-to-noise ratios (SNR) estimation error are analysed. We provide approximations on the estimator algorithms in order to make the estimator practical. The simulations done using measured channel data show that the proposed estimator with approximations operates satisfactorily with negligible loss in performance. Finally, we investigate the symbol error rate (SER) performance of an OFDM system using quadrature phase-shift keying (QPSK) modulation, based on channel estimation modes (a) training sequence (b) decision feedback and (c) pilot subcarriers. The results have indicated that the proposed estimator performance is always better than maximum likelihood (ML) estimator, and as the subchannel correlation increases (large number of subcarriers) the performance comes very close to that of exactly known channel case. Copyright © 2010 John Wiley & Sons, Ltd.

本文在正交频分复用(OFDM)系统的子信道瑞利衰落假设下，采用参数相关模型，假设信道是频率选择性和慢时变的，提出了一种简化的最大后置a (SMAP)信道估计器。推导了估计的均方误差(MSE)表达式，以评估估计器的性能。研究了子信道抽头的相关性与误差方差的关系。分析了该估计器的性能与相关参数估计误差和信噪比估计误差的关系。为了使估计器实用，我们提供了估计器算法的近似。利用实测信道数据进行的仿真表明，所提出的估计器具有近似性，性能损失可以忽略不计。最后，我们研究了基于信道估计模式(a)训练序列(b)决策反馈和(c)导频子载波的正交相移键控(QPSK)调制的OFDM系统的符号误码率(SER)性能。结果表明，该估计器的性能总是优于最大似然估计器，并且随着子信道相关性的增加(大量子载波)，其性能非常接近确切已知信道情况的性能。版权所有©2010 John Wiley & Sons, Ltd

{"title":"Wireless Systems A simplified MAP channel estimator for OFDM systems under Rayleigh fading","authors":"Selva Muratoğlu Çürük, Y. Tanik","doi":"10.1002/ett.1415","DOIUrl":"https://doi.org/10.1002/ett.1415","url":null,"abstract":"This paper presents a simplified Maximum A Posteriori (SMAP) channel estimator to be used in orthogonal frequency division multiplexing (OFDM) systems under the Rayleigh fading assumption for the subchannels, using a parametric correlation model and assuming that the channel is frequency selective and slowly time varying. Expressions for the mean-square error (MSE) of estimations are derived to evaluate the performance of the estimator. The relation between the correlation of subchannels taps and error variance is investigated. Dependencies of the proposed estimator's performance on the correlation parameter estimation error and signal-to-noise ratios (SNR) estimation error are analysed. We provide approximations on the estimator algorithms in order to make the estimator practical. The simulations done using measured channel data show that the proposed estimator with approximations operates satisfactorily with negligible loss in performance. Finally, we investigate the symbol error rate (SER) performance of an OFDM system using quadrature phase-shift keying (QPSK) modulation, based on channel estimation modes (a) training sequence (b) decision feedback and (c) pilot subcarriers. The results have indicated that the proposed estimator performance is always better than maximum likelihood (ML) estimator, and as the subchannel correlation increases (large number of subcarriers) the performance comes very close to that of exactly known channel case. Copyright © 2010 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"52 1","pages":"396-405"},"PeriodicalIF":0.0,"publicationDate":"2010-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73622058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Mobile Networks Trust management in wireless sensor networks 无线传感器网络中的信任管理

European Transactions on Telecommunications

Pub Date : 2010-06-01 DOI: 10.1002/ett.1413

T. Zahariadis, H. Leligou, P. Trakadas, S. Voliotis

SUMMARY The range of applications of wireless sensor networks is so wide that it tends to invade our every day life. In the future, a sensor network will survey our health, our home, the roads we follow, the office or the industry we work in or even the aircrafts we use, in an attempt to enhance our safety. However, the wireless sensor networks themselves are prone to security attacks. The list of security attacks, although already very long, continues to augment impeding the expansion of these networks. The trust management schemes consist of a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them, either for data forwarding, data aggregation or any other cooperative function. A variety of trust models which follow different directions regarding the distribution of measurement functionality, the monitored behaviours and the way measurements are used to calculate/define the node’s trustworthiness has been presented in the literature. In this paper, we survey trust models in an attempt to explore the interplay among the implementation requirements, the resource consumption and the achieved security. Our goal is to draw guidelines for the design of deployable trust model designs with respect to the available node and network capabilities and application peculiarities. Copyright © 2010 John Wiley & Sons, Ltd.

无线传感器网络的应用范围是如此之广，以至于它几乎侵入了我们的日常生活。未来，传感器网络将调查我们的健康、我们的家、我们走过的道路、我们工作的办公室或行业，甚至我们使用的飞机，以试图提高我们的安全。然而，无线传感器网络本身就容易受到安全攻击。安全攻击的清单虽然已经很长，但仍在继续增加，阻碍这些网络的扩展。信任管理方案包含一个强大的工具，用于检测意外节点行为(错误或恶意)。一旦检测到行为不端的节点，它们的邻居可以利用这些信息来避免与它们合作，无论是数据转发、数据聚合还是任何其他合作功能。文献中已经提出了各种信任模型，这些模型遵循不同方向，涉及测量功能的分布、被监控的行为以及测量用于计算/定义节点可信度的方式。在本文中，我们调查了信任模型，试图探索实现需求，资源消耗和实现安全性之间的相互作用。我们的目标是根据可用的节点和网络功能以及应用程序特性，为可部署信任模型设计的设计制定指导方针。版权所有©2010 John Wiley & Sons, Ltd

{"title":"Mobile Networks Trust management in wireless sensor networks","authors":"T. Zahariadis, H. Leligou, P. Trakadas, S. Voliotis","doi":"10.1002/ett.1413","DOIUrl":"https://doi.org/10.1002/ett.1413","url":null,"abstract":"SUMMARY The range of applications of wireless sensor networks is so wide that it tends to invade our every day life. In the future, a sensor network will survey our health, our home, the roads we follow, the office or the industry we work in or even the aircrafts we use, in an attempt to enhance our safety. However, the wireless sensor networks themselves are prone to security attacks. The list of security attacks, although already very long, continues to augment impeding the expansion of these networks. The trust management schemes consist of a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them, either for data forwarding, data aggregation or any other cooperative function. A variety of trust models which follow different directions regarding the distribution of measurement functionality, the monitored behaviours and the way measurements are used to calculate/define the node’s trustworthiness has been presented in the literature. In this paper, we survey trust models in an attempt to explore the interplay among the implementation requirements, the resource consumption and the achieved security. Our goal is to draw guidelines for the design of deployable trust model designs with respect to the available node and network capabilities and application peculiarities. Copyright © 2010 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"49 1","pages":"386-395"},"PeriodicalIF":0.0,"publicationDate":"2010-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89980020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 114

Selective mapping for reduced complexity turbo channel estimation operating on highly time and frequency selective channels 选择性映射降低复杂性涡轮信道估计操作在高时间和频率选择性信道

European Transactions on Telecommunications

Pub Date : 2010-04-08 DOI: 10.1002/ett.1397

Sihem Châabouni, M. Siala, N. Sellami

In this paper, we consider a time division multiple access (TDMA) transmission of coded symbols over a time and frequency selective channel. At the receiver, a turbo-detector composed of a maximum a posteriori (MAP) equaliser and a MAP decoder is used. We give the expression of the MAP iterative burst-by-burst channel estimation algorithm using the Expectation-Maximisation (EM) algorithm. Since the obtained algorithm is complex, we propose to simplify it by neglecting the inter-symbol interference (ISI) term. In order to reduce the error caused by this simplification, we propose to use a candidate precoder at the transmitter chosen among a given set of precoders such that the selected precoded sequence leads to the minimum mean square value of the ISI neglected term. Simulations show that the performance of the approximate algorithm with precoding are almost similar to the performance of the exact algorithm. Copyright © 2010 John Wiley & Sons, Ltd.

在本文中，我们考虑了一个时分多址(TDMA)的传输编码符号在一个时间和频率选择信道。接收机采用由最大后验均衡器(MAP)和MAP解码器组成的涡轮检波器。我们用期望最大化(EM)算法给出了MAP迭代逐突发信道估计算法的表达式。由于所得到的算法比较复杂，我们建议通过忽略符号间干扰(ISI)项来简化算法。为了减少这种简化引起的误差，我们建议在一组给定的预编码器中选择一个候选预编码器，使所选的预编码序列导致ISI被忽略项的均方值最小。仿真结果表明，带预编码的近似算法的性能与精确算法的性能几乎相当。版权所有©2010 John Wiley & Sons, Ltd

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

European Transactions on Telecommunications

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀