Pub Date : 2011-12-01DOI: 10.1109/WICT.2011.6141282
U. Solanki, Nilesh H. Desai
Controlling the home appliances and electronics gadgets through an Infrared remote control is now in general. But the same controlling tasks can be done more easily. Primary motive of proposing the new system of hand gesture remote control is to remove the need to look in to the hand held remote and to search for a specific key for specific function. This paper presents a novel system to control home appliances through hand gesture as a remote control device. The system will referred to as Handmote in this paper. It uses real time image processing for hand gesture recognition in infrared vision using Blobscanner [1] library and microcontroller development board , Arduino[2]. This paper proposes a possible solution to control the gadgets for physically challenged and blind people.
{"title":"Hand gesture based remote control for home appliances: Handmote","authors":"U. Solanki, Nilesh H. Desai","doi":"10.1109/WICT.2011.6141282","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141282","url":null,"abstract":"Controlling the home appliances and electronics gadgets through an Infrared remote control is now in general. But the same controlling tasks can be done more easily. Primary motive of proposing the new system of hand gesture remote control is to remove the need to look in to the hand held remote and to search for a specific key for specific function. This paper presents a novel system to control home appliances through hand gesture as a remote control device. The system will referred to as Handmote in this paper. It uses real time image processing for hand gesture recognition in infrared vision using Blobscanner [1] library and microcontroller development board , Arduino[2]. This paper proposes a possible solution to control the gadgets for physically challenged and blind people.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129740068","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-12-01DOI: 10.1109/WICT.2011.6141232
M. A. Wajeed, T. Adilakshmi
Due to the growth of information which has a great value, classifying the available information becomes inevitable so that navigation could be made easy. Many techniques of supervised learning and unsupervised learning do exist in the literature for data classification. Semi-supervised learning is halfway between the supervised and unsupervised learning. In addition to unlabeled data, the algorithm is provided with some supervision information but not necessarily for all example data. The paper explores the semi-supervised text classification which is applied to different types of vectors that are generated from the text documents. Enhancements in KNN algorithm are made to increase the accuracy performance of the classifier in the process of semi-supervised text classification, and results obtained are encouraging.
{"title":"Semi-supervised text classification using enhanced KNN algorithm","authors":"M. A. Wajeed, T. Adilakshmi","doi":"10.1109/WICT.2011.6141232","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141232","url":null,"abstract":"Due to the growth of information which has a great value, classifying the available information becomes inevitable so that navigation could be made easy. Many techniques of supervised learning and unsupervised learning do exist in the literature for data classification. Semi-supervised learning is halfway between the supervised and unsupervised learning. In addition to unlabeled data, the algorithm is provided with some supervision information but not necessarily for all example data. The paper explores the semi-supervised text classification which is applied to different types of vectors that are generated from the text documents. Enhancements in KNN algorithm are made to increase the accuracy performance of the classifier in the process of semi-supervised text classification, and results obtained are encouraging.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121314921","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-12-01DOI: 10.1109/WICT.2011.6141359
K. Srinivasa, Saumya Chandra, Siddharth Kajaria, Shilpita Mukherjee
We present a genetic algorithm based network intrusion detection system named IGIDS, where the genetic algorithm is used for pruning best individuals in the rule set database. The process makes the decision faster as the search space of the resulting rule set is much compact when compared to the original data set. This makes IDS faster and intelligent. We generate possible intrusions which forms the basis for detecting intrusions on the network traffic. Our method exhibits a high detection rate with low false positives. We have used DARPA Dataset for initial training and testing purpose.
{"title":"IGIDS: Intelligent intrusion detection system using genetic algorithms","authors":"K. Srinivasa, Saumya Chandra, Siddharth Kajaria, Shilpita Mukherjee","doi":"10.1109/WICT.2011.6141359","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141359","url":null,"abstract":"We present a genetic algorithm based network intrusion detection system named IGIDS, where the genetic algorithm is used for pruning best individuals in the rule set database. The process makes the decision faster as the search space of the resulting rule set is much compact when compared to the original data set. This makes IDS faster and intelligent. We generate possible intrusions which forms the basis for detecting intrusions on the network traffic. Our method exhibits a high detection rate with low false positives. We have used DARPA Dataset for initial training and testing purpose.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114698282","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-12-01DOI: 10.1109/WICT.2011.6141338
G. Roy, S. Saurabh, N. Upadhyay, P. K. Gupta
In the present days, the data on particular topic availability is huge and massive. The network virtualization plays very important role in the field of internet. For the Future Internet, Network Virtualization recognized a technology that overcome network ossification [18].Due to existence of the multiple confliction policies, services and alternations to the existing internet, there are some limitations occur according to the following features: robust routing, efficient search, scalability, decentralization, fault tolerances, trust and authentications. We need network virtualization, but the difficulties with the network virtualization are Instantiation means creating virtual networks, logistics means runs them; Management means manage them and Interactions. The creation of virtual network is very difficult and this is referred as future work. In this paper, we propose an algorithm to create virtual node and link for network virtualization. We have already some techniques to create the virtual network but they do not show the exact structure, which we require actually. In this paper, we proposed an algorithm to managing the virtual node and virtual link in any virtual network.
{"title":"Creation of virtual node, virtual link and managing them in network virtualization","authors":"G. Roy, S. Saurabh, N. Upadhyay, P. K. Gupta","doi":"10.1109/WICT.2011.6141338","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141338","url":null,"abstract":"In the present days, the data on particular topic availability is huge and massive. The network virtualization plays very important role in the field of internet. For the Future Internet, Network Virtualization recognized a technology that overcome network ossification [18].Due to existence of the multiple confliction policies, services and alternations to the existing internet, there are some limitations occur according to the following features: robust routing, efficient search, scalability, decentralization, fault tolerances, trust and authentications. We need network virtualization, but the difficulties with the network virtualization are Instantiation means creating virtual networks, logistics means runs them; Management means manage them and Interactions. The creation of virtual network is very difficult and this is referred as future work. In this paper, we propose an algorithm to create virtual node and link for network virtualization. We have already some techniques to create the virtual network but they do not show the exact structure, which we require actually. In this paper, we proposed an algorithm to managing the virtual node and virtual link in any virtual network.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124514142","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-12-01DOI: 10.1109/WICT.2011.6141445
Adway Lele, J. Kirtane, Ambuja Salgaonkar
Siddhata is an automatic theorem prover that can serve as a teaching aid for learning Dijkstra's philosophy of equational reasoning and proofs based on textual substitution [1]. Written in a dialect of the purely functional programming language Haskell, Siddhata implements a term rewriting system that uses a temporal rule-base to repeatedly rewrite a given proposition in an attempt to reduce it to the truth value T, thus proving the proposition. The functionality of Siddhata has been tested by automatically generating proofs for all the theorems in two Chapters of a textbook on discrete mathematics [2]. It has also been used as a teaching aid in a Master's degree course on the mathematical foundations of programming, with encouraging results.
{"title":"Siddhataa: Automatic theorem prover based on equational reasoning","authors":"Adway Lele, J. Kirtane, Ambuja Salgaonkar","doi":"10.1109/WICT.2011.6141445","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141445","url":null,"abstract":"Siddhata is an automatic theorem prover that can serve as a teaching aid for learning Dijkstra's philosophy of equational reasoning and proofs based on textual substitution [1]. Written in a dialect of the purely functional programming language Haskell, Siddhata implements a term rewriting system that uses a temporal rule-base to repeatedly rewrite a given proposition in an attempt to reduce it to the truth value T, thus proving the proposition. The functionality of Siddhata has been tested by automatically generating proofs for all the theorems in two Chapters of a textbook on discrete mathematics [2]. It has also been used as a teaching aid in a Master's degree course on the mathematical foundations of programming, with encouraging results.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125757530","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-12-01DOI: 10.1109/WICT.2011.6141192
A. Rajasekhar, Pratap Kunathi, A. Abraham, M. Pant
In this paper we propose a new technique for designing feedback control of a DC motor speed using fractional order proportional-integral-derivative (FOPID controller). DC motor is often used in robotics and other fields of control and therefore speed control is very important. FOPID controller's parameters are composed of the proportionality constant, integral constant, derivative constant, derivative order and integral order, and its design is more complex than that of conventional integer-order proportional-integral-derivative (PID) controllers. Here the controller synthesis is formulated as a single objective optimization problem and based on Integral Time Absolute Error (ITAE) criterion. A modified Artificial Bee Colony Algorithm is been used to tune the FOPID controller parameters.
{"title":"Fractinal order speed control of DC motor using levy mutated Artificial Bee Colony Algorithm","authors":"A. Rajasekhar, Pratap Kunathi, A. Abraham, M. Pant","doi":"10.1109/WICT.2011.6141192","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141192","url":null,"abstract":"In this paper we propose a new technique for designing feedback control of a DC motor speed using fractional order proportional-integral-derivative (FOPID controller). DC motor is often used in robotics and other fields of control and therefore speed control is very important. FOPID controller's parameters are composed of the proportionality constant, integral constant, derivative constant, derivative order and integral order, and its design is more complex than that of conventional integer-order proportional-integral-derivative (PID) controllers. Here the controller synthesis is formulated as a single objective optimization problem and based on Integral Time Absolute Error (ITAE) criterion. A modified Artificial Bee Colony Algorithm is been used to tune the FOPID controller parameters.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125842251","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-12-01DOI: 10.1109/WICT.2011.6141269
J. Shah, S. K. Shah
The speech enhancement techniques are required to improve the speech signal quality without causing any offshoot in many applications. Recently the growing use of cellular and mobile phones, hands free systems, VoIP phones, voice messaging service, call service centers etc. require efficient real time speech enhancement and detection strategies to make them superior over conventional speech communication systems. The speech enhancement algorithms are required to deal with additive noise and convolutive distortion that occur in any wireless communication system. Also the single channel (one microphone) signal is available in real environments. The short time spectral amplitude or attenuation (STSA) based algorithm particularly minimum mean square error-log spectral amplitude (MMSE-LSA) is used in practice for background noise suppression. However, it is generating artifact called musical noise and has poor performance in low SNR (0–10dB), reverberant and nonstationary noise backgrounds. Hence an algorithm which has a dual capacity to enhance speech corrupted by additive noise and degraded by reverberation is desired. The relative spectral amplitude (RASTA) algorithm is used as a preprocessor to improve performance of speech recognition systems in reverberating and noisy environment. It can be interactively combined with STSA approach. This paper evaluates such hybrid algorithm in terms of objective and subjective measures. The real time implementation is done on PC using SIMULINK from Mathworks and embedded implementation is done on TMS320C6713 DSP from Texas Instruments using DSP Starter kit- DSK 6713 from Spectrum Digital Incorporation. The profile report of both the implementations are generated and compared.
在许多应用中，语音增强技术需要在不产生分支的情况下提高语音信号质量。最近，蜂窝电话和移动电话、免提系统、VoIP电话、语音信息服务、呼叫服务中心等的使用越来越多，需要有效的实时语音增强和检测策略，以使其优于传统的语音通信系统。语音增强算法需要处理任何无线通信系统中出现的加性噪声和卷积失真。此外，单通道(一个麦克风)信号在实际环境中可用。基于短时谱幅值或衰减(STSA)的算法，特别是最小均方误差-对数谱幅值(MMSE-LSA)算法在实际中被用于背景噪声抑制。然而，它会产生被称为音乐噪声的伪影，并且在低信噪比(0-10dB)、混响和非平稳噪声背景下性能较差。因此，需要一种具有增强被加性噪声破坏和混响退化语音的双重能力的算法。采用相对谱幅(RASTA)算法作为预处理器，提高了混响和噪声环境下语音识别系统的性能。它可以与STSA方法交互结合。本文从客观和主观两方面对这种混合算法进行了评价。在PC上使用Mathworks的SIMULINK进行实时实现，在德州仪器的TMS320C6713 DSP上使用Spectrum Digital incorporated的DSP Starter kit- DSK 6713进行嵌入式实现。生成并比较两个实现的概要报告。
{"title":"Real time and embedded implementation of hybrid algorithm for speech enhancement","authors":"J. Shah, S. K. Shah","doi":"10.1109/WICT.2011.6141269","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141269","url":null,"abstract":"The speech enhancement techniques are required to improve the speech signal quality without causing any offshoot in many applications. Recently the growing use of cellular and mobile phones, hands free systems, VoIP phones, voice messaging service, call service centers etc. require efficient real time speech enhancement and detection strategies to make them superior over conventional speech communication systems. The speech enhancement algorithms are required to deal with additive noise and convolutive distortion that occur in any wireless communication system. Also the single channel (one microphone) signal is available in real environments. The short time spectral amplitude or attenuation (STSA) based algorithm particularly minimum mean square error-log spectral amplitude (MMSE-LSA) is used in practice for background noise suppression. However, it is generating artifact called musical noise and has poor performance in low SNR (0–10dB), reverberant and nonstationary noise backgrounds. Hence an algorithm which has a dual capacity to enhance speech corrupted by additive noise and degraded by reverberation is desired. The relative spectral amplitude (RASTA) algorithm is used as a preprocessor to improve performance of speech recognition systems in reverberating and noisy environment. It can be interactively combined with STSA approach. This paper evaluates such hybrid algorithm in terms of objective and subjective measures. The real time implementation is done on PC using SIMULINK from Mathworks and embedded implementation is done on TMS320C6713 DSP from Texas Instruments using DSP Starter kit- DSK 6713 from Spectrum Digital Incorporation. The profile report of both the implementations are generated and compared.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131345171","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-12-01DOI: 10.1109/WICT.2011.6141380
Vaishali R. Patel, R. Mehta
Real world applications are increasingly growing in the field of science and engineering, where data mining is an important stage to relate research and applications. Data objects are clustered based on the similarity using unsupervised learning techniques. The incomplete, noisy and inconsistent data may slow down the knowledge discovery in database process. Data preprocessing techniques improve the quality of data, thereby helping to improve the accuracy and efficiency of the subsequent mining processes. Data cleaning is an important preprocessing task to avoid redundancies during data integration. Normalization is an additional data preprocessing task that would contribute towards the success of the data mining process. In normalization the data to be analyzed is scaled to a specific range. K-means is the well known partition based clustering algorithm, yet it suffers from shortcomings of passing number of clusters and initial centroids preliminary. This paper proposes modified K-means algorithm (MK-means) which provides a solution for automatic initialization of centroids and analyzes the performance of MK-means algorithm with integration of cleaning method and normalization techniques which shows the improvement in the performance of MK-means algorithm.
{"title":"Performance analysis of MK-means clustering algorithm with normalization approach","authors":"Vaishali R. Patel, R. Mehta","doi":"10.1109/WICT.2011.6141380","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141380","url":null,"abstract":"Real world applications are increasingly growing in the field of science and engineering, where data mining is an important stage to relate research and applications. Data objects are clustered based on the similarity using unsupervised learning techniques. The incomplete, noisy and inconsistent data may slow down the knowledge discovery in database process. Data preprocessing techniques improve the quality of data, thereby helping to improve the accuracy and efficiency of the subsequent mining processes. Data cleaning is an important preprocessing task to avoid redundancies during data integration. Normalization is an additional data preprocessing task that would contribute towards the success of the data mining process. In normalization the data to be analyzed is scaled to a specific range. K-means is the well known partition based clustering algorithm, yet it suffers from shortcomings of passing number of clusters and initial centroids preliminary. This paper proposes modified K-means algorithm (MK-means) which provides a solution for automatic initialization of centroids and analyzes the performance of MK-means algorithm with integration of cleaning method and normalization techniques which shows the improvement in the performance of MK-means algorithm.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132124973","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-12-01DOI: 10.1109/WICT.2011.6141291
Anand Kumar, S. Dwivedi
Explicit modeling of administrative workflow processes and their enactment in workflow systems have proved to be valuable in increasing the efficiency of work in organizations on the basis of distributed information for different parties. The Semantic Web is the provision to provide distributed information with well-defined meaning and understandability for different parties such as machine as well as human. “An Agent-based Semantic Web for Paperless Office Content Management System” (aSPOCMS) intends to provide paperless environment for administrative offices of universities and institutes. In this paper, we discuss the ontologies framework with their suitable exemplification for aSPOCMS in paperless environment with the emergence of the Semantic Web perspective and show that how the Semantic Web resource description formats and language can be utilized for paperless office content management system of hypertext structures from distributed metadata. The resources of aSPOCMS are domain, user and observation, which are reconnoitered from ontologies and metadata. We consider a logic-based approach for administrative workflow services using TRIPLE, which facilitate the rule and query language for Semantic Web.
{"title":"Ontology exemplification for aSPOCMS in the Semantic Web","authors":"Anand Kumar, S. Dwivedi","doi":"10.1109/WICT.2011.6141291","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141291","url":null,"abstract":"Explicit modeling of administrative workflow processes and their enactment in workflow systems have proved to be valuable in increasing the efficiency of work in organizations on the basis of distributed information for different parties. The Semantic Web is the provision to provide distributed information with well-defined meaning and understandability for different parties such as machine as well as human. “An Agent-based Semantic Web for Paperless Office Content Management System” (aSPOCMS) intends to provide paperless environment for administrative offices of universities and institutes. In this paper, we discuss the ontologies framework with their suitable exemplification for aSPOCMS in paperless environment with the emergence of the Semantic Web perspective and show that how the Semantic Web resource description formats and language can be utilized for paperless office content management system of hypertext structures from distributed metadata. The resources of aSPOCMS are domain, user and observation, which are reconnoitered from ontologies and metadata. We consider a logic-based approach for administrative workflow services using TRIPLE, which facilitate the rule and query language for Semantic Web.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134131168","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-12-01DOI: 10.1109/WICT.2011.6141246
P. Priya Naidu, M. Chawla
Ad hoc On-demand Distance Vector (AODV) is a routing schema for delivering messages in a connected Mobile Ad hoc Network (MANET). Connectivity between any sources to destination pair in the network exists when they are in radio range of each other. Local Repair is an important issue in routing protocol which is needed for minimizing flooding and performance improvement. Routes can be locally repaired by the node that detects the link break along the end to end path. In this paper, the existing Local Repair Trial method in AODV is extended to achieve broadcasting and minimizing the flooding. The enhanced protocol first creates the group of mobile nodes then broadcasting can be done and if the link breaks then local repair technique can be applied. In the network the numbers of intermediate nodes are increased by using Diameter Perimeter Model. Enhanced AODV-Local Repair Trial (EAODVLRT) protocol is implemented on NS2 network simulator. Simulations are performed to analyze and compare the behavior of proposed protocol (EAODVLRT) for varying parameters such as size of network, node load etc. Proposed protocol has been compared with the existing AODV-LRT in terms of routing load, Data delivery ratio.
{"title":"Enhanced ad hoc on demand Distance Vector Local Repair Trial for MANET","authors":"P. Priya Naidu, M. Chawla","doi":"10.1109/WICT.2011.6141246","DOIUrl":"https://doi.org/10.1109/WICT.2011.6141246","url":null,"abstract":"Ad hoc On-demand Distance Vector (AODV) is a routing schema for delivering messages in a connected Mobile Ad hoc Network (MANET). Connectivity between any sources to destination pair in the network exists when they are in radio range of each other. Local Repair is an important issue in routing protocol which is needed for minimizing flooding and performance improvement. Routes can be locally repaired by the node that detects the link break along the end to end path. In this paper, the existing Local Repair Trial method in AODV is extended to achieve broadcasting and minimizing the flooding. The enhanced protocol first creates the group of mobile nodes then broadcasting can be done and if the link breaks then local repair technique can be applied. In the network the numbers of intermediate nodes are increased by using Diameter Perimeter Model. Enhanced AODV-Local Repair Trial (EAODVLRT) protocol is implemented on NS2 network simulator. Simulations are performed to analyze and compare the behavior of proposed protocol (EAODVLRT) for varying parameters such as size of network, node load etc. Proposed protocol has been compared with the existing AODV-LRT in terms of routing load, Data delivery ratio.","PeriodicalId":178645,"journal":{"name":"2011 World Congress on Information and Communication Technologies","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134195455","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
扫码关注我们
求助内容：
应助结果提醒方式：