Pub Date : 2014-11-03DOI: 10.1109/CCNC.2014.6940508
Vincent Picard, E. Lafond
This Work In Progress (WiP) paper presents a preliminary performance evaluation of next generation Wi-Fi (802.11ac) devices in a controlled laboratory environment. System performance (Layer-4 throughput, latency and data loss) was measured with consumer grade 802.11ac routers, bridges and USB adapters in a single-input single-output (SISO) test configuration. Although 802.11ac-enabled mobile devices such as smartphones are now commercially available, none were available at the time this preliminary evaluation was launched. Additional 802.11ac technology evaluation is scheduled in the coming months, which will include 802.11ac capable mobile devices and multiple input multiple output (MIMO) system performance.
{"title":"Performance evaluation of next generation Wi-Fi (802.11ac) for mobile offloading","authors":"Vincent Picard, E. Lafond","doi":"10.1109/CCNC.2014.6940508","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6940508","url":null,"abstract":"This Work In Progress (WiP) paper presents a preliminary performance evaluation of next generation Wi-Fi (802.11ac) devices in a controlled laboratory environment. System performance (Layer-4 throughput, latency and data loss) was measured with consumer grade 802.11ac routers, bridges and USB adapters in a single-input single-output (SISO) test configuration. Although 802.11ac-enabled mobile devices such as smartphones are now commercially available, none were available at the time this preliminary evaluation was launched. Additional 802.11ac technology evaluation is scheduled in the coming months, which will include 802.11ac capable mobile devices and multiple input multiple output (MIMO) system performance.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129628375","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-07-28DOI: 10.1109/CCNC.2014.6866572
A. Mikityuk, Jean-Pierre Seifert, O. Friedrich
This paper introduces a novel and fundamental change in the creation and delivery of media services like IP Television (IPTV) through the idea of the so-called virtual SetTop Box (vSTB). By shifting most of the service execution environment - e.g. the Web browser - to a Cloud infrastructure, the vSTB concept addresses certain limitations of current IPTV deployments. Nevertheless, routing UI delivery out of the Cloud causes a significant impact on the network infrastructure, which might have some implications for IPTV system response and can therefore result in a lower Quality of Experience overall. This paper describes this approach and its current implementation, as well as identifying and addressing network challenges that emerged in a corresponding project in the Telekom Innovation Laboratories. Furthermore, this paper provides a comparison between IPTV service executed locally on an end-user device (locally-rendered IPTV UI), and that delivered to an end-user after it was executed within the cloud (Cloud-rendered IPTV UI) and empirically shows the feasibility of the presented vSTB Approach.
{"title":"Paradigm shift in IPTV service generation: Comparison between locally- and Cloud-rendered IPTV UI","authors":"A. Mikityuk, Jean-Pierre Seifert, O. Friedrich","doi":"10.1109/CCNC.2014.6866572","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866572","url":null,"abstract":"This paper introduces a novel and fundamental change in the creation and delivery of media services like IP Television (IPTV) through the idea of the so-called virtual SetTop Box (vSTB). By shifting most of the service execution environment - e.g. the Web browser - to a Cloud infrastructure, the vSTB concept addresses certain limitations of current IPTV deployments. Nevertheless, routing UI delivery out of the Cloud causes a significant impact on the network infrastructure, which might have some implications for IPTV system response and can therefore result in a lower Quality of Experience overall. This paper describes this approach and its current implementation, as well as identifying and addressing network challenges that emerged in a corresponding project in the Telekom Innovation Laboratories. Furthermore, this paper provides a comparison between IPTV service executed locally on an end-user device (locally-rendered IPTV UI), and that delivered to an end-user after it was executed within the cloud (Cloud-rendered IPTV UI) and empirically shows the feasibility of the presented vSTB Approach.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126126133","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-07-28DOI: 10.1109/CCNC.2014.6866606
Tomotaka Kimura, T. Matsuda, T. Takine
We propose a probabilistic store-carry-forward message delivery scheme based on node density estimation. In our scheme, when a node with a message copy encounters another node, the former forwards its copy to the latter with a certain probability. The forwarding probability is determined depending on a node density at the contact location where two nodes encounter. More specifically, when the node density is high, the forwarding probability is set to be low. This policy is designed to avoid excess message copy transmissions in a high node-density area. In general, nodes frequently encounter each other in high node-density areas and message copies rapidly spread over the nodes. In order to determine whether the node density is high or not, each node estimates the node density distribution over the whole network based on the contact location information. The information is collected by each node and exchanged among nodes. With simulation experiments, we evaluate the performance of our scheme in terms of the mean delivery delay and the number of forwarded message copies.
{"title":"Probabilistic store-carry-forward message delivery based on node density estimation","authors":"Tomotaka Kimura, T. Matsuda, T. Takine","doi":"10.1109/CCNC.2014.6866606","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866606","url":null,"abstract":"We propose a probabilistic store-carry-forward message delivery scheme based on node density estimation. In our scheme, when a node with a message copy encounters another node, the former forwards its copy to the latter with a certain probability. The forwarding probability is determined depending on a node density at the contact location where two nodes encounter. More specifically, when the node density is high, the forwarding probability is set to be low. This policy is designed to avoid excess message copy transmissions in a high node-density area. In general, nodes frequently encounter each other in high node-density areas and message copies rapidly spread over the nodes. In order to determine whether the node density is high or not, each node estimates the node density distribution over the whole network based on the contact location information. The information is collected by each node and exchanged among nodes. With simulation experiments, we evaluate the performance of our scheme in terms of the mean delivery delay and the number of forwarded message copies.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115584560","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-07-28DOI: 10.1109/CCNC.2014.6866614
K. Nakauchi, Zhong Lei, Y. Shoji, Y. Kitatsuji, Manabu Ito, H. Yokota
This paper proposes virtualized WiFi network that can dynamically create a virtual Base Station (vBS) around the target mobile devices that offers dedicated base station resources for satisfying service-specific QoS and works as a gateway for a corresponding virtual network or slice. Specifically, the paper proposes (1) a technique to dynamically configure a vBS on top of multiple physical WiFi base stations by exploiting the features of OpenFlow, and (2) a technique of network-driven seamless handover between vBSs by forced association and authentication in advance at a target vBS. The paper also describes a detailed design and implementation of a physical WiFi base station which can organize a vBS, named virtualization capable WiFi Base Station (vcBS). As a prototype, two vcBSs and virtualization capable Base Stations Switch (vcBS-SW) to accommodate and centrally control those vcBSs are newly developed. The paper demonstrates a vBS can be dynamically configured on top of two vcBSs and the base station resource can be dynamically allocated to the vBS by assigning additional WiFi interfaces or frequency channels based on a resource allocation policy. The paper also demonstrates the proportion of SIP calls whose setup time exceed the threshold of 600ms can be reduced from 19.7% to 4.6%, when the SIP signaling traffic is served by a SIP-specific vBS. Finally the paper demonstrates that the prototype system can make seamless handover for a target device from common vBS to service-specific vBS in less than 65 ms without any packet drop.
本文提出了一种虚拟WiFi网络，它可以围绕目标移动设备动态创建虚拟基站(virtual Base Station, vBS)，为满足特定业务的QoS提供专用基站资源，并作为相应虚拟网络或片的网关。具体而言，本文提出了(1)利用OpenFlow的特性，在多个物理WiFi基站之上动态配置一个vBS的技术;(2)在目标vBS上通过强制关联和提前认证，实现网络驱动的vBS间无缝切换的技术。本文还详细介绍了一个可以组织vBS的物理WiFi基站的设计和实现，即虚拟化WiFi基站(vcb)。作为一个原型，新开发了两个vcBSs和具有虚拟化功能的基站交换机(vcBS-SW)来容纳和集中控制这些vcBSs。本文介绍了在两个vcBSs之上动态配置一个vBS，根据资源分配策略，通过分配额外的WiFi接口或频率通道，将基站资源动态分配给两个vBS。本文还论证了在使用SIP专用vBS服务SIP信令时，SIP呼叫建立时间超过600ms阈值的比例可以从19.7%降低到4.6%。最后，本文证明了原型系统可以在不到65 ms的时间内实现目标设备从普通vBS到特定业务vBS的无缝切换，并且没有丢包。
{"title":"Bring your own network — Design and implementation of a virtualized WiFi network","authors":"K. Nakauchi, Zhong Lei, Y. Shoji, Y. Kitatsuji, Manabu Ito, H. Yokota","doi":"10.1109/CCNC.2014.6866614","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866614","url":null,"abstract":"This paper proposes virtualized WiFi network that can dynamically create a virtual Base Station (vBS) around the target mobile devices that offers dedicated base station resources for satisfying service-specific QoS and works as a gateway for a corresponding virtual network or slice. Specifically, the paper proposes (1) a technique to dynamically configure a vBS on top of multiple physical WiFi base stations by exploiting the features of OpenFlow, and (2) a technique of network-driven seamless handover between vBSs by forced association and authentication in advance at a target vBS. The paper also describes a detailed design and implementation of a physical WiFi base station which can organize a vBS, named virtualization capable WiFi Base Station (vcBS). As a prototype, two vcBSs and virtualization capable Base Stations Switch (vcBS-SW) to accommodate and centrally control those vcBSs are newly developed. The paper demonstrates a vBS can be dynamically configured on top of two vcBSs and the base station resource can be dynamically allocated to the vBS by assigning additional WiFi interfaces or frequency channels based on a resource allocation policy. The paper also demonstrates the proportion of SIP calls whose setup time exceed the threshold of 600ms can be reduced from 19.7% to 4.6%, when the SIP signaling traffic is served by a SIP-specific vBS. Finally the paper demonstrates that the prototype system can make seamless handover for a target device from common vBS to service-specific vBS in less than 65 ms without any packet drop.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116086635","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-07-28DOI: 10.1109/CCNC.2014.6866604
Petro P. Ernest, H. Anthony Chan, O. Falowo, L. Magagula, Sandra Cespedes
Network Mobility (NEMO) Basic Support Protocol (NBSP) provides mobility supports for mobile networks. NBSP is an extension of Mobile IPv6 which employs a centralized mobility management approach. It relies on a static and centralized home agent for signaling management and data forwarding. All data traffic traverse a centralized home agent, which leads to suboptimal routing, high packet overhead and latency, especially in nested NEMO (i.e. when the mobile networks connect to one another to reach the infrastructure). In this paper, we develop a network-based distributed mobility management (DMM) scheme for non-nested and nested NEMO scenarios, with the goal of mitigating the aforementioned problems. Additionally, the proposed scheme improves the packet delivery and location update (i.e., binding update) costs. The paper discusses in detail the scheme's design, operation mechanism and the performance evaluation analysis. The numerical results of the proposed scheme show significant improvement in packet overhead and latency as well as binding update and packet delivery costs.
{"title":"Network-based distributed mobility management for network mobility","authors":"Petro P. Ernest, H. Anthony Chan, O. Falowo, L. Magagula, Sandra Cespedes","doi":"10.1109/CCNC.2014.6866604","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866604","url":null,"abstract":"Network Mobility (NEMO) Basic Support Protocol (NBSP) provides mobility supports for mobile networks. NBSP is an extension of Mobile IPv6 which employs a centralized mobility management approach. It relies on a static and centralized home agent for signaling management and data forwarding. All data traffic traverse a centralized home agent, which leads to suboptimal routing, high packet overhead and latency, especially in nested NEMO (i.e. when the mobile networks connect to one another to reach the infrastructure). In this paper, we develop a network-based distributed mobility management (DMM) scheme for non-nested and nested NEMO scenarios, with the goal of mitigating the aforementioned problems. Additionally, the proposed scheme improves the packet delivery and location update (i.e., binding update) costs. The paper discusses in detail the scheme's design, operation mechanism and the performance evaluation analysis. The numerical results of the proposed scheme show significant improvement in packet overhead and latency as well as binding update and packet delivery costs.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"267 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122718724","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-07-28DOI: 10.1109/CCNC.2014.6866569
Y. Rao, D. Gao, Hongbin Luo
To enhance seamless provider mobility support in NDN, we propose a Novel Locator Based mobility support Approach (NLBA). In this approach, we assign an unique locator to each Access Router (AR) in NDN networks, and further modify the outgoing faces field in AR's original Forwarding Information Base (FIB), to record the mobility status and the current locator of the provider. Besides, we append an optional field to the original NDN packet, and further extend the AR with additional functionalities, such as caching or forwarding Interest packets on behalf of the provider. Our analytical investigations indicate that NLBA has lower handover cost and shorter handover latency, compared with other existing rendezvous/indirection point based mobility support approach.
{"title":"NLBA: A novel provider mobility support approach in mobile NDN environment","authors":"Y. Rao, D. Gao, Hongbin Luo","doi":"10.1109/CCNC.2014.6866569","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866569","url":null,"abstract":"To enhance seamless provider mobility support in NDN, we propose a Novel Locator Based mobility support Approach (NLBA). In this approach, we assign an unique locator to each Access Router (AR) in NDN networks, and further modify the outgoing faces field in AR's original Forwarding Information Base (FIB), to record the mobility status and the current locator of the provider. Besides, we append an optional field to the original NDN packet, and further extend the AR with additional functionalities, such as caching or forwarding Interest packets on behalf of the provider. Our analytical investigations indicate that NLBA has lower handover cost and shorter handover latency, compared with other existing rendezvous/indirection point based mobility support approach.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124591157","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-07-28DOI: 10.1109/CCNC.2014.6866544
Bin Hu, H. Gharavi
In this paper, a greedy backpressure routing protocol is proposed for multigate mesh networks. This protocol evaluates the greedy backpressure metric (GBM) value of mesh points and routes packets in the direction of the steepest gradient. The GBM value is calculated using a combination of traffic load and the mesh point's hop count to the closest gateway. The proposed routing algorithm can realize the effect of traffic load from all the nodes along the path to each gateway by iteratively updating information from neighbors through periodic beacon exchange. The consideration of incorporating traffic load helps to route packets around congested area. The results indicate that the greedy backpressure multigate mesh routing is capable of achieving significant improvement in the network reliability, latency, and throughput performance.
{"title":"Greedy backpressure routing for Smart Grid sensor networks","authors":"Bin Hu, H. Gharavi","doi":"10.1109/CCNC.2014.6866544","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866544","url":null,"abstract":"In this paper, a greedy backpressure routing protocol is proposed for multigate mesh networks. This protocol evaluates the greedy backpressure metric (GBM) value of mesh points and routes packets in the direction of the steepest gradient. The GBM value is calculated using a combination of traffic load and the mesh point's hop count to the closest gateway. The proposed routing algorithm can realize the effect of traffic load from all the nodes along the path to each gateway by iteratively updating information from neighbors through periodic beacon exchange. The consideration of incorporating traffic load helps to route packets around congested area. The results indicate that the greedy backpressure multigate mesh routing is capable of achieving significant improvement in the network reliability, latency, and throughput performance.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131313840","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-07-28DOI: 10.1109/CCNC.2014.6866584
Irena Trajkovska, P. Rodríguez, Javier Cerviño, P. Harsh, J. Salvachúa
P2P streaming today is one of the most challenging techniques to deliver real-time streaming on the Internet. Incentive mechanisms make a crucial part of the P2P algorithms in order to avoid uncooperative and eliminate malicious behavior. In this paper we present a monetary incentive mechanism based on the taxation incentive schemes. We use a model of a P2P streaming service to apply the idea and validate the quantitative effect on both the users' and the provider's welfare in the system. A billing model based on QoS levels for the perceived video that offers a remuneration inventive for the cooperative users, contributes to the P2P streaming because of the two main reasons: increases provider's welfare in terms of monetary benefit and saves infrastructure cost; increases users' welfare in terms of increased cooperation and motivation to participate in the streaming.
{"title":"P2P incentive model for QoS based streaming systems","authors":"Irena Trajkovska, P. Rodríguez, Javier Cerviño, P. Harsh, J. Salvachúa","doi":"10.1109/CCNC.2014.6866584","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866584","url":null,"abstract":"P2P streaming today is one of the most challenging techniques to deliver real-time streaming on the Internet. Incentive mechanisms make a crucial part of the P2P algorithms in order to avoid uncooperative and eliminate malicious behavior. In this paper we present a monetary incentive mechanism based on the taxation incentive schemes. We use a model of a P2P streaming service to apply the idea and validate the quantitative effect on both the users' and the provider's welfare in the system. A billing model based on QoS levels for the perceived video that offers a remuneration inventive for the cooperative users, contributes to the P2P streaming because of the two main reasons: increases provider's welfare in terms of monetary benefit and saves infrastructure cost; increases users' welfare in terms of increased cooperation and motivation to participate in the streaming.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"312 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133819209","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-07-28DOI: 10.1109/CCNC.2014.6866623
Eran Pisek, S. Abu-Surra, J. Mott, Thomas Henige, Rashbha Sharma
The interest in short range communication has significantly increased in the last decade with the introduction of different wireless connectivity standards and their evolution such as IEEE802.11n/ac and IEEE802.11ad. New demands for higher resolution multimedia applications such as UHD push for higher data rates to exceed 30Gbps. This high data rate demand requires short range standards to adopt a new approach to accommodate these rates. Millimeter wave enable high bandwidth usage which implies higher capacity to accommodate 10-100Gbps data rates. However, the high data rate pose big challenges to both the system algorithm and architecture. In this paper, we propose a novel FPGA-based high-throughput beamforming MIMO system for millimeter wave short range communication. We present our first realization of a complete millimeter wave short range communication system, which includes RF frontend, ADC/DAC, beamforming control, synchronization, channel estimation, MIMO precoding/detection, and channel encoder/decoder. The design works at millimeter carrier frequency with 500MHz bandwidth and 2-channel MIMO Beamforming. We show realtime application test results as captured in the millimeter wave system.
{"title":"High throughput millimeter-wave MIMO beamforming system for short range communication","authors":"Eran Pisek, S. Abu-Surra, J. Mott, Thomas Henige, Rashbha Sharma","doi":"10.1109/CCNC.2014.6866623","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866623","url":null,"abstract":"The interest in short range communication has significantly increased in the last decade with the introduction of different wireless connectivity standards and their evolution such as IEEE802.11n/ac and IEEE802.11ad. New demands for higher resolution multimedia applications such as UHD push for higher data rates to exceed 30Gbps. This high data rate demand requires short range standards to adopt a new approach to accommodate these rates. Millimeter wave enable high bandwidth usage which implies higher capacity to accommodate 10-100Gbps data rates. However, the high data rate pose big challenges to both the system algorithm and architecture. In this paper, we propose a novel FPGA-based high-throughput beamforming MIMO system for millimeter wave short range communication. We present our first realization of a complete millimeter wave short range communication system, which includes RF frontend, ADC/DAC, beamforming control, synchronization, channel estimation, MIMO precoding/detection, and channel encoder/decoder. The design works at millimeter carrier frequency with 500MHz bandwidth and 2-channel MIMO Beamforming. We show realtime application test results as captured in the millimeter wave system.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123713831","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-07-28DOI: 10.1109/CCNC.2014.6866590
Y. Guan, Yao Xiao, L. Cimini, Chien-Chung Shen
The increasing popularity of Internet-capable mobile devices leads to the explosion of mobile data traffic. Although the emerging mobile broadband systems such as 4G LTE promise higher bandwidth and lower latency for video traffic, it is not power efficient to deliver video traffic over cellular networks. This paper studies how peer-to-peer communications via wireless local networks could complement the cellular networks so as to minimize the power consumption of mobile devices. Specifically, we consider the scenario in which a group of nearby mobile devices share the streaming contents, originated from the cellular networks, over the wireless local area networks in a peer-to-peer manner. We focus on investigating how the mobile devices should cooperate to minimize their own power consumption. The problem has been formulated into a linear programming (LP) model, and numerical results show that at least 31% of the power consumption can be saved on mobile devices through the cooperation among them.
{"title":"Power efficient peer-to-peer streaming to co-located mobile users","authors":"Y. Guan, Yao Xiao, L. Cimini, Chien-Chung Shen","doi":"10.1109/CCNC.2014.6866590","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866590","url":null,"abstract":"The increasing popularity of Internet-capable mobile devices leads to the explosion of mobile data traffic. Although the emerging mobile broadband systems such as 4G LTE promise higher bandwidth and lower latency for video traffic, it is not power efficient to deliver video traffic over cellular networks. This paper studies how peer-to-peer communications via wireless local networks could complement the cellular networks so as to minimize the power consumption of mobile devices. Specifically, we consider the scenario in which a group of nearby mobile devices share the streaming contents, originated from the cellular networks, over the wireless local area networks in a peer-to-peer manner. We focus on investigating how the mobile devices should cooperate to minimize their own power consumption. The problem has been formulated into a linear programming (LP) model, and numerical results show that at least 31% of the power consumption can be saved on mobile devices through the cooperation among them.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122367526","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
扫码关注我们
求助内容：
应助结果提醒方式：