2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)最新文献_第5页

Phase sequence construction for near optimum SLM 近最优SLM的相序构造

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2014-06-22 DOI: 10.1109/SPAWC.2014.6941832

Yanyan Wu

引用次数: 1

A cross-layer design for generic interference-limited multicarrier networks 通用限制干扰多载波网络的跨层设计

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2014-06-22 DOI: 10.1109/SPAWC.2014.6941874

R. Rashtchi, R. Gohary, H. Yanikomeroglu

引用次数: 1

Optimization of BICM mutual information and bit error rate of 8-ary signal constellations using genetic algorithms 基于遗传算法的BICM互信息和误码率优化研究

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2014-06-22 DOI: 10.1109/SPAWC.2014.6941465

Benjamin Müller, Bjom Zessack, U. Zölzer

引用次数: 1

On the trade-off between transmit and leakage power for rate optimal MIMO precoding 速率最优MIMO预编码中发射功率与泄漏功率的权衡

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2014-06-22 DOI: 10.1109/SPAWC.2014.6941408

Tim Rüegg, A. Amah, A. Wittneben

引用次数: 7

Free-space optical multi-subcarrier communication employing power-efficient constellations 采用高能效星座的自由空间光学多子载波通信

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2014-06-22 DOI: 10.1109/SPAWC.2014.6941781

Q. Gao, Linchao Liao, Gang Chen, Y. Hua

引用次数: 2

Joint base station clustering and beamformer design for partial coordinated transmission using statistical channel state information 利用统计信道状态信息进行部分协调传输的联合基站聚类和波束成形器设计

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2014-06-22 DOI: 10.1109/SPAWC.2014.6941759

Maziar Sanjabi, Mingyi Hong, Meisam Razaviyayn, Z. Luo

引用次数: 5

Decentralized TOA-based localization in non-synchronized wireless networks with partial, asymmetric connectivity 局部非对称连接的非同步无线网络中去中心化tobased定位

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2014-06-22 DOI: 10.1109/SPAWC.2014.6941367

A. Yeredor

{"title":"Decentralized TOA-based localization in non-synchronized wireless networks with partial, asymmetric connectivity","authors":"A. Yeredor","doi":"10.1109/SPAWC.2014.6941367","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941367","url":null,"abstract":"Classical methods for cooperative time-of-arrival (TOA)-based self-localization in wireless sensors networks usually rely either on synchronization between sensors or on two-way TOA (TW-TOA) measurements. However, when the connectivity in the network is limited, accurate synchronization of the nodes may be too costly to attain, and full TW-TOA measurements may not be available either, especially when the connectivity matrix is asymmetric. Centralized processing for the location estimation is also rarely feasible under such conditions. In this paper we propose an algorithm (method and protocol) for decentralized, cooperative TOA-based self-localization, which does not require synchronization and does not involve any “hand-shaking” procedures (of the kind required for TW-TOA measurements) between sensors. The procedure involves a single initial transmission by each sensor, followed by reports of the received TOAs by each sensor, followed by an iterative procedure in which each sensor estimates its own timing offset and position, as well as the timing-offsets and positions of relevant neighboring sensors, and announces its estimation results. We demonstrate convergence of the procedure to accurate estimates of the position of nearly all sensors, e.g., in scenarios involving 50 - 200 sensors in an area of 20 by 20 Km with an average 1:3 connectivity.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121308020","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}

引用次数: 13

On full message exchange in MIMO DF multi-way relay networks MIMO - DF多路中继网络中的全消息交换

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2014-06-22 DOI: 10.1109/SPAWC.2014.6941608

Mao Yan, T. Li, Qingchun Chen

引用次数: 1

Distributed stochastic learning for dynamic spectrum access adaptive to primary network conditions 适应主要网络条件的动态频谱接入分布式随机学习

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2014-06-22 DOI: 10.1109/SPAWC.2014.6941869

M. Zandi, Min Dong, A. Grami

{"title":"Distributed stochastic learning for dynamic spectrum access adaptive to primary network conditions","authors":"M. Zandi, Min Dong, A. Grami","doi":"10.1109/SPAWC.2014.6941869","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941869","url":null,"abstract":"We consider the problem of decentralized online learning and channel access among M secondary users (SUs) in a cognitive radio network. We aim at designing an adaptive policy that can effectively respond to different primary network conditions. By applying stochastic learning automata, we propose an adaptive decentralized access policy. Each SU probabilistically chooses one of the M-best channels to access. The channel selection probability is then updated based on collision events. Our proposed adaptive policy utilizes two underlying distributed learning algorithms: one is to learn from sensing history on the primary channel availability, and the other is to learn from collision history on channel selections among SUs to avoid further collision. Some previously proposed distributed access policies can be viewed as special cases of our proposed adaptive policy, with a set of pre-set channel selection probabilities. Simulation results demonstrate the effectiveness of our proposed adaptive policy in various distributions of mean channel availabilities across primary channels, as compared with other existing policies.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132615380","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

Towards a principled approach to designing distributed MAC protocols 一种设计分布式MAC协议的原则方法

2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2014-06-22 DOI: 10.1109/SPAWC.2014.6941681

A. Cheng, R. Negi

{"title":"Towards a principled approach to designing distributed MAC protocols","authors":"A. Cheng, R. Negi","doi":"10.1109/SPAWC.2014.6941681","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941681","url":null,"abstract":"Emerging applications such as cyber-physical systems and the electric smart grid have placed a greater demand for distributed protocols that can scale and adapt without centralized control, while providing throughput and delay guarantees. This paper proposes a formal approach to designing a distributed scheduling protocol. Similar to previous queue-length based CSMA-type schedulers, the protocol proposed in this paper is a CSMA-type scheduler that is throughput-optimal, generates collision-free schedules, is fully distributed, and adapts to traffic demands without explicitly knowing the arrival rates. However, our design takes a more formal approach, where the multi-information (a natural extension of mutual information) between links is minimized, rather than maximizing the entropy, as was done by previous CSMA-type schedulers. Zero multi-information corresponds to a fully distributed scheduler. The formal approach in this paper also admits side information (e.g., a universal clock from GPS) into the framework. Simulations show our proposed protocol has better delay performance compared with previous CSMA-type schedulers.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114365426","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