发布求助
文献互助 智能选刊 最新文献

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.最新文献

筛选
英文 中文
Noncoherent iterative demodulation and decoding of serially concatenated coded MSK 串行串联编码MSK的非相干迭代解调与解码
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378067
M. Howlader, Xiaolin Luo
{"title":"Noncoherent iterative demodulation and decoding of serially concatenated coded MSK","authors":"M. Howlader, Xiaolin Luo","doi":"10.1109/GLOCOM.2004.1378067","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378067","url":null,"abstract":"In this paper, we propose a detection technique for a serially concatenated coded MSK (SC-MSK) modulated signal, based on the noncoherent BCJR (N-BCJR) algorithm, where an exponentially decaying observation window (EDW) in the N-BCJR algorithm is used to get better use of the channel phase memory and reduce the state as well as metric computational complexity. We also derive the decoding metrics of N-BCJR for the Rayleigh fading channel without channel state information (CSI) and incorporate the EDW in the metrics. The BER performance of the proposed noncoherent SC-MSK, using EDW and a rectangular window (RW), are compared via Monte Carlo simulation in both AWGN and slow, flat Rayleigh fading channels.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127567346","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
An efficient random key pre-distribution scheme 一种高效的随机密钥预分发方案
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378403
M. Ramkumar, N. Memon
{"title":"An efficient random key pre-distribution scheme","authors":"M. Ramkumar, N. Memon","doi":"10.1109/GLOCOM.2004.1378403","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378403","url":null,"abstract":"Any key pre-distribution (KPD) scheme is inherently a trade-off between complexity and security. By sacrificing some security (KPD schemes need some assurance of the ability to limit sizes of attacker coalitions), KPD schemes gain many advantages. We argue that random KPD schemes, in general, perform an \"advantageous\" trade-off which renders them more suitable for practical large scale deployments of resource constrained nodes. We introduce a novel random KPD scheme, hashed random preloaded subsets (HARPS), which turns out to be a generalization of two other random KPD schemes, random preloaded subsets (RPS) and a scheme proposed by T. Leighton and S. Micali (LM). All three schemes have probabilistic measures for the \"merit\" of the system. We analyze and compare the performance of the three schemes. We show that HARPS has significant advantages over other KPD schemes, and in particular, over RPS and LM.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131154100","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}
引用次数: 41
A scalable and efficient end host multicast protocol for peer-to-peer systems - DSCT 用于点对点系统的可扩展和高效的终端主机多播协议- DSCT
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378103
Wanqing Tu, W. Jia
{"title":"A scalable and efficient end host multicast protocol for peer-to-peer systems - DSCT","authors":"Wanqing Tu, W. Jia","doi":"10.1109/GLOCOM.2004.1378103","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378103","url":null,"abstract":"We study a scalable and efficient end host multicast-DSCT (dynamic shared cluster tree) for P2P systems in this paper. In our design, we focus on making full use of underlying physical properties to improve both scalability and efficiency as data multicast in the overlay topologies of P2P systems. In this paper, we present the DSCT architecture, the dynamic scheme to select cluster cores according to the instantaneous network situations. These are all the key points to construct the basic DSCT (BDSCT) multicast. Through further studies, we provide DSCT improvement design (IDSCT) to make it more suitable for multiple-source P2P communications. Our simulation results indicate that it is possible to improve the scalability and efficiency of end host multicast in P2P systems by using our DSCT designs.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132883584","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
Increasing time domain diversity in OFDM systems 提高OFDM系统的时域分集
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378072
A. Dammann, R. Raulefs
{"title":"Increasing time domain diversity in OFDM systems","authors":"A. Dammann, R. Raulefs","doi":"10.1109/GLOCOM.2004.1378072","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378072","url":null,"abstract":"Delay and Doppler spread of multipath fading channels have already been identified as sources of diversity in wireless communications systems. However, extensive delay- and Doppler spread may cause non-negligible intersymbol interference (ISI) and/or intercarrier interference (ICI) in OFDM systems. In this paper, we propose a method for increasing the Doppler spread of the multipath fading channel without causing additional ICI. The idea is to transmit the OFDM time domain signal predistorted via multiple transmit antennas. The proposed methods can be applied in addition to already existing OFDM systems without any modifications at the receiver, which makes them standards-compatible.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133341495","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
Near maximum likelihood multi-track partial response detection for magnetic recording 磁记录的近最大似然多道部分响应检测
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378446
S. Tosi, T. Conway
{"title":"Near maximum likelihood multi-track partial response detection for magnetic recording","authors":"S. Tosi, T. Conway","doi":"10.1109/GLOCOM.2004.1378446","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378446","url":null,"abstract":"The paper considers the detection of data from a parallel multi-track magnetic recording medium in the presence of severe adjacent track interference. In this case, the complexity of a full maximum likelihood detector is prohibitive, even for modest numbers of rows. Hence, a reduced complexity detector based on the use of a tree search algorithm (such as the M-algorithm) with a time varying trellis model of the channel is proposed. The complexity of the detector is related to the parameter M, and it is shown that modest values of M can result in good performance, yet should be feasible to implement.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133638581","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
Improving the performance of switched diversity with post-examining selection 通过事后检验选择提高切换分集的性能
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1377993
Hong-Chuan Yang, Mohamed-Slim Alouini
{"title":"Improving the performance of switched diversity with post-examining selection","authors":"Hong-Chuan Yang, Mohamed-Slim Alouini","doi":"10.1109/GLOCOM.2004.1377993","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1377993","url":null,"abstract":"Switched diversity offers one of the lowest complexity solutions for fading mitigation. The receiver employing switched combining schemes seeks and uses an acceptable diversity path for data reception. When no acceptable path is found after all paths have been examined, however, the receiver randomly chooses an unacceptable path. In this paper, we consider the performance improvement of switched combining schemes. In particular, we modify the conventional switch and examine combining (SEC) scheme in a way such that the best path is selected when there is no acceptable path. For the resulting SEC with post-examining selection (SECps) scheme, we carry out a thorough performance analysis over fading channels. Noting that SECps can be viewed as selection combining (SC) with an output threshold scheme, we perform a tradeoff study of performance versus complexity between SECps and SC. The analytical results are illustrated with some selected numerical examples.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132592477","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}
引用次数: 60
Adaptive Dly-ACK for TCP over 802.15.3 WPAN 支持802.15.3 WPAN协议的自适应dack
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378268
Hongyuan Chen, Zihua Guo, R. Yao, Yanda Li
{"title":"Adaptive Dly-ACK for TCP over 802.15.3 WPAN","authors":"Hongyuan Chen, Zihua Guo, R. Yao, Yanda Li","doi":"10.1109/GLOCOM.2004.1378268","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378268","url":null,"abstract":"The Dly-ACK scheme in IEEE 802.15.3 is designed to reduce the overhead of the ACK and improve the channel utilization. However, the way to use the Dly-ACK is open for implementation. In this paper, we first investigate the problems of applying the fixed Dly-ACK scheme to the TCP stream and show that the TCP performance is rather poor. Then, we propose two enhancement mechanisms for TCP with Dly-ACK over the 802.15.3 system. The first one is to request the Dly-ACK frame adaptively or change the burst size of Dly-ACK according to the queue size. The second is a retransmission counter to enable the destination DEV to deliver the packets to the upper layer timeously and in orderly fashion. Simulation results show that, with our enhancements, the TCP throughput can be improved more than 40% compared with the conventional Imm-ACK. We also investigate the impacts of some important system parameters such as the buffer size on the TCP performance. Some guidelines for the Dly-ACK design are given. Finally, it is worth pointing out that our enhancements are compatible with the standard.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132734468","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
Multi-branch predetection equal gain combiner in equally correlated Nakagami-m fading channels 等相关Nakagami-m衰落信道中的多支路预检测等增益组合器
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1377991
K. Bae, A. Annamalai, W. Tranter
{"title":"Multi-branch predetection equal gain combiner in equally correlated Nakagami-m fading channels","authors":"K. Bae, A. Annamalai, W. Tranter","doi":"10.1109/GLOCOM.2004.1377991","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1377991","url":null,"abstract":"The article presents an analytical framework for evaluating the performance of an equally correlated multi-branch predetection equal gain combining (EGC) diversity receiver in Nakagami-m fading channels. Specifically, the characteristic function (CHF) of the EGC output signal-to-noise ratio (SNR) with L correlated inputs is derived. Selected numerical examples are provided to illustrate the effects of branch correlation and fade distribution on the average error rate and outage probability of EGC receivers.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133184914","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
Scalable and robust data dissemination in wireless sensor networks 无线传感器网络中可扩展和鲁棒的数据传播
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378937
Wei Liu, Yanchao Zhang, W. Lou, Yuguang Fang, T. Wong
{"title":"Scalable and robust data dissemination in wireless sensor networks","authors":"Wei Liu, Yanchao Zhang, W. Lou, Yuguang Fang, T. Wong","doi":"10.1109/GLOCOM.2004.1378937","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378937","url":null,"abstract":"Wireless sensor networks (WSNs) are appealing in obtaining fine-granular observations about the physical world. Due to the fact that WSNs are composed of a large number of low-cost but energy-constrained sensor nodes, along with the notorious time-varying and error-prone nature of wireless links, scalable, robust, and energy-efficient data disseminating techniques are requisite for the emerging WSN applications such as environment monitoring and surveillance. To meet this challenging demand, we propose a hybrid data dissemination framework for WSNs in this paper. In particular, we conceptually partition a whole sensor field into several functional regions and apply different routing schemes to different regions in order to provide better performance in terms of reliability and fair energy usage. For this purpose, we also propose a novel zone flooding scheme, essentially a combination of geometric routing and flooding techniques. Our scheme features low overhead, high reliability, good scalability, and notable flexibility. Simulation studies are carried out to validate the effectiveness and efficiency of our scheme.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126584613","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
Optimal code assignment and call admission control for OVSF-CDMA systems constrained by blocking probabilities 受阻塞概率约束的OVSF-CDMA系统的最优码分配与呼叫接纳控制
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378958
Jun-Seong Park, Lei Huang, D. Lee, C.-C. Jay Kuo
{"title":"Optimal code assignment and call admission control for OVSF-CDMA systems constrained by blocking probabilities","authors":"Jun-Seong Park, Lei Huang, D. Lee, C.-C. Jay Kuo","doi":"10.1109/GLOCOM.2004.1378958","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378958","url":null,"abstract":"The tradeoff between the throughput and the blocking probability of various code assignment schemes for OVSF-CDMA (orthogonal variable spreading factor CDMA) systems is investigated, and the optimal fixed and dynamic code assignment schemes that maximize the average data throughput under a blocking probability constraint are proposed. The optimal schemes are obtained using constrained optimization through the Markov decision process and linear programming. The performance of each scheme is numerically evaluated. Numerical results demonstrate that the proposed new schemes can achieve a satisfactory balance between the average throughput and the blocking probability.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127631131","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
首页 上一页 下一页 尾页
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学术官方微信