Pub Date : 2010-12-01DOI: 10.1109/GLOCOM.2010.5684042
K. A. Hafeez, Lian Zhao, Z. Liao, B. Ma
Vehicular Ad hoc Networks (VANETs) differ from the predominant models of Mobile Ad hoc Networks (MANET) due to their high speed, mobility constraints and drivers' behaviour. Most researches on analyzing the performance of VANETs' applications done without taking into account the vehicles' high dynamics assuming stationary distribution of vehicles on the road. They assume that all vehicles within the range of the transmitter will receive the transmitted packets successfully. While vehicles near the outer edge of the transmitter's range are more vulnerable to cross the boundary before they receive the packet completely. They also used Most Forward Within Range (MFR) [1] to forward the message from one hop to the next. In this paper, we develop a new mobility model to derive the number of vehicles on the road and the probability of receiving the broadcasted packets successfully from all vehicles within the range of the transmitter. We also derive the probability of multi hop connectivity taking into account the location of relay vehicles and prove that MFR is not a valid scheme in VANETs.
车辆自组织网络(vanet)不同于移动自组织网络(MANET)的主要模型，因为它们具有高速、移动性约束和驾驶员行为。大多数分析VANETs应用性能的研究都没有考虑车辆的高动态特性，假设车辆在道路上的分布是平稳的。他们假设发射机范围内的所有车辆都能成功接收到传输的数据包。而靠近发射机范围外缘的车辆在完全接收到数据包之前更容易越过边界。他们还使用MFR (Most Forward Within Range)[1]将消息从一跳转发到下一跳。在本文中，我们建立了一个新的移动性模型来推导道路上的车辆数量和从发射机范围内的所有车辆成功接收广播数据包的概率。我们还推导了考虑中继车辆位置的多跳连接概率，并证明了MFR在vanet中不是一种有效的方案。
{"title":"Impact of Mobility on VANETs' Safety Applications","authors":"K. A. Hafeez, Lian Zhao, Z. Liao, B. Ma","doi":"10.1109/GLOCOM.2010.5684042","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684042","url":null,"abstract":"Vehicular Ad hoc Networks (VANETs) differ from the predominant models of Mobile Ad hoc Networks (MANET) due to their high speed, mobility constraints and drivers' behaviour. Most researches on analyzing the performance of VANETs' applications done without taking into account the vehicles' high dynamics assuming stationary distribution of vehicles on the road. They assume that all vehicles within the range of the transmitter will receive the transmitted packets successfully. While vehicles near the outer edge of the transmitter's range are more vulnerable to cross the boundary before they receive the packet completely. They also used Most Forward Within Range (MFR) [1] to forward the message from one hop to the next. In this paper, we develop a new mobility model to derive the number of vehicles on the road and the probability of receiving the broadcasted packets successfully from all vehicles within the range of the transmitter. We also derive the probability of multi hop connectivity taking into account the location of relay vehicles and prove that MFR is not a valid scheme in VANETs.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"8 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72755112","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/GLOCOM.2010.5684239
G. Bacci, M. Luise
This paper investigates the performance of distributed power control techniques in the uplink of a flat-fading CDMA wireless network, based on noncooperative game theory. Two energy-efficient criteria, tailored for data detection and code synchronization, are compared in terms of achieved utility at the Nash equilibrium, showing that the optimal power allocation devised for data detection is not the best solution during synchronization, and analogously the optimal allocation for code acquisition does not provide the best performance during data detection. Closed-form expressions for the optimal powers at the Nash equilibrium are derived, and a unified formulation is proposed to allow a more elaborated power allocation method to be adopted, in which the terminals, using the synchronization-oriented approach, can revert to the data-detection optimal criterion after synchronization is over.
{"title":"Performance Comparison of Energy-Efficient Power Control for CDMA Code Acquisition and Detection","authors":"G. Bacci, M. Luise","doi":"10.1109/GLOCOM.2010.5684239","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684239","url":null,"abstract":"This paper investigates the performance of distributed power control techniques in the uplink of a flat-fading CDMA wireless network, based on noncooperative game theory. Two energy-efficient criteria, tailored for data detection and code synchronization, are compared in terms of achieved utility at the Nash equilibrium, showing that the optimal power allocation devised for data detection is not the best solution during synchronization, and analogously the optimal allocation for code acquisition does not provide the best performance during data detection. Closed-form expressions for the optimal powers at the Nash equilibrium are derived, and a unified formulation is proposed to allow a more elaborated power allocation method to be adopted, in which the terminals, using the synchronization-oriented approach, can revert to the data-detection optimal criterion after synchronization is over.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"12 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73027891","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/GLOCOM.2010.5683704
Bin Guo, K. Vardhe, Yu Liu, Chi Zhou, Yu Cheng
In this paper, we propose a Decode-and-Forward Network Coded (DFNC) multi-user cooperation scheme for orthogonal uplink channels in a wireless network. The network consists of m peers having independent information transmitting to a common destination. Each peer transmits its own data in the first time phase and serves as a relay in the second time phase to transmit the network coded information combining its own and others. Assuming block fading with independent fading coefficients, we evaluate the outage probability performance of the proposed scheme using high-SNR approximation. Particularly, we develop an upper bound on outage probability of DFNC, and compare it with Space-Time-Coded (STC) cooperation protocol and Repetition-based (REP) cooperation protocol. From theoretical analysis and numerical results, we show that the outage performance of proposed scheme outperforms both STC and REP at least in high-SNR region, regardless of total number of cooperating peers and provides diversity order of m + 1 in contrast with diversity order of m provided by STC and REP.
{"title":"Outage Performance of DF Network Coded (DFNC) Multi-User Cooperative Diversity in Orthogonal Uplink Channels","authors":"Bin Guo, K. Vardhe, Yu Liu, Chi Zhou, Yu Cheng","doi":"10.1109/GLOCOM.2010.5683704","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683704","url":null,"abstract":"In this paper, we propose a Decode-and-Forward Network Coded (DFNC) multi-user cooperation scheme for orthogonal uplink channels in a wireless network. The network consists of m peers having independent information transmitting to a common destination. Each peer transmits its own data in the first time phase and serves as a relay in the second time phase to transmit the network coded information combining its own and others. Assuming block fading with independent fading coefficients, we evaluate the outage probability performance of the proposed scheme using high-SNR approximation. Particularly, we develop an upper bound on outage probability of DFNC, and compare it with Space-Time-Coded (STC) cooperation protocol and Repetition-based (REP) cooperation protocol. From theoretical analysis and numerical results, we show that the outage performance of proposed scheme outperforms both STC and REP at least in high-SNR region, regardless of total number of cooperating peers and provides diversity order of m + 1 in contrast with diversity order of m provided by STC and REP.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"64 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73350642","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/GLOCOM.2010.5684012
H. Wen, G. Gong, P. Ho
The wireless networks lack a physical boundary due to the broadcasting nature of wireless transmissions. The security has become a critical concern in the physical layer of wireless networks. In this work, we present a cross-layer security scheme for STBC system. By introducing a distort signal set the sender randomly flip-flops between the distort signal set and the orthogonal code set to confuse the attacker. The physicallayer security is enhanced as a result. In the proposed scheme the physical-layer may rely on upper-layer encryption techniques for security, which results in a cross-layer security scheme.
{"title":"MIMO Cross-Layer Secure Communication Architecture Based on STBC","authors":"H. Wen, G. Gong, P. Ho","doi":"10.1109/GLOCOM.2010.5684012","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684012","url":null,"abstract":"The wireless networks lack a physical boundary due to the broadcasting nature of wireless transmissions. The security has become a critical concern in the physical layer of wireless networks. In this work, we present a cross-layer security scheme for STBC system. By introducing a distort signal set the sender randomly flip-flops between the distort signal set and the orthogonal code set to confuse the attacker. The physicallayer security is enhanced as a result. In the proposed scheme the physical-layer may rely on upper-layer encryption techniques for security, which results in a cross-layer security scheme.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"34 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73676196","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/GLOCOM.2010.5683788
O. Adamo, Shengli Fu, M. Varanasi
In conventional communication systems, error correction is carried out at the physical layer while data security is performed performed at an upper layer. As a result, these steps are done as separate steps. As opposed to this conventional system, we present a scheme that combines error correction and data security as one unit so that both encryption and encoding could be carried out at the physical layer. Hence, in this paper, we present an Error Correction Based Cipher (ECBC) that combines error correction and encryption/decryption in a single step. Encrypting and encoding or decoding and decrypting in a single step will lead to a faster and more efficient implementation. One of the challenges of using previous joint schemes in a communications channel is that there is a tradeoff between data reliability and security. However in ECBC, there is no trade off between reliability and security. Errors introduced at the transmitter for randomization are removed at the receiver. Hence ECBC can utilize its full capacity to correct channel errors. We show the result of randomization test on ECBC and its security against conventional attacks. We also present the result of the FPGA implementation of the ECBC encryption.
{"title":"Physical Layer Error Correction Based Cipher","authors":"O. Adamo, Shengli Fu, M. Varanasi","doi":"10.1109/GLOCOM.2010.5683788","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683788","url":null,"abstract":"In conventional communication systems, error correction is carried out at the physical layer while data security is performed performed at an upper layer. As a result, these steps are done as separate steps. As opposed to this conventional system, we present a scheme that combines error correction and data security as one unit so that both encryption and encoding could be carried out at the physical layer. Hence, in this paper, we present an Error Correction Based Cipher (ECBC) that combines error correction and encryption/decryption in a single step. Encrypting and encoding or decoding and decrypting in a single step will lead to a faster and more efficient implementation. One of the challenges of using previous joint schemes in a communications channel is that there is a tradeoff between data reliability and security. However in ECBC, there is no trade off between reliability and security. Errors introduced at the transmitter for randomization are removed at the receiver. Hence ECBC can utilize its full capacity to correct channel errors. We show the result of randomization test on ECBC and its security against conventional attacks. We also present the result of the FPGA implementation of the ECBC encryption.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"10 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72718457","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/GLOCOM.2010.5683484
Xukang Lu, C. Wu, N. Rao, Zongmin Wang
Several research and production high-performance networks now provision multi-Gbps dedicated channels to support large data transfers in network-intensive applications. However, end users have not seen a corresponding increase in application throughput mainly because traditional end-to-end transport methods are not optimized for such connections. New congestion or flow control mechanisms are desirable to meet the challenges brought by dedicated connections to transport protocol design. The advent and proliferation of multi-core processors make it now possible to improve application throughput by providing multiple processing and networking resources to a single data transfer. Based on the existing PLUT method, we propose a new transport method, Para-PLUT, which utilizes multiple parallel UDP connections to take advantage of the full power of multicore processors for maximum aggregate goodput. We implement and test Para-PLUT in a local dedicated network testbed and the experimental results illustrate its superior performance over several existing methods.
{"title":"On Parallel UDP-Based Transport Control over Dedicated Connections","authors":"Xukang Lu, C. Wu, N. Rao, Zongmin Wang","doi":"10.1109/GLOCOM.2010.5683484","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683484","url":null,"abstract":"Several research and production high-performance networks now provision multi-Gbps dedicated channels to support large data transfers in network-intensive applications. However, end users have not seen a corresponding increase in application throughput mainly because traditional end-to-end transport methods are not optimized for such connections. New congestion or flow control mechanisms are desirable to meet the challenges brought by dedicated connections to transport protocol design. The advent and proliferation of multi-core processors make it now possible to improve application throughput by providing multiple processing and networking resources to a single data transfer. Based on the existing PLUT method, we propose a new transport method, Para-PLUT, which utilizes multiple parallel UDP connections to take advantage of the full power of multicore processors for maximum aggregate goodput. We implement and test Para-PLUT in a local dedicated network testbed and the experimental results illustrate its superior performance over several existing methods.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"39 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74554394","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/GLOCOM.2010.5683965
Florian Pflug, C. Voges, T. Fingscheidt
In the past few years microfilm has gained new research interest as a medium for long-term storage of digital data. This became particularly possible by recent advances in laser film recording technology. In contrast to other optical or magnetic storage media, the microfilm digital channel (MDC) still has been subject to characterization in only a few publications. In this paper we investigate iterative channel codes for the MDC, in particular low-density parity-check and turbo convolutional codes. Simulation results show that practically error-free storage can be achieved with code rates even above 0.85 on a monochrome MDC with binary amplitude-shift keying modulation.
{"title":"Performance Evaluation of Iterative Channel Codes for Digital Data Storage on Microfilm","authors":"Florian Pflug, C. Voges, T. Fingscheidt","doi":"10.1109/GLOCOM.2010.5683965","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683965","url":null,"abstract":"In the past few years microfilm has gained new research interest as a medium for long-term storage of digital data. This became particularly possible by recent advances in laser film recording technology. In contrast to other optical or magnetic storage media, the microfilm digital channel (MDC) still has been subject to characterization in only a few publications. In this paper we investigate iterative channel codes for the MDC, in particular low-density parity-check and turbo convolutional codes. Simulation results show that practically error-free storage can be achieved with code rates even above 0.85 on a monochrome MDC with binary amplitude-shift keying modulation.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"17 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78745061","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/GLOCOM.2010.5683153
M. Pursley, IV ThomasC.Royster
Information-theoretic limits on resource consumption are employed to obtain analytical methods for conducting tradeoffs between power, bandwidth, and time for cognitive radio transmissions in ad hoc dynamic spectrum access networks. A quantitative measure of resource consumption is applied to the design and evaluation of protocols for adaptive modulation and coding. The application of information theory to the minimization of resource consumption in cognitive radio networks is illustrated for binary phase-shift-key modulation with coherent demodulation.
{"title":"An Information-Theoretic Approach to Resource Consumption Minimization for Dynamic Spectrum Access Networks","authors":"M. Pursley, IV ThomasC.Royster","doi":"10.1109/GLOCOM.2010.5683153","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683153","url":null,"abstract":"Information-theoretic limits on resource consumption are employed to obtain analytical methods for conducting tradeoffs between power, bandwidth, and time for cognitive radio transmissions in ad hoc dynamic spectrum access networks. A quantitative measure of resource consumption is applied to the design and evaluation of protocols for adaptive modulation and coding. The application of information theory to the minimization of resource consumption in cognitive radio networks is illustrated for binary phase-shift-key modulation with coherent demodulation.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"15 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72638452","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/GLOCOM.2010.5683829
W. Zhang, C. Yeo
In this paper, we study the throughput and delay scaling laws of two coexisting mobile networks. By considering that both the primary and secondary networks are mobile and move according to random walk model, we propose a multi-hop transmission scheme. Based on the assumption that the secondary node can help to relay the primary packet, we show that the secondary network can achieve the same throughput and delay scaling laws as in stand-alone network D_s(m)=Θ(mλ_s(m)). Furthermore, for primary network, it is shown that the throughput-delay tradeoff scaling law is given by D_p(n)=Θ(√{nlog{n}}λ_p(n)), when the primary node is chosen as relay node. If the relay node is a secondary node, the scaling law is D_p(n)=Θ(√{n^{β}log{n}}λ_p(n)), where β>1. The novelties of this paper lie in: i) Detailed study of the delay scaling law of the secondary network in the complex scenario where both the primary and secondary networks are mobile; ii) The impact of buffer delay on the primary and secondary networks due to the presence of preservation region. We explicitly analyze the buffer delay and obtain an expression as D^{II}_{S_R}(m)=Θ(1/√{n^{β-1}a_s(m)}).
{"title":"Throughput-Delay Scaling for Two Mobile Overlaid Networks","authors":"W. Zhang, C. Yeo","doi":"10.1109/GLOCOM.2010.5683829","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683829","url":null,"abstract":"In this paper, we study the throughput and delay scaling laws of two coexisting mobile networks. By considering that both the primary and secondary networks are mobile and move according to random walk model, we propose a multi-hop transmission scheme. Based on the assumption that the secondary node can help to relay the primary packet, we show that the secondary network can achieve the same throughput and delay scaling laws as in stand-alone network D_s(m)=Θ(mλ_s(m)). Furthermore, for primary network, it is shown that the throughput-delay tradeoff scaling law is given by D_p(n)=Θ(√{nlog{n}}λ_p(n)), when the primary node is chosen as relay node. If the relay node is a secondary node, the scaling law is D_p(n)=Θ(√{n^{β}log{n}}λ_p(n)), where β>1. The novelties of this paper lie in: i) Detailed study of the delay scaling law of the secondary network in the complex scenario where both the primary and secondary networks are mobile; ii) The impact of buffer delay on the primary and secondary networks due to the presence of preservation region. We explicitly analyze the buffer delay and obtain an expression as D^{II}_{S_R}(m)=Θ(1/√{n^{β-1}a_s(m)}).","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"101 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77393711","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/GLOCOM.2010.5684051
An Liu, Y. Liu, Haige Xiang, Wu Luo
It is well known that in general, the traditional water-filling is far from optimal in networks. We recently found the long-sought network version of water-filling named polite water-filling that is optimal for a large class of MIMO networks called B-MAC networks, of which interference Tree (iTree) networks is a subset whose interference graphs have no directional loop. iTree networks is a natural extension of both broadcast channel (BC) and multiaccess channel (MAC) and possesses many desirable properties for further information theoretic study. Given the optimality of the polite water-filling, general purpose optimization algorithms for networks are no longer needed because they do not exploit the structure of the problems. Here, we demonstrate it through the weighted sum-rate maximization. The significance of the results is that the algorithm can be easily modified for general B-MAC networks with interference loops. It illustrates the properties of iTree networks and for the special cases of MAC and BC, replaces the current steepest ascent algorithms for finding the capacity regions. The fast convergence and high accuracy of the proposed algorithms are verified by simulation.
{"title":"Iterative Polite Water-Filling for Weighted Sum-Rate Maximization in iTree Networks","authors":"An Liu, Y. Liu, Haige Xiang, Wu Luo","doi":"10.1109/GLOCOM.2010.5684051","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684051","url":null,"abstract":"It is well known that in general, the traditional water-filling is far from optimal in networks. We recently found the long-sought network version of water-filling named polite water-filling that is optimal for a large class of MIMO networks called B-MAC networks, of which interference Tree (iTree) networks is a subset whose interference graphs have no directional loop. iTree networks is a natural extension of both broadcast channel (BC) and multiaccess channel (MAC) and possesses many desirable properties for further information theoretic study. Given the optimality of the polite water-filling, general purpose optimization algorithms for networks are no longer needed because they do not exploit the structure of the problems. Here, we demonstrate it through the weighted sum-rate maximization. The significance of the results is that the algorithm can be easily modified for general B-MAC networks with interference loops. It illustrates the properties of iTree networks and for the special cases of MAC and BC, replaces the current steepest ascent algorithms for finding the capacity regions. The fast convergence and high accuracy of the proposed algorithms are verified by simulation.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"35 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77579426","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
扫码关注我们
求助内容：
应助结果提醒方式：