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

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

筛选
英文 中文
Supporting Private Networking with Wavelength Spatial-Reuse over WDM EPONs 在WDM epon上支持波长空间复用的专用网络
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.498
Hui-Tang Lin, Wang-Rong Chang, Chai-Lin Lai, Sheng-Jhe Hong
{"title":"Supporting Private Networking with Wavelength Spatial-Reuse over WDM EPONs","authors":"Hui-Tang Lin, Wang-Rong Chang, Chai-Lin Lai, Sheng-Jhe Hong","doi":"10.1109/GLOCOM.2008.ECP.498","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.498","url":null,"abstract":"This study proposes a novel WDM EPON system based upon an AWG, in which multiple wavelengths are established in both the upstream and the downstream fibers. The use of the AWG enables the WDM EPON architecture to achieve wavelength spatial-reuse and to provide an intercommunication capability between ONUs. As a result, the architecture not only allows upstream access to the central office but also facilitates a truly-shared LAN capability amongst the end users. The proposed WDM EPON scheme is integrated with a DBA algorithm to arbitrate the access of each individual ONU over the WDM layer and is fully consistent with the requirement for backward compatibility with the 802.3ah MPCP standard.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127049160","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
Ellipse Routing: A Geographic Routing Protocol for Mobile Sensor Networks with Uncertain Positions 椭圆路由:一种位置不确定移动传感器网络的地理路由协议
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.23
C. Saad, A. Benslimane, Julien Champ, J. König
{"title":"Ellipse Routing: A Geographic Routing Protocol for Mobile Sensor Networks with Uncertain Positions","authors":"C. Saad, A. Benslimane, Julien Champ, J. König","doi":"10.1109/GLOCOM.2008.ECP.23","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.23","url":null,"abstract":"Several routing protocols have been proposed for mobile wireless sensor networks. Some are based on variants of flooding algorithms leading to redundant copies of message unnecessarily. Despite various optimizations, such routing methods still remain inefficient. This paper deals with region-based routing which has been introduced to reduce the number of messages in the network. We propose an energy efficient routing algorithm, called Ellipse-routing, which is based on region-based routing. A virtual ellipse is built thanks to source and destination positions. So, only nodes within this region forward a message. For a given energy consumption model, we select a suitable ellipse factor and a transmission range, leading to a delivery rate close to 100% while minimizing energy consumption. Then, we extend the proposed scheme to take into account position errors. Performances of proposed algorithms are shown thanks to simulations.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129227021","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
A High-Performance Optical Access and Control System for Packet-Switched WDM Metro Ring Networks 分组交换WDM城域环网的高性能光接入与控制系统
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.531
M. Yuang, I. Chao, Yu-Min Lin, B. C. Lo, P. Tien, Steven S. W. Lee
{"title":"A High-Performance Optical Access and Control System for Packet-Switched WDM Metro Ring Networks","authors":"M. Yuang, I. Chao, Yu-Min Lin, B. C. Lo, P. Tien, Steven S. W. Lee","doi":"10.1109/GLOCOM.2008.ECP.531","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.531","url":null,"abstract":"In this paper, we present the access and control design of a high-performance optical packet-switched WDM metro ring network (HOPSMAN). HOPSMAN has been designed for networks and nodes to be unconstrained by the number of wavelengths. It includes a handful of nodes that are equipped with fast optical slot erasers making bandwidth reusable and achieving greater bandwidth efficiency. In essence, HOPSMAN incorporates a versatile medium access control (MAC) scheme, which embodies efficient and fair bandwidth allocation in accordance with a quota being exerted probabilistically. The quota is analytically derived with the number of slot-eraser-nodes taken into account. The scheme also employs a new notion of credit to regulate flexible access of remaining bandwidth that is suitable for the metro environment with bursty traffic. With the MAC scheme, HOPSMAN is shown to achieve exceptional throughput, delay, and fairness performance under a wide range of traffic settings via simulation results.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123840456","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}
引用次数: 5
A Partial Forwarding Scheme for Dynamic Window Resizing in Live P2P Streaming Systems 实时P2P流系统中动态窗口调整的部分转发方案
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.440
Zhipeng Ouyang, Lisong Xu, B. Ramamurthy
{"title":"A Partial Forwarding Scheme for Dynamic Window Resizing in Live P2P Streaming Systems","authors":"Zhipeng Ouyang, Lisong Xu, B. Ramamurthy","doi":"10.1109/GLOCOM.2008.ECP.440","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.440","url":null,"abstract":"Peer-to-peer (P2P) streaming systems, in which individual nodes or peers operated by ordinary Internet users collaborate to serve video streams, have recently aroused considerable interest in both academia and industry. An important problem in P2P streaming systems is how to reduce their consumed bandwidth, which is a major concern of Internet service providers. Our work is motivated by the fact that a user may dynamically change the size of a window displaying a video stream according to his/her personal choice, a scenario we refer to as dynamic window resizing. In this paper, we propose a scheme called the partial forwarding scheme (PFS) based on layered coding, in which users with small windows help in forwarding a part of the enhancement layer. PFS significantly reduces the total consumed bandwidth while still maintaining the desired streaming quality. Our extensive simulation results show that PFS can reduce the total consumed bandwidth by up to 40% while still maintaining satisfactory streaming quality.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123924931","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
On the Rate Versus ML-Decoding Complexity Tradeoff of Square LDSTBCs with Unitary Weight Matrices 基于酉权矩阵的方形ldstbc码率与ml解码复杂度的权衡
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.237
Sanjay Karmakar, M. Varanasi
{"title":"On the Rate Versus ML-Decoding Complexity Tradeoff of Square LDSTBCs with Unitary Weight Matrices","authors":"Sanjay Karmakar, M. Varanasi","doi":"10.1109/GLOCOM.2008.ECP.237","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.237","url":null,"abstract":"The low decoding complexity structure of Linear Dispersion Space Time Block Codes (LDSTBCs) with unitary weight matrices is analyzed. It is shown that given n = 2alpha, the maximum number of groups in which the information symbols can be separated and decoded independently is (2a + 2), and as we lower the number of different groups to (2k + 2), 0 les k les alpha, we get higher rate codes. We also find the analytic expression for rates that such codes can achieve for any chosen group number, thus completely characterizing the rate-ML-decoding-complexity tradeoff for this class of codes. The proof of the result also includes a method for constructing such optimal rate achieving codes. Interestingly, this analysis produces some low decoding complexity codes with rate greater than one.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123624625","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
Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks 无线Ad-Hoc网络中满足连通性和容量约束的空中平台布局算法
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.106
Senni Perumal, J. Baras
{"title":"Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks","authors":"Senni Perumal, J. Baras","doi":"10.1109/GLOCOM.2008.ECP.106","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.106","url":null,"abstract":"In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground networks by placing a minimum number of advantaged high flying aerial platforms (APs) as relay nodes at appropriate places. We formulate the problem of providing both connectivity and required capacity between disconnected ground clusters as a constrained clustering problem with complexity costs. The basic requirement for connectivity between the ground clusters and APs is converted into a summation form distortion function. The additional requirement for connectivity between the various APs is encoded by adding a new (summation form) constraint to the distortion function. In order to satisfy the required capacity out of each cluster to all other clusters, we add a cost function that depends on the assignment probabilities of the APs and relate the source (prior) probabilities of each cluster to the required capacity out of this cluster. The cost function produces solutions which are load balanced, i.e., the capacities supported through each AP are nearly equal. We solve the resultant clustering problem using deterministic annealing in order to find (near) globally optimal solutions for the minimum number and locations of the APs to establish full connectivity and provide required traffic capacity between disconnected clusters. We establish the validity of our algorithm by comparing it with optimal exhaustive search algorithms and show that our algorithm is near-optimal for the problem of establishing connectivity and satisfying capacity requirements between disconnected clusters.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121210392","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
Quantizer Design for Codebook-Based Beamforming in Temporally-Correlated Channels 时间相关信道中基于码本的波束形成量化器设计
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.693
Pengcheng Zhu, Lan Tang, Yan Wang, X. You
{"title":"Quantizer Design for Codebook-Based Beamforming in Temporally-Correlated Channels","authors":"Pengcheng Zhu, Lan Tang, Yan Wang, X. You","doi":"10.1109/GLOCOM.2008.ECP.693","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.693","url":null,"abstract":"Codebook-based transmit beamforming with receive combining is a simple and efficient strategy for multiple- input multiple-output (MIMO) wireless systems. However, as a closed-loop technique, codebook-based transmit beamforming suffers from the performance degradation due to feedback delay. In this paper, we design quantizers robust to the feedback delay for codebook-based beamforming systems. Aiming at maximizing the average receive signal-to-noise ratio (SNR) or minimizing the average bit error rate (BER), optimal codeword selection rules are derived for the quantizer. Numerical results reveal that the proposed quantizers well compensate the performance loss due to feedback delay.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121380239","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
Packet Scheduling Over DVB-S2 Through GSE Encapsulation 基于GSE封装的DVB-S2分组调度
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.562
E. Chaput, A. Beylot, C. Baudoin
{"title":"Packet Scheduling Over DVB-S2 Through GSE Encapsulation","authors":"E. Chaput, A. Beylot, C. Baudoin","doi":"10.1109/GLOCOM.2008.ECP.562","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.562","url":null,"abstract":"Satellite digital video broadcasting is deeply changing: the next generation is dedicated to packet based communications and introduces (like many modern physical layers: WiMax, HSDPA, ...) fade mitigation techniques leading to variable throughput. Such tremendous changes need to be taken into account and introduce the need for a scheduling entity. This paper investigates the opportunity to implement classical scheduler techniques tailored to suit fade mitigation techniques. With the help of a dedicated encapsulation scheme allowing fragmentation and concatenation, we show that stability can be achieved even at high load with basic algorithms. We then show that reclassification (an opportunity that can be described as a side effect of fade mitigation techniques) induces a significant improvement on the system performance.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114110339","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
Small Logarithmic S-Boxes for Small Ciphers 小密码的小对数s盒
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.359
Xian Liu
{"title":"Small Logarithmic S-Boxes for Small Ciphers","authors":"Xian Liu","doi":"10.1109/GLOCOM.2008.ECP.359","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.359","url":null,"abstract":"The substitution box (S-box) is one of the most important components in modern ciphers. This paper reports a new class of S-boxes defined by the logarithmic functions in GF(16). Due to their small sizes, these S-boxes can be used to construct a compact cipher for the devices with limited computing and memory resources, such as those in wireless sensor or mobile communications.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114331896","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
Adaptive Rate Control for Aggregated VoIP Traffic 聚合VoIP流量的自适应速率控制
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.275
F. Sabrina, J. Valin
{"title":"Adaptive Rate Control for Aggregated VoIP Traffic","authors":"F. Sabrina, J. Valin","doi":"10.1109/GLOCOM.2008.ECP.275","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.275","url":null,"abstract":"This paper presents a novel mechanism for dynamically adapting the quality of congestion controlled voice over IP (VoIP) applications on the Internet in real time. The system uses our proposed variable bit rate speech codec called Speex, which can dynamically adjust the encoding bit rate (and hence the speech quality) based on both the feedback information about the network congestion and the instantaneous speech properties. Our extensive NS2 simulation results prove that the proposed system indeed provides highest quality speech while maximising the bandwidth utilisation and reducing the network congestion.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"547 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116201197","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}
引用次数: 14
首页 上一页 下一页 尾页
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学术官方微信