The advance of computer network technologies such as IEEE 802.11 Wireless Local Area Network enables users to connect to Internet almost anywhere. A mobile node is likely to move between different base stations while running applications. The IETF defines the Mobile IP (MIP) allowing mobile nodes to maintain their communication uninterrupted while roaming across different IP subnets. However, the mechanisms defined in MIP may cause undesired connection disruption or packet loss which will significantly degrade the quality of real-time applications. It is important yet challenging to support researches on seamless handoff management. To achieve seamless handoff, we propose a unified scheme to address application quality degradation. Our main contribution is the concept and implementation of utilizing buffering and resending method. It helps keep the end-to-end delay of real-time traffic flow in an acceptable value and eliminates the packet loss for accomplishing seamless handoff. The NS-2 simulation results also show that our proposed scheme can maintain application quality effectively for layer-2 and layer-3 handoff of a mobile node.
{"title":"A seamless handoff scheme for IEEE 802.11 Wireless Networks","authors":"Yun-Sheng Yen, R. Chang, C. Wu","doi":"10.1002/wcm.1102","DOIUrl":"https://doi.org/10.1002/wcm.1102","url":null,"abstract":"The advance of computer network technologies such as IEEE 802.11 Wireless Local Area Network enables users to connect to Internet almost anywhere. A mobile node is likely to move between different base stations while running applications. The IETF defines the Mobile IP (MIP) allowing mobile nodes to maintain their communication uninterrupted while roaming across different IP subnets. However, the mechanisms defined in MIP may cause undesired connection disruption or packet loss which will significantly degrade the quality of real-time applications. It is important yet challenging to support researches on seamless handoff management. To achieve seamless handoff, we propose a unified scheme to address application quality degradation. Our main contribution is the concept and implementation of utilizing buffering and resending method. It helps keep the end-to-end delay of real-time traffic flow in an acceptable value and eliminates the packet loss for accomplishing seamless handoff. The NS-2 simulation results also show that our proposed scheme can maintain application quality effectively for layer-2 and layer-3 handoff of a mobile node.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124975801","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}
In this paper, we propose an effective fuzzy local fair-Rate generator (FLFG) for resilient packet ring (RPR) to achieve better utilization fairness and convergence time. The FLFG is composed of three components: adaptive fairRate calculator (AFC), fuzzy congestion detector (FCD), and fuzzy fairRate generator (FFG). AFC produces an estimated fairRate in the meantime FCD indicates the congestion degree of station. Finally, FFG adopts the two outputs from AFC and FCD to generate precise local fairRate. Simulation results show that FLFG performs a stable fairness algorithm and improves at least about by 200% in converge time of the fairRate over the aggressive mode (AM) and the distributed bandwidth allocation (DBA) algorithms.
{"title":"An effective fair bandwidth allocation in resilient packet ring","authors":"Wen-Shiang Tang, Wei-Chien Wang, Chung-Ju Chang, Yao-Ting Hsieh","doi":"10.4108/CHINACOM.2010.93","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.93","url":null,"abstract":"In this paper, we propose an effective fuzzy local fair-Rate generator (FLFG) for resilient packet ring (RPR) to achieve better utilization fairness and convergence time. The FLFG is composed of three components: adaptive fairRate calculator (AFC), fuzzy congestion detector (FCD), and fuzzy fairRate generator (FFG). AFC produces an estimated fairRate in the meantime FCD indicates the congestion degree of station. Finally, FFG adopts the two outputs from AFC and FCD to generate precise local fairRate. Simulation results show that FLFG performs a stable fairness algorithm and improves at least about by 200% in converge time of the fairRate over the aggressive mode (AM) and the distributed bandwidth allocation (DBA) algorithms.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131565333","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.66
Peng Pan, Lie-liang Yang, Youguang Zhang
In this contribution we propose and study a novel iterative time-frequency-domain (TF-domain) multiuser detector (MUD) for the multicarrier direct-sequence code-division multiple-access system employing both T-domain and F-domain spreading, which, for brevity, is referred to as the TF/MC DSCDMA system. The proposed iterative TF-domain MUD consists of a set of T-domain soft-input soft-output MUDs (SISO-MUDs) and a set of F-domain SISO-MUDs, which exchange information through two multiuser interference (MUI) cancellation units. Both the T-domain and F-domain SISO-MUDs are operated under the maximum a-posteriori (MAP) principles. In this contribution the complexity and bit error rate (BER) performance of the TF/MC DS-CDMA employing the proposed iterative TF-domain MUD are investigated and also compared with the other existing MUD schemes, including the optimum MUD and the joint/separate minimum mean-square error (MMSE) MUDs. Our study shows that the iterative TF-domain MUD is capable of achieving nearly the same BER performance as the optimum MUD, but at much lower complexity.
{"title":"Near-optimum iterative multiuser detection in time-frequency-domain spread multicarrier DS-CDMA systems","authors":"Peng Pan, Lie-liang Yang, Youguang Zhang","doi":"10.4108/CHINACOM.2010.66","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.66","url":null,"abstract":"In this contribution we propose and study a novel iterative time-frequency-domain (TF-domain) multiuser detector (MUD) for the multicarrier direct-sequence code-division multiple-access system employing both T-domain and F-domain spreading, which, for brevity, is referred to as the TF/MC DSCDMA system. The proposed iterative TF-domain MUD consists of a set of T-domain soft-input soft-output MUDs (SISO-MUDs) and a set of F-domain SISO-MUDs, which exchange information through two multiuser interference (MUI) cancellation units. Both the T-domain and F-domain SISO-MUDs are operated under the maximum a-posteriori (MAP) principles. In this contribution the complexity and bit error rate (BER) performance of the TF/MC DS-CDMA employing the proposed iterative TF-domain MUD are investigated and also compared with the other existing MUD schemes, including the optimum MUD and the joint/separate minimum mean-square error (MMSE) MUDs. Our study shows that the iterative TF-domain MUD is capable of achieving nearly the same BER performance as the optimum MUD, but at much lower complexity.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131908196","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.41
Lei Shi, Jiang-Hong Han, Yi Shi, Zhenchun Wei
In this paper, we consider how to exploit multi-packet reception (MPR) to increase the capacity for a wireless sensor network. Since MPR behavior at the physical layer affects link layer scheduling, it is necessary to follow a cross-layer approach to obtain an optimal solution. Due to the complexity of cross-layer optimization, although MPR has great potential to increase capacity, optimal solutions are yet to be developed. We build constraints for the signal-to-noise-ratio requirement under MPR at the physical layer such that we can check the feasibility for a set of concurrent transmissions. We further develop an upper bound for the number of concurrent transmissions, which enables us to identify all feasible sets of concurrent transmissions in polynomial time. Then a capacity problem can be formulated as a linear program (LP) but with a large number of variables. We propose a concept of maximum feasible set to decrease the size of LP. Finally, by comparing optimal solutions with and without MPR, we show that network capacity can be increased about 100% by using MPR.
{"title":"Cross-layer optimization for wireless sensor network with multi-packet reception","authors":"Lei Shi, Jiang-Hong Han, Yi Shi, Zhenchun Wei","doi":"10.4108/CHINACOM.2010.41","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.41","url":null,"abstract":"In this paper, we consider how to exploit multi-packet reception (MPR) to increase the capacity for a wireless sensor network. Since MPR behavior at the physical layer affects link layer scheduling, it is necessary to follow a cross-layer approach to obtain an optimal solution. Due to the complexity of cross-layer optimization, although MPR has great potential to increase capacity, optimal solutions are yet to be developed. We build constraints for the signal-to-noise-ratio requirement under MPR at the physical layer such that we can check the feasibility for a set of concurrent transmissions. We further develop an upper bound for the number of concurrent transmissions, which enables us to identify all feasible sets of concurrent transmissions in polynomial time. Then a capacity problem can be formulated as a linear program (LP) but with a large number of variables. We propose a concept of maximum feasible set to decrease the size of LP. Finally, by comparing optimal solutions with and without MPR, we show that network capacity can be increased about 100% by using MPR.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131921858","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}
In this paper, we study low feedback user grouping in downlink cooperative transmission multi-antenna systems. Users in the same group are served on the same frequency and time resource by multiple cooperative BSs using the zero-forcing precoder. We first derive the user's average received signal to interference and noise ratio (SINR). It shows that each user's SINR is an increasing function of the large scale signal to interference ratio (SIR) of users in neighbor cells, which can be obtained using the large scale channel information. We then propose a novel fair user grouping algorithm based on the large scale SIR. Simulation results show that our algorithm achieves better cell edge throughput compared with existing methods with minor reduction of cell throughput.
{"title":"User grouping based on large scale channel information in multi-cell downlink cooperative multi-antenna systems","authors":"Can Sun, Chenyang Yang, Yonghui Li, B. Vucetic","doi":"10.4108/CHINACOM.2010.1","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.1","url":null,"abstract":"In this paper, we study low feedback user grouping in downlink cooperative transmission multi-antenna systems. Users in the same group are served on the same frequency and time resource by multiple cooperative BSs using the zero-forcing precoder. We first derive the user's average received signal to interference and noise ratio (SINR). It shows that each user's SINR is an increasing function of the large scale signal to interference ratio (SIR) of users in neighbor cells, which can be obtained using the large scale channel information. We then propose a novel fair user grouping algorithm based on the large scale SIR. Simulation results show that our algorithm achieves better cell edge throughput compared with existing methods with minor reduction of cell throughput.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121090476","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.88
Yipin Sun, R. Lu, Xiaodong Lin, Jinshu Su, X. Shen
In this paper, we propose a Novel and Efficient Hash-chain based Certificate Management (NEHCM) scheme for vehicular communications. In NEHCM, to protect driver privacy, each vehicle is equipped with a large set of short-time certificates, and most importantly, serial numbers of these certificates satisfy hash-chain relationship. As a result, the certificate revocation becomes an easy task by simply releasing two hash chain seeds. However, without knowing the seeds, it is infeasible to reveal the linkability among these certificates. Thus, not only vehicles can obtain enough certificates for privacy preservation, but also the size of Certificate Revocation List (CRL) remains linear to the number of revoked vehicles, irrelative to the large number of revoked certificates in NEHCM. Furthermore, NEHCM adopts Roadside Units (RSUs) aided certificate service architecture, but the service overhead for an RSU is very low and irrelated to the number of the updated certificates. Extensive simulations demonstrate that the proposed scheme outperforms previously reported works in terms of the revocation cost.
{"title":"NEHCM: A Novel and Efficient Hash-chain based Certificate Management scheme for vehicular communications","authors":"Yipin Sun, R. Lu, Xiaodong Lin, Jinshu Su, X. Shen","doi":"10.4108/CHINACOM.2010.88","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.88","url":null,"abstract":"In this paper, we propose a Novel and Efficient Hash-chain based Certificate Management (NEHCM) scheme for vehicular communications. In NEHCM, to protect driver privacy, each vehicle is equipped with a large set of short-time certificates, and most importantly, serial numbers of these certificates satisfy hash-chain relationship. As a result, the certificate revocation becomes an easy task by simply releasing two hash chain seeds. However, without knowing the seeds, it is infeasible to reveal the linkability among these certificates. Thus, not only vehicles can obtain enough certificates for privacy preservation, but also the size of Certificate Revocation List (CRL) remains linear to the number of revoked vehicles, irrelative to the large number of revoked certificates in NEHCM. Furthermore, NEHCM adopts Roadside Units (RSUs) aided certificate service architecture, but the service overhead for an RSU is very low and irrelated to the number of the updated certificates. Extensive simulations demonstrate that the proposed scheme outperforms previously reported works in terms of the revocation cost.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130887107","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}
This paper introduces a resource management scheme for a heterogeneous cellular network. In a heterogeneous network using multiple frequency bands, the scheme can schedule the users into the band according to the user's channel conditions, e.g. geometry and mobility. According to the simulation results, the new scheme can provide a substantial gain over the independent resource allocation in each band.
{"title":"Cross-spectrum resource management and access for heterogeneous cellular networks","authors":"Jiadong Shen, X. Lu, Huafei Li, Fei Xu","doi":"10.4108/CRNET.2010.5","DOIUrl":"https://doi.org/10.4108/CRNET.2010.5","url":null,"abstract":"This paper introduces a resource management scheme for a heterogeneous cellular network. In a heterogeneous network using multiple frequency bands, the scheme can schedule the users into the band according to the user's channel conditions, e.g. geometry and mobility. According to the simulation results, the new scheme can provide a substantial gain over the independent resource allocation in each band.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133922349","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.115
M. Li, Zhenzhong Chen, Yap-Peng Tan
With the proliferation of wireless services, multimedia interactivities are quickly becoming ubiquitous. As multimedia traffics generally have large packets volume, high data rate requirements in wireless transmission are critical. Next generation wireless systems, e.g., multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM), provide high throughput and support flexible resource management strategies for multimedia services. By fully exploiting spatial, temporal, and frequency diversities of MIMO-OFDM systems, intelligent resource allocation schemes can increase the overall performance of the multimedia streaming system significantly. In this paper, we describe a general framework of cross-layer resource allocation design for scalable video transmission over multiuser MIMO-OFDM systems. Scalable video coding provides an efficient solution for video adaptation to satisfy diverse requirements from heterogeneous mobile clients according to their system specifications and channel conditions. Generally, the base layer of a scalable video bitstream is more important than the enhancement layer as the enhancement layer can only be used for decoding if the base layer is available. Scalable video packets are entitled with different priorities in video reconstructions. Adaptation can be achieved by discarding some enhancement layer packets when network is congested. Based on the characteristics of scalable video, our objective is to optimize the overall system performance for multiple scalable video downlink over the Space Division Multiple Access (SDMA)-OFDM system from a multiple-antenna base station. Our cross-layer optimization is achieved by jointly linking packet prioritization from application layer and radio resource allocation at the physical layer. Based on packet priority of scalable video, time-frequency resource, power and modulation schemes are adaptively selected based on a prioritized water filling algorithm to maximize the overall system performance and to ensure fairness among different users. The performance of the proposed strategy is demonstrated by experimental comparisons with conventional radio resource allocation schemes.
{"title":"Scalable video transmission over multiuser MIMO-OFDM systems","authors":"M. Li, Zhenzhong Chen, Yap-Peng Tan","doi":"10.4108/CHINACOM.2010.115","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.115","url":null,"abstract":"With the proliferation of wireless services, multimedia interactivities are quickly becoming ubiquitous. As multimedia traffics generally have large packets volume, high data rate requirements in wireless transmission are critical. Next generation wireless systems, e.g., multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM), provide high throughput and support flexible resource management strategies for multimedia services. By fully exploiting spatial, temporal, and frequency diversities of MIMO-OFDM systems, intelligent resource allocation schemes can increase the overall performance of the multimedia streaming system significantly. In this paper, we describe a general framework of cross-layer resource allocation design for scalable video transmission over multiuser MIMO-OFDM systems. Scalable video coding provides an efficient solution for video adaptation to satisfy diverse requirements from heterogeneous mobile clients according to their system specifications and channel conditions. Generally, the base layer of a scalable video bitstream is more important than the enhancement layer as the enhancement layer can only be used for decoding if the base layer is available. Scalable video packets are entitled with different priorities in video reconstructions. Adaptation can be achieved by discarding some enhancement layer packets when network is congested. Based on the characteristics of scalable video, our objective is to optimize the overall system performance for multiple scalable video downlink over the Space Division Multiple Access (SDMA)-OFDM system from a multiple-antenna base station. Our cross-layer optimization is achieved by jointly linking packet prioritization from application layer and radio resource allocation at the physical layer. Based on packet priority of scalable video, time-frequency resource, power and modulation schemes are adaptively selected based on a prioritized water filling algorithm to maximize the overall system performance and to ensure fairness among different users. The performance of the proposed strategy is demonstrated by experimental comparisons with conventional radio resource allocation schemes.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131992233","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}
A critical issue encountered in implementing a bus signal priority system is to ensure a trade-off between the delay of a bus and the surrounding traffic. Traditional BSP methods treat buses uniformly so that an empty bus may have the same priority to the full loaded bus, and lead to an excessive delay for private traffic. However, with RFID technique, a control model can realize delicate control mode by identifying and acquiring more detailed, real-time and dynamic data on the bus. Hence, An intelligent method for determing bus priority based on RFID is proposed, assuming two-objective optimization of both on-bus passengers' total delay and private vehicles total delay. The result is a considerable reduction in private traffic delay with higher traffic volume when using bus signal priority. What's more, the proposed control method could also be applied to the coordination of similar complex cyber-physical systems.
{"title":"Multi-objective model reference adaptive bus priority based on RFID","authors":"Guangyuan Wang, Guozhen Tan, Yaodong Wang","doi":"10.4108/IWIOT.2010.6","DOIUrl":"https://doi.org/10.4108/IWIOT.2010.6","url":null,"abstract":"A critical issue encountered in implementing a bus signal priority system is to ensure a trade-off between the delay of a bus and the surrounding traffic. Traditional BSP methods treat buses uniformly so that an empty bus may have the same priority to the full loaded bus, and lead to an excessive delay for private traffic. However, with RFID technique, a control model can realize delicate control mode by identifying and acquiring more detailed, real-time and dynamic data on the bus. Hence, An intelligent method for determing bus priority based on RFID is proposed, assuming two-objective optimization of both on-bus passengers' total delay and private vehicles total delay. The result is a considerable reduction in private traffic delay with higher traffic volume when using bus signal priority. What's more, the proposed control method could also be applied to the coordination of similar complex cyber-physical systems.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114120260","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.19
Feng Wang, Zhifeng Zhao, Honggang Zhang
This paper proposes a new multiuser scheduling scheme for MIMO system that can simultaneously support various QoS requirements of different user groups while satisfying fairness among the same user group in a RRS (Round Robin Scheme) manner. To guarantee high transmission reliability, a cross-layer scheme is adopted by combing spatial diversity in the physical layer and systematic Raptor code in the MAC layer. The delay-sensitive users are scheduled with higher priority. When only one user is chosen at each time slot, spatial diversity is adopted to guarantee a low BER. Furthermore, if Nt users are chosen at each time slot, AA-RRS (Antenna Assisted Round Robin Scheme) is adopted to improve the system capacity, which is brought by the inherent multiuser diversity of the MIMO system. Simulation results demonstrate that the proposed cross-layer scheduling scheme can guarantee a much higher reliability than spatial diversity transmission with only a small increase of delay.
本文提出了一种新的MIMO系统多用户调度方案，该方案以RRS (Round Robin scheme)的方式同时支持不同用户组的各种QoS需求，同时满足同一用户组之间的公平性。为了保证较高的传输可靠性，采用了物理层空间分集和MAC层系统Raptor码相结合的跨层方案。对延迟敏感的用户优先级更高。当每个时隙只选择一个用户时，采用空间分集来保证低误码率。此外，如果在每个时隙选择Nt个用户，则采用天线辅助轮询方案AA-RRS (Antenna Assisted Round Robin Scheme)来提高MIMO系统固有的多用户分集带来的系统容量。仿真结果表明，所提出的跨层调度方案能够保证比空间分集传输高得多的可靠性，且延迟增加很小。
{"title":"Rateless code in QoS-based multiuser scheduling for MIMO systems","authors":"Feng Wang, Zhifeng Zhao, Honggang Zhang","doi":"10.4108/CHINACOM.2010.19","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.19","url":null,"abstract":"This paper proposes a new multiuser scheduling scheme for MIMO system that can simultaneously support various QoS requirements of different user groups while satisfying fairness among the same user group in a RRS (Round Robin Scheme) manner. To guarantee high transmission reliability, a cross-layer scheme is adopted by combing spatial diversity in the physical layer and systematic Raptor code in the MAC layer. The delay-sensitive users are scheduled with higher priority. When only one user is chosen at each time slot, spatial diversity is adopted to guarantee a low BER. Furthermore, if Nt users are chosen at each time slot, AA-RRS (Antenna Assisted Round Robin Scheme) is adopted to improve the system capacity, which is brought by the inherent multiuser diversity of the MIMO system. Simulation results demonstrate that the proposed cross-layer scheduling scheme can guarantee a much higher reliability than spatial diversity transmission with only a small increase of delay.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132148666","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
扫码关注我们
求助内容：
应助结果提醒方式：