Pub Date : 2011-10-27DOI: 10.1109/ITST.2011.6060112
Jehangir Khan, C. Tatkeu, P. Deloof, S. Niar
Advanced Driver Assistance Systems (ADAS) for automotive applications are used to reduce the number of road accidents. Multiple Target Tracking (MTT) is one of the most efficient techniques used in modern ADAS's. Data Association is a vital part of MTT which can be modeled as the classic Assignment Problem. We implement two algorithms namely, the Munkres (or Hungarian) algorithm and the Auction algorithm in Altera's StratixII FPGA using the NiosII soft-core processor. We analyze the resource requirements and the execution speed of the two algorithms. We describe the circumstances where the use of one or the other of these two algorithms is most suitable in the context of the data association problem.
{"title":"Data association techniques for advanced driver assistance systems using embedded soft-core processors","authors":"Jehangir Khan, C. Tatkeu, P. Deloof, S. Niar","doi":"10.1109/ITST.2011.6060112","DOIUrl":"https://doi.org/10.1109/ITST.2011.6060112","url":null,"abstract":"Advanced Driver Assistance Systems (ADAS) for automotive applications are used to reduce the number of road accidents. Multiple Target Tracking (MTT) is one of the most efficient techniques used in modern ADAS's. Data Association is a vital part of MTT which can be modeled as the classic Assignment Problem. We implement two algorithms namely, the Munkres (or Hungarian) algorithm and the Auction algorithm in Altera's StratixII FPGA using the NiosII soft-core processor. We analyze the resource requirements and the execution speed of the two algorithms. We describe the circumstances where the use of one or the other of these two algorithms is most suitable in the context of the data association problem.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116911371","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 : 2011-10-27DOI: 10.1109/ITST.2011.6060035
V. Naumov
Most new methods for safety improvement rely on examination of the vehicle data and monitoring of the driver behaviour. The vehicle data may include steering wheel angle, the brake and gas pedal positions, gear, velocity etc. Driver physiological parameters are acquired using heart rate sensors, electrocardiogram, electromyogram, electroencephalogram, head/eye monitoring and tracking systems. Given a stream of input data the safety system should be able to determine the driver state in real-time. In this paper we use exponentially weighted moving averages for transformation of input data into feature vectors used for classification of driver state and investigate accuracy of this approach for datasets collected in driving simulator.
{"title":"EWMA based classification of driver state","authors":"V. Naumov","doi":"10.1109/ITST.2011.6060035","DOIUrl":"https://doi.org/10.1109/ITST.2011.6060035","url":null,"abstract":"Most new methods for safety improvement rely on examination of the vehicle data and monitoring of the driver behaviour. The vehicle data may include steering wheel angle, the brake and gas pedal positions, gear, velocity etc. Driver physiological parameters are acquired using heart rate sensors, electrocardiogram, electromyogram, electroencephalogram, head/eye monitoring and tracking systems. Given a stream of input data the safety system should be able to determine the driver state in real-time. In this paper we use exponentially weighted moving averages for transformation of input data into feature vectors used for classification of driver state and investigate accuracy of this approach for datasets collected in driving simulator.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116482565","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 : 2011-10-27DOI: 10.1109/ITST.2011.6060090
Xiaozhou Fang, K. K. Chai, Y. Alfadhl, Y. Sun
Vehicular Ad-hoc NETwork (VANET) is becoming a promising technology in which moving vehicles are able to exchange information between them without the need of infrastructure. The original idea of VANET is for the safety purposes such as warning the drivers when there is an accident happened in the front of the road. Nowadays, VANET is extended to offer more services like downloading emails transfer, assessing Internet and Global Positioning System (GPS) services. To make sure that information transmitted correctly, an efficient routing protocol is crucial and indispensable for coping with the rapid topology changes. In this paper, we developed an OPNET model to evaluate the VANET performance of Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) protocols in the city with different scenarios. We found out that AODV outperforms DSR protocol in VANET with increasing vehicles.
{"title":"Evaluation of ad-hoc routing protocols in vehicular ad-hoc network using OPNET","authors":"Xiaozhou Fang, K. K. Chai, Y. Alfadhl, Y. Sun","doi":"10.1109/ITST.2011.6060090","DOIUrl":"https://doi.org/10.1109/ITST.2011.6060090","url":null,"abstract":"Vehicular Ad-hoc NETwork (VANET) is becoming a promising technology in which moving vehicles are able to exchange information between them without the need of infrastructure. The original idea of VANET is for the safety purposes such as warning the drivers when there is an accident happened in the front of the road. Nowadays, VANET is extended to offer more services like downloading emails transfer, assessing Internet and Global Positioning System (GPS) services. To make sure that information transmitted correctly, an efficient routing protocol is crucial and indispensable for coping with the rapid topology changes. In this paper, we developed an OPNET model to evaluate the VANET performance of Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) protocols in the city with different scenarios. We found out that AODV outperforms DSR protocol in VANET with increasing vehicles.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123505675","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 : 2011-10-27DOI: 10.1109/ITST.2011.6060143
Po-Kuan Shih, D. Chang
In the last few years, the Dynamic Spectrum Access (DSA) has been a flexible strategy for wireless spectrum management. In vehicular communications, OFDM is usually used. The detection of dynamically allocated signals is a problem for a receiver with DSA technique. The automatic modulation classifier can recognize and demodulate the dynamically allocated signals in the OFDM system. We design a layered modulation classifier based on high-order statistics to classify the unknown modulated signal. The aim of the classifier is to defeat the unknown channel effect. We show the classification algorithm of signal detection in multipath environments, and discuss the performance of simulation results.
{"title":"An automatic modulation classification technique using high-order statistics for multipath fading channels","authors":"Po-Kuan Shih, D. Chang","doi":"10.1109/ITST.2011.6060143","DOIUrl":"https://doi.org/10.1109/ITST.2011.6060143","url":null,"abstract":"In the last few years, the Dynamic Spectrum Access (DSA) has been a flexible strategy for wireless spectrum management. In vehicular communications, OFDM is usually used. The detection of dynamically allocated signals is a problem for a receiver with DSA technique. The automatic modulation classifier can recognize and demodulate the dynamically allocated signals in the OFDM system. We design a layered modulation classifier based on high-order statistics to classify the unknown modulated signal. The aim of the classifier is to defeat the unknown channel effect. We show the classification algorithm of signal detection in multipath environments, and discuss the performance of simulation results.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124968722","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 : 2011-10-27DOI: 10.1109/ITST.2011.6060163
Wen Xu, Mathias Richter, M. Sauermann, F. Capar, Cyprian Grassmann
We address the issues related to implementation of baseband signal processing algorithms on an SDR platform with multiple parallel processors, such as the Intel's X-GOLD™ SDR20 baseband processor. The basic idea is to reformulate the baseband signal processing algorithms such that they can be efficiently implemented on a parallel architecture. A hierarchical LTE initial synchronization scheme is taken as an example which involves algorithmic modules such as summation, maximum search, vector addition, cross-correlation, auto-correlation, FFT, FIR filter, etc. As can be shown, the computational complexity of an algorithm itself is vital and determines its implementability on a parallel SDR platform. Except for modules like summation, maximum search, vector addition, cross-correlation which can be parallelized straightforwardly, we show how to parallelize sequential and iterative algorithmic modules like autocorrelation and FFT. Challenges and future work are also discussed.
{"title":"Efficient baseband implementation on an SDR platform","authors":"Wen Xu, Mathias Richter, M. Sauermann, F. Capar, Cyprian Grassmann","doi":"10.1109/ITST.2011.6060163","DOIUrl":"https://doi.org/10.1109/ITST.2011.6060163","url":null,"abstract":"We address the issues related to implementation of baseband signal processing algorithms on an SDR platform with multiple parallel processors, such as the Intel's X-GOLD™ SDR20 baseband processor. The basic idea is to reformulate the baseband signal processing algorithms such that they can be efficiently implemented on a parallel architecture. A hierarchical LTE initial synchronization scheme is taken as an example which involves algorithmic modules such as summation, maximum search, vector addition, cross-correlation, auto-correlation, FFT, FIR filter, etc. As can be shown, the computational complexity of an algorithm itself is vital and determines its implementability on a parallel SDR platform. Except for modules like summation, maximum search, vector addition, cross-correlation which can be parallelized straightforwardly, we show how to parallelize sequential and iterative algorithmic modules like autocorrelation and FFT. Challenges and future work are also discussed.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129463895","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 : 2011-10-27DOI: 10.1109/ITST.2011.6060111
Weifeng Lv, Xinxin Jiang, Congcong Li, T. Zhu
Urban transportation is very important for economy development of a city, and accurate and effective overall traffic status in an area provides the basis for transportation application service. This paper proposes a novel model-OTCEM, evaluating urban overall traffic condition effectively. In this model, a regional transport evaluation index is developed. Through the model, the trends of normal transport are obtained. Meanwhile, in this paper, based on different impact factors, those abnormal data are analyzed and the impact assessments are completed. At last, the model is validated through the truth traffic data of Beijing, experimental results show that with this model, we can get effective evaluation of the overall urban transportation status.
{"title":"A novel model to evaluate urban overall traffic condition","authors":"Weifeng Lv, Xinxin Jiang, Congcong Li, T. Zhu","doi":"10.1109/ITST.2011.6060111","DOIUrl":"https://doi.org/10.1109/ITST.2011.6060111","url":null,"abstract":"Urban transportation is very important for economy development of a city, and accurate and effective overall traffic status in an area provides the basis for transportation application service. This paper proposes a novel model-OTCEM, evaluating urban overall traffic condition effectively. In this model, a regional transport evaluation index is developed. Through the model, the trends of normal transport are obtained. Meanwhile, in this paper, based on different impact factors, those abnormal data are analyzed and the impact assessments are completed. At last, the model is validated through the truth traffic data of Beijing, experimental results show that with this model, we can get effective evaluation of the overall urban transportation status.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127347929","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 : 2011-10-27DOI: 10.1109/ITST.2011.6060096
João A. Dias, João N. Isento, J. Rodrigues, P. Pereira, Jaime Lloret
Vehicular Delay-Tolerant Network (VDTN) is a new disruptive network architecture where vehicles act as the communication infrastructure, furnishing low-cost asynchronous opportunistic communications, variable delays and bandwidth limitations defining a non-TCP/IP (Transmission Control Protocol/Internet Protocol) network. A VDTN assumes asynchronous, bundle-oriented communication, and a store-carry-and-forward routing paradigm. VDTNs should make the best use of the tight resources available in the network. In order to optimize the data exchanged among nodes at contact opportunities, increasing the bundle delivery and improving the overall network performance, fragmentation mechanisms are used. This paper presents several fragmentation techniques (proactive, source, reactive, and toilet paper) for VDTNs and evaluates their performance through a laboratory testbed. It was shown that both reactive fragmentation approaches (reactive and toilet paper) perform slightly better than proactive fragmentation approaches (proactive and source) and non-fragmentation approaches.
{"title":"Performance implications of fragmentation mechanisms on Vehicular Delay-Tolerant Networks","authors":"João A. Dias, João N. Isento, J. Rodrigues, P. Pereira, Jaime Lloret","doi":"10.1109/ITST.2011.6060096","DOIUrl":"https://doi.org/10.1109/ITST.2011.6060096","url":null,"abstract":"Vehicular Delay-Tolerant Network (VDTN) is a new disruptive network architecture where vehicles act as the communication infrastructure, furnishing low-cost asynchronous opportunistic communications, variable delays and bandwidth limitations defining a non-TCP/IP (Transmission Control Protocol/Internet Protocol) network. A VDTN assumes asynchronous, bundle-oriented communication, and a store-carry-and-forward routing paradigm. VDTNs should make the best use of the tight resources available in the network. In order to optimize the data exchanged among nodes at contact opportunities, increasing the bundle delivery and improving the overall network performance, fragmentation mechanisms are used. This paper presents several fragmentation techniques (proactive, source, reactive, and toilet paper) for VDTNs and evaluates their performance through a laboratory testbed. It was shown that both reactive fragmentation approaches (reactive and toilet paper) perform slightly better than proactive fragmentation approaches (proactive and source) and non-fragmentation approaches.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130667625","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 : 2011-10-27DOI: 10.1109/ITST.2011.6060103
S. Boudko, W. Leister, C. Griwodz, P. Halvorsen
We develop and evaluate a rate-allocation multipath algorithm for delivery of video in a Video-on-Demand (VoD) system built upon an overlay network. To evaluate how well the rate-allocation algorithms approach the optimum, we have earlier built a benchmarking system that provides the optimal solution for assigning available bandwidth to delivery paths. This solution is also proportionally-fair. We implement a distributed algorithm for multipath rate allocation that operates based on information collected by overlay nodes. The algorithm is evaluated in the OMNet++ simulation environment and analyzed against the aforementioned benchmarking.
{"title":"Multipath rate allocation algorithm for overlay networks with feedback from overlay nodes","authors":"S. Boudko, W. Leister, C. Griwodz, P. Halvorsen","doi":"10.1109/ITST.2011.6060103","DOIUrl":"https://doi.org/10.1109/ITST.2011.6060103","url":null,"abstract":"We develop and evaluate a rate-allocation multipath algorithm for delivery of video in a Video-on-Demand (VoD) system built upon an overlay network. To evaluate how well the rate-allocation algorithms approach the optimum, we have earlier built a benchmarking system that provides the optimal solution for assigning available bandwidth to delivery paths. This solution is also proportionally-fair. We implement a distributed algorithm for multipath rate allocation that operates based on information collected by overlay nodes. The algorithm is evaluated in the OMNet++ simulation environment and analyzed against the aforementioned benchmarking.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132458925","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 : 2011-10-27DOI: 10.1109/ITST.2011.6060110
Yuhe Zhang, Man Li, Wenjia Wang
Driving plan, which is to provide user a route between origin and destination, is a basic and important service of telematics system. Conventional driving plan methods, based on road link properties and shortest route algorithms, seldom consider user driving behaviors and preferences, therefore the generated routes may not be satisfying enough. To solve the problem, this paper proposes a driving plan method by introducing the experiences of local driver, i.e., experienced routes. Moreover, the characteristics of experienced routes, which are helpful to users in choosing suitable routes, are analyzed and presented.
{"title":"Research on experienced route for driving plan services","authors":"Yuhe Zhang, Man Li, Wenjia Wang","doi":"10.1109/ITST.2011.6060110","DOIUrl":"https://doi.org/10.1109/ITST.2011.6060110","url":null,"abstract":"Driving plan, which is to provide user a route between origin and destination, is a basic and important service of telematics system. Conventional driving plan methods, based on road link properties and shortest route algorithms, seldom consider user driving behaviors and preferences, therefore the generated routes may not be satisfying enough. To solve the problem, this paper proposes a driving plan method by introducing the experiences of local driver, i.e., experienced routes. Moreover, the characteristics of experienced routes, which are helpful to users in choosing suitable routes, are analyzed and presented.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126711185","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 : 2011-10-27DOI: 10.1109/ITST.2011.6060160
O. Sheluhin, Atayero, Artem V. Garmashev
Recent advances in ubiquitous broadband access networks have engendered an increase in research activities in the area of network teletraffic. We present in this paper the use of wavelet-transform modulus-maxima method (WTMM) for calculating statistical sum, which is more accurate in discovering the singularity of a signal. Data sets made available by the Lincoln Laboratory of MIT (1999 DARPA Intrusion Detection Evaluation) were analyzed as the test sequence. Analysis of the presented dependencies showed that the differences between two sets are manifested in their multifractal spectra, constructed using software based on WTMM method that was developed in the course of this work. These differences exist regardless of the amount of levels of scaling decomposition involved in the analysis. The values of boundary parameters of the spectra αmin and αmax are almost always different for two realizations and can likewise serve as a reliable distinguishing characteristic of multifractal spectra and hence as indicators of the presence of abnormal teletraffic activity.
{"title":"Detection of abnormal spikes in network traffic using multifractal analysis","authors":"O. Sheluhin, Atayero, Artem V. Garmashev","doi":"10.1109/ITST.2011.6060160","DOIUrl":"https://doi.org/10.1109/ITST.2011.6060160","url":null,"abstract":"Recent advances in ubiquitous broadband access networks have engendered an increase in research activities in the area of network teletraffic. We present in this paper the use of wavelet-transform modulus-maxima method (WTMM) for calculating statistical sum, which is more accurate in discovering the singularity of a signal. Data sets made available by the Lincoln Laboratory of MIT (1999 DARPA Intrusion Detection Evaluation) were analyzed as the test sequence. Analysis of the presented dependencies showed that the differences between two sets are manifested in their multifractal spectra, constructed using software based on WTMM method that was developed in the course of this work. These differences exist regardless of the amount of levels of scaling decomposition involved in the analysis. The values of boundary parameters of the spectra αmin and αmax are almost always different for two realizations and can likewise serve as a reliable distinguishing characteristic of multifractal spectra and hence as indicators of the presence of abnormal teletraffic activity.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"8 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121008937","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}