Pub Date : 2014-04-10DOI: 10.1109/ICRTIT.2014.6996206
N. Iyer, Suresh R. Norman
Automated Condition Monitoring (ACM) of rotating machines is necessary to avoid sudden machine breakdown due to wear and tear of Rolling Element Bearings (REBs). Hence, detecting faults in REBs well before machine outage is important. The aim of the proposed system is to develop a prototype to detect mechanical wear, by capturing acoustic signals with frequencies between 20 Hz to 20 kHz, from the machine under test, using non-contact electret microphone sensor. The frequency spectra of the acoustic signal from a healthy bearing is compared with the acquired acoustic signal. This system aids in scheduled replacement of faulty parts, thereby reducing the machine downtime, increasing reliability and customer satisfaction, but the results do not infer on the severity of the fault present in the REBs. The system also helps in predicting Remaining Useful Life (RUL) of the machine under consideration.
{"title":"Analysis of acoustic signals from rotating machines for wear detection","authors":"N. Iyer, Suresh R. Norman","doi":"10.1109/ICRTIT.2014.6996206","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996206","url":null,"abstract":"Automated Condition Monitoring (ACM) of rotating machines is necessary to avoid sudden machine breakdown due to wear and tear of Rolling Element Bearings (REBs). Hence, detecting faults in REBs well before machine outage is important. The aim of the proposed system is to develop a prototype to detect mechanical wear, by capturing acoustic signals with frequencies between 20 Hz to 20 kHz, from the machine under test, using non-contact electret microphone sensor. The frequency spectra of the acoustic signal from a healthy bearing is compared with the acquired acoustic signal. This system aids in scheduled replacement of faulty parts, thereby reducing the machine downtime, increasing reliability and customer satisfaction, but the results do not infer on the severity of the fault present in the REBs. The system also helps in predicting Remaining Useful Life (RUL) of the machine under consideration.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126225702","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-04-10DOI: 10.1109/ICRTIT.2014.6996195
E. Leavline, S. Megala, D. A. A. G. Singh
Discrete Cosine Transform (DCT) is widely used in image and video compression standards. This paper presents low-power co-ordinate rotation digital computer (CORDIC) based reconfigurable architecture for discrete cosine transform (DCT). All the computations in DCT are not equally important in generating the frequency domain output. Considering the important difference in the DCT coefficients the number of CORDIC iterations can be dynamically changed to reduce the power of consumption with improved image quality. The proposed CORDIC based 2D DCT architecture is simulated using Modelsim and the experimental results show that our reconfigurable DCT achieves power savings with improved image quality.
{"title":"CORDIC iterations based architecture for low power and high quality DCT","authors":"E. Leavline, S. Megala, D. A. A. G. Singh","doi":"10.1109/ICRTIT.2014.6996195","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996195","url":null,"abstract":"Discrete Cosine Transform (DCT) is widely used in image and video compression standards. This paper presents low-power co-ordinate rotation digital computer (CORDIC) based reconfigurable architecture for discrete cosine transform (DCT). All the computations in DCT are not equally important in generating the frequency domain output. Considering the important difference in the DCT coefficients the number of CORDIC iterations can be dynamically changed to reduce the power of consumption with improved image quality. The proposed CORDIC based 2D DCT architecture is simulated using Modelsim and the experimental results show that our reconfigurable DCT achieves power savings with improved image quality.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"431 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123595913","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-04-10DOI: 10.1109/ICRTIT.2014.6996155
J. Sengathir, R. Manoharan, R. Raja Kumar
Reliable dissemination of data in mobile ad hoc network necessitates high degree of connectivity among the nodes present in that environment. The existence of selfish nodes could drastically affect the network connectivity. However, the impact of selfish nodes on network connectivity has been studied either through reputation factor computed based on past history or conditional probability manipulated based on both the past and present behavior of nodes. Hence, a need arises for formulating a mathematical model that makes its future routing decision only based on the present context of the node. In this paper, we propose a Semi-Markov based mathematical model, which isolates selfish nodes exponentially. In particular, we stochastically analyze the network resilience with the aid of transition probability matrix. The effectiveness of the proposed model for network survivability has been verified through quantitative analysis. The numerical results, thus obtained make it evident that the network survivability decreases when the number of selfish nodes increases in an ad hoc scenario.
{"title":"Semi - Markov based node behavior model for isolating selfish neighbors in MANETs","authors":"J. Sengathir, R. Manoharan, R. Raja Kumar","doi":"10.1109/ICRTIT.2014.6996155","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996155","url":null,"abstract":"Reliable dissemination of data in mobile ad hoc network necessitates high degree of connectivity among the nodes present in that environment. The existence of selfish nodes could drastically affect the network connectivity. However, the impact of selfish nodes on network connectivity has been studied either through reputation factor computed based on past history or conditional probability manipulated based on both the past and present behavior of nodes. Hence, a need arises for formulating a mathematical model that makes its future routing decision only based on the present context of the node. In this paper, we propose a Semi-Markov based mathematical model, which isolates selfish nodes exponentially. In particular, we stochastically analyze the network resilience with the aid of transition probability matrix. The effectiveness of the proposed model for network survivability has been verified through quantitative analysis. The numerical results, thus obtained make it evident that the network survivability decreases when the number of selfish nodes increases in an ad hoc scenario.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121600073","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-04-10DOI: 10.1109/ICRTIT.2014.6996192
S. Kanagaraj, A. Shahina, M. Devosh, N. Kamalakannan
Emotion Recognition is an important area of affective computing and has potential applications. This paper proposes a combinational model to compute the percentage of different emotions jointly present in a given speech input. This model is a weighted combination of the classifier models like Neural Network, k-Nearest Neighbors, Gaussian Mixture Model, Naïve Bayesian Classifier and Support Vector Machines is proposed. The results of classification from the individual models are reported and compared with the proposed combinational model. It shows that the best performance is achieved using the proposed combination than the individual models.
{"title":"EmoMeter: Measuring mixed emotions using weighted combinational model","authors":"S. Kanagaraj, A. Shahina, M. Devosh, N. Kamalakannan","doi":"10.1109/ICRTIT.2014.6996192","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996192","url":null,"abstract":"Emotion Recognition is an important area of affective computing and has potential applications. This paper proposes a combinational model to compute the percentage of different emotions jointly present in a given speech input. This model is a weighted combination of the classifier models like Neural Network, k-Nearest Neighbors, Gaussian Mixture Model, Naïve Bayesian Classifier and Support Vector Machines is proposed. The results of classification from the individual models are reported and compared with the proposed combinational model. It shows that the best performance is achieved using the proposed combination than the individual models.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129536680","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-04-10DOI: 10.1109/ICRTIT.2014.6996202
M. Raghini, N. Maheswari, R. Venkatesh
Secure Distributed Wireless Sensor Network (DWSN) is empowered by using an efficient key management technique. Battery powered sensor nodes faces precarious aspects during key distribution in order to reduce the energy consumption for the components of sensor nodes. Thus, implementing a key distribution algorithm should possess minimum power consumption. The proposed work steps towards greater heights by integrating power module with pairwise key establishment using group configuration methodology. We present an investigation of power consumption using STEM (Sparse Topology and Energy Management) protocol on sensor nodes (SNs) during the pairwise key establishment using graphical tools. Further memory utilization is reduced due to less number of keys generated from group configuration methodology. Analytical results of this PEAK (Power Efficiency Analysis for Key Distribution) show that energy efficiency is increased with sensor nodes while establishing pairwise key using group configuration when compared to existing key predistribution techniques.
{"title":"Peak: Power efficiency analysis for key distribution in Wireless Sensor Network","authors":"M. Raghini, N. Maheswari, R. Venkatesh","doi":"10.1109/ICRTIT.2014.6996202","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996202","url":null,"abstract":"Secure Distributed Wireless Sensor Network (DWSN) is empowered by using an efficient key management technique. Battery powered sensor nodes faces precarious aspects during key distribution in order to reduce the energy consumption for the components of sensor nodes. Thus, implementing a key distribution algorithm should possess minimum power consumption. The proposed work steps towards greater heights by integrating power module with pairwise key establishment using group configuration methodology. We present an investigation of power consumption using STEM (Sparse Topology and Energy Management) protocol on sensor nodes (SNs) during the pairwise key establishment using graphical tools. Further memory utilization is reduced due to less number of keys generated from group configuration methodology. Analytical results of this PEAK (Power Efficiency Analysis for Key Distribution) show that energy efficiency is increased with sensor nodes while establishing pairwise key using group configuration when compared to existing key predistribution techniques.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133306650","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-04-10DOI: 10.1109/ICRTIT.2014.6996175
G. J. Rathanam, M. Sumalatha
Nowadays storage systems are now exposed to wide numbers of threat while handling the information in cloud service. Therefore we design a secured storage system for ensuring security and dynamic operation in the environment. The data is stored in the server using dynamic data operation with partitioning method. Improved Adaptive Huffman Technique and Improved RSA Double Encryption Technique also used which enables the user to access process in a secure manner and efficient way. The system does a verification to prevent the loss of data and ensures security with storage integrity method. An efficient distributed storage auditing mechanism is implemented to overcome the limitations in handling the data loss. Security in this service enforces error localization and easy detection of misbehaving server. In nature the data are dynamic in cloud service; hence this process aims to store the data with reduced computational cost, space and time consumption.
{"title":"Dynamic secure storage system in cloud services","authors":"G. J. Rathanam, M. Sumalatha","doi":"10.1109/ICRTIT.2014.6996175","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996175","url":null,"abstract":"Nowadays storage systems are now exposed to wide numbers of threat while handling the information in cloud service. Therefore we design a secured storage system for ensuring security and dynamic operation in the environment. The data is stored in the server using dynamic data operation with partitioning method. Improved Adaptive Huffman Technique and Improved RSA Double Encryption Technique also used which enables the user to access process in a secure manner and efficient way. The system does a verification to prevent the loss of data and ensures security with storage integrity method. An efficient distributed storage auditing mechanism is implemented to overcome the limitations in handling the data loss. Security in this service enforces error localization and easy detection of misbehaving server. In nature the data are dynamic in cloud service; hence this process aims to store the data with reduced computational cost, space and time consumption.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132204587","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-04-10DOI: 10.1109/ICRTIT.2014.6996187
P. Pabitha, G. Amirthavalli, C. Vasuki, J. Mridhula
As technology improves day by day communication and browsing has become very much easier. However lots of information floods over the internet every moment thereby confusing the user as to select what or make decisions. To assist the user in identifying their interests and provide suggestions, recommendation systems came into existence. These systems filter the necessary content from large volumes of data to predict resources to the user. Common techniques used to implement recommender systems are content based approach or collaborative approach. However there are few limitations like data not being available for new users, ratings very sparse for resources. A graph based recommender system is proposed that makes useful recommendations by exploiting the significant content available. Clustering technique is used to identify the neighbourhood of the current user so that relevant resources are suggested. A weight based approach is used to calculate the ratings for the resources. This method is adopted to make the system less prone to data sparsity problem. This system is a web based client side application which makes recommendations by constructing user-resource graph and ranking the resources by a new method designed similar to that of search algorithms.
{"title":"Graph based resource recommender system","authors":"P. Pabitha, G. Amirthavalli, C. Vasuki, J. Mridhula","doi":"10.1109/ICRTIT.2014.6996187","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996187","url":null,"abstract":"As technology improves day by day communication and browsing has become very much easier. However lots of information floods over the internet every moment thereby confusing the user as to select what or make decisions. To assist the user in identifying their interests and provide suggestions, recommendation systems came into existence. These systems filter the necessary content from large volumes of data to predict resources to the user. Common techniques used to implement recommender systems are content based approach or collaborative approach. However there are few limitations like data not being available for new users, ratings very sparse for resources. A graph based recommender system is proposed that makes useful recommendations by exploiting the significant content available. Clustering technique is used to identify the neighbourhood of the current user so that relevant resources are suggested. A weight based approach is used to calculate the ratings for the resources. This method is adopted to make the system less prone to data sparsity problem. This system is a web based client side application which makes recommendations by constructing user-resource graph and ranking the resources by a new method designed similar to that of search algorithms.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125738541","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-04-10DOI: 10.1109/ICRTIT.2014.6996117
P. Revathi
Denial of service attack in computing involves blocking of resources to particular user. This kind of blocking may be temporary or indefinite blocking to access web server in the network. This attack is usually done by a victim web server. Distributed denial of service attacks is given by more than two web servers. The flood of incoming network flows to the victim web server forces it to shut down. Although the attack's individual internet packets may be completely not dangerous and flood of such type of packets can overwhelm the victim server's internet connection or other packet-processing resources in the network. The result is that valid traffic, unable to compete with malicious flood, has little chance for obtaining useful service to legitimate users. This paper mainly concentrates on flow and rank correlation based algorithm (FRCD). With rank correlation we can check if there is any attack in the network or not. And having this as the base we could calculate flow correlation to check if this attack is legitimate or not. The proposed system is highly efficient and is a protocol independent method. The computational cost involved does not affect the network's throughput thereby increasing the possibilities of Distributed Reflection Denial of Service attack detection.
{"title":"Flow and rank correlation based detection against Distributed Reflection Denial of Service attack","authors":"P. Revathi","doi":"10.1109/ICRTIT.2014.6996117","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996117","url":null,"abstract":"Denial of service attack in computing involves blocking of resources to particular user. This kind of blocking may be temporary or indefinite blocking to access web server in the network. This attack is usually done by a victim web server. Distributed denial of service attacks is given by more than two web servers. The flood of incoming network flows to the victim web server forces it to shut down. Although the attack's individual internet packets may be completely not dangerous and flood of such type of packets can overwhelm the victim server's internet connection or other packet-processing resources in the network. The result is that valid traffic, unable to compete with malicious flood, has little chance for obtaining useful service to legitimate users. This paper mainly concentrates on flow and rank correlation based algorithm (FRCD). With rank correlation we can check if there is any attack in the network or not. And having this as the base we could calculate flow correlation to check if this attack is legitimate or not. The proposed system is highly efficient and is a protocol independent method. The computational cost involved does not affect the network's throughput thereby increasing the possibilities of Distributed Reflection Denial of Service attack detection.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124653387","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-04-10DOI: 10.1109/ICRTIT.2014.6996133
B. Kiruthika, Devi, G. Preetha, G. Selvaram, S. Mercy, Shalinie Corresponding
Distributed Denial of service (DDoS) attacks is the most devastating attack which tampers the normal functionality of critical services in internet community. DDoS cyber weapon is highly motivated by several aspects including hactivitism, personal revenge, anti-government force, disgruntled employers/customers, ideological and political cause, cyber espionage and so on. IP spoofing is the powerful technique used by attackers to disrupt the availability of services in the internet network by impersonating as a trusted source. Since the spoofed traffic shares the same resources as that of the legitimate one's detection and filtering becomes very essential. The proposed model consists of online monitoring system (OMS), spoofed traffic detection module and interface based rate limiting (IBRL) algorithm. OMS provides DDoS impact measurements in real time by monitoring the degradation in host and network performance metrics. The spoofed traffic detection module incorporates hop count inspection algorithm (HCF) to check the authenticity of incoming packet by means of source IP address and its corresponding hops to destined victim. HCF coupled with support vector machine (SVM) provides 98.99% accuracy with reduced false positive. Followed with, IBRL algorithm restricts the traffic aggregates at victim router when exceeding system limits in order to provide sufficient bandwidth for remaining flows.
分布式拒绝服务攻击(Distributed Denial of service, DDoS)是网络社区中破坏关键服务正常运行的最具破坏性的攻击。DDoS网络武器的动机主要有行动主义、个人报复、反政府力量、不满雇主/客户、意识形态和政治原因、网络间谍活动等。IP欺骗是一种强大的技术，攻击者通过冒充可信源来破坏internet网络中服务的可用性。由于欺骗流量与合法流量共享相同的资源，因此检测和过滤变得非常重要。该模型由在线监控系统(OMS)、欺骗流量检测模块和基于接口的限速(IBRL)算法组成。OMS通过监控主机和网络性能指标的下降，实时提供DDoS影响测量。欺骗流量检测模块采用HCF (hop count inspection algorithm)算法，通过源IP地址和到达目标对象的跳数来检测报文的真实性。HCF与支持向量机(SVM)相结合，准确率达到98.99%，同时减少了误报。IBRL算法在流量超过系统限制时，对受害路由器上的流量聚合进行限制，为剩余流量提供足够的带宽。
{"title":"An impact analysis: Real time DDoS attack detection and mitigation using machine learning","authors":"B. Kiruthika, Devi, G. Preetha, G. Selvaram, S. Mercy, Shalinie Corresponding","doi":"10.1109/ICRTIT.2014.6996133","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996133","url":null,"abstract":"Distributed Denial of service (DDoS) attacks is the most devastating attack which tampers the normal functionality of critical services in internet community. DDoS cyber weapon is highly motivated by several aspects including hactivitism, personal revenge, anti-government force, disgruntled employers/customers, ideological and political cause, cyber espionage and so on. IP spoofing is the powerful technique used by attackers to disrupt the availability of services in the internet network by impersonating as a trusted source. Since the spoofed traffic shares the same resources as that of the legitimate one's detection and filtering becomes very essential. The proposed model consists of online monitoring system (OMS), spoofed traffic detection module and interface based rate limiting (IBRL) algorithm. OMS provides DDoS impact measurements in real time by monitoring the degradation in host and network performance metrics. The spoofed traffic detection module incorporates hop count inspection algorithm (HCF) to check the authenticity of incoming packet by means of source IP address and its corresponding hops to destined victim. HCF coupled with support vector machine (SVM) provides 98.99% accuracy with reduced false positive. Followed with, IBRL algorithm restricts the traffic aggregates at victim router when exceeding system limits in order to provide sufficient bandwidth for remaining flows.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128792697","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}
Delay-Tolerant Networks (DTNs) refer to mobile wireless networks that lack continuous network connectivity among the nodes. To deal with such intermittent characteristics, DTNs use store-carry-and-forward based routing protocols instead of instantaneous end-to-end path transmissions. Many real-life applications of such networks have been identified and some of them pose complex computational challenges. DTN nodes, however, do not necessarily possess high degree of computational power and are also limited by their energy constraints. Distributed computing has the ability to solve computationally complex and lengthy problems by dividing them into many tasks, which are then spread over the network to be solved simultaneously, resulting in faster execution and significantly lower costs. In this paper, we study the prospect of distributed computing techniques in DTNs. We investigate different job distribution algorithms and their performance across multiple DTN scenarios. We simulate a distributed job processing system on top of a DTN for various scenarios and analyze the effect of node density, job slicing, and mobility models on their performance.
{"title":"Distributing jobs in Delay-Tolerant Networks: Is optimization worth it?","authors":"Akhilesh Jain, Prem Nath Suman, Kapil Tawar, Mayank Jain","doi":"10.1109/ICRTIT.2014.6996205","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996205","url":null,"abstract":"Delay-Tolerant Networks (DTNs) refer to mobile wireless networks that lack continuous network connectivity among the nodes. To deal with such intermittent characteristics, DTNs use store-carry-and-forward based routing protocols instead of instantaneous end-to-end path transmissions. Many real-life applications of such networks have been identified and some of them pose complex computational challenges. DTN nodes, however, do not necessarily possess high degree of computational power and are also limited by their energy constraints. Distributed computing has the ability to solve computationally complex and lengthy problems by dividing them into many tasks, which are then spread over the network to be solved simultaneously, resulting in faster execution and significantly lower costs. In this paper, we study the prospect of distributed computing techniques in DTNs. We investigate different job distribution algorithms and their performance across multiple DTN scenarios. We simulate a distributed job processing system on top of a DTN for various scenarios and analyze the effect of node density, job slicing, and mobility models on their performance.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"09 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129916931","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
扫码关注我们
求助内容：
应助结果提醒方式：