Pub Date : 2010-08-01DOI: 10.4108/CHINACOM.2010.36
Mang Liao, Kai Liu
This paper presents a distributed adaptive QoS medium access control (DAQ-MAC) protocol for mobile ad hoc networks. The protocol assigns nodes accessing channel in three phases: the prioritization phase, the contention phase and the transmission phase. The prioritizations of data packets are expressed by a few binary signed digits. In the prioritization phase, when binary signed digit is “0”, nodes sense the channel by a Tslot, while binary signed digit is “1”, nodes send a forecast bursts (FB). Therefore, every node can differentiate the priorities by sending FB and sensing the channel. Thus only the nodes with higher priority packets can access in the contention phase. In the contention phase, only one node can access in the channel successfully without collisions by collision resolution algorithm. Simulation results show that with the number of the node increasing, the performance of the DAQ-MAC protocol is better than the HIPERLAN Type 1 (HIgh Performance Radio Local Area Networks) protocol in terms of throughput, average packets discard rate and average packet delay.
提出了一种适用于移动自组织网络的分布式自适应QoS介质访问控制(DAQ-MAC)协议。协议将节点访问通道划分为三个阶段:优先级阶段、争用阶段和传输阶段。数据包的优先级由几个二进制有符号数字表示。在优先级阶段，当二进制有符号数为“0”时，节点以一个tlot感知信道，当二进制有符号数为“1”时，节点发送一个预测突发(FB)。因此，每个节点可以通过发送FB和感知信道来区分优先级。因此，只有具有较高优先级数据包的节点才能在争用阶段访问。在争用阶段，通过冲突解析算法，通道中只有一个节点可以成功访问而不发生冲突。仿真结果表明，随着节点数量的增加，DAQ-MAC协议在吞吐量、平均数据包丢弃率和平均数据包延迟方面都优于HIPERLAN Type 1 (HIgh performance Radio Local Area Networks)协议。
{"title":"A distributed adaptive QoS MAC protocol for mobile ad hoc networks","authors":"Mang Liao, Kai Liu","doi":"10.4108/CHINACOM.2010.36","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.36","url":null,"abstract":"This paper presents a distributed adaptive QoS medium access control (DAQ-MAC) protocol for mobile ad hoc networks. The protocol assigns nodes accessing channel in three phases: the prioritization phase, the contention phase and the transmission phase. The prioritizations of data packets are expressed by a few binary signed digits. In the prioritization phase, when binary signed digit is “0”, nodes sense the channel by a Tslot, while binary signed digit is “1”, nodes send a forecast bursts (FB). Therefore, every node can differentiate the priorities by sending FB and sensing the channel. Thus only the nodes with higher priority packets can access in the contention phase. In the contention phase, only one node can access in the channel successfully without collisions by collision resolution algorithm. Simulation results show that with the number of the node increasing, the performance of the DAQ-MAC protocol is better than the HIPERLAN Type 1 (HIgh Performance Radio Local Area Networks) protocol in terms of throughput, average packets discard rate and average packet delay.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"60 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":"127057857","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.47
Jenhui Chen, Yu-Lin Li
The efficiency of power saving mechanism on wireless communications will influence the time the mobile stations (MSs) can operate. Due to the characteristics of centralized control in WiMAX system, the sleeping period of each subscriber is dominated by a base station (BS) based on their service types, traffic loads, and expected sleeping periods. The power saving mechanism uses an exponential backoff sleeping window manner to determine the sleeping period of each MS. In recent researches, some of them optimize the sleeping period by estimating the packet inter-arrival time for improving the energy efficient. However, those mechanisms do not reflect the relationship between the traffic load and available bandwidth. That is, according to the available and priorities of connections, the lower priority connections can not receive data immediately and waste energy on the waiting time. Thus, in this paper, we propose an adaptive traffic indication algorithm (ATIA) to let MSS do the extend sleep on bandwidth unavailable condition, and illustrate an adaptively adjusting sleeping window scheme for delay versus energy consumption. Simulation results show that ATIA increase the degree of power saving with comparison to IEEE 802.16e; and further, it shows that ATIA is capable of combining with other power saving mechanisms and improve performance.
{"title":"Adaptive traffic indication algorithm for energy efficiency in IEEE 802.16e systems","authors":"Jenhui Chen, Yu-Lin Li","doi":"10.4108/CHINACOM.2010.47","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.47","url":null,"abstract":"The efficiency of power saving mechanism on wireless communications will influence the time the mobile stations (MSs) can operate. Due to the characteristics of centralized control in WiMAX system, the sleeping period of each subscriber is dominated by a base station (BS) based on their service types, traffic loads, and expected sleeping periods. The power saving mechanism uses an exponential backoff sleeping window manner to determine the sleeping period of each MS. In recent researches, some of them optimize the sleeping period by estimating the packet inter-arrival time for improving the energy efficient. However, those mechanisms do not reflect the relationship between the traffic load and available bandwidth. That is, according to the available and priorities of connections, the lower priority connections can not receive data immediately and waste energy on the waiting time. Thus, in this paper, we propose an adaptive traffic indication algorithm (ATIA) to let MSS do the extend sleep on bandwidth unavailable condition, and illustrate an adaptively adjusting sleeping window scheme for delay versus energy consumption. Simulation results show that ATIA increase the degree of power saving with comparison to IEEE 802.16e; and further, it shows that ATIA is capable of combining with other power saving mechanisms and improve performance.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"31 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":"129980045","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.60
L. Brewka, H. Wessing, L. Dittmann
Preemption is a common approach for QoS provisioning in multiservice and multiuser networks where the network resources are exhausted. This paper focuses on the analysis of the lightweight algorithms for the UPnP QoS Architecture where the decision about preemption is made by computation power limited home gateway. Based on the data obtained, the comparison of the proposed algorithms shows that the performance of simple methods can give satisfying rejection and preemption rates.
{"title":"Evaluation of lightweight preemption algorithms for UPnP QoS Architecture","authors":"L. Brewka, H. Wessing, L. Dittmann","doi":"10.4108/CHINACOM.2010.60","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.60","url":null,"abstract":"Preemption is a common approach for QoS provisioning in multiservice and multiuser networks where the network resources are exhausted. This paper focuses on the analysis of the lightweight algorithms for the UPnP QoS Architecture where the decision about preemption is made by computation power limited home gateway. Based on the data obtained, the comparison of the proposed algorithms shows that the performance of simple methods can give satisfying rejection and preemption rates.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"52 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":"129826043","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.14
Xiaoming Dai, Shaohui Sun, Xiangming Li, Yingmin Wang
In this work, we present two high-rate quasi-orthogonal space-time coding (STC) schemes for three and four transmit antennas which are designed in conjunction with the serial interference cancellation (SIC) based receiver. The symbols of the proposed STCs are of judiciously designed diversity order which can be effectively exploited by the SIC based receiver to cancel interference as well as to obtain diversity gain. The proposed STC schemes' amicable quasi-orthogonal structures lend themselves to efficient low-complexity linear decoding. Simulation results show that the proposed STC schemes achieve better diversity-multiplexing tradeoffs than the existing conventional schemes.
{"title":"Two high-rate space-time codes for three and four transmit antennas with good diversity-multiplexing tradeoffs","authors":"Xiaoming Dai, Shaohui Sun, Xiangming Li, Yingmin Wang","doi":"10.4108/CHINACOM.2010.14","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.14","url":null,"abstract":"In this work, we present two high-rate quasi-orthogonal space-time coding (STC) schemes for three and four transmit antennas which are designed in conjunction with the serial interference cancellation (SIC) based receiver. The symbols of the proposed STCs are of judiciously designed diversity order which can be effectively exploited by the SIC based receiver to cancel interference as well as to obtain diversity gain. The proposed STC schemes' amicable quasi-orthogonal structures lend themselves to efficient low-complexity linear decoding. Simulation results show that the proposed STC schemes achieve better diversity-multiplexing tradeoffs than the existing conventional schemes.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"125 4 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":"126282467","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 contribution, an analytical expression is derived for the correlation matrix of the multiple-input multiple-output (MIMO) propagation channel for the amplify-and-forward relay transmission systems. In order to understand the cross-correlation mechanism, we derive the spatial correlation of two arbitrary channels between the source and the destination via relay stations in terms of the direction-delay spread functions of the links. The results show that the coherent components that exist in the channels between the source and the relay stations and in the channels between the destination and the relay stations lead to the non-zero cross-correlation among the links. Channel measurement results in two indoor environments are used to illustrate the existence of cross-correlation among the channels with the link ends located in different environments. These observations together with the theoretical work indicate that it is possible to use the geometry-based approaches that take into account the properties of the propagation environments to model the spatial correlation matrix of the multi-link MIMO channels.
{"title":"Spatial cross-correlation of multilink propagation channels in amplify-and-forward relay systems","authors":"X. Yin","doi":"10.4108/IWONCMM.2010.11","DOIUrl":"https://doi.org/10.4108/IWONCMM.2010.11","url":null,"abstract":"In this contribution, an analytical expression is derived for the correlation matrix of the multiple-input multiple-output (MIMO) propagation channel for the amplify-and-forward relay transmission systems. In order to understand the cross-correlation mechanism, we derive the spatial correlation of two arbitrary channels between the source and the destination via relay stations in terms of the direction-delay spread functions of the links. The results show that the coherent components that exist in the channels between the source and the relay stations and in the channels between the destination and the relay stations lead to the non-zero cross-correlation among the links. Channel measurement results in two indoor environments are used to illustrate the existence of cross-correlation among the channels with the link ends located in different environments. These observations together with the theoretical work indicate that it is possible to use the geometry-based approaches that take into account the properties of the propagation environments to model the spatial correlation matrix of the multi-link MIMO channels.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"10 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":"126366990","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.127
I. Santamaría, J. Vía, A. Nazábal, C. Lameiro
In this paper we characterize the capacity boundary of the two-user multiple-input multiple-output (MIMO) broadcast channel (BC) when the multiantenna terminals use analog beamforming at both sides of the link. Basically, the problem reduces to finding the optimal transmit direction and the optimal power allocation between users to operate at any point on the boundary. We show that both optimization problems can be solved in closed form. First, exploiting the fact that any Pareto optimal pair of rates must also be Pareto optimal of a convex region defined by the channel energies, the optimal transmit direction is shown to be the principal eigenvector of a matrix. Second, the optimal power allocation is obtained by exploiting again the Pareto optimality of the sought pair of rates. Although this paper focuses on the BC, the obtained results also serve to characterize the dual multiple-access channel (MAC). Moreover, this explicit characterization of the boundary can be extended to a K-user system for K>;2. Numerical examples are provided to illustrate the results of the paper, and to show the enlargement of the capacity region achieved by analog beamforming in comparison to a single-input single-output (SISO) BC.
{"title":"Capacity region of the multiantenna Gaussian broadcast channel with analog Tx-Rx beamforming","authors":"I. Santamaría, J. Vía, A. Nazábal, C. Lameiro","doi":"10.4108/CHINACOM.2010.127","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.127","url":null,"abstract":"In this paper we characterize the capacity boundary of the two-user multiple-input multiple-output (MIMO) broadcast channel (BC) when the multiantenna terminals use analog beamforming at both sides of the link. Basically, the problem reduces to finding the optimal transmit direction and the optimal power allocation between users to operate at any point on the boundary. We show that both optimization problems can be solved in closed form. First, exploiting the fact that any Pareto optimal pair of rates must also be Pareto optimal of a convex region defined by the channel energies, the optimal transmit direction is shown to be the principal eigenvector of a matrix. Second, the optimal power allocation is obtained by exploiting again the Pareto optimality of the sought pair of rates. Although this paper focuses on the BC, the obtained results also serve to characterize the dual multiple-access channel (MAC). Moreover, this explicit characterization of the boundary can be extended to a K-user system for K>;2. Numerical examples are provided to illustrate the results of the paper, and to show the enlargement of the capacity region achieved by analog beamforming in comparison to a single-input single-output (SISO) BC.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"77 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":"126586243","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}
Multiple Bluetooth piconets are likely to co-exist in a physical environment, supporting many wireless applications. An independently operating Bluetooth piconet will inevitably encounter mutual interference from collocated piconets, which results in individual piconet and overall scatternet performance degradation. In this paper, the throughput performance of Bluetooth piconet is studied and evaluated as the number of interfering piconets is increased considering that the frequency hopping mechanism in Bluetooth piconets is not a totally random process. Several different simulations were performed with varying inter-piconet time offset in order to represent the effects of different packet sizes, symmetric / asymmetric transmission, synchronized / unsynchronized data packets, and different traffic loads with non equal probabilities of collision for different packet sizes. Results proved that certain packets sizes can achieve higher throughput depending on type, size, and number of interferers. Throughput improvement may be achieved in the presence of interference by changing the packet size in the piconet. It was also verified that an optimum traffic load could be reached to achieve maximum throughput for each number of piconets.
{"title":"Interference impact on throughput performance of Bluetooth scatternets under different traffic loads","authors":"K. Morsi, Gao Qiang, Xiong Huagang","doi":"10.4108/CHINACOM.2010.8","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.8","url":null,"abstract":"Multiple Bluetooth piconets are likely to co-exist in a physical environment, supporting many wireless applications. An independently operating Bluetooth piconet will inevitably encounter mutual interference from collocated piconets, which results in individual piconet and overall scatternet performance degradation. In this paper, the throughput performance of Bluetooth piconet is studied and evaluated as the number of interfering piconets is increased considering that the frequency hopping mechanism in Bluetooth piconets is not a totally random process. Several different simulations were performed with varying inter-piconet time offset in order to represent the effects of different packet sizes, symmetric / asymmetric transmission, synchronized / unsynchronized data packets, and different traffic loads with non equal probabilities of collision for different packet sizes. Results proved that certain packets sizes can achieve higher throughput depending on type, size, and number of interferers. Throughput improvement may be achieved in the presence of interference by changing the packet size in the piconet. It was also verified that an optimum traffic load could be reached to achieve maximum throughput for each number of piconets.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"37 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":"127816847","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.44
Xin Ge, Wen-jing Kang, Xingpeng Mao, Gong-liang Liu
Call admission control (CAC) is one of the most important issues for radio resource management of wireless communication systems, which has been widely investigated. However, the computational complexity of the CAC algorithm is still a stringent concern. The performance of interleave-division multiple-access (IDMA) system can be assessed by tracking signal-to-interference-plus-noise ratio (SINR) evolution of the iterative chip-by-chip (CBC) detection process. Based on this semi-analytical technique, a novel CAC algorithm, which makes resource estimation in advance by using the solution obtained from SINR evolution, is proposed to give a simple solution without compromising performance for CAC algorithm in IDMA systems. Besides, the effect of the base station multiuser detection (MUD) on the CAC algorithm is evaluated. It is shown that with the high efficiency of CBC MUD, a high throughput and a low blocking and dropping probability for multimedia users can be expected.
{"title":"Call admission control algorithm for IDMA system based on SINR evolution","authors":"Xin Ge, Wen-jing Kang, Xingpeng Mao, Gong-liang Liu","doi":"10.4108/CHINACOM.2010.44","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.44","url":null,"abstract":"Call admission control (CAC) is one of the most important issues for radio resource management of wireless communication systems, which has been widely investigated. However, the computational complexity of the CAC algorithm is still a stringent concern. The performance of interleave-division multiple-access (IDMA) system can be assessed by tracking signal-to-interference-plus-noise ratio (SINR) evolution of the iterative chip-by-chip (CBC) detection process. Based on this semi-analytical technique, a novel CAC algorithm, which makes resource estimation in advance by using the solution obtained from SINR evolution, is proposed to give a simple solution without compromising performance for CAC algorithm in IDMA systems. Besides, the effect of the base station multiuser detection (MUD) on the CAC algorithm is evaluated. It is shown that with the high efficiency of CBC MUD, a high throughput and a low blocking and dropping probability for multimedia users can be expected.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"235 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":"121142661","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.131
R. Chang, Chia-Ming Wu
Information and communication technology (ICT) profoundly impacts on environment because of its large amount of CO2 emissions. In the past years, the research field of “green” and low power consumption networking infrastructures is of great importance for both service/network providers and equipment manufacturers. An emerging technology called cloud computing can increase the utilization and efficiency of hardware equipments. It can potentially reduce the global CO2 emission. In this paper, we propose a virtual network architecture for cloud computing. Our virtual network can provide communication functions for virtual resources in cloud computing. We design an energy aware routing algorithm for our virtual router. We also design an efficient method for setting up the virtual network. The objective is to build a “green” virtual network in cloud computing.
{"title":"Green virtual networks for cloud computing","authors":"R. Chang, Chia-Ming Wu","doi":"10.4108/CHINACOM.2010.131","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.131","url":null,"abstract":"Information and communication technology (ICT) profoundly impacts on environment because of its large amount of CO2 emissions. In the past years, the research field of “green” and low power consumption networking infrastructures is of great importance for both service/network providers and equipment manufacturers. An emerging technology called cloud computing can increase the utilization and efficiency of hardware equipments. It can potentially reduce the global CO2 emission. In this paper, we propose a virtual network architecture for cloud computing. Our virtual network can provide communication functions for virtual resources in cloud computing. We design an energy aware routing algorithm for our virtual router. We also design an efficient method for setting up the virtual network. The objective is to build a “green” virtual network in cloud computing.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"262 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":"123363925","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 a B3G/4G wireless communication system, the users will connect to the network using one of several available radio access technologies. In this paper, we proposed a Q-learning based algorithm for terminals' independent access network selection with the aim of improving the resource utilization and providing the best quality of service with respect to the wireless environment status, network performance and user' requirement. In particular, for the first time we introduced the concept of low-carbon as one of the evaluation indicators of wireless communication performance, in order to reduce the power consumption and achieve a balance between quality and consumption. The proposed scheme is based on the concept of cognitive network, which has been proposed recently by the motivation of complexity, heterogeneity and reliability requirements of tomorrow's network and the cognitive pilot channel used in it. The performance of the access network selection algorithm is shown in the simulation and it can be seen that this algorithm significantly reduced the blockrate and power consumption as well as increased the throughput compared with random accessing approach. In future work, we will continue to research on the effective access network selection algorithm and try to introduce the low-carbon indicator to other aspects of the wireless communication system.
{"title":"A novel access network selection scheme using Q-learning algorithm for cognitive terminal","authors":"Haifeng Tan, Yizhe Li, Yami Chen, Li Tan, Qian Li","doi":"10.4108/CRNET.2010.2","DOIUrl":"https://doi.org/10.4108/CRNET.2010.2","url":null,"abstract":"In a B3G/4G wireless communication system, the users will connect to the network using one of several available radio access technologies. In this paper, we proposed a Q-learning based algorithm for terminals' independent access network selection with the aim of improving the resource utilization and providing the best quality of service with respect to the wireless environment status, network performance and user' requirement. In particular, for the first time we introduced the concept of low-carbon as one of the evaluation indicators of wireless communication performance, in order to reduce the power consumption and achieve a balance between quality and consumption. The proposed scheme is based on the concept of cognitive network, which has been proposed recently by the motivation of complexity, heterogeneity and reliability requirements of tomorrow's network and the cognitive pilot channel used in it. The performance of the access network selection algorithm is shown in the simulation and it can be seen that this algorithm significantly reduced the blockrate and power consumption as well as increased the throughput compared with random accessing approach. In future work, we will continue to research on the effective access network selection algorithm and try to introduce the low-carbon indicator to other aspects of the wireless communication system.","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":"132600448","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
扫码关注我们
求助内容：
应助结果提醒方式：