Pub Date : 2016-05-22DOI: 10.1109/ICC.2016.7511560
Nguyen H. Tran, Chuan Pham, Shaolei Ren, Zhu Han, C. Hong
Even though demand response of datacenters recently has received increasing attention due to huge demands and flexible power control knobs, most of current studies focus on the owner-operated datacenters, leaving behind another critical segment of datacenter business: multi-tenant colocation. In colocation datacenters, while there exist multiple tenants who manage their own servers, the colocation operator only provides other facilities such as cooling, reliable power, and network connectivity. Therefore, colocation has its unique feature that challenges any attempts to design its demand response program: uncoordinated power management among tenants. To tackle this challenge, we consider incentive mechanisms that can coordinate tenants' power consumption for emergency demand response, where a fixed energy reduction target must be fulfilled. For two types of price-taking and price-anticipating tenants, we propose two incentive schemes with distributed algorithms that can achieve the same optimal social cost. Finally, trace-based simulations are also provided to illustrate the efficacy of our proposed incentive schemes.
{"title":"Coordinated power reduction in multi-tenant colocation datacenter: An emergency demand response study","authors":"Nguyen H. Tran, Chuan Pham, Shaolei Ren, Zhu Han, C. Hong","doi":"10.1109/ICC.2016.7511560","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511560","url":null,"abstract":"Even though demand response of datacenters recently has received increasing attention due to huge demands and flexible power control knobs, most of current studies focus on the owner-operated datacenters, leaving behind another critical segment of datacenter business: multi-tenant colocation. In colocation datacenters, while there exist multiple tenants who manage their own servers, the colocation operator only provides other facilities such as cooling, reliable power, and network connectivity. Therefore, colocation has its unique feature that challenges any attempts to design its demand response program: uncoordinated power management among tenants. To tackle this challenge, we consider incentive mechanisms that can coordinate tenants' power consumption for emergency demand response, where a fixed energy reduction target must be fulfilled. For two types of price-taking and price-anticipating tenants, we propose two incentive schemes with distributed algorithms that can achieve the same optimal social cost. Finally, trace-based simulations are also provided to illustrate the efficacy of our proposed incentive schemes.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116500898","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510745
N. Zlatanov, V. Jamali, D. W. K. Ng, R. Schober
Based on the coding scheme recently introduced in [1], we propose new communication protocols with improved outage probability performance for the fading two-hop half-duplex (HD) relay channel. This channel is comprised of a source, a HD relay, and a destination, where a direct source-destination link does not exist. For this channel, we assume that the transmitting nodes do not have transmitter-side channel state information and therefore have to transmit with fixed rate. As a result, outages may occur. We propose protocols for the cases when feedback from receiving to transmitting nodes is not possible and restricted to one bit of feedback information per time slot, respectively. In the proposed protocols, the relay's silent symbol intervals, when the relay receives, carry information which improves the reliability of both the source-relay and relay-destination links. In contrast, in existing protocols, the relay's silent symbol intervals, when the relay receives, are a priori known to the destination and thereby cannot carry information. Our numerical results show that the proposed protocols achieve significant performance gains in terms of outage probability compared to existing protocols in the literature. These gains are only the result of using a different coding scheme and not of utilizing more resources than existing protocols.
{"title":"Novel protocol with improved outage probability performance for the fading two-hop half-duplex relay channel","authors":"N. Zlatanov, V. Jamali, D. W. K. Ng, R. Schober","doi":"10.1109/ICC.2016.7510745","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510745","url":null,"abstract":"Based on the coding scheme recently introduced in [1], we propose new communication protocols with improved outage probability performance for the fading two-hop half-duplex (HD) relay channel. This channel is comprised of a source, a HD relay, and a destination, where a direct source-destination link does not exist. For this channel, we assume that the transmitting nodes do not have transmitter-side channel state information and therefore have to transmit with fixed rate. As a result, outages may occur. We propose protocols for the cases when feedback from receiving to transmitting nodes is not possible and restricted to one bit of feedback information per time slot, respectively. In the proposed protocols, the relay's silent symbol intervals, when the relay receives, carry information which improves the reliability of both the source-relay and relay-destination links. In contrast, in existing protocols, the relay's silent symbol intervals, when the relay receives, are a priori known to the destination and thereby cannot carry information. Our numerical results show that the proposed protocols achieve significant performance gains in terms of outage probability compared to existing protocols in the literature. These gains are only the result of using a different coding scheme and not of utilizing more resources than existing protocols.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114872694","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510975
D. Hu, Jingxian Wu, P. Fan
In this paper, we study the end-to-end delay of a linear multihop network with mobile relays located on the line connecting the source-destination pair. The network operates in an interference-limited environment, where the interfering signals are from nodes with positions following the Poisson point process (PPP) on a two-dimensional plane. Due to node mobilities, the relay nodes are assumed to move randomly on the source-destination line by following a random waypoint mobility (RWPM) model. Based on the statistical properties of RWPM, we first analyze the probability distributions of the inter-node distance of the mobile relays. The results are then used to derive the exact analytical expressions of the end-to-end delay between a given source-destination pair. The analytical results explicitly quantify the impacts of several system parameters on the end-to-end delay, including the source-destination distance, the number of relays, the propagation parameters, and the density of interferers, etc. The optimum number of relays that can minimize the end-to-end delay is obtained. Both analytical and simulation results show that the mobility of the relay nodes can decrease the end-to-end delay.
{"title":"On the end-to-end delay of interference-limited mobile multihop networks","authors":"D. Hu, Jingxian Wu, P. Fan","doi":"10.1109/ICC.2016.7510975","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510975","url":null,"abstract":"In this paper, we study the end-to-end delay of a linear multihop network with mobile relays located on the line connecting the source-destination pair. The network operates in an interference-limited environment, where the interfering signals are from nodes with positions following the Poisson point process (PPP) on a two-dimensional plane. Due to node mobilities, the relay nodes are assumed to move randomly on the source-destination line by following a random waypoint mobility (RWPM) model. Based on the statistical properties of RWPM, we first analyze the probability distributions of the inter-node distance of the mobile relays. The results are then used to derive the exact analytical expressions of the end-to-end delay between a given source-destination pair. The analytical results explicitly quantify the impacts of several system parameters on the end-to-end delay, including the source-destination distance, the number of relays, the propagation parameters, and the density of interferers, etc. The optimum number of relays that can minimize the end-to-end delay is obtained. Both analytical and simulation results show that the mobility of the relay nodes can decrease the end-to-end delay.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124354526","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511550
P. Houze, Emmanuel Mory, Géraldine Texier, G. Simon
End-users in online video services are sensitive to the overall quality of the video at screen, but also, and more importantly, to other factors, including the latency between the video generation and the playback for live videos. If the improvement of the quality of the perceived video has been well investigated by the multimedia community, the impact of delay, latency, and re-buffering has not received a significant attention. Adaptive streaming technologies, which have been widely adopted in the recent years, contribute to this lack of consideration since vendors usually recommend the introduction of significant extra-latency. In this paper, we address the problem of low-latency live video streaming. We propose an implementation of multi-path video delivery at the applicative level, which exploits the information provided in the latest version of the video delivery standards. We present an implementation of a video player, which takes advantage of multi-path networking to enable video playback using TCP with a latency below 100 ms. By initiating the multi-path delivery from the client side, our mechanism is compatible with current network equipments and does not require any change neither at the server nor in the middleboxes.
{"title":"Applicative-layer multipath for low-latency adaptive live streaming","authors":"P. Houze, Emmanuel Mory, Géraldine Texier, G. Simon","doi":"10.1109/ICC.2016.7511550","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511550","url":null,"abstract":"End-users in online video services are sensitive to the overall quality of the video at screen, but also, and more importantly, to other factors, including the latency between the video generation and the playback for live videos. If the improvement of the quality of the perceived video has been well investigated by the multimedia community, the impact of delay, latency, and re-buffering has not received a significant attention. Adaptive streaming technologies, which have been widely adopted in the recent years, contribute to this lack of consideration since vendors usually recommend the introduction of significant extra-latency. In this paper, we address the problem of low-latency live video streaming. We propose an implementation of multi-path video delivery at the applicative level, which exploits the information provided in the latest version of the video delivery standards. We present an implementation of a video player, which takes advantage of multi-path networking to enable video playback using TCP with a latency below 100 ms. By initiating the multi-path delivery from the client side, our mechanism is compatible with current network equipments and does not require any change neither at the server nor in the middleboxes.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124529181","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511463
Deze Zeng, Guang Yang, Lin Gu, Song Guo, Hong Yao
The rapid development of cloud computing has raised big concerns over the high energy consumption of modern data centers. To satisfy the ever increasing data traffic needs, the energy consumption of data center network (DCN) also takes a significant proportion. The newly emerging technology, Software Defined Networking (SDN), which allows flexible control of network devices, brings a new opportunity towards DCN energy optimization. In this paper, we investigate how to design an energy-efficient network management strategy with guaranteed satisfaction of network traffic demands in Software Defined Data Center Networks (SD-DCNs). To this end, three issues will be tackled: 1) the subset of switches that shall be activated, i.e., switch activation, 2) multi-path routing scheduling for all flows and 3) forwarding rule placement in SDN switches. They are jointly considered and formulated as an integer linear programming (ILP) problem. A heuristic algorithm to deal with its high computational complexity is proposed. Extensive simulation-based evaluations are conducted to validate the high efficiency of our algorithm.
{"title":"Joint optimization on switch activation and flow routing towards energy efficient software defined data center networks","authors":"Deze Zeng, Guang Yang, Lin Gu, Song Guo, Hong Yao","doi":"10.1109/ICC.2016.7511463","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511463","url":null,"abstract":"The rapid development of cloud computing has raised big concerns over the high energy consumption of modern data centers. To satisfy the ever increasing data traffic needs, the energy consumption of data center network (DCN) also takes a significant proportion. The newly emerging technology, Software Defined Networking (SDN), which allows flexible control of network devices, brings a new opportunity towards DCN energy optimization. In this paper, we investigate how to design an energy-efficient network management strategy with guaranteed satisfaction of network traffic demands in Software Defined Data Center Networks (SD-DCNs). To this end, three issues will be tackled: 1) the subset of switches that shall be activated, i.e., switch activation, 2) multi-path routing scheduling for all flows and 3) forwarding rule placement in SDN switches. They are jointly considered and formulated as an integer linear programming (ILP) problem. A heuristic algorithm to deal with its high computational complexity is proposed. Extensive simulation-based evaluations are conducted to validate the high efficiency of our algorithm.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126298418","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511444
Yeganeh Zamiri-Jafarian, S. Gazor
In this paper, we demonstrate that Gaussian mixture distribution is a suitable model for the number of received molecules when on-off keying (OOK) modulation scheme is used in diffusion-based Molecular Communication (MC) systems. Using the proposed Gaussian mixture model, we design a receiver by minimizing the error probability. An iterative algorithm is derived to determine a threshold value which minimizes a linear approximation of the error probability at each iteration. Numerical evaluations reveal that our theoretical analysis based on the Gaussian mixture model match our simulation very closely. Furthermore, we propose a memory-based receiver in which previously detected symbols are considered in deriving the detection algorithm. Computer simulations confirm that the memory-based receiver effectively eliminates inter-symbol interference (ISI) and significantly improves the bit error rate (BER) performance of the system.
{"title":"Receiver design for diffusion-based molecular communication: Gaussian mixture modeling","authors":"Yeganeh Zamiri-Jafarian, S. Gazor","doi":"10.1109/ICC.2016.7511444","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511444","url":null,"abstract":"In this paper, we demonstrate that Gaussian mixture distribution is a suitable model for the number of received molecules when on-off keying (OOK) modulation scheme is used in diffusion-based Molecular Communication (MC) systems. Using the proposed Gaussian mixture model, we design a receiver by minimizing the error probability. An iterative algorithm is derived to determine a threshold value which minimizes a linear approximation of the error probability at each iteration. Numerical evaluations reveal that our theoretical analysis based on the Gaussian mixture model match our simulation very closely. Furthermore, we propose a memory-based receiver in which previously detected symbols are considered in deriving the detection algorithm. Computer simulations confirm that the memory-based receiver effectively eliminates inter-symbol interference (ISI) and significantly improves the bit error rate (BER) performance of the system.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128009059","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510753
Hu Jin, B. Jung, Won-Yong Shin
In this paper, we propose a novel user scheduling that achieves the optimal multi-user diversity gain in multi-cell uplink networks with multiple eavesdroppers. In the proposed scheduling, each base station (BS) selects a certain user based on two pre-determined thresholds (i.e., scheduling criteria). The first threshold is related to the amount of generating interference of the users to other BSs and the second threshold is related to the maximum amount of information overheard by the eavesdroppers in the network. Simulation results show that the proposed scheduling significantly outperforms the other scheduling algorithms in terms of secrecy throughput. Note that the proposed scheduling can operate with a distributed manner when time division duplex is adopted, i.e., no coordination among different BSs is needed.
{"title":"On the secrecy capacity of multi-cell uplink networks with opportunistic scheduling","authors":"Hu Jin, B. Jung, Won-Yong Shin","doi":"10.1109/ICC.2016.7510753","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510753","url":null,"abstract":"In this paper, we propose a novel user scheduling that achieves the optimal multi-user diversity gain in multi-cell uplink networks with multiple eavesdroppers. In the proposed scheduling, each base station (BS) selects a certain user based on two pre-determined thresholds (i.e., scheduling criteria). The first threshold is related to the amount of generating interference of the users to other BSs and the second threshold is related to the maximum amount of information overheard by the eavesdroppers in the network. Simulation results show that the proposed scheduling significantly outperforms the other scheduling algorithms in terms of secrecy throughput. Note that the proposed scheduling can operate with a distributed manner when time division duplex is adopted, i.e., no coordination among different BSs is needed.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487607","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510756
Di Han, B. Bai, Wei Chen
Cooperative communication is a promising technique, which can greatly improve the performance and extend the coverage of cellular networks. In this paper, the resource allocation problem is investigated for multi-carrier amplify-and-forward (AF) relay assisted multi-access networks with multiple users and subcarriers. The joint relay selection and subcarrier allocation problem is formulated as a combinatorial optimization problem so as to minimize the outage probability with fairness assurance. To solve this problem, we propose a constraint maximum H-matching approach, which is based on a correlated random bipartite graph (RBG) formulation. By analyzing the properties of H-matching method on correlated RBG, the tight approximation of outage probability will be obtained in closed-form formulas. By deriving the diversity-multiplexing tradeoff, it is shown that the proposed approach achieves the same frequency and cooperative diversity as if the network has only one user, while all of the users fairly share the multiplexing gain at the same time. The proposed H-matching method also enjoys a sublinear computation complexity for parallel implementations. Numerical results verified the theoretical derivations and optimality of the proposed approach.
{"title":"Joint relay selection and subcarrier allocation for multi-carrier AF relay assisted multi-access networks","authors":"Di Han, B. Bai, Wei Chen","doi":"10.1109/ICC.2016.7510756","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510756","url":null,"abstract":"Cooperative communication is a promising technique, which can greatly improve the performance and extend the coverage of cellular networks. In this paper, the resource allocation problem is investigated for multi-carrier amplify-and-forward (AF) relay assisted multi-access networks with multiple users and subcarriers. The joint relay selection and subcarrier allocation problem is formulated as a combinatorial optimization problem so as to minimize the outage probability with fairness assurance. To solve this problem, we propose a constraint maximum H-matching approach, which is based on a correlated random bipartite graph (RBG) formulation. By analyzing the properties of H-matching method on correlated RBG, the tight approximation of outage probability will be obtained in closed-form formulas. By deriving the diversity-multiplexing tradeoff, it is shown that the proposed approach achieves the same frequency and cooperative diversity as if the network has only one user, while all of the users fairly share the multiplexing gain at the same time. The proposed H-matching method also enjoys a sublinear computation complexity for parallel implementations. Numerical results verified the theoretical derivations and optimality of the proposed approach.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125740396","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511485
Wei-Jheng Lin, Hsi-Pin Ma
In this paper, a method to extract physiological information from Photoplethysmography (PPG) signal with motion artifact detection and removal is proposed. First, PPG data recorded from wearable sensors are pre-processed by discrete wavelet transform to remove unwanted noise and extract AC/DC component. Then, the characteristic points such as peaks and troughs are identified for feature extraction and physiological information extraction. To detect the motion artifact periods, we use support vector machine (SVM) for classification. The detection performance was verified by PPG signals from 11 different healthy subjects. The proposed method operates in 7 seconds with accuracy of 94.4%, sensitivity of 90.35%, and specificity of 99.36%. The motion artifact removal is accomplished by Kalman filter to track the SpO2 and heart rate (HR) extracted from motion artifact-corrupted periods. The parameters of Kalman filter are determined by the detection results. In the case of waving hand left-right, the average mean absolute bias of artifact-corrupted SpO2 and HR are 1.34% and 7.29 bpm, respectively. After applying the algorithm, the bias becomes 0.8% and 4.29 bpm. In the case of waving hand up and down, the errors of SpO2 and HR reduce from 1.31% to 0.82% and 13.97 bpm to 6.87 bpm.
{"title":"A physiological information extraction method based on wearable PPG sensors with motion artifact removal","authors":"Wei-Jheng Lin, Hsi-Pin Ma","doi":"10.1109/ICC.2016.7511485","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511485","url":null,"abstract":"In this paper, a method to extract physiological information from Photoplethysmography (PPG) signal with motion artifact detection and removal is proposed. First, PPG data recorded from wearable sensors are pre-processed by discrete wavelet transform to remove unwanted noise and extract AC/DC component. Then, the characteristic points such as peaks and troughs are identified for feature extraction and physiological information extraction. To detect the motion artifact periods, we use support vector machine (SVM) for classification. The detection performance was verified by PPG signals from 11 different healthy subjects. The proposed method operates in 7 seconds with accuracy of 94.4%, sensitivity of 90.35%, and specificity of 99.36%. The motion artifact removal is accomplished by Kalman filter to track the SpO2 and heart rate (HR) extracted from motion artifact-corrupted periods. The parameters of Kalman filter are determined by the detection results. In the case of waving hand left-right, the average mean absolute bias of artifact-corrupted SpO2 and HR are 1.34% and 7.29 bpm, respectively. After applying the algorithm, the bias becomes 0.8% and 4.29 bpm. In the case of waving hand up and down, the errors of SpO2 and HR reduce from 1.31% to 0.82% and 13.97 bpm to 6.87 bpm.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127919258","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511029
Ruozhou Yu, Shuang Qin, M. Bennis, Xianfu Chen, G. Feng, Zhu Han, G. Xue
The ever increasing video demands from mobile users have posed great challenges to cellular networks. To address this issue, video caching in radio access networks (RANs) has been recognized as one of the enabling technologies in future 5G mobile networks, which brings contents near the end-users, reducing the transmission cost of duplicate contents, meanwhile increasing the Quality-of-Experience (QoE) of users. Inspired by the emerging software-defined networking technology, recent proposals have employed centralized collaborative caching among cells to further increase the caching capacity of the RAN. In this paper, we explore a new dimension in video caching in software-defined RANs to expand its capacity. We enable the controller with the capability to adaptively select the bitrates of videos received by users, in order to maximize the number and quality of video requests that can be served, meanwhile minimizing the transmission cost. To achieve this, we further incorporate Scalable Video Coding (SVC), which enables caching and serving sliced video layers that can serve different bitrates. We formulate the problem of joint video caching and scheduling as a reward maximization (cost minimization) problem. Based on the formulation, we further propose a 2-stage rounding-based algorithm to address the problem efficiently. Simulation results show that using SVC with collaborative caching greatly improves the cache capacity and the QoE of users.
{"title":"Enhancing software-defined RAN with collaborative caching and scalable video coding","authors":"Ruozhou Yu, Shuang Qin, M. Bennis, Xianfu Chen, G. Feng, Zhu Han, G. Xue","doi":"10.1109/ICC.2016.7511029","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511029","url":null,"abstract":"The ever increasing video demands from mobile users have posed great challenges to cellular networks. To address this issue, video caching in radio access networks (RANs) has been recognized as one of the enabling technologies in future 5G mobile networks, which brings contents near the end-users, reducing the transmission cost of duplicate contents, meanwhile increasing the Quality-of-Experience (QoE) of users. Inspired by the emerging software-defined networking technology, recent proposals have employed centralized collaborative caching among cells to further increase the caching capacity of the RAN. In this paper, we explore a new dimension in video caching in software-defined RANs to expand its capacity. We enable the controller with the capability to adaptively select the bitrates of videos received by users, in order to maximize the number and quality of video requests that can be served, meanwhile minimizing the transmission cost. To achieve this, we further incorporate Scalable Video Coding (SVC), which enables caching and serving sliced video layers that can serve different bitrates. We formulate the problem of joint video caching and scheduling as a reward maximization (cost minimization) problem. Based on the formulation, we further propose a 2-stage rounding-based algorithm to address the problem efficiently. Simulation results show that using SVC with collaborative caching greatly improves the cache capacity and the QoE of users.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121731133","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
扫码关注我们
求助内容：
应助结果提醒方式：