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

2013 IEEE Global Communications Conference (GLOBECOM)最新文献

筛选
英文 中文
Wireless streaming of interactive multi-view video: Network compression meets path diversity 交互式多视点视频的无线流:网络压缩满足路径分集
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831304
Jacob Chakareski
{"title":"Wireless streaming of interactive multi-view video: Network compression meets path diversity","authors":"Jacob Chakareski","doi":"10.1109/GLOCOM.2013.6831304","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831304","url":null,"abstract":"I formulate a system framework for network compression of interactive multi-view streaming video. The setup comprises a media server that delivers the content over two independent network paths to a client. My system features a proxy-server located at the junction of the wired and wireless portions of each path. The proxy dynamically adapts the content data sent over the wireless links, in response to channel quality feedback from the client, such that video distortion at the client is minimized. I analyze the performance of my system and contrast its characteristics with dynamic content adaptation at the source and conventional streaming architectures, including scalable video. I numerically simulate the operation of all streaming systems under comparison and establish a close agreement between my analysis and the experimental findings. The proposed system delivers superior video quality over the reference competitors, while enabling notable transmission rate savings, at the same time.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122728661","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
Generalized channel inversion methods for multiuser two-way MIMO relay channels 多用户双向MIMO中继信道的广义信道反演方法
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831746
Haibin Wan, Wen Chen
{"title":"Generalized channel inversion methods for multiuser two-way MIMO relay channels","authors":"Haibin Wan, Wen Chen","doi":"10.1109/GLOCOM.2013.6831746","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831746","url":null,"abstract":"In this paper, we propose a novel linear beamforming scheme for multiuser two-way MIMO relay channels to maximize the system sum rate. To achieve a low complexity, our scheme is designed by using the non-iterative method based on generalized channel inversion (GCI). Both perfect and imperfect channel estimations are considered in the design. Simulation results shown that the proposed scheme outperforms the existing scheme in the scenarios with or without channel estimation error.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122622485","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
Learning perfect coordination with minimal feedback in wireless multi-access communications 学习无线多址通信中最小反馈的完美协调
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831675
W. Zame, J. Xu, M. Schaar
{"title":"Learning perfect coordination with minimal feedback in wireless multi-access communications","authors":"W. Zame, J. Xu, M. Schaar","doi":"10.1109/GLOCOM.2013.6831675","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831675","url":null,"abstract":"Coordination is a central problem whenever stations (or nodes or users) share resources across a network. In the absence of coordination, there will be collision, congestion or interference, with concomitant loss of performance. This paper proposes new protocols, which we call perfect coordination (PC) protocols, that solve the coordination problem. PC protocols are completely distributed (requiring neither central control nor the exchange of any control messages), fast (with speeds comparable to those of any existing protocols), fully efficient (achieving perfect coordination, with no collisions and no gaps) and require minimal feedback. PC protocols rely heavily on learning, exploiting the possibility to use both actions and silence as messages and the ability of stations to learn from their own histories while simultaneously enabling the learning of other stations. PC protocols can be formulated as finite automata and implemented using currently existing technology (e.g., wireless cards). Simulations show that, in a variety of deployment scenarios, PC protocols outperform existing state-of-the-art protocols - despite requiring much less feedback.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122894777","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
Mitigating congestion-based denial of service attacks with active queue management 通过主动队列管理减轻基于拥塞的拒绝服务攻击
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831276
H. Bedi, Sankardas Roy, S. Shiva
{"title":"Mitigating congestion-based denial of service attacks with active queue management","authors":"H. Bedi, Sankardas Roy, S. Shiva","doi":"10.1109/GLOCOM.2013.6831276","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831276","url":null,"abstract":"Denial of service (DoS) attacks are currently one of the biggest risks any organization connected to the Internet can face. Hence, the congestion handling techniques at its edge router(s), such as active queue management (AQM) schemes must consider possibilities of such attacks. Ideally, an AQM scheme should (a) ensure that each network flow gets its fair share of bandwidth, and (b) identify attack flows so that corrective actions (e.g. drop flooding traffic) can be explicitly taken against them to further mitigate the DoS attacks. This paper presents a proof-of-concept work on devising such an AQM scheme, which we name Deterministic Fair Sharing (DFS). Most of the existing AQM schemes do not achieve the above goals or have a significant room for improvement. DFS uses the concept of weighted fair share (wfs) which allows it to dynamically self-adjust the router buffer usage based on the current level of congestion, while assuring fairness among flows and aiding in identifying the malicious ones. We demonstrate the performance of DFS via extensive simulation and compare against other existing AQM techniques.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114507995","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}
引用次数: 10
On the interplay between resource-management overhead and performance in sensor networks: An information theoretic approach 传感器网络中资源管理开销与性能的相互作用:一种信息理论方法
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831296
M. Rahnamay-Naeini, N. Ghani, M. Hayat
{"title":"On the interplay between resource-management overhead and performance in sensor networks: An information theoretic approach","authors":"M. Rahnamay-Naeini, N. Ghani, M. Hayat","doi":"10.1109/GLOCOM.2013.6831296","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831296","url":null,"abstract":"Resource management (RM) is a critical action in systems with limited resources such as sensor networks. Efficient RM depends heavily upon the availability of accurate information on the state of available resources. However, exchange of state information incurs an overhead on the system. In this paper, the sensing and computing resource management in sensor networks is considered. A lossless, distributed source-coding framework is presented to model the exchange of state information. The framework enables the characterization of the interplay between the performance and overhead of RM by leveraging the correlation among the state information of various nodes. Moreover, the proposed framework enables an improved estimate of the lower bound for the minimum control overhead necessary to accurately describe the state of nodes in the network. This improvement is achieved by exploiting the correlation among the state information of nodes as well as the available information on prior resource allocation actions as side information.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122061741","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
Centralized small-cell radio access network with shared millimeter-wave radio-over-fiber resources 具有共享毫米波光纤无线资源的集中式小蜂窝无线接入网
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831441
Lin Cheng, Cheng Liu, Ming Zhu, J. Wang, G. Chang
{"title":"Centralized small-cell radio access network with shared millimeter-wave radio-over-fiber resources","authors":"Lin Cheng, Cheng Liu, Ming Zhu, J. Wang, G. Chang","doi":"10.1109/GLOCOM.2013.6831441","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831441","url":null,"abstract":"Centralized radio access networks (RANs) based on radio-over-fiber (RoF) techniques can simplify the remote access units (RAUs) and maximize the resource sharing among services and operators, thus improving the system efficiency and reducing the operational cost. A scheme of resource sharing is proposed for centralized RANs based on millimeter-wave (MMW) RoF system. Both RoF infrastructure resources and microwave-photonics resources are shared by multiple operators in the heterogeneous system. High-throughput services carried on both V-band (60 GHz) and W-band (100 GHz) are delivered to RAUs through flexible configuration at the central office (CO). This proposed multi-service centralized RAN with shared infrastructure is successfully demonstrated via both simulations and experiments.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116596566","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
Two-path transmission framework for ICI reduction in OFDM systems OFDM系统中减少ICI的双路传输框架
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831651
Miaowen Wen, Xiang Cheng, Liuqing Yang, B. Jiao
{"title":"Two-path transmission framework for ICI reduction in OFDM systems","authors":"Miaowen Wen, Xiang Cheng, Liuqing Yang, B. Jiao","doi":"10.1109/GLOCOM.2013.6831651","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831651","url":null,"abstract":"Two-path transmission schemes have attracted much attention due to its effectiveness in suppressing intercarrier interference (ICI) in orthogonal frequency-division multiplexing (OFDM) systems. This paper proposes a general implementation framework for the existing two-path transmission schemes, which not only reveals the underlying relationship between the existing two-path transmission schemes and the mirror-subcarrier-mapping based ICI self-cancellation technique but also owns the advantage of backward compatibility with normal OFDM systems. Moreover, using the proposed framework, new two-path transmission schemes can be easily developed. With insights provided by this framework, the carrier-to-interference power ratio (CIR) and the bit error probability (BEP) achieved by the existing two-path transmission schemes are further analytically investigated. Monte Carlo simulations validate the analysis.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117018711","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}
引用次数: 21
Optimal power control for analog bidirectional relaying with long-term relay power constraint 具有长期继电器功率约束的模拟双向继电器的最优功率控制
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831710
Z. Hadzi-Velkov, N. Zlatanov, R. Schober
{"title":"Optimal power control for analog bidirectional relaying with long-term relay power constraint","authors":"Z. Hadzi-Velkov, N. Zlatanov, R. Schober","doi":"10.1109/GLOCOM.2013.6831710","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831710","url":null,"abstract":"Wireless systems that carry delay-sensitive information (such as speech and/or video signals) typically transmit with fixed data rates, but may occasionally suffer from transmission outages caused by the random nature of the fading channels. If the transmitter has instantaneous channel state information (CSI) available, it can compensate for a significant portion of these outages by utilizing power allocation. In a conventional dual-hop bidirectional amplify-and-forward (AF) relaying system, the relay already has instantaneous CSI of both links available, as this is required for relay gain adjustment. We therefore develop an optimal power allocation strategy for the relay, which adjusts its instantaneous output power to the minimum level required to avoid outages, but only if the required output power is below some cutoff level; otherwise, the relay is silent in order to conserve power and prolong its lifetime. The proposed scheme is proven to minimize the system outage probability, subject to an average power constraint at the relay and fixed output powers at the end nodes.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129548006","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
Spectrum sharing for bidirectional communication exploiting zero-forcing and singular value decomposition beamforming 利用零强迫和奇异值分解波束形成的双向通信频谱共享
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831184
Hela Hakim, W. Ajib, H. Boujemaa
{"title":"Spectrum sharing for bidirectional communication exploiting zero-forcing and singular value decomposition beamforming","authors":"Hela Hakim, W. Ajib, H. Boujemaa","doi":"10.1109/GLOCOM.2013.6831184","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831184","url":null,"abstract":"In this paper, we propose a dynamic spectrum sharing protocol where a pair of secondary users and a pair of primary users bidirectionally communicate. A secondary relay equipped with multiple antennas is deployed to assist the secondary transmissions and improve the secondary access to the spectrum. We employ a new time division access so that no interference may exist between primary and secondary users. The proposed scheme is then compared to the axiomatic and simple scheme where the secondary users communicate with each other with the assistance of the relay in underlay mode. We study and compare the performances of the two schemes in terms of outage probability. An upper bound for the secondary outage probability of the proposed scheme is derived. Our simulation results prove that the proposed scheme significantly outperforms the underlay spectrum sharing while in both schemes, the primary outage probability is kept identical to the case where secondary users are absent.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"22 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129707672","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
A performance evaluation of a context-aware path recommendation protocol for Vehicular Ad-hoc Networks 车载Ad-hoc网络环境感知路径推荐协议的性能评估
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831123
Maram Bani Younes, A. Boukerche
{"title":"A performance evaluation of a context-aware path recommendation protocol for Vehicular Ad-hoc Networks","authors":"Maram Bani Younes, A. Boukerche","doi":"10.1109/GLOCOM.2013.6831123","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831123","url":null,"abstract":"Many protocols and mechanisms have been proposed aiming to find an alternative path towards each targeted destination in downtown and urban areas. These protocols recommend the fastest path (i.e., least congested path) without considering the services or conditions of the recommended road segments. In this work, we propose a real-time, distributed, and context-aware path recommendation protocol. The proposed protocol considers the existence of special services at alternative road segments and guarantees a congestion-free level for each road segment that is located at a critical service (e.g., hospital, school, etc). Moreover, it considers the conditions of each traveled road segment (e.g., pot-holes, weather conditions, obstacles, etc), while recommending the path towards any targeted destination. We discuss and report on the performance of our protocol compared to other path recommendation and traffic congestion avoidance techniques, using an extensive set of scenarios and experiments implemented in NS-2.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129851916","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}
引用次数: 11
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信