GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference最新文献_第3页

IBI Cancellation Based on Limited Channel Feedback for OFDM Systems over Channels with Large Delay Spreads 基于有限信道反馈的OFDM系统大时延信道IBI抵消

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426165

Xia Wang, Geoffrey Y. Li, Hongjie Hu, L. Qin, A. Soong

引用次数: 2

Optimum/Sub-Optimum Detection for Multi-Branch Cooperative Diversity Networks with Limited CSI 有限CSI下多分支合作分集网络的最优/次最优检测

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425456

Peng Liu, Il Kim

引用次数: 1

Radio-Aware Scheduler for WiMAX Systems Based on Time-Utility Function and Game Theory 基于时间效用函数和博弈论的WiMAX系统无线电感知调度

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425581

R. Garroppo, S. Giordano, D. Iacono

引用次数: 8

Block Diagonalization in the MIMO Broadcast Channel with Delayed CSIT 具有延迟CSIT的MIMO广播信道中的块对角化

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426132

Jun Zhang, J. Andrews, R. Heath

引用次数: 31

Randomized Multi-Channel Interrogation Algorithm for Large-Scale RFID Systems 大规模RFID系统的随机多通道询问算法

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425452

Hamed Mohsenian Rad, V. Shah-Mansouri, V. Wong, R. Schober

{"title":"Randomized Multi-Channel Interrogation Algorithm for Large-Scale RFID Systems","authors":"Hamed Mohsenian Rad, V. Shah-Mansouri, V. Wong, R. Schober","doi":"10.1109/GLOCOM.2009.5425452","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425452","url":null,"abstract":"A radio frequency identification (RFID) system consists of a set of readers and several objects, equipped with small computer chips, called tags. In a dense RFID system, where several readers are placed together to improve the read rate and correctness, readers and tags can frequently experience packet collision. A common approach to avoid collision is to use a distinct frequency channel for interrogation for each reader. Various multi-channel anti-collision protocols have been proposed for RFID readers. However, due to their heuristic nature, most algorithms may not fully utilize the achievable system performance. In this paper, we develop an optimization-based distributed randomized multi-channel interrogation algorithm, called FDFA, for large-scale RFID systems. For this purpose, we develop elaborate models for reader-to-tag and reader-to-reader collision problems. FDFA algorithm is guaranteed to find a local optimum of a max-min fair resource allocation problem to balance the processing load among readers. Simulation results show that FDFA has a significantly better performance than the existing heuristic algorithms in terms of the number of successful interrogations. It also better utilizes the frequency spectrum.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123672568","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

Packet Coding Performance with Correlated Fading and Shadowing 基于相关衰落和阴影的分组编码性能

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425780

M. Papaleo, R. Firrincieli, G. Corazza, A. Vanelli-Coralli

引用次数: 4

Stealthy IP Prefix Hijacking: Don't Bite Off More Than You Can Chew 隐形IP前缀劫持:不要贪多嚼不破

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425977

Christian McArthur, Mina Guirguis

{"title":"Stealthy IP Prefix Hijacking: Don't Bite Off More Than You Can Chew","authors":"Christian McArthur, Mina Guirguis","doi":"10.1109/GLOCOM.2009.5425977","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425977","url":null,"abstract":"In prefix hijacking, an Autonomous System (AS) advertises routes for prefixes that are owned by another AS, and ends up hijacking traffic that is intended to the owner. While misconfigurations and/or misunderstandings of policies are the likely reasons behind the majority of those incidents, malicious incidents have also been reported. Recent works have focused on malicious scenarios that aim to maximize the amount of hijacked traffic from all ASes, without considering scenarios where the attacker is aiming to avoid detection. In this paper, we expose a new class of prefix hijacking that is stealthy in nature. The idea is to craft path(s) - of tunable lengths - that deceive only a small subset of ASes. By finely tuning the degree to which ASes are effected, the attacker can handle the hijacked traffic while the victimized AS would not observe a major reduction in its incoming traffic that would raise an alarm. We give upper bounds on the impact of those attacks via simulations on real BGP Internet announcements obtained from Route-Views. We discuss shortcomings in current proposed defense mechanisms against attackers which can falsify traceroute replies. We also present a defense mechanism against stealthy prefix hijacking attacks.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123757558","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

Distributed Beamforming in Multiuser Multi-Relay Networks with Guaranteed QoS 具有保证QoS的多用户多中继网络中的分布式波束形成

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425247

D. Nguyen, Ha H. Nguyen, Tung T. Pham

引用次数: 18

Multi-Window Spectrum Sensing of Unsynchronized OFDM Signal at Very Low SNR 极低信噪比下不同步OFDM信号的多窗频谱检测

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425957

Cong Wang, Xianbin Wang, Hao Li, P. Ho

引用次数: 9

Dynamic Routing of Connections with Known Duration in WDM Networks WDM网络中已知持续时间连接的动态路由

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425391

Diego Lucerna, M. Tornatore, B. Mukherjee, A. Pattavina

{"title":"Dynamic Routing of Connections with Known Duration in WDM Networks","authors":"Diego Lucerna, M. Tornatore, B. Mukherjee, A. Pattavina","doi":"10.1109/GLOCOM.2009.5425391","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425391","url":null,"abstract":"Recently, new solutions for automatized management in optical networks promise to allow customers to specify on-demand the terms of the Service Level Agreement (SLA) to be guaranteed by the service provider. In this paper we show that is possible to design a highly efficient load balancing algorithm, called RABBIT, for the dynamic provisioning of connections exploiting the knowledge, among the other Service Level Specifications (SLS), of the connections duration. The core idea of RABBIT consists in routing connections based on the transient probability of future-link congestion, that can be estimated with higher precision when the knowledge of connections durations is given. So, we introduce a time-dependent link-weight assignment that evaluates future link congestions probability based on the transient analysis of the Markovian model of the link, making it computationally feasible by means of an effective approximation technique. By means of an extensive set of simulative experiments, we compare our approach to other traditional holding-time agnostic, yet efficient, dynamic routing algorithms. We consider different performance metrics, among which the Blocking Probability (BP), in a wavelength-convertible WDM mesh network scenario. For a typical US nationwide network, RABBIT obtains savings on BP of up to 20% for practical scenarios.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115043465","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