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

筛选
英文 中文
A highly efficient multi-carrier transmission scheme with message-driven idle subcarriers 一种具有消息驱动的空闲子载波的高效多载波传输方案
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831633
Tianlong Song, Tongtong Li
{"title":"A highly efficient multi-carrier transmission scheme with message-driven idle subcarriers","authors":"Tianlong Song, Tongtong Li","doi":"10.1109/GLOCOM.2013.6831633","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831633","url":null,"abstract":"This paper develops a highly efficient multi-carrier transmission scheme by using message-driven idle subcarrier identification. The basic idea is to carry part of the information, named carrier bits, through idle subcarrier selection while transmitting ordinary bits regularly on all the other subcarriers. When the number of subcarriers is much larger than the adopted constellation size (e.g., in most OFDM systems), a high spectral efficiency as well as power efficiency can be achieved. This is because that the number of carrier bits transmitted through each idle subcarrier is larger than the number of ordinary bits carried by a regular symbol, and all the carrier bits are transmitted with no power consumption through idle subcarrier selection. When applied to the OFDM framework, the proposed scheme can achieve an even higher spectral efficiency than OFDM, while keeping a higher power efficiency.We further enhance its security and error-tolerance using secure subcarrier assignment, secure symbol mapping and bit vector rearrangement. Both theoretical analysis and numerical results are provided to demonstrate the performance of the proposed scheme.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"7 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":"128926842","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
Single-receiver dual-channel dynamic bandwidth algorithm for local storage VoD delivery 单接收机双通道动态带宽本地存储视频点播算法
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831478
S. Abeywickrama, E. Wong
{"title":"Single-receiver dual-channel dynamic bandwidth algorithm for local storage VoD delivery","authors":"S. Abeywickrama, E. Wong","doi":"10.1109/GLOCOM.2013.6831478","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831478","url":null,"abstract":"Video-on-demand has been highlighted as one of the highest growing traffic generators to the global IP networks. Benefits of using distributed caching servers within passive optical networks to optimize the traditional video-on-demand delivery has been discussed in literature. In our previous work, we introduced a dual-receiver dynamic bandwidth allocation algorithm to improve such video-on-demand services using a local storage placed within the access network. The main drawback of this algorithm lies in the additional power consumption at the optical network unit that arise from using two receivers. In this paper, we extend our study to present a novel single-receiver dual-channel dynamic bandwidth allocation algorithm to further optimize local storage based video-on-demand delivery over passive optical networks. Through packet-level simulations and formulation of power consumption models, we show that this algorithm improves energy-efficiency without compromising the quality-of-service performance of the network.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"40 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":"130753415","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
A scalable public key infrastructure for smart grid communications 用于智能电网通信的可扩展公钥基础设施
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831168
Mohamed Mahmoud, J. Misic, Xuemin Shen
{"title":"A scalable public key infrastructure for smart grid communications","authors":"Mohamed Mahmoud, J. Misic, Xuemin Shen","doi":"10.1109/GLOCOM.2013.6831168","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831168","url":null,"abstract":"The public-key cryptography is indispensable for securing the smart grid communications. In this paper, we propose a hierarchical and fully-connected public key infrastructure that considers the smart grid characteristics. In the proposed public key infrastructure, each certificate authority is responsible for managing the public-key certificates for a geo-bounded small area. We also propose a novel format for the certificates that does not only bind a node's identity to its public key but also to its privileges and permissions. Finally we propose efficient and scalable certificate- renewing scheme that can much reduce the overhead of renewing certificates. Our verifications and evaluations demonstrate that using public key cryptography is essential for securing the smart grid and our proposals are scalable. Moreover, the simulation results demonstrate that the certificate-renewing scheme can significantly reduce the overhead of certificate renewals.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"70 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":"131137130","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}
引用次数: 15
Comparison of Multipath TCP and CMT-SCTP based on intercontinental measurements 基于洲际测量的多路径TCP和CMT-SCTP的比较
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831263
M. Becke, Hakim Adhari, E. Rathgeb, Fu Fa, Xiong Yang, Xing Zhou
{"title":"Comparison of Multipath TCP and CMT-SCTP based on intercontinental measurements","authors":"M. Becke, Hakim Adhari, E. Rathgeb, Fu Fa, Xiong Yang, Xing Zhou","doi":"10.1109/GLOCOM.2013.6831263","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831263","url":null,"abstract":"The market penetration of access devices with multiple network interfaces has increased dramatically over the last few years. As a consequence, there is a strong interest to use all of the available interfaces concurrently to improve data throughput. Corresponding extensions of established Transport protocols are receiving considerable attention within research and standardization. Currently two approaches are in the focus of the IETF: The Multipath TCP (MPTCP) extension for TCP and the Concurrent Multipath Transfer extension for SCTP (CMT-SCTP). This paper evaluates and compares implementations of these two loadsharing protocols by using both lab measurements and intercontinental testbed realized via the Internet between Europe and China. The experiments show that some performance critical aspects have not been taken into account in previous studies. Furthermore, they show that the simple scenario with two disjoint paths, which is typically used for evaluation, does not sufficiently cover the real Internet environment. Based on these insights, we highlight that the different path management strategies of the two protocols have a significant impact on their performance in real Internet scenarios.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"24 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":"132265440","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}
引用次数: 44
AFR: Accurate and fast RFID estimation AFR:准确和快速的RFID估计
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831077
Wenchao Jiang, Yanmin Zhu, Bo Li
{"title":"AFR: Accurate and fast RFID estimation","authors":"Wenchao Jiang, Yanmin Zhu, Bo Li","doi":"10.1109/GLOCOM.2013.6831077","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831077","url":null,"abstract":"A hot and primary problem in RFID system is the estimation of RFID tag cardinality and many algorithms have been proposed for estimating RFID cardinality. However, we find that there is a serious problem that has been widely neglected by some of previous works of RFID cardinality estimation. They incorrectly assume that states of different time slots in the same frame are independent of each other. The consequence of such incorrect assumption would lead to low estimation accuracy. To demonstrate how we correct this mistake, we propose an accurate and fast estimating algorithm called AFR based on the pattern of the number of consecutive empty slots before the first non-empty slot. We theoretically derive the expected number and the variance of consecutive empty slots before the first non-empty slot as a function of the number of tags. Based on such theoretical derivation, we determine the best estimation of the number of tags by only looking at the numbers of consecutive empty slots before the first non-empty slot. Simulation results demonstrate that our algorithm makes more accurate estimation of RFID tag cardinality than an existing state-of-the-art algorithm while using shorter estimation time.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"5 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":"128914432","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
Cross-channel gain estimation with amplify-and-forward relaying in cognitive radio 认知无线电中放大前向中继的跨信道增益估计
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831205
Lin Zhang, Guodong Zhao, Gang Wu, Zhi Chen
{"title":"Cross-channel gain estimation with amplify-and-forward relaying in cognitive radio","authors":"Lin Zhang, Guodong Zhao, Gang Wu, Zhi Chen","doi":"10.1109/GLOCOM.2013.6831205","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831205","url":null,"abstract":"In this paper, we develop a new proactive estimation method to obtain the cross-channel gain from cognitive transmitter to primary receiver without any backhaul between cognitive and primary users. In conventional proactive methods, the jamming signal is used for probing, which introduces the extra interference to primary receivers. In our method, the relayed primary signal is used for probing, which instead assists the primary transmission. Simulation results demonstrate that the proposed method with 2% estimation errors can obtain up to about 72% throughput improvement introduced by the cross-channel gain.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"18 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":"127816135","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
Hard combining based energy efficient spectrum sensing in cognitive radio network 认知无线电网络中基于硬组合的高能效频谱感知
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831211
Huanyu Yang, Zhifeng Zhao, Honggang Zhang
{"title":"Hard combining based energy efficient spectrum sensing in cognitive radio network","authors":"Huanyu Yang, Zhifeng Zhao, Honggang Zhang","doi":"10.1109/GLOCOM.2013.6831211","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831211","url":null,"abstract":"In traditional hard combining cooperative detection strategy, the fusion center (FC) determines whether the spectrum of interest is idle or occupied by primary user (PU) after collecting the decisions from all secondary users (SUs) involved. This paper introduces two kinds of simple and computationally efficient spectrum sensing schemes with which the final decision at the FC can be reached faster. Specifically, we proposed hard combining based sequential detection and ordered transmission schemes under different signal-to-noise ratio (SNR) distribution assumptions. In these schemes, the FC performs hypothesis test each time after it receiving one decision from a SU until the final decision can be made reliably. The simulation results show the proposed techniques can significantly reduce the number of data required in identification of the spectrum hole while achieving the same error probability compared with traditional methods.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"6 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":"115338186","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}
引用次数: 6
Congestion modeling in graph-routed Delay Tolerant Networks with Predictive Capacity Consumption 具有预测容量消耗的图路由容错网络中的拥塞建模
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831534
E. Birrane
{"title":"Congestion modeling in graph-routed Delay Tolerant Networks with Predictive Capacity Consumption","authors":"E. Birrane","doi":"10.1109/GLOCOM.2013.6831534","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831534","url":null,"abstract":"We present Predictive Capacity Consumption (PCC), a congestion modeling extension to graph-based routing protocols. This extension provides a solution to the problem of flow control in Delay-Tolerant Networks (DTNs) and other overlays that can neither synchronize physical link state across the network nor negotiate bandwidth consumption bridging heterogeneous link layers. PCC enables the construction of a distributed, predictive congestion model independent of the underlying link layer without requiring excessive broadcasts or other mechanisms unfeasible in DTNs. PCC examines information generated by routing protocols and adjusts local routing graphs to account for predicted message paths, correcting for downstream congestion and message retransmission. Unlike other mechanisms, the flow control provided by PCC can be implemented anywhere a graph-based routing methodology is used and the adoption of this method requires only minor modification to the in-situ routing framework. We describe the PCC algorithm, analyze its operation, and demonstrate its performance by simulating multiple data streams driving a set of constrained networks to saturation. The simulation results show that PCC improves the throughput of the network by 97% over table routing approaches and by 37% over graph routing approaches without congestion models.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"8 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":"115480500","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
Performance analysis and resource allocation of heterogeneous cognitive gaussian relay channels 异构认知高斯中继信道性能分析与资源分配
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831232
Ke Xue, Xuemin Hong, Lingyu Chen, Jin Xiong, Jianghong Shi, Chengxiang Wang
{"title":"Performance analysis and resource allocation of heterogeneous cognitive gaussian relay channels","authors":"Ke Xue, Xuemin Hong, Lingyu Chen, Jin Xiong, Jianghong Shi, Chengxiang Wang","doi":"10.1109/GLOCOM.2013.6831232","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831232","url":null,"abstract":"Motivated by the deployment of cognitive radio (CR) based relays in cellular networks, this paper studies the fundamental limits of heterogeneous cognitive Gaussian relay channels (HCGRCs). Unlike conventional relay channels, in HCGRC a source transmits to a relay in a licensed band, while the relay transmits to a destination in an unlicensed cognitive spectrum band. The licensed and unlicensed bands are characterized by different power, bandwidth and reliability constraints. Taking an information-theoretic perspective, the fundamental properties of the HCGRC are analyzed thoroughly in terms of capacity, spectral efficiency (SE), and energy efficiency (EE). With regard to each metric, we derive the optimal resource allocation strategy and discuss the impacts of CR spectrum reliability and relay location on the metric. We find that in HCGRC, improving the SE and EE are not necessarily conflicting objectives. Instead, both metrics can be optimized simultaneously with proper resource allocation.","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":"115541708","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}
引用次数: 6
An IP cross-layer scheduler for relative QoS support in NGNs 在ngn中提供相对QoS支持的IP跨层调度器
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831282
G. Panza, S. Grilli
{"title":"An IP cross-layer scheduler for relative QoS support in NGNs","authors":"G. Panza, S. Grilli","doi":"10.1109/GLOCOM.2013.6831282","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831282","url":null,"abstract":"Next-Generation Networks (NGNs) will support Quality of Service (QoS) over a mixed wired and wireless IP-based infrastructure. A relative model of service differentiation in Differentiated Services architecture is a scalable solution for delivering multimedia traffic. However, considering the dynamic nature of radio channels specifically, it is difficult to achieve the target quality provisioning working at the IP and lower layers separately as in the classical approach. In this work, an IP cross-layer scheduler able to support a Proportional Differentiation Model (PDM) for delay guarantees also over wireless is described. The key idea is to leverage feedbacks from the lower layers about the actual delays experienced by packets in order to tune at run-time the priority of the IP service classes with the objective of supporting a PDM at the network node on the whole across multiple layers. A simulation analysis demonstrates the prominent improvements in reliability and robustness of the proposal in the case of highly time-variant performance of the MAC and PHY layers with respect to the classical approach. Furthermore, considerations on the required functionality and likely deployment scenarios highlight the scalability and backward compatibility of the designed solution.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"102 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":"115639675","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
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学术官方微信