Pub Date : 2014-02-01DOI: 10.1109/ICICES.2014.7034062
M. Hemakumar, G. Nagalalli
Communication and data networking field are being changed by the use of wireless networks, which enables user to communicate and access application and information without wires anywhere and anytime. This emerging and innovative technology while used in the computer networks which are supporting more flexibility and mobility. But one of the most considerable factors is power consumption. Because majority of nodes while using single radio platform (WLAN) in Wi-Fi area, power consumption becomes larger. So we propose a novel distributed clustering approach for energy saving using (LPR) and (HPR) within a single platform and this approach is based on clustering the nodes within the Wi-Fi area. By selecting a CHCs and GWNs among the member nodes, we have considered nodes highest residual energy level, signal strength and topology features. Cluster head coordinators (CHCs) to control the member nodes within the cluster. Here the cluster heads are act as a Coordinator between WLAN and PAN, and these cluster heads are responsible to make transmission process and forwarding data packets via the secondary radio interface (PAN) with their member nodes and the Gateway nodes (GWNs) are used to bridge the clusters to avoid the cluster head failures. Communication between the neighboring clusters on behalf of their cluster heads, Gateway nodes are used. So the clusters are independently controlled and dynamically reconfigured the nodes. Based on this, we presenting a Multi-Radio clustering protocol (MRCP) using Ns2, which effectively reforms the clusters and prolong the network lifetime, according to the user's application, power and bandwidth.
{"title":"Multi radio clustering protocol for mobile networks","authors":"M. Hemakumar, G. Nagalalli","doi":"10.1109/ICICES.2014.7034062","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034062","url":null,"abstract":"Communication and data networking field are being changed by the use of wireless networks, which enables user to communicate and access application and information without wires anywhere and anytime. This emerging and innovative technology while used in the computer networks which are supporting more flexibility and mobility. But one of the most considerable factors is power consumption. Because majority of nodes while using single radio platform (WLAN) in Wi-Fi area, power consumption becomes larger. So we propose a novel distributed clustering approach for energy saving using (LPR) and (HPR) within a single platform and this approach is based on clustering the nodes within the Wi-Fi area. By selecting a CHCs and GWNs among the member nodes, we have considered nodes highest residual energy level, signal strength and topology features. Cluster head coordinators (CHCs) to control the member nodes within the cluster. Here the cluster heads are act as a Coordinator between WLAN and PAN, and these cluster heads are responsible to make transmission process and forwarding data packets via the secondary radio interface (PAN) with their member nodes and the Gateway nodes (GWNs) are used to bridge the clusters to avoid the cluster head failures. Communication between the neighboring clusters on behalf of their cluster heads, Gateway nodes are used. So the clusters are independently controlled and dynamically reconfigured the nodes. Based on this, we presenting a Multi-Radio clustering protocol (MRCP) using Ns2, which effectively reforms the clusters and prolong the network lifetime, according to the user's application, power and bandwidth.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77914535","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7033982
S. P. Prashanth Kumar, Maruthi G, Asst. Professor
Image fusion is the process of combining information from two or more sensed or acquired images into a single composite image that is more informative and becomes more suitable for visual processing or computer processing. Image fusion fully utilizes much complementary and redundant information of the original images. The aim of image fusion is to integrate complementary and redundant information from multiple images to create a composite image that contains a better description of the scene than any of the individual source images. The objective is to reduce uncertainty, minimize redundancy in the output, and maximize relevant information pertaining to an application or a task. This paper focuses on feature level image fusion based on dual-tree complex wavelet transform (DT-CWT). A dual-tree complex wavelet transforms and watershed transform is used to segment the features of the input images, either jointly or separately, to produce the region map. Characteristics of each region are calculated and a region-based approach is used to fuse the images, region by region. The images used are already registered. Misregistration is a major source of error in image fusion.
{"title":"DT-CWT: Feature level image fusion based on dual-tree complex wavelet transform","authors":"S. P. Prashanth Kumar, Maruthi G, Asst. Professor","doi":"10.1109/ICICES.2014.7033982","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033982","url":null,"abstract":"Image fusion is the process of combining information from two or more sensed or acquired images into a single composite image that is more informative and becomes more suitable for visual processing or computer processing. Image fusion fully utilizes much complementary and redundant information of the original images. The aim of image fusion is to integrate complementary and redundant information from multiple images to create a composite image that contains a better description of the scene than any of the individual source images. The objective is to reduce uncertainty, minimize redundancy in the output, and maximize relevant information pertaining to an application or a task. This paper focuses on feature level image fusion based on dual-tree complex wavelet transform (DT-CWT). A dual-tree complex wavelet transforms and watershed transform is used to segment the features of the input images, either jointly or separately, to produce the region map. Characteristics of each region are calculated and a region-based approach is used to fuse the images, region by region. The images used are already registered. Misregistration is a major source of error in image fusion.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77999377","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7034009
K. Sridhar, M. Raguram, B. Prakash, S. Koushighan, S. Saravanan
Ellipti curve Cryptosystem used in cryptograhy chips undergoes side channel threats, where the attackers deciphered the secret key from the scan path through finding the memory element position by applying reverse enginering process in montgomery algorithm used in Elliptic device. Hence we propose the modified scan path architecture through the addition of extra electronic componet inorder to protect the secret key against the threats. The modified elliptic curve crypro scan architecture written in verilog code and simulated using model Sim Tool. The hardware module core is synthesised using Xillinx Spartan III Field Programable Gatted Array (FPGA) kit. The perfomance utilization is reported with the help of generated synsthesis result.
{"title":"Secured elliptic curve cryptosystems for scan based VLSI architecture","authors":"K. Sridhar, M. Raguram, B. Prakash, S. Koushighan, S. Saravanan","doi":"10.1109/ICICES.2014.7034009","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034009","url":null,"abstract":"Ellipti curve Cryptosystem used in cryptograhy chips undergoes side channel threats, where the attackers deciphered the secret key from the scan path through finding the memory element position by applying reverse enginering process in montgomery algorithm used in Elliptic device. Hence we propose the modified scan path architecture through the addition of extra electronic componet inorder to protect the secret key against the threats. The modified elliptic curve crypro scan architecture written in verilog code and simulated using model Sim Tool. The hardware module core is synthesised using Xillinx Spartan III Field Programable Gatted Array (FPGA) kit. The perfomance utilization is reported with the help of generated synsthesis result.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78065512","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7034177
C. Subashini, T. Mohanapriya, U. Rajaram
Fault handling is an important metric for many operating environments. The traditional technique for improving reliability of system is by replicating the system component. This paper explains about the Adaptive group testing technique for isolating the faults which is present in the memory of the system. The memory element contains many cell and these cells are grouped into number of blocks. These blocks are tested. The test vectors are produced sly LFSR and this is introduced into the circuit to validate the correct working of the system. This work is incorporated into FPGA to provide an adaptive hardware system with self-isolating properties. This approach increases the performance of the system. This testing is designed using hardware description language called VHDL.
{"title":"Fault-tolerance of reconfigurable logic in memory using AGT","authors":"C. Subashini, T. Mohanapriya, U. Rajaram","doi":"10.1109/ICICES.2014.7034177","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034177","url":null,"abstract":"Fault handling is an important metric for many operating environments. The traditional technique for improving reliability of system is by replicating the system component. This paper explains about the Adaptive group testing technique for isolating the faults which is present in the memory of the system. The memory element contains many cell and these cells are grouped into number of blocks. These blocks are tested. The test vectors are produced sly LFSR and this is introduced into the circuit to validate the correct working of the system. This work is incorporated into FPGA to provide an adaptive hardware system with self-isolating properties. This approach increases the performance of the system. This testing is designed using hardware description language called VHDL.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78954743","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7033992
V. Nagesh, K. D. Dattatreya
The prevalence of high-definition (HD) cameras, televisions, Blu-Ray players, and DVD recorders means that almost all video content is now captured and recorded digitally and much of it in HD. MPEG-2, H.264/AVC, and VC-1 are the most popular codecs in use today, and these rely on decorrelating transforms, motion estimation, intra prediction, and variable-length entropy coding (VLC) to achieve good picture quality at high compression ratios. Alongside the need for efficient video compression, there is a critical requirement for error resilience, in particular in association with wireless networks which are characterized by highly dynamic variations in error rate and bandwidth. Compression techniques based on prediction and variable-length coding render an encoded bit stream highly sensitive to channel errors. In the paper, techniques such as pyramid vector quantization (PVQ) have been implemented for increasing the ability to prevent error propagation through the use of fixed-length codeword in the Wireless Environment. In the paper, frame performance of the video has been observed in the pyramid vector section which offers greater compression performance in various techniques.
{"title":"Effective optimization of video transmission in WLAN","authors":"V. Nagesh, K. D. Dattatreya","doi":"10.1109/ICICES.2014.7033992","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033992","url":null,"abstract":"The prevalence of high-definition (HD) cameras, televisions, Blu-Ray players, and DVD recorders means that almost all video content is now captured and recorded digitally and much of it in HD. MPEG-2, H.264/AVC, and VC-1 are the most popular codecs in use today, and these rely on decorrelating transforms, motion estimation, intra prediction, and variable-length entropy coding (VLC) to achieve good picture quality at high compression ratios. Alongside the need for efficient video compression, there is a critical requirement for error resilience, in particular in association with wireless networks which are characterized by highly dynamic variations in error rate and bandwidth. Compression techniques based on prediction and variable-length coding render an encoded bit stream highly sensitive to channel errors. In the paper, techniques such as pyramid vector quantization (PVQ) have been implemented for increasing the ability to prevent error propagation through the use of fixed-length codeword in the Wireless Environment. In the paper, frame performance of the video has been observed in the pyramid vector section which offers greater compression performance in various techniques.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83920019","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7033856
H. Shalma, R. Rajesh
Fault tolerance has been identified as key challenges in the design and operations of Wireless Sensor Network (WSNs). Failures are inevitable in wireless sensor networks due to inhospitable environment and unattended deployment. Therefore, it is necessary to detect the networks for recovery from the failure to sustain it. WSNs are self-organized using clustering algorithms to conserve energy. The sensor nodes are organized in several small clusters where there are cluster heads in each cluster. These CHs (Cluster Heads) gather data from their local clusters aggregate them & send them to the base station with shortest distance as a forwarding metric using Dijkstra algorithm. The proposed scheme is supposed to be an efficient fault detection and recovery mechanism to make the network fault-tolerant and achieve reliability, latency and energy efficiency. Performance analysis and evaluation will be made using several scenarios of wireless sensor networks.
{"title":"Dynamic cluster based energy controlled routing in Wireless Sensor Networks","authors":"H. Shalma, R. Rajesh","doi":"10.1109/ICICES.2014.7033856","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033856","url":null,"abstract":"Fault tolerance has been identified as key challenges in the design and operations of Wireless Sensor Network (WSNs). Failures are inevitable in wireless sensor networks due to inhospitable environment and unattended deployment. Therefore, it is necessary to detect the networks for recovery from the failure to sustain it. WSNs are self-organized using clustering algorithms to conserve energy. The sensor nodes are organized in several small clusters where there are cluster heads in each cluster. These CHs (Cluster Heads) gather data from their local clusters aggregate them & send them to the base station with shortest distance as a forwarding metric using Dijkstra algorithm. The proposed scheme is supposed to be an efficient fault detection and recovery mechanism to make the network fault-tolerant and achieve reliability, latency and energy efficiency. Performance analysis and evaluation will be made using several scenarios of wireless sensor networks.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88941336","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7033880
E. Kamalakannan, K. S. Arvind
Handle the privacy information in the cloud faces the lot of security issues. If we maintain the medical information in the cloud means we need to provide the more security protection for the sensitive information's. Personal Health Information system is the system for preserving the privacy and distributing the information in secret way using Cloud Computing. Storing the medical information in third party cloud server, there is the chance for viewing and there is the chance for the information leakage. So here we need to protect the sensitive information's. The better way to protect the medical information's is, storing the sensitive information in the form of cipher text. In this paper we made a detailed study on Attribute Based Encryption and Attribute Based Broadcast Encryption for securing the Personal Health Information. And also in this paper we present the Personal Health Information system and we implement the system from different angle for securing the Personal Health Information with the help of Asymmetric key Cryptography and Message Digest. And also we are using the Attribute Based Broadcast Encryption. And we present the Time Granularity based log record scheme. To maintaining the log record we using the Third Party Auditor for strong back end protection. We show the experimental result of the PHIS in this paper.
{"title":"Privacy conserving and secure distribution of personal health information using cloud","authors":"E. Kamalakannan, K. S. Arvind","doi":"10.1109/ICICES.2014.7033880","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033880","url":null,"abstract":"Handle the privacy information in the cloud faces the lot of security issues. If we maintain the medical information in the cloud means we need to provide the more security protection for the sensitive information's. Personal Health Information system is the system for preserving the privacy and distributing the information in secret way using Cloud Computing. Storing the medical information in third party cloud server, there is the chance for viewing and there is the chance for the information leakage. So here we need to protect the sensitive information's. The better way to protect the medical information's is, storing the sensitive information in the form of cipher text. In this paper we made a detailed study on Attribute Based Encryption and Attribute Based Broadcast Encryption for securing the Personal Health Information. And also in this paper we present the Personal Health Information system and we implement the system from different angle for securing the Personal Health Information with the help of Asymmetric key Cryptography and Message Digest. And also we are using the Attribute Based Broadcast Encryption. And we present the Time Granularity based log record scheme. To maintaining the log record we using the Third Party Auditor for strong back end protection. We show the experimental result of the PHIS in this paper.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83758050","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7033999
Anjana Sasidharan, P. Nagarajan
IEEE-754 specifies interchange and arithmetic formats and methods for binary and decimal floating-point arithmetic in computer programming world. The implementation of a floating-point systemusing this standard can be done fully in software, or in hardware, or in any combination of software and hardware. This project propose VHDL implementation of IEEE-754 Floating point unit. In proposed work the pack, unpack and rounding mode was implemented using the VHDL language and simulation was verified.
{"title":"VHDL implementation of IEEE 754 floating point unit","authors":"Anjana Sasidharan, P. Nagarajan","doi":"10.1109/ICICES.2014.7033999","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7033999","url":null,"abstract":"IEEE-754 specifies interchange and arithmetic formats and methods for binary and decimal floating-point arithmetic in computer programming world. The implementation of a floating-point systemusing this standard can be done fully in software, or in hardware, or in any combination of software and hardware. This project propose VHDL implementation of IEEE-754 Floating point unit. In proposed work the pack, unpack and rounding mode was implemented using the VHDL language and simulation was verified.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79727120","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7034053
Angeline M. Flashy, A. Shanthi
The design and characteristics of the double sided microstrip circular antenna array are presented. The single sided antenna array is placed on the top layer and the double sided antenna array is placed on both the top and bottom layers to obtain the desired antenna characterilstics. The single sided antenna array is designed for single band at 6.3-6.6 GHz for C band and the double sided antenna array is designed for dual bands at 6.05-7 GHz and 9-10 GHz to support C band and X band Weather Radar applications. The single band antenna array shows directional radiation pattern with the gain value of 6.74 dBi at 6.44 GHz and dual band at 3.12 dBi at 6.5 GHz and 3.8 dBi at 9.5 GHz. The single sided single band and double sided dual band antenna provides directional radiation pattern with high gain.
{"title":"Microstrip circular antenna array design for radar applications","authors":"Angeline M. Flashy, A. Shanthi","doi":"10.1109/ICICES.2014.7034053","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034053","url":null,"abstract":"The design and characteristics of the double sided microstrip circular antenna array are presented. The single sided antenna array is placed on the top layer and the double sided antenna array is placed on both the top and bottom layers to obtain the desired antenna characterilstics. The single sided antenna array is designed for single band at 6.3-6.6 GHz for C band and the double sided antenna array is designed for dual bands at 6.05-7 GHz and 9-10 GHz to support C band and X band Weather Radar applications. The single band antenna array shows directional radiation pattern with the gain value of 6.74 dBi at 6.44 GHz and dual band at 3.12 dBi at 6.5 GHz and 3.8 dBi at 9.5 GHz. The single sided single band and double sided dual band antenna provides directional radiation pattern with high gain.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83374652","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 : 2014-02-01DOI: 10.1109/ICICES.2014.7034067
R. Yugapriya, P. Dhivya, M. Dhivya, S. Kirubakaran
Vehicular ad hoc networks (VANETs) are used to collect and aggregate real-time speed and position information on individual vehicles to optimize signal control at traffic intersections. VANET can be used to group vehicles into approximately equal-sized platoons, which can then be scheduled using OJF. Greedy forwarding algorithm is proposed to use in the traffic management as it offer the better transfer. Vehicle to infrastructure method is used to transfer the message from the platoon to the vehicle thus increases the safety. The road block information is transfer from platoon to V to I and from one V to I it is transfer to another. Greedy Forwarding algorithm is used to forwarded message to the neighboring node which is "closest" to the destination. In this paper Greedy Forwarding is used to increase the delivery rate and throughput. This algorithm is also used to reduce the load traffic. Greedy algorithm has computationally efficient and can find the error in early stage. Under heavy vehicular traffic load, the greedy algorithm performs the same as the platooning algorithm but still produces low delays, and high throughput.
{"title":"Adaptive traffic management with VANET in V to I communication using greedy forwarding algorithm","authors":"R. Yugapriya, P. Dhivya, M. Dhivya, S. Kirubakaran","doi":"10.1109/ICICES.2014.7034067","DOIUrl":"https://doi.org/10.1109/ICICES.2014.7034067","url":null,"abstract":"Vehicular ad hoc networks (VANETs) are used to collect and aggregate real-time speed and position information on individual vehicles to optimize signal control at traffic intersections. VANET can be used to group vehicles into approximately equal-sized platoons, which can then be scheduled using OJF. Greedy forwarding algorithm is proposed to use in the traffic management as it offer the better transfer. Vehicle to infrastructure method is used to transfer the message from the platoon to the vehicle thus increases the safety. The road block information is transfer from platoon to V to I and from one V to I it is transfer to another. Greedy Forwarding algorithm is used to forwarded message to the neighboring node which is \"closest\" to the destination. In this paper Greedy Forwarding is used to increase the delivery rate and throughput. This algorithm is also used to reduce the load traffic. Greedy algorithm has computationally efficient and can find the error in early stage. Under heavy vehicular traffic load, the greedy algorithm performs the same as the platooning algorithm but still produces low delays, and high throughput.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88510947","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
扫码关注我们
求助内容：
应助结果提醒方式：