2010 IEEE Global Telecommunications Conference GLOBECOM 2010最新文献

筛选
英文 中文
Analysis and Performance of MIMO-OFDM in Mobile Satellite Broadcasting Systems 移动卫星广播系统中MIMO-OFDM的分析与性能
2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683426
S. Cioni, A. Vanelli-Coralli, G. Corazza, P. Burzigotti, Pantelis-Daniel M. Arapoglou
{"title":"Analysis and Performance of MIMO-OFDM in Mobile Satellite Broadcasting Systems","authors":"S. Cioni, A. Vanelli-Coralli, G. Corazza, P. Burzigotti, Pantelis-Daniel M. Arapoglou","doi":"10.1109/GLOCOM.2010.5683426","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683426","url":null,"abstract":"The mobile satellite broadcasting arena is witnessing a constant increase in demand for improved transmission quality and higher number of services in order to remain on par with the corresponding terrestrial counterparts. A promising way forward in this regard is the migration from the conventional single polarization per beam to an advanced dual polarization per beam architecture for effective spectrum exploitation; this also enables the application of advanced multiple antenna (MIMO) techniques. The present paper moves from DVB-SH the current state-of-the-art for mobile satellite services towards a more advanced system architecture doubling the overall system capacity with a minimum power increase. It turns out that a multiplexing gain equal to two comes at a cost of about 6 dB for the conventional single polarization system, whereas for the advanced system the corresponding cost is about 3.5 dB.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"15 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81964710","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
DIMDS: A Cross Federation Identity Solution for Converged Networks 融合网络的交叉联邦身份解决方案
2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683448
Konstantinos Lampropoulos, S. Denazis
{"title":"DIMDS: A Cross Federation Identity Solution for Converged Networks","authors":"Konstantinos Lampropoulos, S. Denazis","doi":"10.1109/GLOCOM.2010.5683448","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683448","url":null,"abstract":"Future internet architecture, based on the integration of existing networks, face a series of important technical challenges, one of them being the management of diverse user identities. Existing research efforts often tackle only a small range of identity issues, offering limited solutions only applicable in well defined administrative domains. This paper presents an identity management and discovery system, which spans across different domains, federations, and technologies and offers identity services without affecting internal network procedures.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"153 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85395455","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
An NGN-Based Cross-Domain Shared File System 基于ngn的跨域共享文件系统
2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683536
M. Kuhnen, J. Häussler, A. Schülke, H. Kornmayer, Federico Marmori, Matthias Kraus
{"title":"An NGN-Based Cross-Domain Shared File System","authors":"M. Kuhnen, J. Häussler, A. Schülke, H. Kornmayer, Federico Marmori, Matthias Kraus","doi":"10.1109/GLOCOM.2010.5683536","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683536","url":null,"abstract":"The vision of cross-domain file systems is becoming a reality; however, issues like ensuring quality of service for bandwidth-intense resource access, especially over mobile network, may still arise. In this paper, we propose a cross-domain shared file system, which enables a real-time experience for delivery of virtualized file systems utilizing a grid approach over NGN. The system allows users to share file systems in real-time, and provides functions to delivery update notification, to ensure access control settings, and to offer real-time streaming access to the virtual resources. We describe the system design, and a file sharing scenario to show the details of the prototyped solution. Finally, we give an outlook on the future improvements that could be made to the system.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"125 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85398197","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
Joint Power Control and Relay Matrix Design for Cooperative Communication Networks with Multiple Source-Destination Pairs 多源-目的对协同通信网络的联合功率控制与中继矩阵设计
2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683267
K. Zarifi, A. Ghrayeb, S. Affes
{"title":"Joint Power Control and Relay Matrix Design for Cooperative Communication Networks with Multiple Source-Destination Pairs","authors":"K. Zarifi, A. Ghrayeb, S. Affes","doi":"10.1109/GLOCOM.2010.5683267","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683267","url":null,"abstract":"A network with L single-antenna source-destination pairs is considered that uses a half-duplex K-antenna relay to establish the end-to-end links in a dual-hop cooperative communication scheme. The sources share a common channel to concurrently transmit their signals and the relay multiplies its received signal vector with L relaying matrices and then forwards the resulting signal vectors to the destinations in dedicated channels. Under the relay's transmit power constraint at every channel as well as both sources' individual and total power constraints, the jointly optimal sources' powers and the relaying matrices are obtained that maximize the minimum of the normalized signal-to-interference-plus-noise ratios at the destinations. Numerical simulations are then used to verify the analytical results.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"75 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84008477","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
Multi-Radio Wireless Sensor Networks: Energy Efficient Solutions for Radio Activation 多无线电无线传感器网络:无线电激活的节能解决方案
2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683413
Aravind M. Canthadai, S. Radhakrishnan, V. Sarangan
{"title":"Multi-Radio Wireless Sensor Networks: Energy Efficient Solutions for Radio Activation","authors":"Aravind M. Canthadai, S. Radhakrishnan, V. Sarangan","doi":"10.1109/GLOCOM.2010.5683413","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683413","url":null,"abstract":"Consider a wireless sensor network where each node has $K$ radios$r_1,r_2,cdots,r_K$ such that the one hop reachability distance(resp. energy expended) of (resp. by) radio $r_i$ is greater than that of $r_j$, $1 leq j < i leq K$. Given such a network, the problem of energy efficient radio activation is to minimize the total energy spent by the active radios across all nodes in order to maintain a connected network. We show that this problem is NP-Hard. We initially pay attention to the case of $K=2$ and discuss a basic version of the radio activation problem in such networks. We propose approximation methodologies for solving this problem. Our analytical and experimental studies reveal that the greedy algorithm and the minimum spanning tree solution have the best {em worst case} performance while the greedy algorithm has the best {em average case} performance. To the best of our knowledge, this is one of the first few works to focus on %deterministic solutions for optimal radio activation in generic multi-radio wireless networks.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"107 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78253226","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
Multi-Variable Cost Function for Application Layer Multicast Routing 应用层组播路由的多变量代价函数
2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683140
T. Le, Hang Nguyen, Hongguang Zhang
{"title":"Multi-Variable Cost Function for Application Layer Multicast Routing","authors":"T. Le, Hang Nguyen, Hongguang Zhang","doi":"10.1109/GLOCOM.2010.5683140","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683140","url":null,"abstract":"Cost function is an essential part in Application Layer Multicast (ALM) routing algorithms. It is from a cost function that we can calculate links' costs and then build the data delivery tree for multicasting. Unfortunately, cost function remains an almost untouched research area in ALM routing. In this research, we propose a new multi-variable cost function considering various end-to-end QoS parameters simultaneously. The mathematical derivation process is also described in details so that one can apply it to obtain other multi-variable cost functions according to their specific requirements. The newly proposed multi-variable cost function can avoid congestion before it happens, preventing the data delivery tree from being frequently or unnecessarily changed while still be adaptable to the dynamic requirements of different applications. With theoretical analysis, we have proved that the new cost function can provide better performance for ALM routing algorithms compared to conventional cost functions.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"3 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78327852","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}
引用次数: 8
A Resilient Routing Policy for Peering Management 对等管理中的弹性路由策略
2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683622
Stefano Secci, Huaiyuan Ma, B. Helvik, J. Rougier
{"title":"A Resilient Routing Policy for Peering Management","authors":"Stefano Secci, Huaiyuan Ma, B. Helvik, J. Rougier","doi":"10.1109/GLOCOM.2010.5683622","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683622","url":null,"abstract":"We present a novel resilient routing policy for controlling the routing across peering links between Internet carriers. Our policy is aimed at offering more reliability, dependability and better performance to the routing decision with respect to the current practice (e.g., hot-potato routing). Our work relies on a non-cooperative game framework, called Peering Equilibrium MultiPath (PEMP), that has been recently proposed. PEMP allows two carrier providers to coordinate a multipath route selection for critical flows across peering links, while preserving their respective interests and independence. In this paper, we propose a resilient PEMP execution policy accounting for the occurrence of potential impairments (traffic matrix variations, intra-AS and peering link failures) that may occurr in both peering networks. We mathematically define how to produce robust equilibrium sets and describe how to appropriately react to unexpected network impairments that might take place. The results from extensive simulations show that, under a realistic failure scenario, our policy adaptively prevents from peering link congestions and excessive route deviations after failures.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"8 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78523935","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
A Hybrid Relative Distance Based Cluster Scheme for Energy Efficiency in Wireless Sensor Networks 一种基于相对距离的无线传感器网络能效混合聚类方案
2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683388
Hui Gao, Hongkun Li, Y. Cheng
{"title":"A Hybrid Relative Distance Based Cluster Scheme for Energy Efficiency in Wireless Sensor Networks","authors":"Hui Gao, Hongkun Li, Y. Cheng","doi":"10.1109/GLOCOM.2010.5683388","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683388","url":null,"abstract":"Energy efficiency is of great importance for the wireless sensor network (WSN). A popular way to save energy is to construct clusters for data aggregation and forwarding. This paper studies the distributed cluster algorithm to improve the energy consumption efficiency. We observe that the cluster head has to lie within the transmission range of the base station (sink node) and the distance between cluster head and base station is critical for the energy consumption performance, we propose a hybrid relative distance based clustering scheme (HRDCS), which considers the relative distance to the base station and the residual energy level during the cluster head selection stage. Consequently we could better balance the chance of being cluster head for all nodes. Simulation results show that our scheme is able to result in longer network lifetime than the well-known protocol LEACH [2].","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"192 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77780413","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
On the Complexity of Power Minimization Schemes in Data Center Networks 数据中心网络中功率最小化方案的复杂性研究
2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683128
R. McGeer, Priya Mahadevan, S. Banerjee
{"title":"On the Complexity of Power Minimization Schemes in Data Center Networks","authors":"R. McGeer, Priya Mahadevan, S. Banerjee","doi":"10.1109/GLOCOM.2010.5683128","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683128","url":null,"abstract":"In this paper, we consider migration of virtual machines in a data center to minimize network power consumption. Network power is consumed when switches are turned on, and conserved when they are turned off; the optimization problem then is to site virtual machines within the data center to achieve connectivity and desired bandwidth while turning on as few switches as possible. Depending upon specifics of the permissible optimization, and topology considerations within the data center, this optimization problem can be easy, or hard. We fully taxonomize the suite of optimization problems in this general space, showing that the most complex problem (placement and routing of virtual machines in a topologically-rich data center network) is NP- hard. We offer a placement technique based on a classic VLSI placement algorithm, and demonstrate efficacy on a trace set derived from a production data center.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"58 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77974595","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}
引用次数: 16
Performance of Opportunistic Spectrum OFDMA Network with Users of Different Priorities and Traffic Characteristics 具有不同用户优先级和业务特征的机会频谱OFDMA网络性能
2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683356
Jihoon Park, P. Pawełczak, Pål Grønsund, D. Cabric
{"title":"Performance of Opportunistic Spectrum OFDMA Network with Users of Different Priorities and Traffic Characteristics","authors":"Jihoon Park, P. Pawełczak, Pål Grønsund, D. Cabric","doi":"10.1109/GLOCOM.2010.5683356","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683356","url":null,"abstract":"We propose an analytical model to assess the throughput and call blocking rate of Opportunistic Spectrum Orthogonal Frequency Division Multiple Access network constituted of multiple classes of Secondary Users (SUs) and temporarily active Primary Users (PUs) of different priorities. In the case of PUs we consider low activity wideband and high activity narrowband users. While in the case of SUs we consider subscribers transmitting real-time constant bit rate (CBR) and elastic variable bit rate (VBR) traffic. We conclude that with the increased activity of PUs, CBR traffic experiences larger throughput decrease than VBR. Moreover, blocking rate of CBR connections decreases exponentially with increased inter-arrival rate of PU, while we observe no direct correlation between obtained SU network throughput and CBR blocking rate.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"74 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78085313","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学术文献互助群
群 号:481959085
Book学术官方微信