2012 International Conference on Connected Vehicles and Expo (ICCVE)最新文献

筛选
英文 中文
Analysis of Maximum Power Reduction of Uplink for Carrier Aggregation in LTE-A System LTE-A载波汇聚系统中上行链路最大功率降耗分析
2012 International Conference on Connected Vehicles and Expo (ICCVE) Pub Date : 2012-12-12 DOI: 10.1109/ICCVE.2012.17
Banglong Xiong, Xinning Zhu, Wei Li, Gan Guo
{"title":"Analysis of Maximum Power Reduction of Uplink for Carrier Aggregation in LTE-A System","authors":"Banglong Xiong, Xinning Zhu, Wei Li, Gan Guo","doi":"10.1109/ICCVE.2012.17","DOIUrl":"https://doi.org/10.1109/ICCVE.2012.17","url":null,"abstract":"Carrier Aggregation (CA) technique is adopted by LTE-A system to achieve high performance in data rate and spectral efficiency. However, CA technique will drive the Peak to Average Power Ratio (PAPR) of uplink signal to the extreme level. PAPR remains an important issue for a LTE-A User Equipment (UE) because it determines the PA efficiency and the coverage when multi-carrier transmission is employed. The uplink signal with a high level of PAPR will be severely affected by the nonlinearity of Power Amplifier (PA) and brings unacceptable interference into adjacent channels. To mitigate the interference, this paper introduces a well-known linearization technique named back off of UE transmission power and analyzes the factors which actually influence the value of power back off needed represented by Maximum Power Reduction (MPR). Based on theoretical analysis and experimental results, this paper provides credible references to the similar research and the RF design of UE especially in LTE-A system.","PeriodicalId":182453,"journal":{"name":"2012 International Conference on Connected Vehicles and Expo (ICCVE)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126164212","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}
引用次数: 2
A Novel Method to Solve CRS/PDSCH RE Collision in Joint Transmission in LTE-A 一种解决LTE-A联合传输中CRS/PDSCH RE碰撞的新方法
2012 International Conference on Connected Vehicles and Expo (ICCVE) Pub Date : 2012-12-12 DOI: 10.1109/ICCVE.2012.20
Jinghui Xie, Xiaogang Chen, Yuan Zhu, Hongwen Yang, Liyun Dai
{"title":"A Novel Method to Solve CRS/PDSCH RE Collision in Joint Transmission in LTE-A","authors":"Jinghui Xie, Xiaogang Chen, Yuan Zhu, Hongwen Yang, Liyun Dai","doi":"10.1109/ICCVE.2012.20","DOIUrl":"https://doi.org/10.1109/ICCVE.2012.20","url":null,"abstract":"CoMP (Coordinated multi-point) transmission and reception has been studied for deployment types such as heterogeneous networks in LTE-A Rel-11. In this paper, we focus on the CRS (cell-specific reference signal)/PDSCH (Physical Downlink Shared Channel [12]) RE (resource element) collision in downlink joint transmission where different transmission points have different CRS frequency shifts. Since CRS muting scheme with rate matching decreases PDSCH throughput, we propose to send an additional PDSCH RE over the CRS collided PDSCH REs from joint transmission points. With CRS-IC (CRS interference canceling) receiver at UE, this scheme has significant throughput gain over CRS muting in the link level simulation. In addition, this new approach doesn't have negative impact on legacy UE's interference measurements compared with the rate matching scheme.","PeriodicalId":182453,"journal":{"name":"2012 International Conference on Connected Vehicles and Expo (ICCVE)","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133484975","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
Multi-Agent Intersection Management for Connected Vehicles Using an Optimal Scheduling Approach 基于最优调度方法的互联车辆多智能体交叉口管理
2012 International Conference on Connected Vehicles and Expo (ICCVE) Pub Date : 2012-12-12 DOI: 10.1109/ICCVE.2012.41
Qiu Jin, Guoyuan Wu, K. Boriboonsomsin, M. Barth
{"title":"Multi-Agent Intersection Management for Connected Vehicles Using an Optimal Scheduling Approach","authors":"Qiu Jin, Guoyuan Wu, K. Boriboonsomsin, M. Barth","doi":"10.1109/ICCVE.2012.41","DOIUrl":"https://doi.org/10.1109/ICCVE.2012.41","url":null,"abstract":"Today's transportation systems are facing numerous issues resulting from the increased travel demands and limited capacities of roadway infrastructure. As a potential intelligent transportation system (ITS) solution, multi-agent intersection management systems have recently received increased attention with the rapid advance in wireless communications and comprehensive vehicular technologies. Most of the proposed multi-agent system approaches take a FIFO (first-in first-out) approach to time-space occupancy scheduling. However, by also optimizing the departure sequence, greater global benefits are possible. In this paper, we propose a modified multi-agent system with optimal scheduling of Vehicle Agent's (VAs') departure times. Compared with the FIFO-based system developed in the authors' previous work, the modified system can provide more system-wide benefits in terms of mobility, reliability and sustainability. Simulation studies have shown improvements in travel times, but more importantly an approximately 58% reduction in travel time variability and 49%-60% reductions in (partial) stops. These leads to potential benefits in fuel consumption and pollutant emissions, primarily by carefully designing VAs' trajectories through the intersection.","PeriodicalId":182453,"journal":{"name":"2012 International Conference on Connected Vehicles and Expo (ICCVE)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122035054","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}
引用次数: 67
Throughput Upper Bound for Random Wireless Network 随机无线网络的吞吐量上限
2012 International Conference on Connected Vehicles and Expo (ICCVE) Pub Date : 2012-12-12 DOI: 10.1109/ICCVE.2012.25
E. Kalantari, S. K. Malekee, Ehsan Rahimi, H. Nirourang
{"title":"Throughput Upper Bound for Random Wireless Network","authors":"E. Kalantari, S. K. Malekee, Ehsan Rahimi, H. Nirourang","doi":"10.1109/ICCVE.2012.25","DOIUrl":"https://doi.org/10.1109/ICCVE.2012.25","url":null,"abstract":"In this paper we investigate the throughput of an ad-hoc wireless network with independent identically distributed nodes. This scenario have been studied before and achievable throughput have been calculated as O(1/√nlogn). Here, by using the Voronoi tessellation and modifying the cell area, we could decrease the area of cells and consequently decline the transmission power. Smaller transmission power results in lower interference and higher throughput. Then, not only we compute new upper bound for throughput as o(1/√n log...log (n)) but we also obtain range of throughput as o(1/√n log n ) ≤ o(n) ≤ o(1/√n) which is variable according to the area of cells so that with the condition of scenario, it can be changed.","PeriodicalId":182453,"journal":{"name":"2012 International Conference on Connected Vehicles and Expo (ICCVE)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128025859","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
Soft Interference Cancellation for Nonbinary LDPC Coded Multicarrier MFSK Multiple Access Systems over Rayleigh Fading Channel 非二进制LDPC编码多载波MFSK多址系统在瑞利衰落信道上的软干扰消除
2012 International Conference on Connected Vehicles and Expo (ICCVE) Pub Date : 2012-12-12 DOI: 10.1109/ICCVE.2012.18
S. Su, Her-Chang Tsai, Ye-Shun Shen
{"title":"Soft Interference Cancellation for Nonbinary LDPC Coded Multicarrier MFSK Multiple Access Systems over Rayleigh Fading Channel","authors":"S. Su, Her-Chang Tsai, Ye-Shun Shen","doi":"10.1109/ICCVE.2012.18","DOIUrl":"https://doi.org/10.1109/ICCVE.2012.18","url":null,"abstract":"This paper studies an iterative multiuser detection for nonbinary LDPC coded multicarrier MFSK multiple access system to increase system performance under specific signal-to-noise ratio and data rate. When multiuser detection process is carried out, we test the soft outputs of channel decoder. When the soft output exceeds a threshold, the user is declared as a reliable user. For each signal, we count the number of reliable users on it. The reliable information iteratively updates the soft output calculation in the iterative demodulation and decoding process. Numerical results show that system performances are improved after multiuser detection over Rayleigh fading channel.","PeriodicalId":182453,"journal":{"name":"2012 International Conference on Connected Vehicles and Expo (ICCVE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130443606","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
Efficient Data Broadcast for Generic Applications Using a Scalable Dynamic VANET Algorithm 基于可扩展动态VANET算法的通用应用高效数据广播
2012 International Conference on Connected Vehicles and Expo (ICCVE) Pub Date : 2012-12-12 DOI: 10.1109/ICCVE.2012.60
Sandeep Mudigonda, J. Fukuyama, K. Ozbay
{"title":"Efficient Data Broadcast for Generic Applications Using a Scalable Dynamic VANET Algorithm","authors":"Sandeep Mudigonda, J. Fukuyama, K. Ozbay","doi":"10.1109/ICCVE.2012.60","DOIUrl":"https://doi.org/10.1109/ICCVE.2012.60","url":null,"abstract":"Data broadcasting using VANETs has been studied extensively. It is a very important part of applications of connected vehicles where there is a constant need for vehicles to exchange information with the communication infrastructure. This could result in the congestion of the network with data. Alternatively information can be disseminated using exclusively adhoc V2V approach. This approach may lead to broadcast storm and jamming of the V2V channel. In this study we evaluate as a proof-of-concept, V2V data broadcast, for an algorithm proposed in an earlier study to build autonomous and dynamic groups. In our recent studies we showed that the hybrid VANETs formed using this algorithm can reduce communication load and are very scalable for sensor data collection. In this study we modify the dynamic grouping algorithm so that the time for which the group is available for data broadcast is improved. This modified algorithm for dynamic grouping of vehicular nodes is implemented in a realistic well-calibrated microscopic traffic simulation test bed of New Jersey Turnpike. We demonstrate the benefit by considering a generic instance of an event-specific data broadcast. This data could be information on accidents, local commercial information, etc. We demonstrate, using initial findings, that the algorithm can be used to contain broadcast storm and reduce bandwidth usage by 65-76% compared to flooding and 45-62% compared to farthest neighbor broadcast protocol. Thus we establish that the dynamic grouping algorithm is an effective solution in many real-world traffic scenarios.","PeriodicalId":182453,"journal":{"name":"2012 International Conference on Connected Vehicles and Expo (ICCVE)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121109673","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
Evacuation Time Analysis and Optimization for Distributed Emergency Guiding Based on Wireless Sensor Networks 基于无线传感器网络的分布式应急引导疏散时间分析与优化
2012 International Conference on Connected Vehicles and Expo (ICCVE) Pub Date : 2012-12-12 DOI: 10.1109/ICCVE.2012.32
Lien-Wu Chen, Jen-Hsiang Cheng, Y. Tseng
{"title":"Evacuation Time Analysis and Optimization for Distributed Emergency Guiding Based on Wireless Sensor Networks","authors":"Lien-Wu Chen, Jen-Hsiang Cheng, Y. Tseng","doi":"10.1109/ICCVE.2012.32","DOIUrl":"https://doi.org/10.1109/ICCVE.2012.32","url":null,"abstract":"This paper proposes a load-balancing framework for emergency guiding based on wireless sensor networks. We design a load-balancing guiding scheme and derive an analytical model in order to reduce the total evacuation time of indoor people. The guiding scheme can provide the fastest path to an exit for people based on the evacuation time estimated by the analytical model. This is the first distributed solution which takes the corridor capacity and length, exit capacity, concurrent move, and people distribution into consideration for estimating evacuation time and planning escape paths. Through the proposed framework, the congestion of certain corridors and exits can be released to significantly reduce the total evacuation time. Analytical and simulation results show that our approach outperforms existing works, which can prevent people from following the local optimal guiding direction with the longer evacuation time in total. We also implement a prototype, called Load-balancing Emergency Guiding System (LEGS), which can compare evacuation time and guiding directions of existing schemes and ours under different people distribution.","PeriodicalId":182453,"journal":{"name":"2012 International Conference on Connected Vehicles and Expo (ICCVE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126523060","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}
引用次数: 12
Data Acquisition in Sensor Network Using an Autonomous Path 基于自治路径的传感器网络数据采集
2012 International Conference on Connected Vehicles and Expo (ICCVE) Pub Date : 2012-12-12 DOI: 10.1109/ICCVE.2012.40
V. M. Chhieng, R. Wong, S. Fong
{"title":"Data Acquisition in Sensor Network Using an Autonomous Path","authors":"V. M. Chhieng, R. Wong, S. Fong","doi":"10.1109/ICCVE.2012.40","DOIUrl":"https://doi.org/10.1109/ICCVE.2012.40","url":null,"abstract":"Data acquisition in a wireless sensor network typically involves routing data from numerous sensors toward a static sink or a base station. To achieve this efficiently, mobile sink strategies have been investigated by numerous researchers. However, a thorough qualitative study of the mobile sink path has mostly been disregarded in the literature. As such no strong common qualitative measurement can be asserted regarding a particular technique against the others. This paper proposes a novice technique based on the space filling curve which produces a mobile sink path for an arbitrarily convex network shape.","PeriodicalId":182453,"journal":{"name":"2012 International Conference on Connected Vehicles and Expo (ICCVE)","volume":"23 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113941264","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
Comparison and Analysis of Flow Features at the Packet Level for Traffic Classification 面向流分类的包级流特征比较与分析
2012 International Conference on Connected Vehicles and Expo (ICCVE) Pub Date : 2012-12-12 DOI: 10.1109/ICCVE.2012.58
Gang Lu, Hongli Zhang, M. T. Qassrawi, Xiangzhan Yu
{"title":"Comparison and Analysis of Flow Features at the Packet Level for Traffic Classification","authors":"Gang Lu, Hongli Zhang, M. T. Qassrawi, Xiangzhan Yu","doi":"10.1109/ICCVE.2012.58","DOIUrl":"https://doi.org/10.1109/ICCVE.2012.58","url":null,"abstract":"Recently, flow features at the packet level for traffic classification have been paid more attention to since they are simple and observable even if encrypted tunnels are applied in the network, such as SSL tunnel. However, how to use flow features at the packet level for effective classification of traffic flows is still a significant issue to be solved. The objective of this paper is to compare and analyze three typical flow features at the packet level: packet size combined with packet direction, packet size combined with interarrival time, and protocol fingerprint. The amount of information carried by each feature is presented with mutual information measurement. Based on the traffic traces captured from two different network environments, our experimental results indicate that when C4.5 algorithm classifies traffic flows with the first two packets of each flow, packet size combined with packet interarrival time, which is generated from the client-to-server direction of a TCP connection, is more accurate and stable across space and time.","PeriodicalId":182453,"journal":{"name":"2012 International Conference on Connected Vehicles and Expo (ICCVE)","volume":"3 S1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113964950","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}
引用次数: 5
A Research on the Applicability of ADS-B Data Links in Near Space Environment 近空间环境下ADS-B数据链的适用性研究
2012 International Conference on Connected Vehicles and Expo (ICCVE) Pub Date : 2012-12-12 DOI: 10.1109/ICCVE.2012.9
Tianyuan Li, Qibo Sun, Jinglin Li
{"title":"A Research on the Applicability of ADS-B Data Links in Near Space Environment","authors":"Tianyuan Li, Qibo Sun, Jinglin Li","doi":"10.1109/ICCVE.2012.9","DOIUrl":"https://doi.org/10.1109/ICCVE.2012.9","url":null,"abstract":"To test the applicability of ADS-B data links in near space environment, the channel propagation models of 1090ES and UAT (two kinds of ADS-B data links) in near space and in ground environment are proposed. Simulations of channel transmission performance of links between airplane and near space platform are conducted and an analysis of simulation results is made in aspects of path loss, signal to noise ratio and bit error rate. The results show that, within certain near space platform coverage, ADS-B data links can meet all conditions of aeronautical communication in near space communication environment.","PeriodicalId":182453,"journal":{"name":"2012 International Conference on Connected Vehicles and Expo (ICCVE)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124102459","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}
引用次数: 5
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学术文献互助群
群 号:604180095
Book学术官方微信