Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700123
J. Nielsen, T. Madsen, H. Schwefel
Relaying is a well known technique to extend coverage and improve conditions for nodes in the outer coverage region. In this paper we propose a relaying scheme that exploits the spatial separation of relay and destination pairs to improve throughput by allowing simultaneous transmissions. The proposed scheme is a cross-layer optimization for two-hop relaying that uses position information to jointly optimize relay selection and relay transmit power, maximizing Medium Access Control layer throughput. Further, in order to calculate the expected throughput, we apply a probabilistic model that takes into account MAC retransmissions and timing behavior of the IEEE 802.11 Distributed Coordination Function mode. Our results show an increase in throughput of approximately 20% is achievable for the proposed scheme when compared to two-hop relaying in the analyzed scenario.
{"title":"Location-based relay selection and power adaptation enabling simultaneous transmissions","authors":"J. Nielsen, T. Madsen, H. Schwefel","doi":"10.1109/GLOCOMW.2010.5700123","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700123","url":null,"abstract":"Relaying is a well known technique to extend coverage and improve conditions for nodes in the outer coverage region. In this paper we propose a relaying scheme that exploits the spatial separation of relay and destination pairs to improve throughput by allowing simultaneous transmissions. The proposed scheme is a cross-layer optimization for two-hop relaying that uses position information to jointly optimize relay selection and relay transmit power, maximizing Medium Access Control layer throughput. Further, in order to calculate the expected throughput, we apply a probabilistic model that takes into account MAC retransmissions and timing behavior of the IEEE 802.11 Distributed Coordination Function mode. Our results show an increase in throughput of approximately 20% is achievable for the proposed scheme when compared to two-hop relaying in the analyzed scenario.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129142084","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}
Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700152
K. Khalid, T. Gulliver
Node localization is an essential component of many wireless networks. It can be used to improve routing and enhance security. Localization can be divided into range-free and range-based algorithms. Range-based algorithms use measurements to estimate the distance between nodes. Range-free algorithms are based on proximity sensing between nodes. Range-based algorithms are more accurate but also more complex. However, in applications such as target tracking, localization accuracy is important. In this paper, we propose a new range-based algorithm which is based on decision tree classification, a well known technique in data mining. This algorithm is compared with those based on linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS-SVD). It is shown that the proposed algorithm performs better than these algorithms even when the anchor geometric distribution about an unlocalized node is poor.
{"title":"Range-based localization in wireless networks using decision trees","authors":"K. Khalid, T. Gulliver","doi":"10.1109/GLOCOMW.2010.5700152","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700152","url":null,"abstract":"Node localization is an essential component of many wireless networks. It can be used to improve routing and enhance security. Localization can be divided into range-free and range-based algorithms. Range-based algorithms use measurements to estimate the distance between nodes. Range-free algorithms are based on proximity sensing between nodes. Range-based algorithms are more accurate but also more complex. However, in applications such as target tracking, localization accuracy is important. In this paper, we propose a new range-based algorithm which is based on decision tree classification, a well known technique in data mining. This algorithm is compared with those based on linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS-SVD). It is shown that the proposed algorithm performs better than these algorithms even when the anchor geometric distribution about an unlocalized node is poor.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132189999","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}
Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700352
Dimitris Maniadakis, D. Varoutas
Population characteristics such as density or dispersion are heavily used in exploring the viability of infrastructure investments and telecommunication networks' development, but not much attention has been paid to the effects of distribution of population sizes. In this paper, a fast method is presented for estimating the backbone network cost using population size distribution as an input parameter, which is discovered to play a significant role in cost behavior. Combining a variation of the already proposed gravity model for creating realistic complex network topologies with Pareto distribution model for city sizes, allows building simulations, and presenting results for fixed operators' backbone network growth. An application of the methodology is also illustrated, providing estimation and comparison of the network cost for three European countries while increasing their population coverage. The main aim of this work is to provide a simple tool for rapid cost estimation of a countrywide physical backbone network and highlight the population distribution impact, assisting both telecommunication providers and regulators.
{"title":"Population distribution effects in backbone network cost","authors":"Dimitris Maniadakis, D. Varoutas","doi":"10.1109/GLOCOMW.2010.5700352","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700352","url":null,"abstract":"Population characteristics such as density or dispersion are heavily used in exploring the viability of infrastructure investments and telecommunication networks' development, but not much attention has been paid to the effects of distribution of population sizes. In this paper, a fast method is presented for estimating the backbone network cost using population size distribution as an input parameter, which is discovered to play a significant role in cost behavior. Combining a variation of the already proposed gravity model for creating realistic complex network topologies with Pareto distribution model for city sizes, allows building simulations, and presenting results for fixed operators' backbone network growth. An application of the methodology is also illustrated, providing estimation and comparison of the network cost for three European countries while increasing their population coverage. The main aim of this work is to provide a simple tool for rapid cost estimation of a countrywide physical backbone network and highlight the population distribution impact, assisting both telecommunication providers and regulators.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131828649","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}
Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700316
Kun Wang, Lei Wang, Cang Ma, Lei Shu, J. Rodrigues
This paper focuses on studying the performance of TPGF geographic routing algorithm with multi routing metric called McTPGF in random duty-cycled wireless multimedia sensor networks (WMSNs). The multi-metric contains the geographic distance and the time, which is called sleeping-delay in this paper, the forwarding node waits to forward packet to the neighbor node after it wakes up. We recognize the fact that in random duty-cycled WMSNs, geographic routing should not only consider the geographic distance of the neighbor node but also the sleeping-delay of the node at that moment. The significant difference between our work and the TPGF is that our work pays more attentions to the demand of finding a single routing path with low sleeping-delay at a certain time using TPGF while the traditional TPGF algorithm focuses on finding all node-disjoint paths in the given network topology. Simulations are conducted to evaluate that the McTPGF reduces the end-to-end delay with the cost of adding few hop counts compared with the traditional TPGF algorithm in random duty-cycled WMSNs.
{"title":"Geographic routing in random duty-cycled wireless multimedia sensor networks","authors":"Kun Wang, Lei Wang, Cang Ma, Lei Shu, J. Rodrigues","doi":"10.1109/GLOCOMW.2010.5700316","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700316","url":null,"abstract":"This paper focuses on studying the performance of TPGF geographic routing algorithm with multi routing metric called McTPGF in random duty-cycled wireless multimedia sensor networks (WMSNs). The multi-metric contains the geographic distance and the time, which is called sleeping-delay in this paper, the forwarding node waits to forward packet to the neighbor node after it wakes up. We recognize the fact that in random duty-cycled WMSNs, geographic routing should not only consider the geographic distance of the neighbor node but also the sleeping-delay of the node at that moment. The significant difference between our work and the TPGF is that our work pays more attentions to the demand of finding a single routing path with low sleeping-delay at a certain time using TPGF while the traditional TPGF algorithm focuses on finding all node-disjoint paths in the given network topology. Simulations are conducted to evaluate that the McTPGF reduces the end-to-end delay with the cost of adding few hop counts compared with the traditional TPGF algorithm in random duty-cycled WMSNs.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132624536","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}
Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700385
I. Baldine, Yufeng Xin, A. Mandal, Chris Heermann Renci, Unc-Ch Jeff Chase, Varun Marupadi, Aydan R. Yumerefendi, D. Irwin
This paper describes the experience of developing a system for creation of distributed linked configurations of heterogeneous resources (slices) in GENI. Our work leverages a number of unique architectural solutions (distributed architecture, declarative resource specifications, unique approach to slice instantiation) which is applicable to a wider set of problems related to autonomic co-scheduling and provisioning of heterogeneous networked resources. We discuss the architecture, the resource description mechanisms and some of the algorithms used to enable our system. We conclude with an analysis of a real experiment at allocating resources from multiple providers across a very wide geographic area (spanning Massachusetts, Illinois and North Carolina) to create a single private Layer 2 network connecting virtual machines on the campus of Duke University to a sensor testbed at University of Massachusetts, Amherst.
{"title":"Networked cloud orchestration: A GENI perspective","authors":"I. Baldine, Yufeng Xin, A. Mandal, Chris Heermann Renci, Unc-Ch Jeff Chase, Varun Marupadi, Aydan R. Yumerefendi, D. Irwin","doi":"10.1109/GLOCOMW.2010.5700385","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700385","url":null,"abstract":"This paper describes the experience of developing a system for creation of distributed linked configurations of heterogeneous resources (slices) in GENI. Our work leverages a number of unique architectural solutions (distributed architecture, declarative resource specifications, unique approach to slice instantiation) which is applicable to a wider set of problems related to autonomic co-scheduling and provisioning of heterogeneous networked resources. We discuss the architecture, the resource description mechanisms and some of the algorithms used to enable our system. We conclude with an analysis of a real experiment at allocating resources from multiple providers across a very wide geographic area (spanning Massachusetts, Illinois and North Carolina) to create a single private Layer 2 network connecting virtual machines on the campus of Duke University to a sensor testbed at University of Massachusetts, Amherst.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"2021 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132991017","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}
Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700146
J. Sánchez-Sánchez, M. Aguayo-Torres, U. Fernández-Plazaola
Although there are many similarities between SC-FDMA and OFDMA, results presented in literature show that the pre-coding stage in the former worsens the system performance. However, to the best of our knowledge, the reduction of the spectral efficiency has not been quantified yet. Besides, related literature is based mostly on simulations results and there is not an analytical study that validates the conclusions reached through simulations. The purpose of this paper is to perform an analytical study of the spectral efficiency for SC-FDMA when a zero forcing frequency-domain equalizer is applied. Thus, a closed-form expression for the spectral efficiency is provided supposing independence among the frequency channel responses for the allocated sub-carriers. We first show that this expression is a good approximation for interleaved FDMA, and then we analyze its suitability to describe actual ITU channels with a certain coherence bandwidth.
{"title":"Analysis of SC-FDMA spectral efficiency over Rayleigh fading channels","authors":"J. Sánchez-Sánchez, M. Aguayo-Torres, U. Fernández-Plazaola","doi":"10.1109/GLOCOMW.2010.5700146","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700146","url":null,"abstract":"Although there are many similarities between SC-FDMA and OFDMA, results presented in literature show that the pre-coding stage in the former worsens the system performance. However, to the best of our knowledge, the reduction of the spectral efficiency has not been quantified yet. Besides, related literature is based mostly on simulations results and there is not an analytical study that validates the conclusions reached through simulations. The purpose of this paper is to perform an analytical study of the spectral efficiency for SC-FDMA when a zero forcing frequency-domain equalizer is applied. Thus, a closed-form expression for the spectral efficiency is provided supposing independence among the frequency channel responses for the allocated sub-carriers. We first show that this expression is a good approximation for interleaved FDMA, and then we analyze its suitability to describe actual ITU channels with a certain coherence bandwidth.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122220662","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}
Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700250
Ben Pearre, T. Brown
Given multiple widespread stationary data sources such as ground-based sensors, an unmanned aircraft can fly over the sensors and gather the data via a wireless link. To minimize delays and system resources, the unmanned aircraft should collect the data at each node via the shortest trajectory. The trajectory planning is hampered by the complex vehicle and communication dynamics. We present a method that allows the ferry to optimize a multi-node data collection trajectory through an unknown radio field using reinforcement learning. The approach learns improved trajectories in situ obviating the need for detailed system identification. The ferry is able to quickly learn significantly improved trajectories compared to alternative heuristics.
{"title":"Model-free trajectory optimization for wireless data ferries among multiple sources","authors":"Ben Pearre, T. Brown","doi":"10.1109/GLOCOMW.2010.5700250","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700250","url":null,"abstract":"Given multiple widespread stationary data sources such as ground-based sensors, an unmanned aircraft can fly over the sensors and gather the data via a wireless link. To minimize delays and system resources, the unmanned aircraft should collect the data at each node via the shortest trajectory. The trajectory planning is hampered by the complex vehicle and communication dynamics. We present a method that allows the ferry to optimize a multi-node data collection trajectory through an unknown radio field using reinforcement learning. The approach learns improved trajectories in situ obviating the need for detailed system identification. The ferry is able to quickly learn significantly improved trajectories compared to alternative heuristics.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114175145","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}
Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700356
Vikram Arkalgud Chandrasetty, S. M. Aziz
This paper presents a novel technique to significantly reduce the implementation complexity of Low-Density Parity-Check (LDPC) decoders. The proposed technique uses high precision soft messages at the variable nodes but scales down the extrinsic message length, which reduces the number of interconnections between variable and check nodes. It also simplifies the check node operation. The effect on performance and complexity of the decoders due to such simplification is analyzed. A prototype model of the proposed decoders compliant with the WiMax application standard has been implemented and tested on Xilinx Virtex 5 FPGA. The implementation results show that the proposed decoders can achieve significant reduction in hardware complexity with comparable decoding performance to that of Min-Sum algorithm based decoders. The proposed decoders are estimated to achieve an average throughput in the range of 6–11 Gbps, even with short code lengths.
{"title":"Analysis of performance and implementation complexity of simplified algorithms for decoding Low-Density Parity-Check codes","authors":"Vikram Arkalgud Chandrasetty, S. M. Aziz","doi":"10.1109/GLOCOMW.2010.5700356","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700356","url":null,"abstract":"This paper presents a novel technique to significantly reduce the implementation complexity of Low-Density Parity-Check (LDPC) decoders. The proposed technique uses high precision soft messages at the variable nodes but scales down the extrinsic message length, which reduces the number of interconnections between variable and check nodes. It also simplifies the check node operation. The effect on performance and complexity of the decoders due to such simplification is analyzed. A prototype model of the proposed decoders compliant with the WiMax application standard has been implemented and tested on Xilinx Virtex 5 FPGA. The implementation results show that the proposed decoders can achieve significant reduction in hardware complexity with comparable decoding performance to that of Min-Sum algorithm based decoders. The proposed decoders are estimated to achieve an average throughput in the range of 6–11 Gbps, even with short code lengths.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122010281","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}
Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700151
Hui Zhou, K. Anwar, T. Matsumoto
This paper proposes a novel Single Carrier Frequency Division Multiple Access (SC-FDMA) System without Cyclic Prefix based on the Chained Turbo Equalization (CHATUE) algorithm, which connects turbo equalizers neighboring in time to eliminate the Inter-Block Interference (IBI). Results of Extrinsic Information Transfer (EXIT) chart demonstrate that the performance can be improved by performing iterations between neighboring blocks. In addition, this paper also proposes a complexity reduction technique. The numerical results verify the performance improvement and superiority of the proposed technique over the conventional SC-FDMA transmission, without requiring high computational complexity.
本文提出了一种基于链式Turbo均衡(CHATUE)算法的无循环前缀单载波频分多址(SC-FDMA)系统，该系统及时连接相邻的Turbo均衡器以消除块间干扰(IBI)。外部信息传递(Extrinsic Information Transfer, EXIT)图的结果表明，在相邻块之间进行迭代可以提高性能。此外，本文还提出了一种降低复杂性的技术。数值结果验证了该技术相对于传统SC-FDMA传输的性能改进和优越性，且不需要很高的计算复杂度。
{"title":"Chained Turbo Equalization for SC-FDMA Systems without Cyclic Prefix","authors":"Hui Zhou, K. Anwar, T. Matsumoto","doi":"10.1109/GLOCOMW.2010.5700151","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700151","url":null,"abstract":"This paper proposes a novel Single Carrier Frequency Division Multiple Access (SC-FDMA) System without Cyclic Prefix based on the Chained Turbo Equalization (CHATUE) algorithm, which connects turbo equalizers neighboring in time to eliminate the Inter-Block Interference (IBI). Results of Extrinsic Information Transfer (EXIT) chart demonstrate that the performance can be improved by performing iterations between neighboring blocks. In addition, this paper also proposes a complexity reduction technique. The numerical results verify the performance improvement and superiority of the proposed technique over the conventional SC-FDMA transmission, without requiring high computational complexity.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116669752","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}
Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700177
M. Guenach, C. Nuzman, K. Hooghe, J. Maes, M. Peeters
It has been shown recently that power-efficient digital subscriber line (DSL) access networks can be designed via an optimization problem with an objective that assigns a value to user's data rate while assessing a penalty proportional to the line driver energy consumption. An optimization algorithm was proposed that combines elements of linear programming and trust region optimization, having a complexity that scales linearly with the number of users and the number of used tones. Motivated by the expansion of DSL technology from hundreds to thousands of tones, and by operator's preference to implement power spectral profiles that can be specified with a small number of parameters, we propose in this paper a reduced dimensional formulation of the optimization problem. The new formulation reduces complexity with little loss in performance, by exploiting the smoothness of the problem data as a function of frequency. Using the new formulation, we compare the efficiency achievable using two classes of line drivers: class AB and class G.
{"title":"Reduced dimensional power optimization using class AB and G line drivers in DSL","authors":"M. Guenach, C. Nuzman, K. Hooghe, J. Maes, M. Peeters","doi":"10.1109/GLOCOMW.2010.5700177","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700177","url":null,"abstract":"It has been shown recently that power-efficient digital subscriber line (DSL) access networks can be designed via an optimization problem with an objective that assigns a value to user's data rate while assessing a penalty proportional to the line driver energy consumption. An optimization algorithm was proposed that combines elements of linear programming and trust region optimization, having a complexity that scales linearly with the number of users and the number of used tones. Motivated by the expansion of DSL technology from hundreds to thousands of tones, and by operator's preference to implement power spectral profiles that can be specified with a small number of parameters, we propose in this paper a reduced dimensional formulation of the optimization problem. The new formulation reduces complexity with little loss in performance, by exploiting the smoothness of the problem data as a function of frequency. Using the new formulation, we compare the efficiency achievable using two classes of line drivers: class AB and class G.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116868054","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：