Pub Date : 2015-04-27DOI: 10.1109/ICT.2015.7124656
Xinyu Liu, Cheng Chen, An Huang, Qing F. Zhou
This paper proposes a new TDMA-based cooperative MAC scheme for a two-hop relay network in which there are several helpers besides a default relay node. Here, a helper has lower obligation than the default relay to help packet forwarding. The proposed method is developed from the existing CR-TDMA scheme, and named as opportunistic CR-TDMA or OCR-TDMA. We derive the throughput performance of CR-TDMA and OCR-TDMA. Both the theoretical analysis and simulation results demonstrate that OCR-TDMA provides superior throughput performance compared with CR-TDMA, even though OCR-TDMA is a limited modification of CR-TDMA. Amazingly, the OCR-TDMA gains remarkable cooperation benefit even when the helpers have low resource and capability to cooperate.
{"title":"A new TDMA-based cooperative MAC scheme","authors":"Xinyu Liu, Cheng Chen, An Huang, Qing F. Zhou","doi":"10.1109/ICT.2015.7124656","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124656","url":null,"abstract":"This paper proposes a new TDMA-based cooperative MAC scheme for a two-hop relay network in which there are several helpers besides a default relay node. Here, a helper has lower obligation than the default relay to help packet forwarding. The proposed method is developed from the existing CR-TDMA scheme, and named as opportunistic CR-TDMA or OCR-TDMA. We derive the throughput performance of CR-TDMA and OCR-TDMA. Both the theoretical analysis and simulation results demonstrate that OCR-TDMA provides superior throughput performance compared with CR-TDMA, even though OCR-TDMA is a limited modification of CR-TDMA. Amazingly, the OCR-TDMA gains remarkable cooperation benefit even when the helpers have low resource and capability to cooperate.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126858099","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124695
Volkan Dedeoglu, Fanny Jardel, J. Boutros
Random low-density parity-check (LDPC) ensembles do not achieve full diversity on block-fading channels. To cope with quasi-static fading, a special LDPC structure, known as root-LDPC, has been introduced. A root-LDPC ensemble guarantees that any information bit receives messages from all channel states. Results in the literature show that the gap between the root-LDPC boundary and the capacity boundary in the fading plane is not small enough. In this paper, we propose to saturate the whole root-LDPC boundary via spatial coupling. For simplicity, we adopt an equivalent erasure channel model rather than a block fading model. It is shown that spatial coupling of parity bits only is sufficient to saturate the root-LDPC threshold boundary in the erasure plane.
{"title":"Spatial coupling of root-LDPC: Parity bits doping","authors":"Volkan Dedeoglu, Fanny Jardel, J. Boutros","doi":"10.1109/ICT.2015.7124695","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124695","url":null,"abstract":"Random low-density parity-check (LDPC) ensembles do not achieve full diversity on block-fading channels. To cope with quasi-static fading, a special LDPC structure, known as root-LDPC, has been introduced. A root-LDPC ensemble guarantees that any information bit receives messages from all channel states. Results in the literature show that the gap between the root-LDPC boundary and the capacity boundary in the fading plane is not small enough. In this paper, we propose to saturate the whole root-LDPC boundary via spatial coupling. For simplicity, we adopt an equivalent erasure channel model rather than a block fading model. It is shown that spatial coupling of parity bits only is sufficient to saturate the root-LDPC threshold boundary in the erasure plane.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114337364","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124693
Yu-Chih Huang, K. Narayanan
This paper revisits the Construction πA lattices recently proposed by Huang and Narayanan. This lattice construction is a generalization of the famous Construction A to the multilevel coding setting which preserves most of the structures of Construction A. Decoding algorithms of the Construction πA lattices are then studied. Two low complexity decoders are proposed to take advantage of the additional structure of the Construction πA lattices.
{"title":"On decoding algorithms for construction πA lattices","authors":"Yu-Chih Huang, K. Narayanan","doi":"10.1109/ICT.2015.7124693","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124693","url":null,"abstract":"This paper revisits the Construction π<sub>A</sub> lattices recently proposed by Huang and Narayanan. This lattice construction is a generalization of the famous Construction A to the multilevel coding setting which preserves most of the structures of Construction A. Decoding algorithms of the Construction π<sub>A</sub> lattices are then studied. Two low complexity decoders are proposed to take advantage of the additional structure of the Construction π<sub>A</sub> lattices.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"48 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122544578","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124647
Shabnam Khomejani, A. Nallanathan, H. Nguyen, H. Aghvami
In [1], a new frame structure is introduced to improve throughput and spectrum sensing capabilities compared to conventional cognitive radio (CR) systems that use the frame structure with a periodic sensing. However, even though employing two levels of power only for primary users (PUs) can be considered for CR systems, it may not be practical as the PUs often transmit with multiple levels of power. Thus, in this paper, we propose a new CR system to accommodate multiple levels of the primary transmission power and, at the same time, improve overall system throughput by using the new frame structure that provides spectrum sensing and data transmission at the same time within one time slot. Finally, computer simulation is used to validate the performance improvement of the proposed system.
{"title":"Enhancing throughput of cognitive radio system with multiple power levels for primary users","authors":"Shabnam Khomejani, A. Nallanathan, H. Nguyen, H. Aghvami","doi":"10.1109/ICT.2015.7124647","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124647","url":null,"abstract":"In [1], a new frame structure is introduced to improve throughput and spectrum sensing capabilities compared to conventional cognitive radio (CR) systems that use the frame structure with a periodic sensing. However, even though employing two levels of power only for primary users (PUs) can be considered for CR systems, it may not be practical as the PUs often transmit with multiple levels of power. Thus, in this paper, we propose a new CR system to accommodate multiple levels of the primary transmission power and, at the same time, improve overall system throughput by using the new frame structure that provides spectrum sensing and data transmission at the same time within one time slot. Finally, computer simulation is used to validate the performance improvement of the proposed system.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133563030","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124671
Fan Zhang, T. Luo, Jianfeng Li
In this paper, we propose an efficient multi-hop broadcast routing algorithm based on Real-time Traffic Estimation in vehicular ad-hoc networks (VANETs) including a novel relay node selection scheme and an efficient adaptive rebroadcast wait delay strategy. Firstly, we take the overall traffic information into consideration to select the relay node, which is different with the traditional scheme only considering the distance information. In order to obtain more accurate traffic information in the target road segment, we employ the real-time traffic estimates algorithm to predict the information. Furthermore, we also reduce the rebroadcast waiting just select only one rebroadcast node by considering many influence factors such as the traffic density and the vehicle information. Therefore, a weighted utility function (WUF) is formulated to comprehensively consider the effect of these factors. Furthermore, the value of WUF can also be utilized to determine the waiting time of the rebroadcast node to achieve the adaptive wait scheme. Finally, the timeout retransmission strategy is employed to improve the reliability of broadcast message transmission at the source node. Theoretical and simulation results demonstrate the effectiveness of the proposed algorithm in terms of the packet delay, data redundancy, effective permeability and network robustness, when compared with classical M-Flood and Slotted algorithms.
{"title":"A multi-hop broadcast routing algorithm based on real-time traffic estimation for VANETs","authors":"Fan Zhang, T. Luo, Jianfeng Li","doi":"10.1109/ICT.2015.7124671","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124671","url":null,"abstract":"In this paper, we propose an efficient multi-hop broadcast routing algorithm based on Real-time Traffic Estimation in vehicular ad-hoc networks (VANETs) including a novel relay node selection scheme and an efficient adaptive rebroadcast wait delay strategy. Firstly, we take the overall traffic information into consideration to select the relay node, which is different with the traditional scheme only considering the distance information. In order to obtain more accurate traffic information in the target road segment, we employ the real-time traffic estimates algorithm to predict the information. Furthermore, we also reduce the rebroadcast waiting just select only one rebroadcast node by considering many influence factors such as the traffic density and the vehicle information. Therefore, a weighted utility function (WUF) is formulated to comprehensively consider the effect of these factors. Furthermore, the value of WUF can also be utilized to determine the waiting time of the rebroadcast node to achieve the adaptive wait scheme. Finally, the timeout retransmission strategy is employed to improve the reliability of broadcast message transmission at the source node. Theoretical and simulation results demonstrate the effectiveness of the proposed algorithm in terms of the packet delay, data redundancy, effective permeability and network robustness, when compared with classical M-Flood and Slotted algorithms.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132847587","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124683
Aqeel Sahi Khader, D. Lai
The acceleration in developments in communication technology has led to a consequent increase in the vulnerability of data due to penetration attacks. These attacks often came from outside where non-qualified companies develop IT projects. Cryptography can offer high levels of security but has recently shown vulnerabilities such as the man-in-the-middle (MITM) attack in areas of key exchange protocols, especially in the Diffie-Hellman (DH) protocol. Firstly, this paper presents an overview of MITM attacks targeted at the DH protocol then discusses some of the shortcomings of current defenses. A proposed method to secure DH, which helps secure systems against MITM attacks, is then presented. This method involves the use of Geffe generation of binary sequences. The use of Geffe generator offers high levels of randomness. Data hashed and encrypted using this proposed method will be so difficult to intercept and decrypt without the appropriate keys. This offers high levels of security and helps prevent MITM attacks.
{"title":"Preventing man-in-the-middle attack in Diffie-Hellman key exchange protocol","authors":"Aqeel Sahi Khader, D. Lai","doi":"10.1109/ICT.2015.7124683","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124683","url":null,"abstract":"The acceleration in developments in communication technology has led to a consequent increase in the vulnerability of data due to penetration attacks. These attacks often came from outside where non-qualified companies develop IT projects. Cryptography can offer high levels of security but has recently shown vulnerabilities such as the man-in-the-middle (MITM) attack in areas of key exchange protocols, especially in the Diffie-Hellman (DH) protocol. Firstly, this paper presents an overview of MITM attacks targeted at the DH protocol then discusses some of the shortcomings of current defenses. A proposed method to secure DH, which helps secure systems against MITM attacks, is then presented. This method involves the use of Geffe generation of binary sequences. The use of Geffe generator offers high levels of randomness. Data hashed and encrypted using this proposed method will be so difficult to intercept and decrypt without the appropriate keys. This offers high levels of security and helps prevent MITM attacks.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129379774","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124709
Shiyu Ren, Zhimin Zeng, Caili Guo, Xuekang Sun
In wideband compressive spectrum sensing, when the number of occupied subbands in the monitored wideband increases, the existing compressive sensing approaches have to raise the sampling rate to maintain a desired sensing performance. What is worse, that will add computational complexity of the following signal reconstruction. To overcome this issue, this paper proposes a novel wideband spectrum sensing approach based on time-domain coprime sampling. Our approach first estimates the power spectrum of the wideband signal by employing the coprime sampling scheme, then performs detection via a subband-bin energy detector. The cornerstone of our approach is that we can generate a Nyquist space sampled autocorrelation from the sub-Nyquist samples by implementing the coprime sampling scheme. Demonstrated by the simulations, our proposed wideband sensing approach has a better performance under high compression ratio and a better robustness against noise compared with the orthogonal matching pursuit (OMP). Also it is illustrated that our approach has the advantage over computational complexity by analyzing. Considering the merits synthetically, the novel wideband sensing approach adapts better to a higher bandwidth by comparision.
{"title":"Wideband spectrum sensing based on coprime sampling","authors":"Shiyu Ren, Zhimin Zeng, Caili Guo, Xuekang Sun","doi":"10.1109/ICT.2015.7124709","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124709","url":null,"abstract":"In wideband compressive spectrum sensing, when the number of occupied subbands in the monitored wideband increases, the existing compressive sensing approaches have to raise the sampling rate to maintain a desired sensing performance. What is worse, that will add computational complexity of the following signal reconstruction. To overcome this issue, this paper proposes a novel wideband spectrum sensing approach based on time-domain coprime sampling. Our approach first estimates the power spectrum of the wideband signal by employing the coprime sampling scheme, then performs detection via a subband-bin energy detector. The cornerstone of our approach is that we can generate a Nyquist space sampled autocorrelation from the sub-Nyquist samples by implementing the coprime sampling scheme. Demonstrated by the simulations, our proposed wideband sensing approach has a better performance under high compression ratio and a better robustness against noise compared with the orthogonal matching pursuit (OMP). Also it is illustrated that our approach has the advantage over computational complexity by analyzing. Considering the merits synthetically, the novel wideband sensing approach adapts better to a higher bandwidth by comparision.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129510762","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124710
Xiaochen Lin, Yu Liu, Mengyao Sun
With the widespread popularity of mobile terminals, mobile video has become an indispensable part of daily life. The conventional wireless video transmission scheme which consists of separate digital source coding and digital channel coding is now unable to meet the broadcast and mobile scenarios owing to the dramatic changes in its channel condition. However, an uncoded transmission scheme called SoftCast was recently presented to provide graceful quality transition. SoftCast is not efficient when the channel bandwidth is greater than the video bandwidth (pixels/s) by retransmission. This paper introduces Analog Channel Coding to utilize the wide bandwidth more efficiently. The transmitted data is divided into two parts: the most important part and the remainder. As the most important part can be estimated correctly at decoder side, our scheme only transmits the remainder to correct the reconstructed signal. The experimental results show that the proposed scheme can improve the performance of SoftCast by 2-5dB in wide band channel.
{"title":"Analog channel coding for wireless image/video SoftCast by data division","authors":"Xiaochen Lin, Yu Liu, Mengyao Sun","doi":"10.1109/ICT.2015.7124710","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124710","url":null,"abstract":"With the widespread popularity of mobile terminals, mobile video has become an indispensable part of daily life. The conventional wireless video transmission scheme which consists of separate digital source coding and digital channel coding is now unable to meet the broadcast and mobile scenarios owing to the dramatic changes in its channel condition. However, an uncoded transmission scheme called SoftCast was recently presented to provide graceful quality transition. SoftCast is not efficient when the channel bandwidth is greater than the video bandwidth (pixels/s) by retransmission. This paper introduces Analog Channel Coding to utilize the wide bandwidth more efficiently. The transmitted data is divided into two parts: the most important part and the remainder. As the most important part can be estimated correctly at decoder side, our scheme only transmits the remainder to correct the reconstructed signal. The experimental results show that the proposed scheme can improve the performance of SoftCast by 2-5dB in wide band channel.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115477470","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124662
Zhongsheng Liu, Yuan’an Liu, Fang Liu
In this paper, the joint resource scheduling strategies in a full-duplex cellular system are studied. In the system, the base station (BS) is enabled full-duplex transmission, while the user equipments (UEs) are still traditional half-duplex. Firstly, we propose a binary-integer programming problem concerning cell throughput and solve it through exhaustive search algorithm. Furthermore, considering the feasibility of the optimal algorithm, two suboptimal heuristic algorithms are raised: one is distance isolation algorithm, the other one is user filtering and dynamic adjustment algorithm. Then, to verify the performance of the proposed algorithms, some system level simulations are conducted in a single cell full-duplex scenario. The results show the comparison of system throughput between traditional half-duplex system and full-duplex system under different self-interference cancellation capabilities at the BS. The throughput performance of the proposed algorithms changing with self-interference cancellation capability and user number is analyzed.
{"title":"Joint resource scheduling for full-duplex cellular system","authors":"Zhongsheng Liu, Yuan’an Liu, Fang Liu","doi":"10.1109/ICT.2015.7124662","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124662","url":null,"abstract":"In this paper, the joint resource scheduling strategies in a full-duplex cellular system are studied. In the system, the base station (BS) is enabled full-duplex transmission, while the user equipments (UEs) are still traditional half-duplex. Firstly, we propose a binary-integer programming problem concerning cell throughput and solve it through exhaustive search algorithm. Furthermore, considering the feasibility of the optimal algorithm, two suboptimal heuristic algorithms are raised: one is distance isolation algorithm, the other one is user filtering and dynamic adjustment algorithm. Then, to verify the performance of the proposed algorithms, some system level simulations are conducted in a single cell full-duplex scenario. The results show the comparison of system throughput between traditional half-duplex system and full-duplex system under different self-interference cancellation capabilities at the BS. The throughput performance of the proposed algorithms changing with self-interference cancellation capability and user number is analyzed.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114091214","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124702
Huan Liu, Yan Jiao, Yuehong Gao, Lin Sang, Dacheng Yang
Performance gain can be obtained by dynamically reconfiguring the uplink and downlink radio frames in TDD systems. FDD systems can also benefit from the flexibility in the allocation of uplink and downlink resources. The paper proposes a specific implement of flexible duplex based on selection between different designs of radio frames to make the FDD network more adaptive to the real time situation of uplink and downlink traffic. The interference generated by flexible duplex is analyzed with a typical mathematic model and several scenarios are discussed to find out the ideal scenario to apply flexible duplex. Some simulation results are given to show the gain obtained by the scheme.
{"title":"Performance evaluation of flexible duplex implement based on radio frame selection in LTE heterogeneous network","authors":"Huan Liu, Yan Jiao, Yuehong Gao, Lin Sang, Dacheng Yang","doi":"10.1109/ICT.2015.7124702","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124702","url":null,"abstract":"Performance gain can be obtained by dynamically reconfiguring the uplink and downlink radio frames in TDD systems. FDD systems can also benefit from the flexibility in the allocation of uplink and downlink resources. The paper proposes a specific implement of flexible duplex based on selection between different designs of radio frames to make the FDD network more adaptive to the real time situation of uplink and downlink traffic. The interference generated by flexible duplex is analyzed with a typical mathematic model and several scenarios are discussed to find out the ideal scenario to apply flexible duplex. Some simulation results are given to show the gain obtained by the scheme.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116368115","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
扫码关注我们
求助内容：
应助结果提醒方式：