GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference最新文献

筛选
英文 中文
Decentralized Cooperative Positioning and Tracking Based on a Weighted Sign Algorithm for Wireless Sensor Networks 基于加权符号算法的无线传感器网络分散协同定位与跟踪
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426290
Dong-Shing Wu, Chin-Liang Wang
{"title":"Decentralized Cooperative Positioning and Tracking Based on a Weighted Sign Algorithm for Wireless Sensor Networks","authors":"Dong-Shing Wu, Chin-Liang Wang","doi":"10.1109/GLOCOM.2009.5426290","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426290","url":null,"abstract":"Based on the requirements of low energy consumption and high bandwidth efficiency, a primary area of study is how to improve the estimation accuracy and tracking performance for target localization in wireless sensor networks. In this paper, we propose a weighted sign algorithm (WSA) for positioning and tracking in wireless sensor networks. In terms of the reliability of distance estimation, the location estimation of a target is formulated as a weighted least squares (WLS) problem, which is solved based on the WSA in an iterative and decentralized manner. We also propose a cooperative message-passing algorithm for inter-sensor information exchange, adaptively picking the participating sensor nodes, and making the paths for cyclic routing in the network. On each routing path, a target's location estimate is updated on each cycle and continues among the participating sensor nodes that surround the target. To ensure that the WSA-based scheme has a convergence behavior, a convergence analysis is given. Computer simulation results demonstrate that, as compared with previous methods, our proposed scheme has a faster convergence rate, better location accuracy, and improved tracking performance.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"4 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":"116466842","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}
引用次数: 4
Effect of Dynamic Spectrum Access on Transport Control Protocol Performance 动态频谱接入对传输控制协议性能的影响
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426234
Y. Kondareddy, P. Agrawal
{"title":"Effect of Dynamic Spectrum Access on Transport Control Protocol Performance","authors":"Y. Kondareddy, P. Agrawal","doi":"10.1109/GLOCOM.2009.5426234","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426234","url":null,"abstract":"Transmission Control Protocol (TCP) is the most commonly used transport protocol on the Internet. All indications assure that it will be an integral part of the future internetworks. In this paper, we present how regular TCP which was designed for wired networks is not suitable for dynamic spectrum access networks. We develop an analytical model to estimate the TCP throughput of Dynamic spectrum access networks. Dynamic spectrum access networks deal with opportunistic spectrum access leading to greater utilization of the spectrum. The extent of utilization depends on the primary user's traffic and also on the way the spectrum is accessed by the primary and secondary users. The proposed model considers primary and secondary user traffic in estimating the TCP throughput by modeling the spectrum access using continuous-time Markov chains, thus providing more insight on effect of dynamic spectrum access on TCP performance than the existing models.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"9 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":"121500123","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}
引用次数: 30
Downlink Distributed Beamforming through Relay Networks 通过中继网络的下行分布式波束形成
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426225
Yi Zheng, S. Blostein
{"title":"Downlink Distributed Beamforming through Relay Networks","authors":"Yi Zheng, S. Blostein","doi":"10.1109/GLOCOM.2009.5426225","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426225","url":null,"abstract":"Beamforming and relaying are two methods of improving wireless system performance. Until now, these techniques have been considered separately. In this paper, a single source (basestation) with multiple antennas broadcasts to multiple single-antenna destinations through a network of single-antenna relays. A transmit precoder is first proposed to optimize the system for a set of fixed relay gains and phases (beamforming weights). Next, by straightforwardly generalizing results from the recent literature, these distributed relay beam-forming weights are optimized for this transmit precoder. The process is performed iteratively, and both problems are solved using semidefinite relaxation. For the special case of a single destination, we also provide a closed-form solution for relay optimization using a fixed linear precoder at the transmitter. Simulation results quantify the tradeoffs between the number of antennas at the basestation versus the number of relays, in terms of total relay network transmit power savings.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"130 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113989032","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
A Decentralized Framework for Dynamic Downlink Base Station Cooperation 一种分散的动态下行基站合作框架
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425212
Sheng Zhou, Jie Gong, Z. Niu, Yunjian Jia, Peng Yang
{"title":"A Decentralized Framework for Dynamic Downlink Base Station Cooperation","authors":"Sheng Zhou, Jie Gong, Z. Niu, Yunjian Jia, Peng Yang","doi":"10.1109/GLOCOM.2009.5425212","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425212","url":null,"abstract":"Multiple Base Station (Multi-BS) cooperation has been considered as a promising mechanism to suppress co-channel interference and boost the capacity for cellular networks. However, the large feedback and signaling overhead hinder it from practice. Therefore, limited cooperation among BSs is recognized as a good tradeoff between the performance gain and the relevant cost. In this paper, the whole network is divided into small disjointing BS cooperation groups, namely, clusters. A decentralized framework is proposed to facilitate the BS cluster formation on the downlink, in order to maximize the sum-rate of the scheduled mobile stations (MSs) under the cluster size constraint. Moreover, an efficient BS negotiation algorithm is designed for cluster formation, of which the feedback overhead per MS is irrelevant to the network size, and the number of iteration rounds scales very slowly with the network size. Simulations show that our strategy leads to significant sum-rate gain over static clustering and performs almost the same as the centralized greedy approach. With its low signaling overhead and complexity, the proposed framework is well suited for implementation in large-scale cellular networks.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"27 3 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":"124437883","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}
引用次数: 40
LDPC Decoding Strategies for Two-Dimensional Magnetic Recording 二维磁记录LDPC解码策略
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425930
A.R. Krishnan, R. Radhakrishnan, B. Vasic
{"title":"LDPC Decoding Strategies for Two-Dimensional Magnetic Recording","authors":"A.R. Krishnan, R. Radhakrishnan, B. Vasic","doi":"10.1109/GLOCOM.2009.5425930","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425930","url":null,"abstract":"In this paper, we propose a linear programming (LP) decoding scheme for binary error-erasure channel for use in two-dimensional magnetic recording. We compare the performance of this decoding scheme with other decoding schemes like LP decoding for BSC and belief-propagation decoding. Also, we compare the effect of variance of grain-area in the medium on the bit-error rates of various decoding schemes.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"1 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":"127600940","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}
引用次数: 17
Cooperative Uplink of Two Mobile Stations with Network Coding Based on the WiMax LDPC Code 基于WiMax LDPC码的两移动站网络编码协同上行
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425675
Lena Chebli, C. Hausl, Georg Zeitler, R. Koetter
{"title":"Cooperative Uplink of Two Mobile Stations with Network Coding Based on the WiMax LDPC Code","authors":"Lena Chebli, C. Hausl, Georg Zeitler, R. Koetter","doi":"10.1109/GLOCOM.2009.5425675","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425675","url":null,"abstract":"We consider the uplink of two mobile stations with the help of one common relay. Recently, joint network-channel coding based on LDPC codes was proposed for this setup where the channel codes at the mobile stations and the network code at the relay form one distributed LDPC code. This approach allows to gain diversity with a higher rate compared to a relay system without network coding. We propose a practical joint network-channel code that follows the structure of the WiMax IEEE 802.16e LDPC code, and that benefits from efficient linear time encoding and reduced storage requirements. We show how to use a modified high girth code at the relay that allows to gain diversity. Further, we compare two decoding methods of the distributed code at the destination. Simulation results for an example with noisy block fading channels against reference systems demonstrate the advantage of the proposed design.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"42 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":"127676220","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
Integrated Approach to Proportional-Fair Resource Allocation for Multiclass Services in an OFDMA System OFDMA系统中多类业务资源比例公平分配的集成方法
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425291
N. Ruangchaijatupon, Yusheng Ji
{"title":"Integrated Approach to Proportional-Fair Resource Allocation for Multiclass Services in an OFDMA System","authors":"N. Ruangchaijatupon, Yusheng Ji","doi":"10.1109/GLOCOM.2009.5425291","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425291","url":null,"abstract":"This paper presents the novel resource allocation scheme for multiclass services in the downlink OFDMA system, in which the frame-based transmission with multiple subchannels and multiple time slots is used. As system utilization and fairness are necessary, the scheme is based on Proportional Fairness (PF) utility function. Two main service classes are considered. One is the guaranteed service class. The other is the nonguaranteed service class. The scheme guarantees the minimum bit rate for the former class. The PF-based optimization problem with minimum bit rate requirement is formed and solved by using the Lagrange multiplier method with relaxed constraints. The novel PF-based utility function is derived and used for this class. The non-guaranteed class is served after the guaranteed class by using the conventional PF utility function. Extensive simulation with user mobility and finite backlog is conducted. The results show that the proposed scheme is able to satisfy the minimum rate requirement for the guaranteed class with moderate system utilization. Furthermore, within the same class, the scheme can provide very high throughput fairness.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"7 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":"126386825","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
An Efficient Key Management Scheme for Live Streaming 一种高效的实时流媒体密钥管理方案
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426232
Xingyu Li, H. V. Zhao
{"title":"An Efficient Key Management Scheme for Live Streaming","authors":"Xingyu Li, H. V. Zhao","doi":"10.1109/GLOCOM.2009.5426232","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426232","url":null,"abstract":"To protect multimedia content in live streaming applications, it is of critical importance to employ effective access control and key management schemes and to prevent unauthorized access. Many live streaming applications experience a large variation in the user number, high reconnection rate, and a large number of short sessions. Such frequent membership update may introduce significant rekey overhead and poses challenges to efficient key management. This paper considers applications that can tolerate a small amount of content leak, explores the unique characteristics of live broadcast streaming in membership dynamics, and investigates efficient key management mechanisms. Our proposed scheme uses the reconnection algorithm, batch rekeying and grouped user placement to reduce the communication and the computation cost associated with key update. Our analytical and simulation results show that the proposed scheme can reduce more than 50% of the rekey messages, and helps decrease the number of rekey messages that a user needs to decrypt by more than 90%.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"38 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":"126388664","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
Forecasting-Based Sampling Decision for Accurate and Scalable Anomaly Detection 基于预测的采样决策用于精确和可扩展的异常检测
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426221
F. Hashim, A. Jamalipour
{"title":"Forecasting-Based Sampling Decision for Accurate and Scalable Anomaly Detection","authors":"F. Hashim, A. Jamalipour","doi":"10.1109/GLOCOM.2009.5426221","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426221","url":null,"abstract":"This paper proposes the inclusion of two traffic forecasting frameworks in traffic sampling paradigm. The proposed frameworks: namely, the pattern forecasting and the attack forecasting, predicts the occurrence of traffic deviation and examines the existence of malicious attack in the traffic deviation, respectively. While the former utilizes the ARAR model to forecast the network traffic, the latter exploits the statistical likelihood function to determine whether any malicious attack is the origin of the traffic deviation. In addition, a dynamic weight assignment strategy is proposed to further improve the efficiency of the sampling strategy. Performance evaluation indicates that the inclusion of both forecasting frameworks and dynamic weight assignment in the sampling strategy can improve the accuracy and scalability of the anomaly detection.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"44 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":"126417533","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
Bandpass Sampling Digital Frontend Architecture for Multi-Band Access Cognitive Radio 多频带接入认知无线电的带通采样数字前端架构
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426260
Jaehyung Kim, Hongmei Wang, Hyungjung Kim, Jin-Up Kim
{"title":"Bandpass Sampling Digital Frontend Architecture for Multi-Band Access Cognitive Radio","authors":"Jaehyung Kim, Hongmei Wang, Hyungjung Kim, Jin-Up Kim","doi":"10.1109/GLOCOM.2009.5426260","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426260","url":null,"abstract":"Bandpass sampling (BPS) theory enables the conversion of RF frequency directly down to baseband, which is a significant technique in Cognitive radio (CR) systems because they require flexibility in RF frontend. Based on this concept, second-order BPS frontends for CR systems are designed and verified by using a hardware platform. The methods adopted to manipulate spectrums to remove aliasing and images are described, and the equations employed to design interpolants are provided. The results of experiment indicate that the proposed second-order BPS frontends can realize universal access and environment sensing functionalities in CR systems.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"18 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":"126535554","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
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学术官方微信