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

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

筛选
英文 中文
Optimizing Enhanced Hierarchical Modulations 优化增强分层调制
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.662
Shu Wang, B. K. Yi
{"title":"Optimizing Enhanced Hierarchical Modulations","authors":"Shu Wang, B. K. Yi","doi":"10.1109/GLOCOM.2008.ECP.662","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.662","url":null,"abstract":"Though hierarchical modulation offers an important coverage and throughput tradeoff for wireless communications, it has received relatively little attention to date. Traditional hierarchical modulation suffers from the interference between layers, which results in both capacity loss and bit-error rate increasing. In this paper, an enhanced hierarchical modulation technique along with four optimization criteria are discussed. The proposed hierarchical modulation enhancement, where the enhancement-layer signal constellation is intentionally rotated, helps achieve better performance with little complexity increase. The first criterion is to maximize the achievable spectral efficiency with optimizing the Euclidean distance profile. The second criterion is to lower demodulation error rate with maximizing the modulation efficiency, a concept suggested for quantizing inter- layer interference. The third criterion is proposed to maximize the demodulation robustness when the imperfect channel estimation happens. The last approach is suggested for maximizing the RF power amplifier efficiency at the transmitter side with reducing the peak-to-average-power ratio of modulated signals when multi-carrier transmission is applied. All proposed schemes are simple and efficient. They can help recover the performance loss by regular hierarchical modulations with little complexity increase. Computer simulation is provided to support our conclusions.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"62 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":"127103486","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
On Robust Traffic Engineering in Transport Networks 传输网络中的鲁棒流量工程研究
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.456
A. Tizghadam, A. Leon-Garcia
{"title":"On Robust Traffic Engineering in Transport Networks","authors":"A. Tizghadam, A. Leon-Garcia","doi":"10.1109/GLOCOM.2008.ECP.456","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.456","url":null,"abstract":"This paper reports on a probabilistic method for traffic engineering (specifically routing and resource allocation) in backbone networks, where the transport is the main service and robustness to the unexpected changes in network parameters is required. We analyze the network using the probabilistic betweenness of the network nodes (or links). The theoretical results lead to the definition of \"criticality\" for nodes and links. Link criticality is used as the main metric to model the risk of taking a specific path from a source to a destination node. Different paths will be ranked based on their criticality measure, and the best path will be selected to route the flow along the core network. The choice of the path is in the direction of preserving the robustness of the network to the unforeseen changes in topology and traffic demands. The proposed method is useful in situations like MPLS and Ethernet networks where path assignment is required.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"27 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":"127261285","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}
引用次数: 19
Distributed Sender Scheduling for Multimedia Transmission in Wireless Peer-to-Peer Networks 无线点对点网络中多媒体传输的分布式发送方调度
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.992
Pengbo Si, F. Yu, Hong Ji, Victor C. M. Leung
{"title":"Distributed Sender Scheduling for Multimedia Transmission in Wireless Peer-to-Peer Networks","authors":"Pengbo Si, F. Yu, Hong Ji, Victor C. M. Leung","doi":"10.1109/GLOCOM.2008.ECP.992","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.992","url":null,"abstract":"Multi-source multimedia transmission is a popular approach in wireless peer-to-peer networks. Most previous related work concentrates on the protocols and network structures, and consequently ignores the multiple senders scheduling problem. In this paper, we present a distributed sender scheduling algorithm for multi-source transmission in wireless P2P networks, which can maximize the data rate and minimize the power consumption. Specifically, we formulate the network as a multi-arm bandit system. The optimal distributed scheduling policy can be found according to the Gittins indices of the senders. Numerical examples illustrate that the data rate and power consumption can be improved significantly compared to existing schemes.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"71 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":"127266888","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}
引用次数: 2
Interplay of Network Topology and Channel Assignment in Multi-Radio Multi-Rate Multi-Channel Wireless Mesh Networks 多无线电多速率多通道无线网状网络中网络拓扑与信道分配的相互作用
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.1012
Tehuang Liu, W. Liao
{"title":"Interplay of Network Topology and Channel Assignment in Multi-Radio Multi-Rate Multi-Channel Wireless Mesh Networks","authors":"Tehuang Liu, W. Liao","doi":"10.1109/GLOCOM.2008.ECP.1012","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.1012","url":null,"abstract":"Employing multiple channels can effectively improve the network capacity in wireless mesh networks (WMNs). In multi-radio multi-channel WMNs, the channel assignment problem is to assign each radio a channel such that the network capacity is maximized. Since whether two nodes can communicate with each other depends on the channels they use, different channel assignments may lead to different network topologies. Most existing channel assignment algorithms are based on specific network topologies, such as trees, A-connected graphs, etc. This pre-determined network topology is then used as the input of the channel assignment algorithm. In this paper, we study the importance of the input network topology of channel assignment algorithms on the network performance, and propose an algorithm for constructing efficient input network topologies for existing channel assignment algorithms to increase the capacity gain due to multiple channels. The simulation results show that the proposed algorithm improves the network capacity dramatically without the need to modify existing channel assignment algorithms.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"21 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":"127498985","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
PeerGraph: A Distributed Data Structure for Peer-to-Peer Streaming PeerGraph:点对点流的分布式数据结构
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.336
A. Tosun, T. Korkmaz
{"title":"PeerGraph: A Distributed Data Structure for Peer-to-Peer Streaming","authors":"A. Tosun, T. Korkmaz","doi":"10.1109/GLOCOM.2008.ECP.336","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.336","url":null,"abstract":"Video streaming over peer-to-peer networks has received significant attention recently. Accordingly, much work is done on video streaming under the assumption that all the peers have the whole movie. However, it is likely that many peers may only store a fraction of the movie due to their resource constraints. Therefore, there is a need to develop appropriate mechanisms to facilitate efficient streaming when each user stores a fraction of the movie. With this in mind, we propose a distributed data structure called PeerGraph in which each peer determines other peers having the previous or subsequent fractions of the movie and maintains pointers to these peers. In our model, a peer has full control on how many segments it wants to store. However, we require it to store consecutive segments. In order to stream, a client first finds a peer that contains the first segment and then uses the proposed PeerGraph to locate subsequent segments. We use extensive simulations to investigate the effect of various parameters. Simulation results support feasibility of the proposed scheme.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"23 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":"127548384","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}
引用次数: 2
Fault-Tolerant Dual Power Management in Wireless Sensor Networks 无线传感器网络中的容错双电源管理
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.91
Chen Wang, M. Park, James Willson, A. Faragó, D. Du
{"title":"Fault-Tolerant Dual Power Management in Wireless Sensor Networks","authors":"Chen Wang, M. Park, James Willson, A. Faragó, D. Du","doi":"10.1109/GLOCOM.2008.ECP.91","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.91","url":null,"abstract":"How to adjust the transmission power at each node to achieve global energy efficiency while maintaining the network connectivity, referred as power management problem, is the major target of various topology control technologies. Moreover, fault tolerance which is often modeled as 2-edge or 2-vertex connectivity is another desired feature in many applications. In this paper, we study the fault tolerant dual power assignment problem. With the assumption of dual universal transmission power levels, we aim to minimize the total number of nodes assigned to high power level such that the resultant network topology is 2-edge or 2-vertex connected. As the problems are NP-hard, we design a novel algorithm to compute nearly-optimal solutions. From the theoretical perspective, we prove that our algorithm can guarantee 3.67-approximation for both 2-edge connectivity and 2-vertex connectivity, which improves the existing best approximation algorithm. We also conduct some numerical experiments which show that results of our algorithm are at most 2 times of optimal solutions in average and have significant improvements compared to that of existing algorithm.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"70 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":"124979173","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
Optimum Space-Time Block Codes over Time-Selective Channels 时间选择信道上的最佳空时分组码
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.702
Jun He, P. Kam
{"title":"Optimum Space-Time Block Codes over Time-Selective Channels","authors":"Jun He, P. Kam","doi":"10.1109/GLOCOM.2008.ECP.702","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.702","url":null,"abstract":"We analyze the average bit error probability (BEP) of orthogonal space-time block codes (STBC) over time-selective channels. Exact BEP results are obtained in closed form. Through the analysis, we reveal the relationship between the inter-symbol interference (ISI) and the row positions in a STBC matrix. We then introduce one proposition and two design criteria for code search/design. Optimum/near-optimum codes are found/designed with reduced ISI.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"27 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":"125127952","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
Analytical Analysis of the Coverage of a MBSFN OFDMA Network MBSFN OFDMA网络覆盖的分析分析
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.459
L. Rong, O. B. Haddada, S. Elayoubi
{"title":"Analytical Analysis of the Coverage of a MBSFN OFDMA Network","authors":"L. Rong, O. B. Haddada, S. Elayoubi","doi":"10.1109/GLOCOM.2008.ECP.459","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.459","url":null,"abstract":"In this paper, we develop a novel analytical model to examine the coverage and capacity of MBSFN (MBMS over a single frequency network) OFDMA, proposed to deliver TV services to mobile users in forthcoming 3G LTE networks. First, analytical expression for SINR at a given point in a cell is derived, which takes into account the SFN gain and propagation delay values. Next, the shadowing effect of propagation on MBSFN is considered. In addition, dynamic MBSFN, an advanced MBSFN technique, in which the network cells are dynamically activated based on user traffic, is modelled. Finally, the performance of MBSFN is evaluated based on the proposed analytical model. This includes the investigation of MBSFN related parameters such as the modulation and coding scheme (MCS) values and the length of cyclic prefix, as well as the verification on the accuracy of the proposed model and the impact of shadowing. Dynamic MBSFN is also analyzed and we show its effect on the coverage for different traffic scenarios.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"18 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":"126093485","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}
引用次数: 92
A Supervised Learning Approach to Adaptation in Practical MIMO-OFDM Wireless Systems 实用MIMO-OFDM无线系统的监督学习自适应方法
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.878
R. Daniels, C. Caramanis, R. Heath
{"title":"A Supervised Learning Approach to Adaptation in Practical MIMO-OFDM Wireless Systems","authors":"R. Daniels, C. Caramanis, R. Heath","doi":"10.1109/GLOCOM.2008.ECP.878","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.878","url":null,"abstract":"MIMO-OFDM wireless systems require adaptive modulation and coding based on channel state information (CSI) to maximize throughput in changing wireless channels. Traditional adaptive modulation and coding attempts to predict the best rate available by estimating the packet error rate for each modulation and coding scheme (MCS) by using CSI, which has shown to be challenging. This paper considers supervised learning with the k-nearest neighbor (k-NN) algorithm as a new framework for adaptive modulation and coding. Practical k-NN operation is enabled through feature space dimensionality reduction using subcarrier ordering techniques based on postprocessing SNR. Simulation results of an IEEE 802.11n draft-compatible physical layer in flat and frequency selective wireless channels shows the k-NN with an ordered subcarrier feature space performs near ideal adaptation under packet error rate constraints.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"46 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":"123312973","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}
引用次数: 24
SHOP: An Integrated Scheme for SCTP Handover Optimization in Multihomed Environments SHOP:多归属环境下SCTP切换优化的集成方案
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.460
Kun Zheng, Min Liu, Zhongcheng Li, Gang Xu
{"title":"SHOP: An Integrated Scheme for SCTP Handover Optimization in Multihomed Environments","authors":"Kun Zheng, Min Liu, Zhongcheng Li, Gang Xu","doi":"10.1109/GLOCOM.2008.ECP.460","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.460","url":null,"abstract":"Multihoming feature enables stream control transmission protocol (SCTP) to be a handover and mobility scheme for mobile users in multihomed environment. However, there are two flaws deteriorating SCTP handover performance. First, the congestion control mechanism of SCTP makes entire association experience a slow-start phase after handover, thus leading to a sudden-shrink of throughput. Second, the diversity of round-trip time (RTT) between separate paths incurs packet reordering and likely to trigger the spurious fast-retransmit, which degrades performance of reliable transport, too. This paper presents SHOP: an integrated scheme for SCTP handover optimization. By means of available bandwidth estimation technologies, SHOP avoids the slow-start phase after handover through configuring proper congestion control variables of new primary path. Meanwhile, postpone-handover based on RTT measurement is put forward in SHOP to minimize the negative effects of packet reordering. Detailed simulation results show the effectiveness of proposed scheme.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"53 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":"125432259","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}
引用次数: 9
首页 上一页 下一页 尾页
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学术官方微信