The ease of deployment and the infrastructure less nature of mobile ad hoc networks (MANETs) make them highly desirable for the present day multi media communications. Traditional routing protocols may not suffice for real time communications which require QoS support from the network. Though there has been considerable research in this area, most of the routing protocols take into account a single QoS constraint. In this paper, we propose an adaptive distributed routing protocol for MANETs which provides a QoS aware path from a given source to destination. The novelty of the protocol lies in taking multiple QoS constraints into consideration. Admission control and bandwidth reservation schemes are incorporated in the protocol to satisfy the QoS constraints of the applications. Relevant information is stored at the intermediate nodes to achieve the required QoS. The protocol has been simulated on top of IEEE 802.11 MAC, in ns-2 network simulator, to show it's correctness and efficiency.
{"title":"QoS Constrained Adaptive Routing Protocol For Mobile Adhoc Networks","authors":"Vinod Kone, Sukumar Nandi","doi":"10.1109/ICIT.2006.76","DOIUrl":"https://doi.org/10.1109/ICIT.2006.76","url":null,"abstract":"The ease of deployment and the infrastructure less nature of mobile ad hoc networks (MANETs) make them highly desirable for the present day multi media communications. Traditional routing protocols may not suffice for real time communications which require QoS support from the network. Though there has been considerable research in this area, most of the routing protocols take into account a single QoS constraint. In this paper, we propose an adaptive distributed routing protocol for MANETs which provides a QoS aware path from a given source to destination. The novelty of the protocol lies in taking multiple QoS constraints into consideration. Admission control and bandwidth reservation schemes are incorporated in the protocol to satisfy the QoS constraints of the applications. Relevant information is stored at the intermediate nodes to achieve the required QoS. The protocol has been simulated on top of IEEE 802.11 MAC, in ns-2 network simulator, to show it's correctness and efficiency.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127457083","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}
In this paper, we analyze the route failure time of node- disjoint paths in an ad hoc network. We discuss an exact expression for the expected value of route failure time when lifetimes of individual paths are independent and identically distributed random variables. When the lifetimes are not independent, we discuss an upper bound on route failure time. In order to validate the model, we simulate exponentially distributed random variables. The values of route failure time obtained from simulations are close to those obtained analytically.
{"title":"Route Failure Time of Node-Disjoint Paths in Mobile Ad hoc Networks","authors":"A. Abbas","doi":"10.1109/ICIT.2006.79","DOIUrl":"https://doi.org/10.1109/ICIT.2006.79","url":null,"abstract":"In this paper, we analyze the route failure time of node- disjoint paths in an ad hoc network. We discuss an exact expression for the expected value of route failure time when lifetimes of individual paths are independent and identically distributed random variables. When the lifetimes are not independent, we discuss an upper bound on route failure time. In order to validate the model, we simulate exponentially distributed random variables. The values of route failure time obtained from simulations are close to those obtained analytically.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126031860","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}
In this paper, we propose Sniff and Embark (Sniff) protocol, a novel frame sniffing and token passing based approach to provide QoS in WLANs. Our simulations show that S^E performs significantly better than EDCF over the performance metrics - delay, jitter and time- constrained frame drop ratio.
{"title":"Performance of Sniff and Embark MAC Protocol for Real-Time Traffic in Wireless LANs","authors":"Aditya Dhananjay, D. Das","doi":"10.1109/ICIT.2006.70","DOIUrl":"https://doi.org/10.1109/ICIT.2006.70","url":null,"abstract":"In this paper, we propose Sniff and Embark (Sniff) protocol, a novel frame sniffing and token passing based approach to provide QoS in WLANs. Our simulations show that S^E performs significantly better than EDCF over the performance metrics - delay, jitter and time- constrained frame drop ratio.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125349627","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}
This article presents an efficient two-stage clustering method for clustering microarray gene expression time series data. The algorithm is based on the identification of genes having significant membership to multiple classes. A recently proposed variable string length genetic scheme and an iterated version of well known fuzzy C-means algorithm are utilized as the underlying clustering techniques. The performance of the two-stage clustering technique has been compared with the hierarchical clustering algorithms, those are widely used for clustering gene expression data, to prove its effectiveness on some publicly available gene expression data.
{"title":"Efficient Two-stage Fuzzy Clustering of Microarray Gene Expression Data","authors":"A. Mukhopadhyay, U. Maulik, S. Bandyopadhyay","doi":"10.1109/ICIT.2006.49","DOIUrl":"https://doi.org/10.1109/ICIT.2006.49","url":null,"abstract":"This article presents an efficient two-stage clustering method for clustering microarray gene expression time series data. The algorithm is based on the identification of genes having significant membership to multiple classes. A recently proposed variable string length genetic scheme and an iterated version of well known fuzzy C-means algorithm are utilized as the underlying clustering techniques. The performance of the two-stage clustering technique has been compared with the hierarchical clustering algorithms, those are widely used for clustering gene expression data, to prove its effectiveness on some publicly available gene expression data.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122492403","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}
Detection of outliers is one of the data pre-processing tasks. In all the applications, outliers need to be detected to enhance the accuracy of the classifiers. Several different techniques, such as statistical, distance-based and deviation-based outlier detection exist to detect outliers. Many of these techniques use filter method. A wrapper method using the concept of instance typicality may also be used to detect outliers. This paper deals with a new wrapper method that builds an initial model using neural networks and treats values at the output of neurons in the output layer as the typicality scores. Instances with lowest output values are treated as potential outliers. In addition, the method is also useful to build compact and accurate classifiers by selecting a few most typical instances resulting in significant reduction in storage space. The method is generic and thus can also be used for instance selection with any kind of classifiers. Resultant compact models are useful for imputation of missing values.
{"title":"Use of Instance Typicality for Efficient Detection of Outliers with Neural Network Classifiers","authors":"S. Sane, A. Ghatol","doi":"10.1109/ICIT.2006.89","DOIUrl":"https://doi.org/10.1109/ICIT.2006.89","url":null,"abstract":"Detection of outliers is one of the data pre-processing tasks. In all the applications, outliers need to be detected to enhance the accuracy of the classifiers. Several different techniques, such as statistical, distance-based and deviation-based outlier detection exist to detect outliers. Many of these techniques use filter method. A wrapper method using the concept of instance typicality may also be used to detect outliers. This paper deals with a new wrapper method that builds an initial model using neural networks and treats values at the output of neurons in the output layer as the typicality scores. Instances with lowest output values are treated as potential outliers. In addition, the method is also useful to build compact and accurate classifiers by selecting a few most typical instances resulting in significant reduction in storage space. The method is generic and thus can also be used for instance selection with any kind of classifiers. Resultant compact models are useful for imputation of missing values.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114480841","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}
In this paper we have presented design and implementation of a prototype for intrusion detection using mobile agents (MAs) in mobile ad hoc networks (MANETs). In this prototype each node runs intrusion detection system locally and equally cooperates with other intrusion detection systems running on other nodes. The proposed prototype is implemented and validated on PMADE (Platform for MA Distribution and Execution).
{"title":"Intrusion Detection in Mobile Ad-Hoc Networks: A Mobile Agent Approach","authors":"Upinder Kaur, R. B. Patel","doi":"10.1109/ICIT.2006.62","DOIUrl":"https://doi.org/10.1109/ICIT.2006.62","url":null,"abstract":"In this paper we have presented design and implementation of a prototype for intrusion detection using mobile agents (MAs) in mobile ad hoc networks (MANETs). In this prototype each node runs intrusion detection system locally and equally cooperates with other intrusion detection systems running on other nodes. The proposed prototype is implemented and validated on PMADE (Platform for MA Distribution and Execution).","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116859884","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}
Web applications involve the operations on the data objects across the organization boundaries. The operations are provided by the organization once the partners are identified. Web services are globally accepted and are adopted in any web application. The serious threat in web services is security, as these services are available to open world. In this paper the concept of generic web application-RBAC model, called as GenericWA-RBAC is introduced for secure information dissemination to the any web application. The proposal is to realize the system, which checks the security aspects for authorizing the access and reveling the data to the user belonging to partner organization. This model takes the hierarchy of the role in the partner organization and maps to the role of native systems. The proposed policies guaranty the safe data dissemination to partner organization role.
{"title":"GenericWA-RBAC: Role Based Access Control Model for Web Applications","authors":"Prasanna H. Bammigatti, P. R. Rao","doi":"10.1109/ICIT.2006.57","DOIUrl":"https://doi.org/10.1109/ICIT.2006.57","url":null,"abstract":"Web applications involve the operations on the data objects across the organization boundaries. The operations are provided by the organization once the partners are identified. Web services are globally accepted and are adopted in any web application. The serious threat in web services is security, as these services are available to open world. In this paper the concept of generic web application-RBAC model, called as GenericWA-RBAC is introduced for secure information dissemination to the any web application. The proposal is to realize the system, which checks the security aspects for authorizing the access and reveling the data to the user belonging to partner organization. This model takes the hierarchy of the role in the partner organization and maps to the role of native systems. The proposed policies guaranty the safe data dissemination to partner organization role.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129024401","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}
Cheryl-Annette Kincaid, S. Mohanty, Armin R. Mikler, E. Kougianos, Brandon Parker
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by allowing all cells to be computed in parallel. In this paper we present simple yet useful hardware that can perform the required computations in constant time complexity, O(l).
{"title":"A High Performance ASIC for Cellular Automata (CA) Applications","authors":"Cheryl-Annette Kincaid, S. Mohanty, Armin R. Mikler, E. Kougianos, Brandon Parker","doi":"10.1109/ICIT.2006.9","DOIUrl":"https://doi.org/10.1109/ICIT.2006.9","url":null,"abstract":"CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by allowing all cells to be computed in parallel. In this paper we present simple yet useful hardware that can perform the required computations in constant time complexity, O(l).","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121670228","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}
IEEE 754r is the ongoing revision to the IEEE 754 floating point standard. A major enhancement to the standard is the addition of decimal format, thus the design of BCD arithmetic units is likely to get significant attention. Firstly, this paper introduces a novel carry look-ahead BCD adder and then builds a novel carry look-ahead BCD subtracter based on it. Secondly, it introduces the reversible logic implementation of the proposed carry look-ahead BCD subtracter. We have tried to design the reversible logic implementation of the BCD Subtracter optimal in terms of number of reversible gates used and garbage outputs produced. Thus, the proposed work will be of significant value as the technologies mature.
{"title":"Design of Novel Reversible Carry Look-Ahead BCD Subtractor","authors":"H. Thapliyal, Sumedha Gupta","doi":"10.1109/ICIT.2006.44","DOIUrl":"https://doi.org/10.1109/ICIT.2006.44","url":null,"abstract":"IEEE 754r is the ongoing revision to the IEEE 754 floating point standard. A major enhancement to the standard is the addition of decimal format, thus the design of BCD arithmetic units is likely to get significant attention. Firstly, this paper introduces a novel carry look-ahead BCD adder and then builds a novel carry look-ahead BCD subtracter based on it. Secondly, it introduces the reversible logic implementation of the proposed carry look-ahead BCD subtracter. We have tried to design the reversible logic implementation of the BCD Subtracter optimal in terms of number of reversible gates used and garbage outputs produced. Thus, the proposed work will be of significant value as the technologies mature.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"16 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113995272","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}
This paper deals with the identification of the swaras in a given Carnatic song, which is an essential component, needed for raga identification of South Indian Classical - Carnatic music. Raga is a representation of the possible swaras that can occur in a given Carnatic song. This paper first deals with the segmentation of Carnatic vocal music and then attempts to find the pitch associated with each segment. We propose a two level segmentation algorithm to yield the probable swara segments. For each segment, pitch information is extracted to find the frequency of that particular segment. The fundamental frequency associated with the music signal conveys the overall pitch of the singer, which in turn corresponds to the middle octave swara 'Sa'. The frequencies associated with the segments are identified and the exact tagging of swara is performed to find the 7-swara combinations in the given music signal.
{"title":"Swara Indentification for South Indian Classical Music","authors":"R. Sridhar, T. Geetha","doi":"10.1109/ICIT.2006.83","DOIUrl":"https://doi.org/10.1109/ICIT.2006.83","url":null,"abstract":"This paper deals with the identification of the swaras in a given Carnatic song, which is an essential component, needed for raga identification of South Indian Classical - Carnatic music. Raga is a representation of the possible swaras that can occur in a given Carnatic song. This paper first deals with the segmentation of Carnatic vocal music and then attempts to find the pitch associated with each segment. We propose a two level segmentation algorithm to yield the probable swara segments. For each segment, pitch information is extracted to find the frequency of that particular segment. The fundamental frequency associated with the music signal conveys the overall pitch of the singer, which in turn corresponds to the middle octave swara 'Sa'. The frequencies associated with the segments are identified and the exact tagging of swara is performed to find the 7-swara combinations in the given music signal.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124054367","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
扫码关注我们
求助内容：
应助结果提醒方式：