发布求助
文献互助 智能选刊 最新文献

2013 Australian Communications Theory Workshop (AusCTW)最新文献

筛选
英文 中文
Performance of quickest spectrum sensing over various fading channels 在各种衰落信道上的最快频谱感知性能
2013 Australian Communications Theory Workshop (AusCTW) Pub Date : 2013-05-02 DOI: 10.1109/AusCTW.2013.6510047
E. Hanafi, Philippa A. Martin, Peter J. Smith, A. Coulson
{"title":"Performance of quickest spectrum sensing over various fading channels","authors":"E. Hanafi, Philippa A. Martin, Peter J. Smith, A. Coulson","doi":"10.1109/AusCTW.2013.6510047","DOIUrl":"https://doi.org/10.1109/AusCTW.2013.6510047","url":null,"abstract":"In this paper, we study the performance of quickest spectrum sensing when the received signal experiences various fading conditions, including the time-invariant, Rayleigh, Rician, Nakagami-m and the F channel. We prove that the power of the complex received signal is a sufficient statistic and derive the probability density function of the received signal amplitude for all of these fading cases. Simulation results reveal that the sensing performance degrades with the severity of the fading as well as the level of temporal correlation. We also consider mis-matched channel conditions and show that the average detection delay depends greatly on the channel but very little on the nature of the detector.","PeriodicalId":177106,"journal":{"name":"2013 Australian Communications Theory Workshop (AusCTW)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134308679","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
Fault-tolerant stochastic routing for wireless sensor networks with unreliable links 链路不可靠无线传感器网络的容错随机路由
2013 Australian Communications Theory Workshop (AusCTW) Pub Date : 2013-05-02 DOI: 10.1109/AusCTW.2013.6510050
U. Wijetunge, A. Pollok, S. Perreau
{"title":"Fault-tolerant stochastic routing for wireless sensor networks with unreliable links","authors":"U. Wijetunge, A. Pollok, S. Perreau","doi":"10.1109/AusCTW.2013.6510050","DOIUrl":"https://doi.org/10.1109/AusCTW.2013.6510050","url":null,"abstract":"Timely and reliable delivery of critical information is vital for military applications and disaster relief applications. Such applications rely on communications networks, which in practice operate via unreliable links. Improving the packet delivery ratio while reducing the end-to-end delay is a major challenge for stochastic routing in networks with unreliable communication links. In this paper, we propose a novel decentralized stochastic routing algorithm to improve the packet delivery ratio and end-to-end delay for wireless sensor networks (WSNs) with unreliable links. We introduce an evaluation framework based on discrete time absorbing Markov chains to evaluate the packet delivery ratio and end-to-end delay. Simulation results show that our proposed routing algorithm performs significantly better in terms of packet delivery ratio and end-to-end delay when compared to existing decentralized methods.","PeriodicalId":177106,"journal":{"name":"2013 Australian Communications Theory Workshop (AusCTW)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133033002","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}
引用次数: 7
Connectivity of three dimensional wireless sensor networks using geometrical probability 三维无线传感器网络的几何概率连通性
2013 Australian Communications Theory Workshop (AusCTW) Pub Date : 2013-05-02 DOI: 10.1109/AusCTW.2013.6510043
Z. Khalid, S. Durrani
{"title":"Connectivity of three dimensional wireless sensor networks using geometrical probability","authors":"Z. Khalid, S. Durrani","doi":"10.1109/AusCTW.2013.6510043","DOIUrl":"https://doi.org/10.1109/AusCTW.2013.6510043","url":null,"abstract":"This paper investigates the connectivity properties of three dimensional wireless sensor network in which N nodes are independently and uniformly (i.u.d.) distributed either on the surface of a sphere of radius R or inside the volume of a ball of radius R. Our approach utilizes the geometrical probability results for the conditional probability that a random node falls inside a ball centered at an arbitrary sensor node. We obtain exact expressions for the mean node degree and node isolation probability for the two topologies, which can be easily evaluated analytically or numerically. We also illustrate an upper bound for the probability of connectivity. The analysis is validated by comparison with existing results and Monte Carlo simulations.","PeriodicalId":177106,"journal":{"name":"2013 Australian Communications Theory Workshop (AusCTW)","volume":"64 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120817713","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}
引用次数: 14
Transmitter optimization for the network MIMO downlink with finite-alphabet and QoS constraints 具有有限字母和QoS约束的网络MIMO下行链路的发射机优化
2013 Australian Communications Theory Workshop (AusCTW) Pub Date : 2013-05-02 DOI: 10.1109/AusCTW.2013.6510063
Min Li, Chunshan Liu, S. Hanly, I. Collings
{"title":"Transmitter optimization for the network MIMO downlink with finite-alphabet and QoS constraints","authors":"Min Li, Chunshan Liu, S. Hanly, I. Collings","doi":"10.1109/AusCTW.2013.6510063","DOIUrl":"https://doi.org/10.1109/AusCTW.2013.6510063","url":null,"abstract":"We consider a network MIMO downlink communication where base stations (BSs) can cooperate on transmission of data symbols to their intended mobile stations (MSs). We assume the data symbols for each user come from a finite alphabet. We formulate a novel power optimization problem for the downlink communication starting with the binary inputs: we take a symbol detection point of view, impose minimum Symbol Error Probability (SEP) as Quality-of-Service (QoS) constraints at the MSs, and show that the resulting problem is convex. We first tackle the problem via centralized approaches and then propose a distributed algorithm to solve the power optimization problem, where only local communication among the base stations is required. We compare with state of the art linear precoding techniques, and demonstrate significant reduction in consumed transmit power attained by the proposed schemes. We also provide an extension of the problem to general finite-alphabet inputs.","PeriodicalId":177106,"journal":{"name":"2013 Australian Communications Theory Workshop (AusCTW)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124808425","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
Power allocation in OFDM cognitive radio relay networks with average interference constraints 平均干扰约束下OFDM认知无线电中继网络的功率分配
2013 Australian Communications Theory Workshop (AusCTW) Pub Date : 2013-05-02 DOI: 10.1109/AusCTW.2013.6510049
S. Biyanwilage, U. Gunawardana, R. Liyanapathirana
{"title":"Power allocation in OFDM cognitive radio relay networks with average interference constraints","authors":"S. Biyanwilage, U. Gunawardana, R. Liyanapathirana","doi":"10.1109/AusCTW.2013.6510049","DOIUrl":"https://doi.org/10.1109/AusCTW.2013.6510049","url":null,"abstract":"In this paper, we study power allocation in OFDM based cognitive radio (CR) relay networks when the fading statistics between cognitive and primary users are known at the CR transmitters. The objective of power allocation is to maximize the instantaneous capacity of the CR network. Optimal power allocation schemes are developed for both decode-and-forward (DF) and amplify-and-forward (AF) relay assisted CR transmission where the primary users are subject to average interference constraints and the CR transmitters are subject to maximum transmit power constraint. Performance of the proposed schemes is compared with uniform power allocation method and the numerical results confirm that the proposed optimal power allocation schemes achieve significant capacity improvement compared to uniform power loading.","PeriodicalId":177106,"journal":{"name":"2013 Australian Communications Theory Workshop (AusCTW)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116633071","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
Analysis of compute-and-forward with QPSK in two-way relay fading channels 双向中继衰落信道中QPSK的计算转发分析
2013 Australian Communications Theory Workshop (AusCTW) Pub Date : 2013-05-02 DOI: 10.1109/AusCTW.2013.6510048
Tao Huang, Jinhong Yuan, Jing Li
{"title":"Analysis of compute-and-forward with QPSK in two-way relay fading channels","authors":"Tao Huang, Jinhong Yuan, Jing Li","doi":"10.1109/AusCTW.2013.6510048","DOIUrl":"https://doi.org/10.1109/AusCTW.2013.6510048","url":null,"abstract":"In this paper, the error performance of compute-and-forward with QPSK over Rayleigh fading two-way relay channels is analyzed. We investigate the optimal way to select the computation coefficients to minimize the error probability at the relay. This is equivalent to maximizing the minimum Euclidean distance between the network coded messages on a superimposed two-user constellation at the relay. We derive the performance upper bound for the decoding of the network coded messages at the relay in a closed form. Both analytical results and simulation results demonstrate that when QPSK is employed, the diversity order of decoding the network coded messages at the relay can reach 1, rather than being halved as reported in previous literature where 4-PAM was considered.","PeriodicalId":177106,"journal":{"name":"2013 Australian Communications Theory Workshop (AusCTW)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125858946","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
On complex LLL algorithm for integer forcing linear receivers 整数强迫线性接收机的复LLL算法
2013 Australian Communications Theory Workshop (AusCTW) Pub Date : 2013-01-08 DOI: 10.1109/AusCTW.2013.6510037
A. Sakzad, J. Harshan, E. Viterbo
{"title":"On complex LLL algorithm for integer forcing linear receivers","authors":"A. Sakzad, J. Harshan, E. Viterbo","doi":"10.1109/AusCTW.2013.6510037","DOIUrl":"https://doi.org/10.1109/AusCTW.2013.6510037","url":null,"abstract":"Integer-forcing (IF) linear receiver has been recently introduced for multiple-input multiple-output (MIMO) fading channels. The receiver has to compute an integer linear combination of the symbols as a part of the decoding process. In particular, the integer coefficients have to be chosen based on the channel realizations, and the choice of such coefficients is known to determine the receiver performance. The original known solution of finding these integers was based on exhaustive search. A practical algorithm based on HKZ and Minkowski lattice reduction algorithms was also proposed recently. In this paper, we propose a low-complexity method to obtain the integer coefficients for the IF receiver. For the 2 × 2 MIMO channel, we study the effectiveness of the proposed method in terms of the ergodic rate. We also compare the bit error rate (BER) of our approach with that of other linear receivers, and show that the suggested algorithm outperforms the minimum mean square estimator (MMSE) and zero-forcing (ZF) linear receivers, but trades-off error performance for complexity in comparison with the IF receiver based on exhaustive search or on HKZ and Minkowski lattice reduction algorithms.","PeriodicalId":177106,"journal":{"name":"2013 Australian Communications Theory Workshop (AusCTW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131157510","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}
引用次数: 24
Statistically robust cognitive radio beamforming 统计稳健的认知无线电波束形成
2013 Australian Communications Theory Workshop (AusCTW) Pub Date : 2013-01-01 DOI: 10.1109/AUSCTW.2013.6510057
Sudhir Singh, Paul D. Teal, P. Dmochowski, A. Coulson
{"title":"Statistically robust cognitive radio beamforming","authors":"Sudhir Singh, Paul D. Teal, P. Dmochowski, A. Coulson","doi":"10.1109/AUSCTW.2013.6510057","DOIUrl":"https://doi.org/10.1109/AUSCTW.2013.6510057","url":null,"abstract":"We consider a cognitive radio (CR) network consisting of a secondary user transmitter (SU-Tx) equipped with multiple antennas and a secondary user receiver (SU-Rx) that share spectrum with multiple primary user transmitter (PU-Tx) and receiver (PU-Rx) pairs. We assume that the CR has a loose cooperation with the primary network and therefore, only partial channel state information of each of the PU-Tx to PU-Rx and SU-Tx to each PU-Rx links is available. Furthermore, we assume that the SU-Tx to SU-Rx link CSI is imperfect, with the channel error modelled as additive Gaussian noise. Under these assumptions, we propose a new statistically robust CR beamformer where the total SU-Tx transmit power is minimised subject to PU-Rx and SU-Rx outage probability constraints. We present expressions for PU-Rx and SU-Rx outage probabilities and formulate the robust beamformer optimisation problem as a convex semidefinite program (SDP). SU-Tx transmit power, PU-Rx signal-to-interference-and-noise ratio (SINR) and SU-Rx signal-to-noise (SNR) cumulative distribution functions (CDFs) are obtained through solution of our optimisation problem.","PeriodicalId":177106,"journal":{"name":"2013 Australian Communications Theory Workshop (AusCTW)","volume":"5 23","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131437917","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
Computational complexity reduction in Taguchi method based joint optimization of antenna parameters in LTE-A networks 基于田口法的LTE-A网络天线参数联合优化计算复杂度降低
2013 Australian Communications Theory Workshop (AusCTW) Pub Date : 2013-01-01 DOI: 10.1109/AusCTW.2013.6510039
Yongfeng Diao, X. Gui, Min Zhang, A. Dow
{"title":"Computational complexity reduction in Taguchi method based joint optimization of antenna parameters in LTE-A networks","authors":"Yongfeng Diao, X. Gui, Min Zhang, A. Dow","doi":"10.1109/AusCTW.2013.6510039","DOIUrl":"https://doi.org/10.1109/AusCTW.2013.6510039","url":null,"abstract":"In Long Term Evolution-Advanced (LTE-A) cellular networks, minimizing inter-cell interference is the key to maximizing coverage and capacity. This can be achieved by setting the antenna parameters such as azimuth orientations and tilts to the optimal values. Due to the interdependencies between these parameters, finding the optimal configuration is a time-consuming and complex task. Among the various algorithms proposed for this task, the joint optimization approach based on the Taguchi method (TM) is a recent development that has been shown to be promising. This paper presents some further improvements to the existing approach aiming at enhancing optimization performance and reducing computational complexity. The proposed improvements include the use of the mixed-level Nearly-Orthogonal Array (NOA) to cater for the different optimization ranges of different types of parameters, an improved mapping function to select testing values that are more representative of the optimization range, and a hybrid approach using multiple NOAs with decreasing number of experiments to exchange small degradation in optimization performance for significant reduction in computational complexity. The effectiveness of the proposed improvements is demonstrated by numerical examples.","PeriodicalId":177106,"journal":{"name":"2013 Australian Communications Theory Workshop (AusCTW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130233712","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
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信