Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844211
S. Harish, R. Hemalatha, S. Radha
In traditional sampling methods, images are sampled at the Nyquist rate for perfect reconstruction. But most of these acquired data samples are discarded during compression. Compressed Sensing (CS) overcomes this problem by combining the acquisition and compression process. Most of the images are sparse in some domain and thus can be recovered from reduced number of samples than the Nyquist rate. The quality of reconstruction depends upon the sparsity level of the image. Contourlet transform is used to obtain the sparse representation of the image while the wavelet transform reduces the complexity of the compressed sensing algorithm. Thus both the transforms are combined to achieve better recovery from reduced number of sparse measurements. The low frequency wavelet subband contains most of the information and thus more number of samples is taken from this band. The high frequency wavelet bands contain lesser amount of data and thus reduced number of samples is taken from these bands. The recovered image is smoothened by using the Hybrid Mean Median (HMM) Filter because of its nature of preserving the sharp edges in the image. Hence higher quality image is obtained from very less measurements.
{"title":"Image recovery from reduced sparse measurements by compressed sensing based on wavelet transform","authors":"S. Harish, R. Hemalatha, S. Radha","doi":"10.1109/ICRTIT.2013.6844211","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844211","url":null,"abstract":"In traditional sampling methods, images are sampled at the Nyquist rate for perfect reconstruction. But most of these acquired data samples are discarded during compression. Compressed Sensing (CS) overcomes this problem by combining the acquisition and compression process. Most of the images are sparse in some domain and thus can be recovered from reduced number of samples than the Nyquist rate. The quality of reconstruction depends upon the sparsity level of the image. Contourlet transform is used to obtain the sparse representation of the image while the wavelet transform reduces the complexity of the compressed sensing algorithm. Thus both the transforms are combined to achieve better recovery from reduced number of sparse measurements. The low frequency wavelet subband contains most of the information and thus more number of samples is taken from this band. The high frequency wavelet bands contain lesser amount of data and thus reduced number of samples is taken from these bands. The recovered image is smoothened by using the Hybrid Mean Median (HMM) Filter because of its nature of preserving the sharp edges in the image. Hence higher quality image is obtained from very less measurements.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131058704","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844268
M. Jeeva, B. Ramani, P. Vijayalakshmi
Given an input text, a text-to-speech (TTS) system is expected to produce a speech signal that is highly intelligible to human listener. State-of-the art synthesis approaches are: unit selection-based concatenative speech synthesis (USS) and hidden Markov model (HMM)-based speech synthesis (HTS). In USS approach, pre-recorded speech units are selected according to the given text and concatenated to produce synthetic speech whereas in HTS approach, features are extracted from the speech units and the context dependent HMMs are trained for these units. These models are concatenated to form sentence HMMs, which synthesize speech for the given text, by extracting features from them and passing it through corresponding source-system filters. For Indian languages, building a speech synthesizer for each language is laborious. In this work, monolingual and multilingual speech synthesizers are developed in the state-of-the-art approaches and the performances are compared for both the systems. Based on the acoustic similarities across Indian languages, a common phoneset and a question set is derived for four of the Indian languages namely, Tamil, Telugu, Malayalam, and Hindi. The performance of the synthesizers developed are evaluated using mean opinion score (MOS) derived from the listeners. The average MOS ranges from 2.57 to 3.88 for the monolingual and multilingual systems.
{"title":"Performance evaluation and comparison of multilingual speech synthesizers for Indian languages","authors":"M. Jeeva, B. Ramani, P. Vijayalakshmi","doi":"10.1109/ICRTIT.2013.6844268","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844268","url":null,"abstract":"Given an input text, a text-to-speech (TTS) system is expected to produce a speech signal that is highly intelligible to human listener. State-of-the art synthesis approaches are: unit selection-based concatenative speech synthesis (USS) and hidden Markov model (HMM)-based speech synthesis (HTS). In USS approach, pre-recorded speech units are selected according to the given text and concatenated to produce synthetic speech whereas in HTS approach, features are extracted from the speech units and the context dependent HMMs are trained for these units. These models are concatenated to form sentence HMMs, which synthesize speech for the given text, by extracting features from them and passing it through corresponding source-system filters. For Indian languages, building a speech synthesizer for each language is laborious. In this work, monolingual and multilingual speech synthesizers are developed in the state-of-the-art approaches and the performances are compared for both the systems. Based on the acoustic similarities across Indian languages, a common phoneset and a question set is derived for four of the Indian languages namely, Tamil, Telugu, Malayalam, and Hindi. The performance of the synthesizers developed are evaluated using mean opinion score (MOS) derived from the listeners. The average MOS ranges from 2.57 to 3.88 for the monolingual and multilingual systems.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129480182","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844258
S. Ghatak, P. Nayak, T. Sindhura
In the proposed technique, the first idea of a novel elucidation has been proposed to shelter dull Passport. The contemporary state of dull Passport be defeated by proper Passport verification along with Passport owner authentication. The proposed solution space ensures security against these two which is candidly adoptable in the current milieu of India. As Verification and Authentication are two special stream of Cryptography; the only way to lock facts, proposed contrivance is based on Visual Cryptography and Palm Vein based authentication practice. As a fact of multimedia data hiding, Visual Cryptography is a well-known method of encrypting images into several shares where stacking corresponding shares reveals secrets without intervention of any electronic devices. Palm Vein based biometric is already implemented for user authentication in many countries throughout the world. It is an on-going technology which is very easy to implement and cost effective with respect to resources and time. The said proposal will verify dull Passport through Visual Cryptography and authenticate dull Passport holder at various checkpoints through Palm Vein Authentication in the form of a Multilayer cryptographic technique. The performance of the proposed Visual Cryptographic algorithm is also compared with some existing algorithms. The comparisons shows that the proposed algorithm is better than the existing algorithms with respect to space requirement, Meaningfulness, and security.
{"title":"Revolutionizing the “DULL” Passport","authors":"S. Ghatak, P. Nayak, T. Sindhura","doi":"10.1109/ICRTIT.2013.6844258","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844258","url":null,"abstract":"In the proposed technique, the first idea of a novel elucidation has been proposed to shelter dull Passport. The contemporary state of dull Passport be defeated by proper Passport verification along with Passport owner authentication. The proposed solution space ensures security against these two which is candidly adoptable in the current milieu of India. As Verification and Authentication are two special stream of Cryptography; the only way to lock facts, proposed contrivance is based on Visual Cryptography and Palm Vein based authentication practice. As a fact of multimedia data hiding, Visual Cryptography is a well-known method of encrypting images into several shares where stacking corresponding shares reveals secrets without intervention of any electronic devices. Palm Vein based biometric is already implemented for user authentication in many countries throughout the world. It is an on-going technology which is very easy to implement and cost effective with respect to resources and time. The said proposal will verify dull Passport through Visual Cryptography and authenticate dull Passport holder at various checkpoints through Palm Vein Authentication in the form of a Multilayer cryptographic technique. The performance of the proposed Visual Cryptographic algorithm is also compared with some existing algorithms. The comparisons shows that the proposed algorithm is better than the existing algorithms with respect to space requirement, Meaningfulness, and security.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122122889","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844228
R. Sathiaseelan, Sriram Sitharaman, R. B. Subramanian, R. Senthilkumar
Information Retrieval system produces the result in the order of the most relevant to the least, for given keywords. The user need to know the exact path of the query in the case of retrieval from an XML document or Compact storage structure, this becomes a hurdle for a novice user and it makes the system suitable only for experts. The On Fly Search (OFS) method has been proposed to make the system suitable for all the users and thus helps the users to search the compact storage structures without any knowledge about the content or about the path of the query. It also extends to support the auto complete method for multiple keyword queries. The typographical errors in the query are removed by the usage of fuzzy logic techniques. The effective Indexing Structure in QUICX helps to retrieve the data efficiently from the compact storage structure. The radix trie data structure, ranking function and inverted indexing has been used to have effective on fly search and to retrieve the top k results. The experiments are carried out on standard bench mark datasets like Shakespeare dataset, the results shows that the proposed method helps to retrieve the top-k results for the user query comparatively better than the existing approaches.
{"title":"On fly search approach for compact XML","authors":"R. Sathiaseelan, Sriram Sitharaman, R. B. Subramanian, R. Senthilkumar","doi":"10.1109/ICRTIT.2013.6844228","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844228","url":null,"abstract":"Information Retrieval system produces the result in the order of the most relevant to the least, for given keywords. The user need to know the exact path of the query in the case of retrieval from an XML document or Compact storage structure, this becomes a hurdle for a novice user and it makes the system suitable only for experts. The On Fly Search (OFS) method has been proposed to make the system suitable for all the users and thus helps the users to search the compact storage structures without any knowledge about the content or about the path of the query. It also extends to support the auto complete method for multiple keyword queries. The typographical errors in the query are removed by the usage of fuzzy logic techniques. The effective Indexing Structure in QUICX helps to retrieve the data efficiently from the compact storage structure. The radix trie data structure, ranking function and inverted indexing has been used to have effective on fly search and to retrieve the top k results. The experiments are carried out on standard bench mark datasets like Shakespeare dataset, the results shows that the proposed method helps to retrieve the top-k results for the user query comparatively better than the existing approaches.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126874793","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844266
S. Vengadeswaran, K. Geetha
In the process of software development, testing is the critical activity which consumes more than 50% of resources and time. A challenging step in software testing process is to generate test cases that will sufficiently test the functionality of the software being developed. A technique commonly used to generate the test cases is through branch coverage. Even though the above technique successfully generates test cases for the input program, there are few limitations during which this technique does not prove to be useful. Especially when an infeasible path is encountered in the program under test, the test cases generated does not reflect the reality. To overcome such situation test cases generation through symbolic execution is proposed in this paper.
{"title":"Symbolic execution — An efficient approach for test case generation","authors":"S. Vengadeswaran, K. Geetha","doi":"10.1109/ICRTIT.2013.6844266","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844266","url":null,"abstract":"In the process of software development, testing is the critical activity which consumes more than 50% of resources and time. A challenging step in software testing process is to generate test cases that will sufficiently test the functionality of the software being developed. A technique commonly used to generate the test cases is through branch coverage. Even though the above technique successfully generates test cases for the input program, there are few limitations during which this technique does not prove to be useful. Especially when an infeasible path is encountered in the program under test, the test cases generated does not reflect the reality. To overcome such situation test cases generation through symbolic execution is proposed in this paper.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127279554","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844255
D. Prathiba, S. Umamaheswari
The proposed reconfigurable architecture for Networks-on-chip (NoC) changes the network topology by dynamically changing the router connections. This ReNoC can adapt more than one application on a single chip for desired application known at runtime. The router connections are changed by using the configuration switches. This scenario gives the reconfigured NoC architecture and is achieved by data transmission between the source and destination of the NoC architecture. In this proposed reconfigurable NoC architecture, the energy consumption induced by the links is more than that of the router. So, data encoding and decoding t techniques are used to reduce the energy consumption of data transmission and hence the power dissipation in the NoC architecture.
{"title":"Application based topology adaptation in NoC architecture with reduced power dissipation","authors":"D. Prathiba, S. Umamaheswari","doi":"10.1109/ICRTIT.2013.6844255","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844255","url":null,"abstract":"The proposed reconfigurable architecture for Networks-on-chip (NoC) changes the network topology by dynamically changing the router connections. This ReNoC can adapt more than one application on a single chip for desired application known at runtime. The router connections are changed by using the configuration switches. This scenario gives the reconfigured NoC architecture and is achieved by data transmission between the source and destination of the NoC architecture. In this proposed reconfigurable NoC architecture, the energy consumption induced by the links is more than that of the router. So, data encoding and decoding t techniques are used to reduce the energy consumption of data transmission and hence the power dissipation in the NoC architecture.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122877642","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844215
Chakradhar P Research, P Yogesh
In this paper we proposed a new Minimum Connected Dominating Set [MCDS] algorithm. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem[1]. The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad-hoc networks. Here the MCDS is a distributed algorithm based on Unit Disk Graph[7]. The node's mobility and residual energy are considered as parameters in construction of stable MCDS. The time complexity of this algorithm is O(n) and the message complexity is O(n). The performance evaluation of this algorithm yields better results in dense networks as well as sparse networks. Size of the MCDS is also small compared to other distributed algorithms[8][9][10].
{"title":"Energy efficient minimum connected dominating set algorithm for MANETs","authors":"Chakradhar P Research, P Yogesh","doi":"10.1109/ICRTIT.2013.6844215","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844215","url":null,"abstract":"In this paper we proposed a new Minimum Connected Dominating Set [MCDS] algorithm. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem[1]. The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad-hoc networks. Here the MCDS is a distributed algorithm based on Unit Disk Graph[7]. The node's mobility and residual energy are considered as parameters in construction of stable MCDS. The time complexity of this algorithm is O(n) and the message complexity is O(n). The performance evaluation of this algorithm yields better results in dense networks as well as sparse networks. Size of the MCDS is also small compared to other distributed algorithms[8][9][10].","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131402527","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844225
M. A. Maffina, R. Rampriya
The main aim of this project is to provide secure communication among distributed clusters via Message Passing Interface (MPI). When a number of clusters associated to each other are increased then, it becomes a threat to security applications running on the clusters. To handle this security trouble, a MPI is built-up to protect the properties of security in an untrusted network. In the existing system, to generate the symmetric shared key, the participant provide only 1 byte size of random number so there is a chance to find out the key by the intruder. Furthermore, here only text message is passed between the clients. The proposed system is Enhanced Security for Message Passing Interface Chameleon version 2 (ES-MPICH2) in which it maintains the size of random number as 4 bytes, thus it is impossible to find out the key by the unauthorized person. This protocol is extended with features, such as secure file transfer utility and rekeying process. As well it supports to encrypt and decrypt the file upload by the user. We use secure algorithms like interpolation polynomial, AES and SHA-1 for key management, encryption/decryption and providing integrity service. After that those algorithms are integrated into Message Passing Interface Chameleon version 2 (MPICH2) that becomes ES-MPICH2. It supports a large collection of calculation and conversation area. The proposed work is based on both mathematics and cryptography concept that direct to error free message passing among the authorized users with enhanced security.
该项目的主要目的是通过消息传递接口(Message Passing Interface, MPI)在分布式集群之间提供安全通信。当相互关联的集群数量增加时，就会对在集群上运行的安全应用程序构成威胁。为了解决这一安全问题，建立了MPI来保护不受信任网络中的安全属性。在现有的系统中，为了生成对称共享密钥，参与者只提供1字节大小的随机数，因此有机会被入侵者找到密钥。此外，这里只有文本消息在客户端之间传递。所提出的系统是Enhanced Security for Message Passing Interface Chameleon version 2 (ES-MPICH2)，它将随机数的大小保持在4字节，因此未经授权的人不可能找到密钥。该协议扩展了安全文件传输实用程序和密钥更新过程等功能。它还支持对用户上传的文件进行加密和解密。我们使用插值多项式、AES和SHA-1等安全算法进行密钥管理、加解密和提供完整性服务。之后，这些算法被集成到消息传递接口变色龙版本2 (MPICH2)中，成为ES-MPICH2。它支持大量的集合计算和对话区域。建议的工作是基于数学和密码学的概念，直接在授权用户之间以增强的安全性传递无错误的消息。
{"title":"An improved and efficient message passing interface for secure communication on distributed clusters","authors":"M. A. Maffina, R. Rampriya","doi":"10.1109/ICRTIT.2013.6844225","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844225","url":null,"abstract":"The main aim of this project is to provide secure communication among distributed clusters via Message Passing Interface (MPI). When a number of clusters associated to each other are increased then, it becomes a threat to security applications running on the clusters. To handle this security trouble, a MPI is built-up to protect the properties of security in an untrusted network. In the existing system, to generate the symmetric shared key, the participant provide only 1 byte size of random number so there is a chance to find out the key by the intruder. Furthermore, here only text message is passed between the clients. The proposed system is Enhanced Security for Message Passing Interface Chameleon version 2 (ES-MPICH2) in which it maintains the size of random number as 4 bytes, thus it is impossible to find out the key by the unauthorized person. This protocol is extended with features, such as secure file transfer utility and rekeying process. As well it supports to encrypt and decrypt the file upload by the user. We use secure algorithms like interpolation polynomial, AES and SHA-1 for key management, encryption/decryption and providing integrity service. After that those algorithms are integrated into Message Passing Interface Chameleon version 2 (MPICH2) that becomes ES-MPICH2. It supports a large collection of calculation and conversation area. The proposed work is based on both mathematics and cryptography concept that direct to error free message passing among the authorized users with enhanced security.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122456817","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844218
Saravanan K, Venkatalakshmi B
Recent times, a new communication archetype called Network Coding (NC) has emerged in which the mediator nodes allowed to carry out encoding and decoding operations on the information they receive. Network capacity of any communication network can be enhanced through this network coding strategy. Mobile Ad-hoc Networks (MANET) often consist of large number of mobile nodes that are strictly power constrained. So, it is important to minimize the power utilization of every single node in order to improve the network lifetime. Blind Encoding consequences superfluous power consumption. If a node moves after encoding the packet due its dynamic nature then obviously waste of time and power occurs. This work proposes an algorithm called mobility based minimal network coding algorithm (MBMNC) for MANET which allows only minimal number of nodes to encode by considering the node mobility. The eligibility criteria of a node to do NC have a dependency on link availability of a node with respect to its neighboring node. The probability of the link availability influences the decision of whether the node is an encoding node or forwarding node. Only a limited number of nodes with high probability of link availability will do network coding. This work proposes a solution for enhancing the network capacity through network coding in consideration with node mobility.
{"title":"Mobility based minimal network coding (MBMNC) algorithm for mobile ad-hoc network","authors":"Saravanan K, Venkatalakshmi B","doi":"10.1109/ICRTIT.2013.6844218","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844218","url":null,"abstract":"Recent times, a new communication archetype called Network Coding (NC) has emerged in which the mediator nodes allowed to carry out encoding and decoding operations on the information they receive. Network capacity of any communication network can be enhanced through this network coding strategy. Mobile Ad-hoc Networks (MANET) often consist of large number of mobile nodes that are strictly power constrained. So, it is important to minimize the power utilization of every single node in order to improve the network lifetime. Blind Encoding consequences superfluous power consumption. If a node moves after encoding the packet due its dynamic nature then obviously waste of time and power occurs. This work proposes an algorithm called mobility based minimal network coding algorithm (MBMNC) for MANET which allows only minimal number of nodes to encode by considering the node mobility. The eligibility criteria of a node to do NC have a dependency on link availability of a node with respect to its neighboring node. The probability of the link availability influences the decision of whether the node is an encoding node or forwarding node. Only a limited number of nodes with high probability of link availability will do network coding. This work proposes a solution for enhancing the network capacity through network coding in consideration with node mobility.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"465 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115629500","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844226
Sunitha Abburu, G. S. Babu
Ontologies are an inevitable aspect of knowledge representation, processing, sharing and reuse and this in itself is the essence and significance of ontology. The number of ontologies available online is growing at a rapid pace. This conspicuous growth of ontologies enables sharing of knowledge in distributed and heterogeneous systems. The tremendous growth of ontologies has implied the popping up of multiple ontologies of the same domain. Applications developed based on these ontologies cannot achieve interoperability. To conquer this problem one of the optimum solution is to merge the ontologies in to a single general complete ontology. This brings up the need for a method which merges multiple ontologies, producing consistent, complete ontology. Another decisive factor worth consideration is the performance of multiple ontology merge process in terms of time. The current research work proposes a new cluster based multiple ontology parallel merge process. The performance of the multiple ontology merge process is fine-tuned by considering the similarity measure and parallel merge process. The proposed method produces consistent, optimum and complete knowledge of the domain as a single ontology with reduced time, which can be used by heterogeneous applications. The proposed method is implemented and a comparison of time complexity of the processing is presented at the end.
{"title":"A cluster based multiple ontology parallel merge method","authors":"Sunitha Abburu, G. S. Babu","doi":"10.1109/ICRTIT.2013.6844226","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844226","url":null,"abstract":"Ontologies are an inevitable aspect of knowledge representation, processing, sharing and reuse and this in itself is the essence and significance of ontology. The number of ontologies available online is growing at a rapid pace. This conspicuous growth of ontologies enables sharing of knowledge in distributed and heterogeneous systems. The tremendous growth of ontologies has implied the popping up of multiple ontologies of the same domain. Applications developed based on these ontologies cannot achieve interoperability. To conquer this problem one of the optimum solution is to merge the ontologies in to a single general complete ontology. This brings up the need for a method which merges multiple ontologies, producing consistent, complete ontology. Another decisive factor worth consideration is the performance of multiple ontology merge process in terms of time. The current research work proposes a new cluster based multiple ontology parallel merge process. The performance of the multiple ontology merge process is fine-tuned by considering the similarity measure and parallel merge process. The proposed method produces consistent, optimum and complete knowledge of the domain as a single ontology with reduced time, which can be used by heterogeneous applications. The proposed method is implemented and a comparison of time complexity of the processing is presented at the end.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487521","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
扫码关注我们
求助内容：
应助结果提醒方式：