Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952275
D. Nguyen, T. Le-Ngoc
This paper is concerned with linear precoding designs in a multiuser downlink system. We consider a multiple-input single-output system with multiple single-antenna user-equipments (UE) experiencing non-homogeneous user conditions, including the channel strength and the background noise power. Assuming perfect knowledge of channel state information and noise power at the base-station (eNB), we propose a new regularized zero-forcing (RZF) precoder, which takes advantage of the non-homogeneous user conditions. Given in a closed-form solution, the proposed RZF precoder outperforms other well-known linear precoders, while achieving a close performance to the locally optimal iterative weighted minimization of mean-squared error precoder, in terms of the achievable network sum-rate. We then propose a greedy user selection algorithm in conjunction with the proposed RZF precoder when the number of UEs exceeds the number transmit antennas at the eNB.
{"title":"Regularized zero-forcing precoding with non-homogeneous user conditions","authors":"D. Nguyen, T. Le-Ngoc","doi":"10.1109/WCNC.2014.6952275","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952275","url":null,"abstract":"This paper is concerned with linear precoding designs in a multiuser downlink system. We consider a multiple-input single-output system with multiple single-antenna user-equipments (UE) experiencing non-homogeneous user conditions, including the channel strength and the background noise power. Assuming perfect knowledge of channel state information and noise power at the base-station (eNB), we propose a new regularized zero-forcing (RZF) precoder, which takes advantage of the non-homogeneous user conditions. Given in a closed-form solution, the proposed RZF precoder outperforms other well-known linear precoders, while achieving a close performance to the locally optimal iterative weighted minimization of mean-squared error precoder, in terms of the achievable network sum-rate. We then propose a greedy user selection algorithm in conjunction with the proposed RZF precoder when the number of UEs exceeds the number transmit antennas at the eNB.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130018888","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-04-06DOI: 10.1109/WCNC.2014.6952126
Kai Zhu, A. Burr
In this contribution, we study the property of FEC-coded differential PSK schemes with iterative non-coherent detection suitable for high mobility applications. Two distinct iterative non-coherent reception algorithms are proposed, in which decision feedback differential detection (DFDD) is used either to generate symbol probabilities or to predict the channel estimates. Turbo processing is employed in both schemes to progressively bridge the performance gap between coherent and non-coherent receivers by iteratively exchanging extrinsic information. Simulation results suggest that our proposed DFDD assisted iterative non-coherent DPSK trellis detection scheme is capable of delivering performance very similar to previous schemes reported in the literature, while being much simpler.
{"title":"Iterative non-coherent detected DPSK systems in fast fading channels","authors":"Kai Zhu, A. Burr","doi":"10.1109/WCNC.2014.6952126","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952126","url":null,"abstract":"In this contribution, we study the property of FEC-coded differential PSK schemes with iterative non-coherent detection suitable for high mobility applications. Two distinct iterative non-coherent reception algorithms are proposed, in which decision feedback differential detection (DFDD) is used either to generate symbol probabilities or to predict the channel estimates. Turbo processing is employed in both schemes to progressively bridge the performance gap between coherent and non-coherent receivers by iteratively exchanging extrinsic information. Simulation results suggest that our proposed DFDD assisted iterative non-coherent DPSK trellis detection scheme is capable of delivering performance very similar to previous schemes reported in the literature, while being much simpler.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134148671","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-04-06DOI: 10.1109/WCNC.2014.6952956
Mirghiasaldin Seyedebrahimi, Xiaohong Peng, R. Harrison
The concern over the quality of delivering video streaming services in mobile wireless networks is addressed in this work. A framework that enhances the Quality of Experience (QoE) of end users through a quality driven resource allocation scheme is proposed. To play a key role, an objective no-reference quality metric, Pause Intensity (PI), is adopted to derive a resource allocation algorithm for video streaming. The framework is examined in the context of 3GPP Long Term Evolution (LTE) systems. The requirements and structure of the proposed PI-based framework are discussed, and results are compared with existing scheduling methods on fairness, efficiency and correlation (between the required and allocated data rates). Furthermore, it is shown that the proposed framework can produce a trade-off between the three parameters through the QoE-aware resource allocation process.
{"title":"A quality driven framework for adaptive video streaming in mobile wireless networks","authors":"Mirghiasaldin Seyedebrahimi, Xiaohong Peng, R. Harrison","doi":"10.1109/WCNC.2014.6952956","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952956","url":null,"abstract":"The concern over the quality of delivering video streaming services in mobile wireless networks is addressed in this work. A framework that enhances the Quality of Experience (QoE) of end users through a quality driven resource allocation scheme is proposed. To play a key role, an objective no-reference quality metric, Pause Intensity (PI), is adopted to derive a resource allocation algorithm for video streaming. The framework is examined in the context of 3GPP Long Term Evolution (LTE) systems. The requirements and structure of the proposed PI-based framework are discussed, and results are compared with existing scheduling methods on fairness, efficiency and correlation (between the required and allocated data rates). Furthermore, it is shown that the proposed framework can produce a trade-off between the three parameters through the QoE-aware resource allocation process.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134270546","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-04-06DOI: 10.1109/WCNC.2014.6951988
B. Gao, Zhenyu Xiao, Changming Zhang, L. Su, Depeng Jin, Lieguang Zeng
Due to human blockage and device mobility, 60GHz wireless local-area network (WLAN) faces the challenge of communication-link outage. To cope with this problem, a double-link beam tracking scheme is proposed in this paper. This scheme includes a search strategy of transmission and alternative links, and an in-packet double-link tracking and switching method. The transmission and alternative links are simultaneously tracked against device mobility, through probing neighboring beams; once the human blockage is detected in transmission link, the system can thus switch to the alternative link directly. Besides, the proposed scheme finds the finish of human blockage quickly through in-packet double-link tracking, and enables the system to communication in the maximal received-power link. The comparison between the proposed scheme and the IEEE 802.11ad scheme is conducted. The comparison shows that the proposed scheme significantly reduces the probability of outage, and achieves an improved throughput.
{"title":"Double-link beam tracking against human blockage and device mobility for 60-GHz WLAN","authors":"B. Gao, Zhenyu Xiao, Changming Zhang, L. Su, Depeng Jin, Lieguang Zeng","doi":"10.1109/WCNC.2014.6951988","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6951988","url":null,"abstract":"Due to human blockage and device mobility, 60GHz wireless local-area network (WLAN) faces the challenge of communication-link outage. To cope with this problem, a double-link beam tracking scheme is proposed in this paper. This scheme includes a search strategy of transmission and alternative links, and an in-packet double-link tracking and switching method. The transmission and alternative links are simultaneously tracked against device mobility, through probing neighboring beams; once the human blockage is detected in transmission link, the system can thus switch to the alternative link directly. Besides, the proposed scheme finds the finish of human blockage quickly through in-packet double-link tracking, and enables the system to communication in the maximal received-power link. The comparison between the proposed scheme and the IEEE 802.11ad scheme is conducted. The comparison shows that the proposed scheme significantly reduces the probability of outage, and achieves an improved throughput.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134172931","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-04-06DOI: 10.1109/WCNC.2014.6951938
Fernando Reátegui del Águila, M. Imran, R. Tafazolli
Interference forwarding has been shown to be beneficial in the interference channel with a relay as it enlarges the strong interference region, allowing the decoding of the interference at the receivers for larger ranges of the channel gains. In this work we demonstrate the benefit of adding a relay to the cognitive interference channel. We pay special attention to the effect of interference forwarding in this configuration. Two setups are presented. In the first, the interference forwarded by the relay is the primary user's signal, and in the second, this is the cognitive user's signal. We characterise the capacity regions of these two models in the case of strong interference. We show that as opposed to the first setup, in the second setup the capacity region is enlarged, compared to the capacity region of the cognitive interference channel, when the relay does not help the intended receiver.
{"title":"On the capacity of the cognitive interference channel with a relay","authors":"Fernando Reátegui del Águila, M. Imran, R. Tafazolli","doi":"10.1109/WCNC.2014.6951938","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6951938","url":null,"abstract":"Interference forwarding has been shown to be beneficial in the interference channel with a relay as it enlarges the strong interference region, allowing the decoding of the interference at the receivers for larger ranges of the channel gains. In this work we demonstrate the benefit of adding a relay to the cognitive interference channel. We pay special attention to the effect of interference forwarding in this configuration. Two setups are presented. In the first, the interference forwarded by the relay is the primary user's signal, and in the second, this is the cognitive user's signal. We characterise the capacity regions of these two models in the case of strong interference. We show that as opposed to the first setup, in the second setup the capacity region is enlarged, compared to the capacity region of the cognitive interference channel, when the relay does not help the intended receiver.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128945150","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-04-06DOI: 10.1109/WCNC.2014.6952559
I. Ahmed, Mohsin Khan
This paper presents a three dimensional (3D) radio resource allocation and interference coordination scheme in multicell LTE-A downlink. We formulate the resource allocation and interference coordination problem as proportional fairness based utility maximization problem. Interference has been minimized through time, frequency, and space domain resource allocation. The proposed 3D scheme utilizes two time slots for intercell interference management, geometrical position based frequency resource allocation for intracell interference mitigation, and frequency domain orthogonality across UEs and relays for inter-UE and UE-relays interference management. The relaxed convex optimization problem has been solved through Lagrange multipliers and Karush-Kuhn-Tucker (KKT) conditions. Simulations have been performed according to the 3GPP (Third Generation Partnership Project) standard parameters for relay-enhanced LTE networks. Simulation results show the efficacy of proposed 3D scheme as compared to the already presented 3 slots time domain interference coordination (TD-IC) with round robin (RR-TD-IC) and proportional fairness (PF-TD-IC) schemes. It has been observed that proposed 3D scheme provides 81% increase in average individual throughput at the cost of only 13.8% degradation in fairness as compared to the PF-TD-IC.
{"title":"Three dimensional channel aware scheduling in relay-assisted multi-cell LTE-A downlink","authors":"I. Ahmed, Mohsin Khan","doi":"10.1109/WCNC.2014.6952559","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952559","url":null,"abstract":"This paper presents a three dimensional (3D) radio resource allocation and interference coordination scheme in multicell LTE-A downlink. We formulate the resource allocation and interference coordination problem as proportional fairness based utility maximization problem. Interference has been minimized through time, frequency, and space domain resource allocation. The proposed 3D scheme utilizes two time slots for intercell interference management, geometrical position based frequency resource allocation for intracell interference mitigation, and frequency domain orthogonality across UEs and relays for inter-UE and UE-relays interference management. The relaxed convex optimization problem has been solved through Lagrange multipliers and Karush-Kuhn-Tucker (KKT) conditions. Simulations have been performed according to the 3GPP (Third Generation Partnership Project) standard parameters for relay-enhanced LTE networks. Simulation results show the efficacy of proposed 3D scheme as compared to the already presented 3 slots time domain interference coordination (TD-IC) with round robin (RR-TD-IC) and proportional fairness (PF-TD-IC) schemes. It has been observed that proposed 3D scheme provides 81% increase in average individual throughput at the cost of only 13.8% degradation in fairness as compared to the PF-TD-IC.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132815137","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-04-06DOI: 10.1109/WCNC.2014.6952242
Rong Ou, Wenjun Xu, Shengyu Li, Jiaru Lin
We consider a spectrum sharing protocol in which a secondary system can operate on the same spectrum with a primary user. In the protocol, the secondary system helps the primary system achieve its target rate by acting as a relay for the primary system. As a reward, the remaining subcarriers can be used for the secondary transmission. In order to alleviate the disadvantages of amplify-and-forward (AF) and decode-and-forward (DF) relaying techniques, an adaptive relaying scheme is proposed. In this paper, we study energy efficient resource allocation for the cognitive cooperation system. The considered problem is modeled as a non-convex optimization problem which takes into account the total transmit power of the secondary system and the minimum required data rate of the primary system. The optimal set of subcarriers used for cooperation, subcarrier power allocation and relaying technique are derived for maximization of the energy efficiency (EE) of the secondary system by using fractional programming and dual theory. Simulation results demonstrate that significant performance gains can be achieved by the devised scheme.
{"title":"Energy-efficient resource allocation for OFDM-based cognitive cooperation system using adaptive relaying strategy","authors":"Rong Ou, Wenjun Xu, Shengyu Li, Jiaru Lin","doi":"10.1109/WCNC.2014.6952242","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952242","url":null,"abstract":"We consider a spectrum sharing protocol in which a secondary system can operate on the same spectrum with a primary user. In the protocol, the secondary system helps the primary system achieve its target rate by acting as a relay for the primary system. As a reward, the remaining subcarriers can be used for the secondary transmission. In order to alleviate the disadvantages of amplify-and-forward (AF) and decode-and-forward (DF) relaying techniques, an adaptive relaying scheme is proposed. In this paper, we study energy efficient resource allocation for the cognitive cooperation system. The considered problem is modeled as a non-convex optimization problem which takes into account the total transmit power of the secondary system and the minimum required data rate of the primary system. The optimal set of subcarriers used for cooperation, subcarrier power allocation and relaying technique are derived for maximization of the energy efficiency (EE) of the secondary system by using fractional programming and dual theory. Simulation results demonstrate that significant performance gains can be achieved by the devised scheme.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131053439","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-04-06DOI: 10.1109/WCNC.2014.6952560
J. Biswas, Wei Ni, R. Liu, I. Collings, S. Jha
Virtual Multiple-Input Multiple-Output (MIMO) is a promising uplink technology that can meet the throughput demand of Long-Term Evolution-Advanced (LTE-A) systems. However, the complexity of scheduling virtual MIMO is a challenge; existing virtual MIMO is therefore limited to best effort applications. We investigate the resource allocation and scheduling problem in a heterogeneous virtual MIMO system where delay sensitive applications are present. The goal is to maximize the system throughput while maintaining delay bound for delay sensitive traffic. To tackle the complexity challenge, we propose two low-complexity suboptimal algorithms, where the key idea is to reduce the search space and iteratively minimize the rate loss respectively. Simulation results show that the rate loss minimization based heuristic algorithm converges to within 99% of the optimal throughput on average and maintains delay bound for delay sensitive users. It also achieves almost the same fairness performance as the optimal solution.
{"title":"Low complexity user pairing and resource allocation of heterogeneous users for uplink virtual MIMO system over LTE-A network","authors":"J. Biswas, Wei Ni, R. Liu, I. Collings, S. Jha","doi":"10.1109/WCNC.2014.6952560","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952560","url":null,"abstract":"Virtual Multiple-Input Multiple-Output (MIMO) is a promising uplink technology that can meet the throughput demand of Long-Term Evolution-Advanced (LTE-A) systems. However, the complexity of scheduling virtual MIMO is a challenge; existing virtual MIMO is therefore limited to best effort applications. We investigate the resource allocation and scheduling problem in a heterogeneous virtual MIMO system where delay sensitive applications are present. The goal is to maximize the system throughput while maintaining delay bound for delay sensitive traffic. To tackle the complexity challenge, we propose two low-complexity suboptimal algorithms, where the key idea is to reduce the search space and iteratively minimize the rate loss respectively. Simulation results show that the rate loss minimization based heuristic algorithm converges to within 99% of the optimal throughput on average and maintains delay bound for delay sensitive users. It also achieves almost the same fairness performance as the optimal solution.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131135566","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-04-06DOI: 10.1109/WCNC.2014.6952899
Peng Wang, Guoqiang Mao, Zihuai Lin
Wireless broadcast has been widely utilized to deliver information of common interest to a large number of users. A major challenge for wireless broadcast is that wireless links are often unreliable. Further, it is not feasible for every receiver to acknowledge the correct reception of broadcasted packets. In this paper we investigate the use of wireless broadcast to deliver a given number of packets by a common transmitter to a given number of receivers, without feedback from the receivers, while meeting the reliability constraint, i.e. the probability that all receivers successfully receive all broadcasted packets is above a certain threshold. Rateless codes(RCs) technology is used to assist the broadcast. Performance analysis with the use of RCs is conducted. Simulations are conducted to validate the accuracy of the theoretical analysis. It is shown that the use of RCs can significantly reduce the number of transmissions required to meet the reliability constraint.
{"title":"Reliability-constrained broadcast using network coding without feedback","authors":"Peng Wang, Guoqiang Mao, Zihuai Lin","doi":"10.1109/WCNC.2014.6952899","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952899","url":null,"abstract":"Wireless broadcast has been widely utilized to deliver information of common interest to a large number of users. A major challenge for wireless broadcast is that wireless links are often unreliable. Further, it is not feasible for every receiver to acknowledge the correct reception of broadcasted packets. In this paper we investigate the use of wireless broadcast to deliver a given number of packets by a common transmitter to a given number of receivers, without feedback from the receivers, while meeting the reliability constraint, i.e. the probability that all receivers successfully receive all broadcasted packets is above a certain threshold. Rateless codes(RCs) technology is used to assist the broadcast. Performance analysis with the use of RCs is conducted. Simulations are conducted to validate the accuracy of the theoretical analysis. It is shown that the use of RCs can significantly reduce the number of transmissions required to meet the reliability constraint.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131195841","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-04-06DOI: 10.1109/WCNC.2014.6952445
C. Bouras, N. Kanakis
A crucial point on the delivery of multicast content over mobile multicast networks is the utilization of Forward Error Correction (FEC) codes on the application layer (AL-FEC) so as to introduce robustness against arbitrary erasures on different recipients without the need of inefficient common error control methods based on data retransmission. FEC is a feedback free error recovery method where the sender introduces redundant data in advance with the source data enabling the recipients to recover from different arbitrary packet losses. The main issue on the efficient application of AL-FEC protection is the adaptation of the introduced redundancy to the current network conditions, in order to avoid network resources wastage ensuring at the same time sufficient transmission robustness. Based on this, in this work we present an adaptive weighted online algorithm aiming at the efficient application of RaptorQ AL-FEC codes over mobile multicast services. The proposed algorithm adapts the introduced AL-FEC transmission overhead exploiting at first the reception reports ability defined by several mobile multicast standards and thereafter the performance properties of the newly introduced RaptorQ FEC codes. We introduce the competitive framework of the efficient application of AL-FEC protection over mobile multicast networks, in the context of which, we design and analyze the adaptive online weighted algorithm and we further provide a series of simulation results to analyze the performance of the proposed scheme.
{"title":"An adaptive weighted online AL-FEC algorithm over mobile multicast networks","authors":"C. Bouras, N. Kanakis","doi":"10.1109/WCNC.2014.6952445","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952445","url":null,"abstract":"A crucial point on the delivery of multicast content over mobile multicast networks is the utilization of Forward Error Correction (FEC) codes on the application layer (AL-FEC) so as to introduce robustness against arbitrary erasures on different recipients without the need of inefficient common error control methods based on data retransmission. FEC is a feedback free error recovery method where the sender introduces redundant data in advance with the source data enabling the recipients to recover from different arbitrary packet losses. The main issue on the efficient application of AL-FEC protection is the adaptation of the introduced redundancy to the current network conditions, in order to avoid network resources wastage ensuring at the same time sufficient transmission robustness. Based on this, in this work we present an adaptive weighted online algorithm aiming at the efficient application of RaptorQ AL-FEC codes over mobile multicast services. The proposed algorithm adapts the introduced AL-FEC transmission overhead exploiting at first the reception reports ability defined by several mobile multicast standards and thereafter the performance properties of the newly introduced RaptorQ FEC codes. We introduce the competitive framework of the efficient application of AL-FEC protection over mobile multicast networks, in the context of which, we design and analyze the adaptive online weighted algorithm and we further provide a series of simulation results to analyze the performance of the proposed scheme.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132951780","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
扫码关注我们
求助内容：
应助结果提醒方式：