Pub Date : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037350
X. Liu, Erdem Koyuncu, H. Jafarkhani
We investigate the channel quantization problem for two-user multicast networks where the transmitter is equipped with multiple antennas and either receiver is equipped with only a single antenna. Our goal is to design a global quantizer to minimize the outage probability. It is known that any fixed-length quantizer with a finite-cardinality codebook cannot achieve the same minimum outage probability as the case where all nodes in the network know perfect channel state information (CSI). To achieve the minimum outage probability, we propose a variable-length global quantizer that knows perfect CSI and sends quantized CSI to the transmitter and receivers. With a random infinite-cardinality codebook, we prove that the proposed quantizer is able to achieve the minimum outage probability with a low average feedback rate. Numerical simulations also validate our theoretical analysis.
{"title":"A variable-length channel quantizer for multicast networks with two users","authors":"X. Liu, Erdem Koyuncu, H. Jafarkhani","doi":"10.1109/GLOCOM.2014.7037350","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037350","url":null,"abstract":"We investigate the channel quantization problem for two-user multicast networks where the transmitter is equipped with multiple antennas and either receiver is equipped with only a single antenna. Our goal is to design a global quantizer to minimize the outage probability. It is known that any fixed-length quantizer with a finite-cardinality codebook cannot achieve the same minimum outage probability as the case where all nodes in the network know perfect channel state information (CSI). To achieve the minimum outage probability, we propose a variable-length global quantizer that knows perfect CSI and sends quantized CSI to the transmitter and receivers. With a random infinite-cardinality codebook, we prove that the proposed quantizer is able to achieve the minimum outage probability with a low average feedback rate. Numerical simulations also validate our theoretical analysis.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"8 1","pages":"3501-3506"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79075697","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037190
M. Naderi, K. Chowdhury, S. Basagni, W. Heinzelman, S. De, S. Jana
Wireless transfer of energy through directed radio frequency waves has the potential to realize perennially operating sensor nodes by replenishing the energy contained in the limited on-board battery. However, the high power energy transfer from energy transmitters (ETs) interferes with data communication, limiting the coexistence of these functions. This paper provides the first experimental study to quantify the rate of charging, packet loss due to interference, and suitable ranges for charging and data communication of the ETs. It also explores how the placement and relative distances of multiple ETs affect the charging process, demonstrating constructive and destructive energy aggregation at the sensor nodes. Finally, we investigate the impact of the separation in frequency between data and energy transmissions, as well as among multiple concurrent energy transmissions. Our results aim at providing insights on radio frequency-based energy harvesting wireless sensor networks for enhanced protocol design and network planning.
{"title":"Experimental study of concurrent data and wireless energy transfer for sensor networks","authors":"M. Naderi, K. Chowdhury, S. Basagni, W. Heinzelman, S. De, S. Jana","doi":"10.1109/GLOCOM.2014.7037190","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037190","url":null,"abstract":"Wireless transfer of energy through directed radio frequency waves has the potential to realize perennially operating sensor nodes by replenishing the energy contained in the limited on-board battery. However, the high power energy transfer from energy transmitters (ETs) interferes with data communication, limiting the coexistence of these functions. This paper provides the first experimental study to quantify the rate of charging, packet loss due to interference, and suitable ranges for charging and data communication of the ETs. It also explores how the placement and relative distances of multiple ETs affect the charging process, demonstrating constructive and destructive energy aggregation at the sensor nodes. Finally, we investigate the impact of the separation in frequency between data and energy transmissions, as well as among multiple concurrent energy transmissions. Our results aim at providing insights on radio frequency-based energy harvesting wireless sensor networks for enhanced protocol design and network planning.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"65 1","pages":"2543-2549"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79597628","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037224
Bin Liu, Chao Song, Ming Liu, Nianbo Liu
The development of the smartphones with various sensors, and powerful capabilities (computing, storage, and communication), motivates a popular computing and sensing paradigm, crowdsensing. In general, in crowdsensing, the smart-phones sense and collect the sensory data from a large number of smartphone users, for distinguishing the uncertain objects. However, some existing solutions for crowdsensing usually prefer to utilize only one or few features to distinguish the uncertain objects. In this paper, due to the limitation of less features, we propose to utilize multiple features to distinguish the uncertain objects for crowdsensing. For distinguishing uncertain objects with multiple features, we propose to utilize KL divergence based clustering. Moreover, we introduce two other mutated forms, the symmetry KL divergence and Jensen-Shannon KL divergence, to improve our algorithm. We evaluate our proposed schemes with real data of multiple features, which are collected by the smartphones with the sensors.
{"title":"Distinguishing uncertain objects with multiple features for crowdsensing","authors":"Bin Liu, Chao Song, Ming Liu, Nianbo Liu","doi":"10.1109/GLOCOM.2014.7037224","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037224","url":null,"abstract":"The development of the smartphones with various sensors, and powerful capabilities (computing, storage, and communication), motivates a popular computing and sensing paradigm, crowdsensing. In general, in crowdsensing, the smart-phones sense and collect the sensory data from a large number of smartphone users, for distinguishing the uncertain objects. However, some existing solutions for crowdsensing usually prefer to utilize only one or few features to distinguish the uncertain objects. In this paper, due to the limitation of less features, we propose to utilize multiple features to distinguish the uncertain objects for crowdsensing. For distinguishing uncertain objects with multiple features, we propose to utilize KL divergence based clustering. Moreover, we introduce two other mutated forms, the symmetry KL divergence and Jensen-Shannon KL divergence, to improve our algorithm. We evaluate our proposed schemes with real data of multiple features, which are collected by the smartphones with the sensors.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"240 1","pages":"2751-2756"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83489504","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037300
Yuehua Ding, Nanxi Li, Yide Wang, Suili Feng
Widely linear processing (WLP) can provide attractive performance improvement in wireless communication systems. However, performance improvement brought by WLP is mainly achieved by exploiting signal's non-circularity, which leads to the fact that existing works on WLP are mainly confined to the cases related to non circular signals or improper signals with imbalanced I/Q components. In this paper, WLP for circular signals, such as PSK signals, is investigated by exploiting the hidden properties of PSK signals. The hidden properties of PSK signals are firstly studied, and a unified mathematical model is derived to describe the hidden properties of PSK signals. Furthermore, a widely linear sphere decoding (WLSD) algorithm exploiting PSK signals' hidden properties is proposed for MIMO systems. Compared to traditional sphere decoding (SD), WLSD has little performance loss, and it transforms the traditional SD searching for the true transmitted vector into the shrunk searching for the corresponding rotation vector, the candidate rotation vectors of WLSD are only (1/2)NT of SD candidate vectors. Simulation results show that the proposed algorithm can achieve quasi-optimal BER performance, while the computational complexity is significantly reduced by more than a half compared with Schnorr-Euchner sphere decoder.
{"title":"Widely linear sphere decoding by exploiting the hidden properties of PSK signals","authors":"Yuehua Ding, Nanxi Li, Yide Wang, Suili Feng","doi":"10.1109/GLOCOM.2014.7037300","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037300","url":null,"abstract":"Widely linear processing (WLP) can provide attractive performance improvement in wireless communication systems. However, performance improvement brought by WLP is mainly achieved by exploiting signal's non-circularity, which leads to the fact that existing works on WLP are mainly confined to the cases related to non circular signals or improper signals with imbalanced I/Q components. In this paper, WLP for circular signals, such as PSK signals, is investigated by exploiting the hidden properties of PSK signals. The hidden properties of PSK signals are firstly studied, and a unified mathematical model is derived to describe the hidden properties of PSK signals. Furthermore, a widely linear sphere decoding (WLSD) algorithm exploiting PSK signals' hidden properties is proposed for MIMO systems. Compared to traditional sphere decoding (SD), WLSD has little performance loss, and it transforms the traditional SD searching for the true transmitted vector into the shrunk searching for the corresponding rotation vector, the candidate rotation vectors of WLSD are only (1/2)NT of SD candidate vectors. Simulation results show that the proposed algorithm can achieve quasi-optimal BER performance, while the computational complexity is significantly reduced by more than a half compared with Schnorr-Euchner sphere decoder.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"50 1","pages":"3209-3214"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88510053","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036780
C. Funai, C. Tapparello, He Ba, Bora Karaoglu, W. Heinzelman
Volunteer computing provides a practical and low cost solution to the increasing computational demands of many applications. Recent advancements in mobile device processing capabilities, combined with the energy efficiency of the mobile devices, make their inclusion in a distributed computing architecture particularly appealing. However, the intrinsic requirement of Internet connectivity to participate in volunteer computing limits the direct adoption of mobile devices due to service availability or related costs to connect to the Internet. In this paper, we propose and implement a novel computational architecture that extends the ability of mobile devices to participate in volunteer computing through ad hoc networking. By introducing decentralized task distribution points, mobile devices are invited to join the computation via device to device communication, removing the requirement for an Internet connection. Using a prototype implementation running on Android devices, we investigate the impact of a promising ad hoc communication technology, namely WiFi Direct, and two task distribution algorithms with different computation and communication overheads, under various scenarios. Experimental results show that our proposed approach is feasible with only minor additional energy consumption at the decentralized task distribution points.
{"title":"Extending volunteer computing through mobile ad hoc networking","authors":"C. Funai, C. Tapparello, He Ba, Bora Karaoglu, W. Heinzelman","doi":"10.1109/GLOCOM.2014.7036780","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036780","url":null,"abstract":"Volunteer computing provides a practical and low cost solution to the increasing computational demands of many applications. Recent advancements in mobile device processing capabilities, combined with the energy efficiency of the mobile devices, make their inclusion in a distributed computing architecture particularly appealing. However, the intrinsic requirement of Internet connectivity to participate in volunteer computing limits the direct adoption of mobile devices due to service availability or related costs to connect to the Internet. In this paper, we propose and implement a novel computational architecture that extends the ability of mobile devices to participate in volunteer computing through ad hoc networking. By introducing decentralized task distribution points, mobile devices are invited to join the computation via device to device communication, removing the requirement for an Internet connection. Using a prototype implementation running on Android devices, we investigate the impact of a promising ad hoc communication technology, namely WiFi Direct, and two task distribution algorithms with different computation and communication overheads, under various scenarios. Experimental results show that our proposed approach is feasible with only minor additional energy consumption at the decentralized task distribution points.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"42 1","pages":"32-38"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88548671","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037462
A. Zanella, A. Bazzi, B. Masini, G. Pasolini
We consider a multi-user scenario where sources transmit their messages to the destinations by means of a two-hop mechanism. To minimize the interference generated in the scenario, a simple opportunistic relay selection mechanism is investigated. The performance of the scenario is evaluated using some results of the stochastic geometry under the assumption that relay nodes are distributed according to a Poisson point process. Results show that, when the relay density is sufficiently high, a suitable choice of the relay leads to a limited amount of interference generated during source-relay and relay-destination transmissions.
{"title":"Performance analysis of multiuser 2-hop systems with random placement of relay nodes","authors":"A. Zanella, A. Bazzi, B. Masini, G. Pasolini","doi":"10.1109/GLOCOM.2014.7037462","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037462","url":null,"abstract":"We consider a multi-user scenario where sources transmit their messages to the destinations by means of a two-hop mechanism. To minimize the interference generated in the scenario, a simple opportunistic relay selection mechanism is investigated. The performance of the scenario is evaluated using some results of the stochastic geometry under the assumption that relay nodes are distributed according to a Poisson point process. Results show that, when the relay density is sufficiently high, a suitable choice of the relay leads to a limited amount of interference generated during source-relay and relay-destination transmissions.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"59 1","pages":"4174-4179"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84794267","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037461
Xiaoxiao Zhang, Xuemin Shen, Liang-Liang Xie
This paper studies the cooperative transmission scheme and the achievable rate for uplink communications in an LTE-Advanced cellular network with Type II in-band decode-and-forward relay stations. The physical layer uplink transmission is based on single carrier frequency division multiple access (SC-FDMA) with frequency-domain equalization (FDE). Unlike orthogonal frequency division multiple access (OFDMA) where the users achievable rate is the summation of the rates on all allocated subcarriers, achievable rate of SC-FDMA system has a more complex expression because the subcarriers are transmitted sequentially rather than in parallel. With the joint superposition coding for cooperative relaying, we derive the expressions of the achievable rate for both zero-forcing (ZF) equalization and minimum mean square error (MMSE) equalization. Numerical results are given to verify the derived uplink achievable rates.
{"title":"Achievable rates for uplink communications in LTE-advanced networks with decode-and-forward relays","authors":"Xiaoxiao Zhang, Xuemin Shen, Liang-Liang Xie","doi":"10.1109/GLOCOM.2014.7037461","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037461","url":null,"abstract":"This paper studies the cooperative transmission scheme and the achievable rate for uplink communications in an LTE-Advanced cellular network with Type II in-band decode-and-forward relay stations. The physical layer uplink transmission is based on single carrier frequency division multiple access (SC-FDMA) with frequency-domain equalization (FDE). Unlike orthogonal frequency division multiple access (OFDMA) where the users achievable rate is the summation of the rates on all allocated subcarriers, achievable rate of SC-FDMA system has a more complex expression because the subcarriers are transmitted sequentially rather than in parallel. With the joint superposition coding for cooperative relaying, we derive the expressions of the achievable rate for both zero-forcing (ZF) equalization and minimum mean square error (MMSE) equalization. Numerical results are given to verify the derived uplink achievable rates.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"8 1","pages":"4168-4173"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88160421","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037144
Wanchao Liang, Xiaofeng Gao, Fan Wu, Guihai Clien, Wei Wei
Using a centralized controller for resource management and coordination is a common practice in cloud services. For scalability concern, in recent literature a novel approach, namely devolved controllers, was proposed. Such approach splits the network into regions, while each controller only monitors a portion of the traffic. This technique alleviates scalability issue, but brings other critical problems, such as unbalanced work load among controllers and reconfiguration complexities. In this paper, we investigate the usage of devolved controllers for large-scale data centers, and design a new scheme to overcome shortcomings, and to improve system performance. We first define Load Balancing problem for Devolved Controllers (LBDC), and prove its NP-completeness. For LBDC, we design an f-approximation, where f is the largest number of potential controllers for a switch in the network. We also propose both centralized and distributed approaches to solve LBDC time effectively. The numerical results validate our designs, which become a solution to manage and coordinate large-scale data centers.
{"title":"Balancing traffic load for devolved controllers in data center networks","authors":"Wanchao Liang, Xiaofeng Gao, Fan Wu, Guihai Clien, Wei Wei","doi":"10.1109/GLOCOM.2014.7037144","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037144","url":null,"abstract":"Using a centralized controller for resource management and coordination is a common practice in cloud services. For scalability concern, in recent literature a novel approach, namely devolved controllers, was proposed. Such approach splits the network into regions, while each controller only monitors a portion of the traffic. This technique alleviates scalability issue, but brings other critical problems, such as unbalanced work load among controllers and reconfiguration complexities. In this paper, we investigate the usage of devolved controllers for large-scale data centers, and design a new scheme to overcome shortcomings, and to improve system performance. We first define Load Balancing problem for Devolved Controllers (LBDC), and prove its NP-completeness. For LBDC, we design an f-approximation, where f is the largest number of potential controllers for a switch in the network. We also propose both centralized and distributed approaches to solve LBDC time effectively. The numerical results validate our designs, which become a solution to manage and coordinate large-scale data centers.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"96 1","pages":"2258-2263"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82011061","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036932
Andreas Achtzehn, Dominik Deling, M. Petrova
In this paper we analyze the potential use of underutilized TV frequencies to enable high-speed hotspots and data offloading in trains. We propose a system where the hotspots connect via TV frequencies to base stations that are located at the train stations. Using data from the railway network of Germany and detailed spectrum availability information we carry out a performance analysis for various realistic scenarios and configurations of a secondary system that relies on LTE technologies. Our analysis shows that sustainable data rates beyond 20 Mbps per train can be achieved in all considered scenarios, and that a proposed modified spectrum policy for authorized shared access of the secondary system will yield near-universal coverage. The results show that it would be possible to provide cost-efficient broadband connectivity for a national high-speed train network by using unused TV frequencies.
{"title":"Feasibility of a TV whitespaces enabled broadband network for high-speed trains","authors":"Andreas Achtzehn, Dominik Deling, M. Petrova","doi":"10.1109/GLOCOM.2014.7036932","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036932","url":null,"abstract":"In this paper we analyze the potential use of underutilized TV frequencies to enable high-speed hotspots and data offloading in trains. We propose a system where the hotspots connect via TV frequencies to base stations that are located at the train stations. Using data from the railway network of Germany and detailed spectrum availability information we carry out a performance analysis for various realistic scenarios and configurations of a secondary system that relies on LTE technologies. Our analysis shows that sustainable data rates beyond 20 Mbps per train can be achieved in all considered scenarios, and that a proposed modified spectrum policy for authorized shared access of the secondary system will yield near-universal coverage. The results show that it would be possible to provide cost-efficient broadband connectivity for a national high-speed train network by using unused TV frequencies.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"25 1","pages":"954-960"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77322596","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037336
S. Rajagopal, S. Abu-Surra, Eran Pisek
Wireless LAN systems have been continuously evolving to provide ~10X increase in data rates every five years, exploiting higher mmWave frequencies and larger bandwidths, such as IEEE 802.11ad, providing 6.76 Gb/s using 2.16 GHz of bandwidth at 60 GHz. One of the key technical challenges to successful commercialization of these large bandwidth systems is power consumption. In this paper, we focus on reducing the idle listening mode power consumption where the device is actively looking for packets and the power consumption is dominated by the high speed ADCs. We propose a low power and bandwidth-scalable synchronization design for large bandwidth systems by developing reduced bandwidth modes in high-speed ADCs used in such systems. We study the impact of the proposed synchronization design on the detection probability, false alarm, AGC design and symbol timing estimation. Comparisons of our design using a bandwidth reduction of 4 with the existing IEEE 802. Had synchronization design show no loss in AWGN and a 0.8 dB loss in fading for an equivalent acquisition time and false alarm rate while providing a 33% power reduction in idle mode, assuming the ADCs consume 50% of the total idle power consumption. We also provide backward compatibility with current IEEE 802.11ad systems with limited impact on performance and power consumption.
{"title":"Low power synchronization design for large bandwidth wireless LAN systems","authors":"S. Rajagopal, S. Abu-Surra, Eran Pisek","doi":"10.1109/GLOCOM.2014.7037336","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037336","url":null,"abstract":"Wireless LAN systems have been continuously evolving to provide ~10X increase in data rates every five years, exploiting higher mmWave frequencies and larger bandwidths, such as IEEE 802.11ad, providing 6.76 Gb/s using 2.16 GHz of bandwidth at 60 GHz. One of the key technical challenges to successful commercialization of these large bandwidth systems is power consumption. In this paper, we focus on reducing the idle listening mode power consumption where the device is actively looking for packets and the power consumption is dominated by the high speed ADCs. We propose a low power and bandwidth-scalable synchronization design for large bandwidth systems by developing reduced bandwidth modes in high-speed ADCs used in such systems. We study the impact of the proposed synchronization design on the detection probability, false alarm, AGC design and symbol timing estimation. Comparisons of our design using a bandwidth reduction of 4 with the existing IEEE 802. Had synchronization design show no loss in AWGN and a 0.8 dB loss in fading for an equivalent acquisition time and false alarm rate while providing a 33% power reduction in idle mode, assuming the ADCs consume 50% of the total idle power consumption. We also provide backward compatibility with current IEEE 802.11ad systems with limited impact on performance and power consumption.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"54 1","pages":"3418-3423"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90820853","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
扫码关注我们
求助内容：
应助结果提醒方式：