发布求助
文献互助 智能选刊 最新文献

2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)最新文献

筛选
英文 中文
Multi-node-cooperative AODV based on cross-layer 基于跨层的多节点协作AODV
2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) Pub Date : 2011-08-17 DOI: 10.1109/ChinaCom.2011.6158177
Liang Ye, Deying Chen, X. Sha
{"title":"Multi-node-cooperative AODV based on cross-layer","authors":"Liang Ye, Deying Chen, X. Sha","doi":"10.1109/ChinaCom.2011.6158177","DOIUrl":"https://doi.org/10.1109/ChinaCom.2011.6158177","url":null,"abstract":"According to the instability of links in mobile Ad hoc networks, this paper put forward a cross-layered multi-node-cooperative routing protocol AODV-CLC, based on a multi-route AODV. If the signal power between a certain node and the transmitter, as well as the power between it and the receiver, was larger than that between the transmitter and the receiver, the node became a candidate partner. One transmitter chose one partner by the signal power, and one partner served only one transmitter. When receiving a packet, the partner started a timer. If the partner had not received the receiver's ACK when the timer ran out, it retransmitted the packet. The timer was set shorter than the MAC retry interval, so the partner could access the channel before the transmitter. The partner also offered ACK cooperation to reduce unnecessary retransmissions by the transmitter. If the link between the cooperator and the transmitter (or the receiver) broke, the cooperation was canceled. According to the simulation results, AODV-CLC had a smaller delay and delay jitter while a higher packet delivery ratio than the existing routing protocol. However, because of the cooperation messages, AODV-CLC evolved in additional control message cost.","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133972687","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}
引用次数: 1
An improved SLM cascade with iterative TR method for PAPR reduction in OFDM system 一种改进的SLM级联迭代TR法用于OFDM系统中PAPR的降低
2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) Pub Date : 2011-08-17 DOI: 10.1109/ChinaCom.2011.6158133
Dong Hyun Choi, K. Won, Hyung-Jin Choi
{"title":"An improved SLM cascade with iterative TR method for PAPR reduction in OFDM system","authors":"Dong Hyun Choi, K. Won, Hyung-Jin Choi","doi":"10.1109/ChinaCom.2011.6158133","DOIUrl":"https://doi.org/10.1109/ChinaCom.2011.6158133","url":null,"abstract":"In this paper, we propose an improved selective mapping (SLM) cascaded with iterative tone reservation (TR) method for peak-to average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) system. In the simple SLM cascaded with iterative TR method, the candidate signal which has the minimum PAPR is selected. However, since the number of iteration L of the largest peak values will be reduced by TR, in the proposed method, the candidate signal which has the minimum (L+1)th peak to average power ratio is selected among other candidates in the SLM process. From the performance comparisons between various PAPR reduction methods, we verified that the PAPR reduction performance of the proposed method achieves the better reduction performance and power efficiency.","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134025166","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}
引用次数: 1
Utility-based joint routing and scheduling in OFDMA cellular relay networks with traffic prioritization 具有流量优先级的OFDMA蜂窝中继网络中基于效用的联合路由与调度
2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) Pub Date : 2011-08-17 DOI: 10.1109/ChinaCom.2011.6158134
Jian Liang, Hui Yin, Haokai Chen, Zhongnian Li, Shouyin Liu
{"title":"Utility-based joint routing and scheduling in OFDMA cellular relay networks with traffic prioritization","authors":"Jian Liang, Hui Yin, Haokai Chen, Zhongnian Li, Shouyin Liu","doi":"10.1109/ChinaCom.2011.6158134","DOIUrl":"https://doi.org/10.1109/ChinaCom.2011.6158134","url":null,"abstract":"This paper researches the utility-based resource allocation problem in a real-time and non-real-time traffics mixed OFDMA cellular relay network to exploit the potentiality of relay. In order to apply utility theory to obtain an efficient tradeoff between throughput and fairness as well as satisfy the delay requirements of real-time traffic, a joint routing and scheduling scheme is proposed to resolve the resource allocation problem. Additionally, a low-complexity iterative algorithm is introduced to realize the scheme. Numerical results indicate that besides meet the delay requirements of real-time traffic, the scheme can effectively achieve the tradeoff between throughput and fairness.","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134213740","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}
引用次数: 1
Combined fast link adaptation algorithm in LTE systems LTE系统中组合快速链路自适应算法
2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) Pub Date : 2011-08-17 DOI: 10.1109/ChinaCom.2011.6158190
Tao Tao, A. Czylwik
{"title":"Combined fast link adaptation algorithm in LTE systems","authors":"Tao Tao, A. Czylwik","doi":"10.1109/ChinaCom.2011.6158190","DOIUrl":"https://doi.org/10.1109/ChinaCom.2011.6158190","url":null,"abstract":"The Fast Link Adaptation (FLA) algorithm is implemented as Channel Quality Indicator (CQI) selection technique in the 3GPP Long Term Evolution (LTE) system. The presented FLA algorithms are Exponential Effective SNR Mapping (EESM) and Mean Mutual Information per coded Bit (MMIB) which utilize the post-processing Signal-to-Interference plus Noise Ratios (SINR) to compute the effective Signal-to-Noise power Ratio (SNR) and mean Mutual Information (MI) as Link Quality Metric (LQM), respectively. The throughput performance of investigated FLA algorithms are presented in this paper. We also propose a joint FLA algorithm which combines EESM and MMIB algorithms. We present our simulation results and show that the proposed FLA algorithm yields higher throughput performance and Packet Error Rate (PER) estimation accuracy, compared to conventional FLA schemes. Simultaneously, the computation complexity does not increase much.","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132144557","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}
引用次数: 4
QoS guaranteed radio resource allocation scheme using Genetic Algorithm for OFDMA 基于遗传算法的OFDMA无线资源分配方案
2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) Pub Date : 2011-08-17 DOI: 10.1109/ChinaCom.2011.6158224
Juejia Zhou, X. She, Lan Chen, H. Otsuka
{"title":"QoS guaranteed radio resource allocation scheme using Genetic Algorithm for OFDMA","authors":"Juejia Zhou, X. She, Lan Chen, H. Otsuka","doi":"10.1109/ChinaCom.2011.6158224","DOIUrl":"https://doi.org/10.1109/ChinaCom.2011.6158224","url":null,"abstract":"OFDMA (Orthogonal Frequency-Division Multiple Access) is one of the most important technologies applied in Long Term Evolution (LTE) of wireless radio system [1]. In OFDMA system, dynamic resource block (RB) allocation is utilized as the effective way to achieve multi-user diversity gain, and also the factor which will greatly affect the QoS (Quality of Service) performance of each UE (User Equipment). Along with the development of future wireless communication systems, the QoS requirement has been led to more complex situations and will be affected by various aspects, e.g. network architecture and services with multiple traffics. The traditional resource allocation schemes based on PF (Proportional Fair) or MAXCI (Maximal C/I) perform the greedy searching, and will encounter problems to effectively fulfill the complicated QoS request. In this paper, aiming at various GBR (Guaranteed Bit Rate) requests of each UE, the Genetic Algorithm (GA) based resource allocation algorithm is proposed. The algorithm gains the merit of heuristics, and introduces efficient crossover rules and fitness function to rapidly approach to the optimal resource allocation regarding to different GBR requests of UEs. The system evaluation shows that GA based algorithm owns visibly superior performance at satisfying UEs' QoS request and average system throughput than other contrast schemes.","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129819603","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}
引用次数: 8
An energy-computation-efficient (ECE) method for mobile localization in sensor networks 一种能量计算效率高的传感器网络移动定位方法
2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) Pub Date : 2011-08-17 DOI: 10.1109/ChinaCom.2011.6158176
Lingwen Zhang, Gang Yang
{"title":"An energy-computation-efficient (ECE) method for mobile localization in sensor networks","authors":"Lingwen Zhang, Gang Yang","doi":"10.1109/ChinaCom.2011.6158176","DOIUrl":"https://doi.org/10.1109/ChinaCom.2011.6158176","url":null,"abstract":"In sensor network, vehicle location is mostly determined by sensor group. Each sensor is equipped with an antenna array to measure the angle of arrival from a mobile vehicle. Complicated array signals are processed at sensors, which leads to large energy consumption. This paper presents a novel localization scheme where processing unit is not required at sensors. In addition, a computation efficient algorithm is designed for angle of arrival estimation. Compared with sensor-based approaches, this method relieves the requirements of sensor size and energy consumption and reduces communication and computation overhead. The simulation results show that the proposed method is potentially suitable for mobile vehicle localization.","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128509166","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}
引用次数: 0
Rapid deployment of APs in WLAN indoor positioning system WLAN室内定位系统中ap的快速部署
2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) Pub Date : 2011-08-17 DOI: 10.1109/ChinaCom.2011.6158161
Ying He, W. Meng, Lin Ma, Zhian Deng
{"title":"Rapid deployment of APs in WLAN indoor positioning system","authors":"Ying He, W. Meng, Lin Ma, Zhian Deng","doi":"10.1109/ChinaCom.2011.6158161","DOIUrl":"https://doi.org/10.1109/ChinaCom.2011.6158161","url":null,"abstract":"With the increasing needs of people for indoor location based service, wireless indoor location technology has made a great development. In order to improve indoor positioning accuracy, how to find appropriate number of access points and how to deploy them are key issues. In this paper, we present an optimal algorithm for access points deployment in WLAN indoor localization system. First, we demonstrate the theoretical foundation of this algorithm and then mathematical model and process of the optimal algorithm are described in detail. The final results of simulation show that the optimal algorithm proposed in this paper can give the reasonable number and deployment of APs which provide higher location accuracy for users.","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128661993","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}
引用次数: 27
A new joint feedback and scheduling scheme based on the users' satisfaction 一种基于用户满意度的联合反馈调度新方案
2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) Pub Date : 2011-08-17 DOI: 10.1109/ChinaCom.2011.6158113
Ying Yang, Xiaohui Chen, Weidong Wang
{"title":"A new joint feedback and scheduling scheme based on the users' satisfaction","authors":"Ying Yang, Xiaohui Chen, Weidong Wang","doi":"10.1109/ChinaCom.2011.6158113","DOIUrl":"https://doi.org/10.1109/ChinaCom.2011.6158113","url":null,"abstract":"In this paper, a new joint feedback and scheduling scheme based on the users' satisfaction has been proposed. The scheme divides the users into different groups based on the QOS of users and calculates the users' satisfaction. Based on the satisfaction, the scheme takes it as scheduling weight of ZFBF-SUS in real-time users. Also, the scheduling weight of non-real-time users has been analyzed. It shows that the PDF of the scheduling weight of non-real-time users is given by gamma distribution. Furthermore, an appropriate feedback threshold has been derived. The scheme tradeoff the users' satisfaction, system sum-rate and feedback ratio. It reduces the feedback ratio effectively and proves the average of users' satisfaction with little decreasing of system sum-rate.","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132725912","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}
引用次数: 0
A novel traffic analysis method For PoC over LTE based on retrial calling model 基于重审呼叫模型的LTE对讲话务分析新方法
2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) Pub Date : 2011-08-17 DOI: 10.1109/ChinaCom.2011.6158257
Lin Ma, Shouming Wei, Wei Qiang
{"title":"A novel traffic analysis method For PoC over LTE based on retrial calling model","authors":"Lin Ma, Shouming Wei, Wei Qiang","doi":"10.1109/ChinaCom.2011.6158257","DOIUrl":"https://doi.org/10.1109/ChinaCom.2011.6158257","url":null,"abstract":"With the extensive use of the Internet and the rapid development of telecommunication technology, communication services become increasingly variety. Many new technologies promotes, such as one of the important applications PoC service over LTE based on the IP Multimedia Subsystem. According to this service requirement, blocking probability is desired to be low enough for the recall which occurs more often for PoC service. So in this paper, based on the analysis of the PoC over LTE system architecture, we propose to make a proper queuing model by using of the Queuing theory. Extended Erlang B formula is improved by implementing a more appropriate formula that is suit for the PoC over LTE. And the retrial calling percentage is concerned in the proposed model. The simulation result shows that the proposed method is more accurate and performs well to predict the blocking probability.","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"213 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133387705","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}
引用次数: 7
A service-oriented dynamic trust vector model for ad hoc networks 面向服务的自组织网络动态信任向量模型
2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) Pub Date : 2011-08-17 DOI: 10.1109/ChinaCom.2011.6158229
Li Yu, Fei Xiong, W. Cheng, Wei Wang, Hui Li
{"title":"A service-oriented dynamic trust vector model for ad hoc networks","authors":"Li Yu, Fei Xiong, W. Cheng, Wei Wang, Hui Li","doi":"10.1109/ChinaCom.2011.6158229","DOIUrl":"https://doi.org/10.1109/ChinaCom.2011.6158229","url":null,"abstract":"In service oriented architecture, Quality of Service (QoS) is an important index for an interaction or a cooperation in network. Whereas, considering the particular properties of service, more attention needs to be paid to the transmission environment and the requirement of service. In this paper, we introduce a trust vector to evaluate the network, including secondhand information and propose a fast-decreasing, slow-increasing trust management system, which incarnates a punishment to malicious behaviors. Also, a routing approach based on trust vector to select the most appropriate routing for services is proposed. And a simulation is given in the end, which shows a better performance of trust vector model","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116120219","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信