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

AnomBench: A Benchmark for Volume-Based Internet Anomaly Detection 基于容量的互联网异常检测基准

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

S. Shanbhag, T. Wolf

引用次数: 5

SARP - A Novel Multi-Copy Routing Protocol for Intermittently Connected Mobile Networks SARP——一种用于间歇连接移动网络的新型多副本路由协议

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

Ahmed Elwhishi, P. Ho

引用次数: 32

New Theoretical Studies and Optimal Cluster-Population Determination for Hierarchical Networks 层次网络最优聚类种群确定的新理论研究

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

S. Chang, Hsiao-Chun Wu, Yiyan Wu, Ai-Chun Pang

{"title":"New Theoretical Studies and Optimal Cluster-Population Determination for Hierarchical Networks","authors":"S. Chang, Hsiao-Chun Wu, Yiyan Wu, Ai-Chun Pang","doi":"10.1109/GLOCOM.2009.5425394","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425394","url":null,"abstract":"In order to decrease the overhead of the dynamic routing mechanisms in large networks, the hierarchical routing protocols have been proposed in the early 80's. The routing complexity and the routing table size are the two most important functional blocks in a dynamic route guidance system. Although various algorithms exist for finding the best routing policy on a hierarchical network, hardly exists any work in studying and evaluating the aforementioned measures of routing complexity and routing table size for a hierarchical network. In this paper, by applying the random geometry theory, we can generalize the mathematical framework from the previous work which discussed the worst-case deterministic models. Our proposed new framework can carry out the averages of the routing complexity and the routing table size, which can be specified as the functions of the hierarchical network parameters such as the number of the hierarchical levels and the subscriber densities (cluster-population) for each hierarchical level. After establishing the relationship between the structure of a hierarchical network and these two crucial network performance measures (routing complexity and routing table size), we present a novel cluster-population optimization method for hierarchical networks and the associated statistical analysis.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"25 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":"134244052","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 Novel Observe-and-Forward Scheme in Wireless Cooperative Relaying Systems 无线协作中继系统中一种新的观察转发方案

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

Wenjun Wu, Q. Quan, Yuexing Peng, K. Zheng, Wenbo Wang, Young-il Kim

引用次数: 0

Data collection capacity of random-deployed wireless sensor networks 随机部署无线传感器网络的数据采集能力

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

Siyuan Chen, Yang Wang, Xiangyang Li, Xinghua Shi

引用次数: 30

Channel Orthogonalizing Precoder for Open-Loop QO-STBC Systems 开环QO-STBC系统信道正交化预编码器

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

Heejin Kim, Heunchul Lee, Inkyu Lee

{"title":"Channel Orthogonalizing Precoder for Open-Loop QO-STBC Systems","authors":"Heejin Kim, Heunchul Lee, Inkyu Lee","doi":"10.1109/GLOCOM.2009.5426185","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426185","url":null,"abstract":"This paper proposes a new preprocessing scheme for rate-one quasi-orthogonal space-time block code (QO-STBC), which requires no channel state information at the transmitter. We consider QO-STBCs in real domain so as to utilize the real-valued multidimensional constellation. First, we derive a precoding matrix which makes the effective channel matrix of QO-STBC column-wise orthogonal. Surprisingly, the proposed scheme provides the channel gains identical to the singular values of the channel matrix of STBCs. Since singular value decomposition based precoding method provides better performance than other conventional maximum-likelihood decoding method in coded systems, the proposed scheme outperforms other STBC schemes in coded systems without feedback information, while reducing the decoding complexity dramatically. Second, we employ the rotated multidimensional constellation in order to achieve full diversity in uncoded systems. Unlike the previous works where heuristic approaches should be needed to obtain solutions in QO-STBC systems with more than four transmit antennas, the proposed precoding combined with the rotated multidimensional constellation provides an optimal solution based on analysis regardless of the number of transmit antennas.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"2 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":"133872121","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

Handling Double-Link Failures in Metro Ethernet Networks Using Fast Spanning Tree Reconnection 使用快速生成树重连处理城域以太网双链路故障

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

Jian Qiu, G. Mohan, K. Chua, Yong Liu

{"title":"Handling Double-Link Failures in Metro Ethernet Networks Using Fast Spanning Tree Reconnection","authors":"Jian Qiu, G. Mohan, K. Chua, Yong Liu","doi":"10.1109/GLOCOM.2009.5425321","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425321","url":null,"abstract":"Ethernet is becoming a preferred technology to be deployed in metro domain due to its low cost, simplicity and ubiquity. However, traditional spanning tree based Ethernet protocol does not meet the requirement for Metro Area Networks in terms of network resilience. In [1], we proposed a Fast Spanning Tree Reconnection (FSTR) mechanism for Metro Ethernet networks to handle single link failures. Upon failure of a link on a spanning tree, FSTR mechanism activates a reconnect-link to reconnect the broken spanning tree. FSTR mechanism has the features of fast recovery, simplicity, and guaranteed protection. However, when more than one link fail in the network, the FSTR mechanism would generate unexpected loops and cannot function properly. In this paper, we propose a fast spanning tree reconnection mechanism to handle double-link failures with protection grade guarantees. The mechanism is distributed and can alleviate the problem in previous FSTR mechanism. We formulate the reconnect-link pre-configuration problem for double-link failures as an integer linear programming problem. Through numerical results we demonstrate that the proposed mechanism can satisfy the protection grade required for each connection by efficiently utilizing the network capacity.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"141 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":"133973248","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

Matching Stream Authentication and Resource Allocation to Multimedia Codec Dependency with Position-Value Partitioning in Wireless Multimedia Sensor Networks 无线多媒体传感器网络中基于位置-值划分的多媒体编解码器依赖匹配流认证和资源分配

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

Wei Wang, D. Peng, Honggang Wang, H. Sharif, Hsiao-Hwa Chen

{"title":"Matching Stream Authentication and Resource Allocation to Multimedia Codec Dependency with Position-Value Partitioning in Wireless Multimedia Sensor Networks","authors":"Wei Wang, D. Peng, Honggang Wang, H. Sharif, Hsiao-Hwa Chen","doi":"10.1109/GLOCOM.2009.5425472","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425472","url":null,"abstract":"A cross layer Unequal Error Protection (UEP) scheme based upon the multimedia position-value (P-V) partitioning has been recently proposed to only improve energy-distortion performance in Wireless Multimedia Sensor Networks (WMSN). There is also a great potential to adapt this UEP scheme into multimedia stream integrity protection. However, performance gains in multimedia transmissions with considerations of energy, distortion, and authentication in WMSN is a challenge. This difficulty results from the media codec dependency on both the content of multimedia stream authentication and protection on the integrity process itself. In this article, we propose a novel scheme which optimally matches the application layer multimedia codec dependency to both lower layer resource allocation requirements and the upper layer stream authentication. The goal of this scheme is to optimize the integrity and quality performance gain within energy constraint. The contribution of the proposed approach is two folds. Firstly, a stream authentication scheme matched with P-V codec dependency is proposed which significantly reduces additional authentication dependency overhead. Secondly, a new resource allocation scheme is proposed to improve energy-distortion-authentication performance with regard to codec dependency. Simulation studies demonstrate that the proposed scheme significantly impacts achieving multimedia transmission quality with energy efficiency and authentication assurance.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"22 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":"133977384","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

Interference Subspace Tracking for Network Interference Alignment in Cellular Systems 蜂窝系统中网络干扰对准的干扰子空间跟踪

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

Bo Niu, A. Haimovich

引用次数: 23

Utility-Based Scheduling with Non-Deterministic Fading Channels in Wireless Multi-Hop Networks 无线多跳网络中基于效用的非确定性衰落信道调度

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

Zheng Liu, M. Ma, J. Dai

引用次数: 0