2015 IEEE International Conference on Communication Workshop (ICCW)最新文献_第2页

Efficient optical wireless communication in the presence of signal-dependent noise 存在信号相关噪声的高效光通信

2015 IEEE International Conference on Communication Workshop (ICCW) Pub Date : 2015-06-08 DOI: 10.1109/ICCW.2015.7247372

M. Safari

引用次数: 26

Structured compressive sensing based narrowband interference mitigation for vehicular communications 基于结构化压缩感知的车载通信窄带干扰抑制

2015 IEEE International Conference on Communication Workshop (ICCW) Pub Date : 2015-06-08 DOI: 10.1109/ICCW.2015.7247536

Sicong Liu, Fang Yang, Wenbo Ding, Jian Song

引用次数: 4

Joint scheduling and power allocation in Cognitive Radio systems 认知无线电系统中的联合调度与功率分配

2015 IEEE International Conference on Communication Workshop (ICCW) Pub Date : 2015-06-08 DOI: 10.1109/ICCW.2015.7247212

Raouia Masmoudi, E. Belmega, I. Fijalkow, N. Sellami

{"title":"Joint scheduling and power allocation in Cognitive Radio systems","authors":"Raouia Masmoudi, E. Belmega, I. Fijalkow, N. Sellami","doi":"10.1109/ICCW.2015.7247212","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247212","url":null,"abstract":"This paper investigates a joint spectrum scheduling and power allocation problem in Cognitive Radio (CR) network composed of several secondary (SU) and primary users (PU). The objective is to minimize the overall SU system power consumption (over several orthogonal frequency bands) under minimum Quality of Service (QoS) constraints, maximum peak and average interference to the PUs constraints. The main challenge lies in the non-convexity of the problem because of the discrete spectrum scheduling policies. We overcome this issue by considering a simpler and convex problem based on Lagrangian relaxation. It turns out that, this problem has discrete solutions which are the optimal solutions to our initial non-convex problem. We propose an iterative sub-gradient algorithm to compute the optimal solution, when it exists, assuming that the channels are drawn randomly. In the case of symmetric systems, this algorithm is not suitable. Therefore, we study such a case for which we give an analytical solution. Several numerical results that sustain and give insight into the resolution of this problem are also provided.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"24 1","pages":"399-404"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80419254","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

Optimized packet scheduling for live streaming on peer-to-peer network with network coding 利用网络编码优化了点对点网络直播的数据包调度

2015 IEEE International Conference on Communication Workshop (ICCW) Pub Date : 2015-06-08 DOI: 10.1109/ICCW.2015.7247394

Shenglan Huang, E. Izquierdo, Pengwei Hao

{"title":"Optimized packet scheduling for live streaming on peer-to-peer network with network coding","authors":"Shenglan Huang, E. Izquierdo, Pengwei Hao","doi":"10.1109/ICCW.2015.7247394","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247394","url":null,"abstract":"This paper proposed an optimized packet scheduling algorithm for live peer-to-peer streaming system, where network coding technique is extended to improve the efficiency in bandwidth utilization. We identify a problem of undesirable non-innovative packet transmission due to the latency of buffer-map update among peers, which, with many previous proposed techniques, yields to bandwidth inefficiencies. In the proposed system, we present an optimized packet scheduling algorithm for forecasting the number of required packets at parent nodes in advance, a selection mechanism for selecting and encoding packets for forwarding, and an adaptive push algorithm for smart frame skipping. The proposed optimized packet scheduling algorithm calculates the minimum number of required packets for full rate transmission. Transmitting as the scheduled results can reduce non-innovative packet transmission, save limited bandwidth for innovative transmission, thereby improving the streaming continuity. The simulation results show that the proposed scheme provides significantly better video quality, delivery ratio, lower redundancy rate, and higher innovative video packet rate compared with previous packet scheduling algorithms.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"73 1","pages":"1515-1520"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79153462","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}

引用次数: 2

MIMO wiretap channels with randomly located eavesdroppers: Large-system analysis 随机定位窃听者的MIMO窃听信道:大系统分析

2015 IEEE International Conference on Communication Workshop (ICCW) Pub Date : 2015-06-08 DOI: 10.1109/ICCW.2015.7247226

Maksym A. Girnyk, Frederic Gabry, Mikko Vehkaperä, L. Rasmussen, M. Skoglund

{"title":"MIMO wiretap channels with randomly located eavesdroppers: Large-system analysis","authors":"Maksym A. Girnyk, Frederic Gabry, Mikko Vehkaperä, L. Rasmussen, M. Skoglund","doi":"10.1109/ICCW.2015.7247226","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247226","url":null,"abstract":"Security issues in wireless networks have become a subject of growing interest in recent years due to the broadcast nature of wireless channels. In this paper, we investigate secure communication over a multi-antenna wiretap channel in the presence of randomly distributed eavesdroppers. In the fast fading environment, the overall performance of this channel is traditionally characterized by the ergodic secrecy capacity, which, in general, cannot be derived explicitly. Nevertheless, based on the assumption that the numbers of antennas at legitimate terminals and the number of eavesdroppers grow large without bound, we derive a deterministic approximation of an achievable ergodic secrecy rate for arbitrary inputs. In addition, we characterize the secrecy rates for practically relevant separate-decoding scheme at the receiver. We validate the proposed large-system approximation through numerical simulations and observe a good match with the actual secrecy rates. Finally, we also analyze some interesting behavior of the secrecy rates in the given scenario depending on the geometry of the nodes.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"7 1","pages":"480-484"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85096572","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}

引用次数: 3

Optimal throughput analysis of a super dense wireless network with the Renewal Access Protocol 基于更新访问协议的超密集无线网络的最优吞吐量分析

2015 IEEE International Conference on Communication Workshop (ICCW) Pub Date : 2015-06-08 DOI: 10.1109/ICCW.2015.7247507

Yunbae Kim, G. Hwang, Jungsun Um, Sungjin Yoo, Hoiyoon Jung, Seungkeun Park

{"title":"Optimal throughput analysis of a super dense wireless network with the Renewal Access Protocol","authors":"Yunbae Kim, G. Hwang, Jungsun Um, Sungjin Yoo, Hoiyoon Jung, Seungkeun Park","doi":"10.1109/ICCW.2015.7247507","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247507","url":null,"abstract":"As Wireless Local Area Networks (WLANs) become denser and denser recently, the contention-based MAC protocol such as the IEEE 802.11 DCF, the de facto standard for the WLAN, should be modified to handle such dense WLANs. To this end, we consider a recently proposed novel MAC protocol called the Renewal Access Protocol (RAP) in this paper. With the RAP, we consider two strategies for resolving collisions efficiently and achieving high throughput performance in a super dense WLAN: strategies without and with grouping. First, we analyze the asymptotic behavior of the RAP itself (i.e., without grouping) as the number of terminals goes to infinity. We show that the RAP can achieve optimal throughput even in a super dense WLAN and the related optimal access probability of the RAP can be derived in a closed-form from the analysis. Second, we propose a new grouping strategy in the RAP and call it the grouped RAP (G-RAP). While a grouping strategy in the IEEE 802.11ah standard is based on time division, which can cause a waste of channel, our grouping strategy is based on transmission attempts, which does not waste channel resources. From the analysis we show that the G-RAP easily achieves the optimal network throughput performance for any group structure (i.e., unform group size and arbitrary group size) if terminals use the optimal access probability that we derive. Our analytical results are validated by simulation.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"4 1","pages":"2194-2199"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85203614","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

Performance of a cognitive p-persistent slotted Aloha protocol 认知p持久槽Aloha协议的性能

2015 IEEE International Conference on Communication Workshop (ICCW) Pub Date : 2015-06-08 DOI: 10.1109/ICCW.2015.7247213

José Reis, Miguel Luís, Luís Bernardo, Rodolfo Oliveira, R. Dinis, Paulo Pinto

引用次数: 2

Channel reservation for dynamic spectrum access of cognitive radio networks with prioritized traffic 具有优先业务量的认知无线电网络动态频谱接入的信道预留

2015 IEEE International Conference on Communication Workshop (ICCW) Pub Date : 2015-06-08 DOI: 10.1109/ICCW.2015.7247287

T. Chu, H. Zepernick, Hoc Phan

{"title":"Channel reservation for dynamic spectrum access of cognitive radio networks with prioritized traffic","authors":"T. Chu, H. Zepernick, Hoc Phan","doi":"10.1109/ICCW.2015.7247287","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247287","url":null,"abstract":"In this paper, we propose a strategy to coordinate the dynamic spectrum access (DSA) of different types of traffic. It is assumed that the DSA assigns spectrum bands to three kinds of prioritized traffic, the traffic of the primary network, the Class 1 traffic and Class 2 traffic of the secondary network. Possessing the licensed spectrum, the primary traffic has the highest access priority and can access the spectrum bands at anytime. The secondary Class 1 traffic has higher priority compared to secondary Class 2 traffic. In this system, a channel reservation scheme is deployed to control spectrum access of the traffic. Specifically, the optimal number of reservation channels is applied to minimize the forced termination probability of the secondary traffic while satisfying a predefined blocking probability of the primary network. To investigate the system performance, we model state transitions of the DSA as a multi-dimensional Markov chain with three-state variables representing the number of primary, Class 1, and Class 2 packets in the system. Based on this chain, important performance measures, i.e., blocking probability and forced termination probability are derived for the Class 1 and Class 2 secondary traffic.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"50 1","pages":"883-888"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85813417","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

Mobile data service QoE analytics and optimization 移动数据服务QoE分析和优化

2015 IEEE International Conference on Communication Workshop (ICCW) Pub Date : 2015-06-08 DOI: 10.1109/ICCW.2015.7247425

S. Yoon, Suwon Lee, Youngjin Kim, Panhyung Lee, Chang-Yeong Oh, I. Youn, E. Monroy, Ziaul Hasany, Jungah Choi

引用次数: 7

An improved Log-MAP algorithm based on polynomial regression function for LTE Turbo decoding 基于多项式回归函数的LTE Turbo译码改进Log-MAP算法

2015 IEEE International Conference on Communication Workshop (ICCW) Pub Date : 2015-06-08 DOI: 10.1109/ICCW.2015.7247502

D. Nguyen, Hang Nguyen

引用次数: 5