Pub Date : 2015-04-02DOI: 10.1109/ICCSP.2015.7322653
R. Kavitha, B. Caroline
The wireless sensor networks are always deployed in hostile and pervasive environment. They are prone to security threats and they do have a wide range of applications like military, environmental monitoring, health care, etc... traditional network security methods are not up to the mark due to limited resources. Several key management schemes have been proposed security in HSN. In this paper, we propose a key distribution scheme based on random key pre-distribution for heterogeneous sensor networks to achieve better security and performance compared to homogeneous networks, which is suffer from high communication overhead,computation overhead and high storage requirements. A combination of symmetric and asymmetric keys were tried (hybrid), where the cluster head and BS use public key encryption based on ECC, while using symmetric key encryption between the adjacent nodes in the cluster.
{"title":"Hybrid cryptographic technique for heterogeneous wireless sensor networks","authors":"R. Kavitha, B. Caroline","doi":"10.1109/ICCSP.2015.7322653","DOIUrl":"https://doi.org/10.1109/ICCSP.2015.7322653","url":null,"abstract":"The wireless sensor networks are always deployed in hostile and pervasive environment. They are prone to security threats and they do have a wide range of applications like military, environmental monitoring, health care, etc... traditional network security methods are not up to the mark due to limited resources. Several key management schemes have been proposed security in HSN. In this paper, we propose a key distribution scheme based on random key pre-distribution for heterogeneous sensor networks to achieve better security and performance compared to homogeneous networks, which is suffer from high communication overhead,computation overhead and high storage requirements. A combination of symmetric and asymmetric keys were tried (hybrid), where the cluster head and BS use public key encryption based on ECC, while using symmetric key encryption between the adjacent nodes in the cluster.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127774482","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 : 2015-04-02DOI: 10.1109/ICCSP.2015.7322812
Sudeep D. Thepade, Ashwini Kawale, Poonam Shipure, S. Thomas, Shruti Nathe
Sign language is the most basic communication medium for deaf and dumb people. It has evolved as the major area of research and study. In this paper the novel techniques for Indian Sign Language Recognition are proposed and analyzed with experimentation. Indian Sign Language has total 26 alphabets. With the help of Energy Compaction using five different orthogonal transforms, maximum energy is packed into low frequency region of the row mean of column transformed sign images. The feature vectors are extracted in five different ways from the transformed sign images in the form of feature sets of 3.125%, 6.25%, 12.5%, 25%, 50% of the total 100% coefficients of row mean of column transformed Sign images. The experimentation is done on a database containing 260 images spread across 26 categories. For each query fired on the database the average precision values are calculated. The results have improved with fractional coefficients compared to complete transformed sign image resulting in faster recognition. Overall Haar and Cosine transforms have given good results as indicated by higher precision values.
{"title":"Novel Indian Sign Language Recognition technique using Energy Compaction of five orthogonal transforms","authors":"Sudeep D. Thepade, Ashwini Kawale, Poonam Shipure, S. Thomas, Shruti Nathe","doi":"10.1109/ICCSP.2015.7322812","DOIUrl":"https://doi.org/10.1109/ICCSP.2015.7322812","url":null,"abstract":"Sign language is the most basic communication medium for deaf and dumb people. It has evolved as the major area of research and study. In this paper the novel techniques for Indian Sign Language Recognition are proposed and analyzed with experimentation. Indian Sign Language has total 26 alphabets. With the help of Energy Compaction using five different orthogonal transforms, maximum energy is packed into low frequency region of the row mean of column transformed sign images. The feature vectors are extracted in five different ways from the transformed sign images in the form of feature sets of 3.125%, 6.25%, 12.5%, 25%, 50% of the total 100% coefficients of row mean of column transformed Sign images. The experimentation is done on a database containing 260 images spread across 26 categories. For each query fired on the database the average precision values are calculated. The results have improved with fractional coefficients compared to complete transformed sign image resulting in faster recognition. Overall Haar and Cosine transforms have given good results as indicated by higher precision values.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121850207","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 : 2015-04-02DOI: 10.1109/ICCSP.2015.7322809
Supriya S. Lanjewar
Folding transformation systematically determines the control circuits in digital signal processing architectures which are described by data flow graph (DFG). For a specified folding set and technology constraints it gives architecture represented by hardware DFG. In iterative DFG which can be represented as cascade of similar substructures, rather than applying folding transformation on whole DFG, hierarchical folding folds one substructure and then folding is completed after appropriately changing the number of delays and switch instances in the resulted structure. This paper introduces two ways of applying hierarchical folding namely hierarchical interleaved folding and hierarchical contiguous folding. Its advantages signifies reduction in area required for implementation and run time. From experimental results it is proved that the area requirement and execution time is reduced for two stage sixth order infinite impulse response filter by hierarchical folding over conventional one.
{"title":"Design of iterative data flow graph using hierarchical folding","authors":"Supriya S. Lanjewar","doi":"10.1109/ICCSP.2015.7322809","DOIUrl":"https://doi.org/10.1109/ICCSP.2015.7322809","url":null,"abstract":"Folding transformation systematically determines the control circuits in digital signal processing architectures which are described by data flow graph (DFG). For a specified folding set and technology constraints it gives architecture represented by hardware DFG. In iterative DFG which can be represented as cascade of similar substructures, rather than applying folding transformation on whole DFG, hierarchical folding folds one substructure and then folding is completed after appropriately changing the number of delays and switch instances in the resulted structure. This paper introduces two ways of applying hierarchical folding namely hierarchical interleaved folding and hierarchical contiguous folding. Its advantages signifies reduction in area required for implementation and run time. From experimental results it is proved that the area requirement and execution time is reduced for two stage sixth order infinite impulse response filter by hierarchical folding over conventional one.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121792823","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 : 2015-04-02DOI: 10.1109/ICCSP.2015.7322674
Lohita S. Niwal, S. Hajare
The arithmetic operations are widely used in calculators and digital system. High speed methods of calculating are currently being requested, hence the design of fast divider is an important issues in high speed computing. In this paper we present fast radix-4 SRT division architecture with the digit-recurrent approach in which the quotient is obtained one digit per iteration. In this we estimating quotient digit instead of finding the exact one. The speculated quotient digit is used to calculate two possible partial remainders, in parallel with updating the new partial remainder for the next step whiles the quotient digit is being corrected. The two step processes does not affect the division speed, the approach has fast speed performance due to significant reduction in table size and by using higher radix, proposed divider takes power of 32.92μw with delay of 1.18 ns with 0.18μm CMOS technology.
{"title":"Design of radix 4 divider circuit using SRT algorithm","authors":"Lohita S. Niwal, S. Hajare","doi":"10.1109/ICCSP.2015.7322674","DOIUrl":"https://doi.org/10.1109/ICCSP.2015.7322674","url":null,"abstract":"The arithmetic operations are widely used in calculators and digital system. High speed methods of calculating are currently being requested, hence the design of fast divider is an important issues in high speed computing. In this paper we present fast radix-4 SRT division architecture with the digit-recurrent approach in which the quotient is obtained one digit per iteration. In this we estimating quotient digit instead of finding the exact one. The speculated quotient digit is used to calculate two possible partial remainders, in parallel with updating the new partial remainder for the next step whiles the quotient digit is being corrected. The two step processes does not affect the division speed, the approach has fast speed performance due to significant reduction in table size and by using higher radix, proposed divider takes power of 32.92μw with delay of 1.18 ns with 0.18μm CMOS technology.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131452927","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 : 2015-04-02DOI: 10.1109/ICCSP.2015.7322794
N. Sarode, R. Atluri, P. Dakhole
The Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) which exploits symmetry and periodicity in the DFT. Because of its efficiency, the algorithm is implemented in many Digital Signal Processing (DSP) applications and hardware platforms for real-time applications. FFT applications also include spectrum analysis, speech processing and filter designs where filter coefficients are determined according to the frequency of the filter. In this paper, a 128-point FFT is designed by employing mixed-radix number representation to effectively reduce the number of additions and multiplications. In addition, the computational complexity of twiddle factors (essentially involving the sine and cosine trigonometric computations) in butterfly operations of FFT is reduced by using CORDIC module, to confine the multiplication operations to simple addition and shift operations.
{"title":"Mixed-radix and CORDIC algorithm for implementation of FFT","authors":"N. Sarode, R. Atluri, P. Dakhole","doi":"10.1109/ICCSP.2015.7322794","DOIUrl":"https://doi.org/10.1109/ICCSP.2015.7322794","url":null,"abstract":"The Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) which exploits symmetry and periodicity in the DFT. Because of its efficiency, the algorithm is implemented in many Digital Signal Processing (DSP) applications and hardware platforms for real-time applications. FFT applications also include spectrum analysis, speech processing and filter designs where filter coefficients are determined according to the frequency of the filter. In this paper, a 128-point FFT is designed by employing mixed-radix number representation to effectively reduce the number of additions and multiplications. In addition, the computational complexity of twiddle factors (essentially involving the sine and cosine trigonometric computations) in butterfly operations of FFT is reduced by using CORDIC module, to confine the multiplication operations to simple addition and shift operations.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130022395","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 : 2015-04-02DOI: 10.1109/ICCSP.2015.7322664
I. Karthiga, S. Sankar, P. Dhivahar
Wireless sensor networks are spatially distributed network of autonomous nodes that are used in the monitoring of physical and environmental conditions. Since these sensors have limited energy to work with, their storage and processing capabilities are very much basic. They also have very limited transmission range. Recent approaches have seen immense investments using WSN that demands sensor networks that are capable of operating more efficiently but simultaneously with improved functionality. One such field that require state of art WSN technology is the m-health applications. Some of the factors that are needed to be considered are data consistency, security and sensor validation. Continuous efforts have been taken to improve the system architecture of the sensors that constitute these networks. It has been widely accepted that data forwarding and processing functionality provides ample of opportunity to improve the productiveness of the WSN. Designing routing protocols that comply with the limitations and further efficiently utilize the resources are of huge demand. There has been numerous proposed routing protocols that are based upon various factors like location, data, QoS, etc. This paper studies the various routing protocols that are present for wireless sensor networks with the view of analyzing the advantages and drawbacks in each of them. The study outlines the situations and scenarios by effectively analyzing the faults in those algorithms and establishes good practices that need to be followed in the implementation of the updated protocols which eliminates arising drawbacks. The eventual aim of this study is to layout the base containing all the regulated positive approaches from the established routing protocols and arriving at a more innovative routing protocol that satisfies m-Health's required critical factors such as consistency and accuracy.
{"title":"A study on routing protocols in wireless body area networks and its suitability for m-Health applications","authors":"I. Karthiga, S. Sankar, P. Dhivahar","doi":"10.1109/ICCSP.2015.7322664","DOIUrl":"https://doi.org/10.1109/ICCSP.2015.7322664","url":null,"abstract":"Wireless sensor networks are spatially distributed network of autonomous nodes that are used in the monitoring of physical and environmental conditions. Since these sensors have limited energy to work with, their storage and processing capabilities are very much basic. They also have very limited transmission range. Recent approaches have seen immense investments using WSN that demands sensor networks that are capable of operating more efficiently but simultaneously with improved functionality. One such field that require state of art WSN technology is the m-health applications. Some of the factors that are needed to be considered are data consistency, security and sensor validation. Continuous efforts have been taken to improve the system architecture of the sensors that constitute these networks. It has been widely accepted that data forwarding and processing functionality provides ample of opportunity to improve the productiveness of the WSN. Designing routing protocols that comply with the limitations and further efficiently utilize the resources are of huge demand. There has been numerous proposed routing protocols that are based upon various factors like location, data, QoS, etc. This paper studies the various routing protocols that are present for wireless sensor networks with the view of analyzing the advantages and drawbacks in each of them. The study outlines the situations and scenarios by effectively analyzing the faults in those algorithms and establishes good practices that need to be followed in the implementation of the updated protocols which eliminates arising drawbacks. The eventual aim of this study is to layout the base containing all the regulated positive approaches from the established routing protocols and arriving at a more innovative routing protocol that satisfies m-Health's required critical factors such as consistency and accuracy.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130050781","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 : 2015-04-02DOI: 10.1109/ICCSP.2015.7322696
Mrunalini B. Labhane, P. Palsodkar
With the change in advanced technology and the need for electronic equipments, the development of electronic instruments stimulate more efforts for more innovative ideas and better performance of design. In real world physical values, such as pressure, humidity, temperature and voice can be measured as analog (continuous) signals. However, to process these analog signals by electronic digital equipments, we need to convert these analog signals into digital or discreet signals or binary. In this paper, there are many types of Analog-to-Digital Converters (ADCs) which can be classified according to the applications and concept on which they were designed. ADCs including, Direct conversion ADC (Flash), successive approximation ADC, integrating ADC, Pipeline ADC. In some cases, many comparators are used to reduce the complexity, power and improve the linearity which are also explained in this paper.
{"title":"Various architectures of analog to digital converter","authors":"Mrunalini B. Labhane, P. Palsodkar","doi":"10.1109/ICCSP.2015.7322696","DOIUrl":"https://doi.org/10.1109/ICCSP.2015.7322696","url":null,"abstract":"With the change in advanced technology and the need for electronic equipments, the development of electronic instruments stimulate more efforts for more innovative ideas and better performance of design. In real world physical values, such as pressure, humidity, temperature and voice can be measured as analog (continuous) signals. However, to process these analog signals by electronic digital equipments, we need to convert these analog signals into digital or discreet signals or binary. In this paper, there are many types of Analog-to-Digital Converters (ADCs) which can be classified according to the applications and concept on which they were designed. ADCs including, Direct conversion ADC (Flash), successive approximation ADC, integrating ADC, Pipeline ADC. In some cases, many comparators are used to reduce the complexity, power and improve the linearity which are also explained in this paper.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"106 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134094176","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 : 2015-04-02DOI: 10.1109/ICCSP.2015.7322633
Poornima M. Chanal, Gururaj S. Kori, M. Kakkasageri
Vehicular Ad hoc Networks (VANETs) play an important role in future, for on road V2V communication systems and related applications like self-organizing, acquiring traffic information using sensors and disseminating it to the nearby vehicles, which are based on broadcast/geo-cast transmission schemes. These networks allow vehicles to share traffic, alerting information with each other during travelling. To achieve this goal successfully, a secured mechanism must be designed to guarantee that no false/malicious vehicles can intercept, or modify the information. It is a challenging task to develop a efficient reliable routing algorithm for VANETs due to the high mobility and the frequent changes of the network topology. In this paper, we propose a new vehicular reliability model to find the reliable route in VANETs. The reliable path is calculated using the location, direction and velocity information of vehicles along the road. Furthermore, proposed scheme guarantees the reliability and timely delivery of messages. Mobile agent based scheme exhibits better bandwidth usage and packet delivery ratio.
{"title":"Efficient reliable routing scheme for VANETs","authors":"Poornima M. Chanal, Gururaj S. Kori, M. Kakkasageri","doi":"10.1109/ICCSP.2015.7322633","DOIUrl":"https://doi.org/10.1109/ICCSP.2015.7322633","url":null,"abstract":"Vehicular Ad hoc Networks (VANETs) play an important role in future, for on road V2V communication systems and related applications like self-organizing, acquiring traffic information using sensors and disseminating it to the nearby vehicles, which are based on broadcast/geo-cast transmission schemes. These networks allow vehicles to share traffic, alerting information with each other during travelling. To achieve this goal successfully, a secured mechanism must be designed to guarantee that no false/malicious vehicles can intercept, or modify the information. It is a challenging task to develop a efficient reliable routing algorithm for VANETs due to the high mobility and the frequent changes of the network topology. In this paper, we propose a new vehicular reliability model to find the reliable route in VANETs. The reliable path is calculated using the location, direction and velocity information of vehicles along the road. Furthermore, proposed scheme guarantees the reliability and timely delivery of messages. Mobile agent based scheme exhibits better bandwidth usage and packet delivery ratio.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134350420","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 : 2015-04-02DOI: 10.1109/ICCSP.2015.7322893
S. C. Kushwaha, Pallavi Das, Madhuparna Chakraborty
This paper proposes an effective multiple watermarking algorithm based on Discrete Wavelet Transform for audio signal. This approach embeds multiple gray images inside the detailed coefficient of Discrete Wavelet Transform at the first and second level decomposition. Embedded multiple watermark can be easily and faithfully recovered under different common signal processing attacks such as high pass filtering, compression, amplification normalization, noise reduction, amplification, delay re-quantization, resampling, pitch correction, echo attack and other attacks by owner of the audio signal. The performance evaluation of proposed algorithm indicates high robustness against common signal processing attack and satisfactory audio quality of transmitted audio signal.
{"title":"Multiple watermarking on digital audio based on DWT technique","authors":"S. C. Kushwaha, Pallavi Das, Madhuparna Chakraborty","doi":"10.1109/ICCSP.2015.7322893","DOIUrl":"https://doi.org/10.1109/ICCSP.2015.7322893","url":null,"abstract":"This paper proposes an effective multiple watermarking algorithm based on Discrete Wavelet Transform for audio signal. This approach embeds multiple gray images inside the detailed coefficient of Discrete Wavelet Transform at the first and second level decomposition. Embedded multiple watermark can be easily and faithfully recovered under different common signal processing attacks such as high pass filtering, compression, amplification normalization, noise reduction, amplification, delay re-quantization, resampling, pitch correction, echo attack and other attacks by owner of the audio signal. The performance evaluation of proposed algorithm indicates high robustness against common signal processing attack and satisfactory audio quality of transmitted audio signal.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131608932","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 : 2015-04-02DOI: 10.1109/ICCSP.2015.7322606
Farha Anjum, V. Bondre, Ausaf Umar Khan
Most of the concerns of interest to mobile ad hoc networks (MANETs) are of interest in vehicular ad hoc networks (VANETs), but the details differ. Rather than moving at random, vehicles tend to move in an organized path. The intercommunication with roadside equipment can likewise be characterized fairly accurately. And finally, most vehicles are prohibited in their range of motion, for example by being forced to follow a smooth highway. Various routing protocol are used in VANET named Dynamic Source Routing Protocol(DSR), Destination Sequence Distance Routing Protocol(DSDV), Ad-hoc On Demand Distance Vector (AODV), Ad-hoc On demand Multipath distance Vector(AOMDV).In this paper we design and compare the performance of routing protocol named AODV and AOMDV in different traffic pattern UDP and CBR.The performance metrics parameter under the consideration for designed networks are Packet delivery Ratio(PDR), Packet loss ratio(PLR) and Throughput. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to achieve a better improvement in the packet delivery ratio(PDR) increased up to 91%, packet loss ratio(PLR) reduced up to 9% and also is able to increase throughput up to 9 to 10mbps.
大多数对移动自组网(manet)感兴趣的问题都是对车载自组网(vanet)感兴趣的问题，但细节不同。车辆不是随意移动，而是沿着有组织的路径移动。与路边设备的相互通信也可以相当准确地表征。最后，大多数车辆在其活动范围内被禁止，例如被迫沿着平坦的高速公路行驶。VANET中使用了各种路由协议，分别是动态源路由协议(DSR)、目的地序列距离路由协议(DSDV)、自组织随需距离矢量(AODV)、自组织随需多路径距离矢量(AOMDV)。本文设计并比较了AODV和AOMDV两种路由协议在UDP和CBR不同流量模式下的性能。在设计网络时，考虑的性能指标参数有包投递率(Packet delivery Ratio, PDR)、丢包率(Packet loss Ratio, PLR)和吞吐量。利用ns-2仿真对AOMDV与AODV的性能进行比较，结果表明AOMDV能够实现更好的改进，包投递率(PDR)提高到91%，包丢包率(PLR)降低到9%，吞吐量提高到9 ~ 10mbps。
{"title":"Design of single and Multipath Routing Protocol for quality of service (QoS) in VANET","authors":"Farha Anjum, V. Bondre, Ausaf Umar Khan","doi":"10.1109/ICCSP.2015.7322606","DOIUrl":"https://doi.org/10.1109/ICCSP.2015.7322606","url":null,"abstract":"Most of the concerns of interest to mobile ad hoc networks (MANETs) are of interest in vehicular ad hoc networks (VANETs), but the details differ. Rather than moving at random, vehicles tend to move in an organized path. The intercommunication with roadside equipment can likewise be characterized fairly accurately. And finally, most vehicles are prohibited in their range of motion, for example by being forced to follow a smooth highway. Various routing protocol are used in VANET named Dynamic Source Routing Protocol(DSR), Destination Sequence Distance Routing Protocol(DSDV), Ad-hoc On Demand Distance Vector (AODV), Ad-hoc On demand Multipath distance Vector(AOMDV).In this paper we design and compare the performance of routing protocol named AODV and AOMDV in different traffic pattern UDP and CBR.The performance metrics parameter under the consideration for designed networks are Packet delivery Ratio(PDR), Packet loss ratio(PLR) and Throughput. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to achieve a better improvement in the packet delivery ratio(PDR) increased up to 91%, packet loss ratio(PLR) reduced up to 9% and also is able to increase throughput up to 9 to 10mbps.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127585755","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
扫码关注我们
求助内容：
应助结果提醒方式：