Pub Date : 2018-02-01DOI: 10.1109/ICCMC.2018.8488150
B. Jitkar, S. Raut
The rapid and continuous growth in the multimedia technology, computational power and the availability of storage devices like NAS, the size of image databases increases day by day over the Internet through many academic, commercial and social websites. So, these image databases attracted the attention of the researchers for fast and efficient image retrieval. The mechanisms like indexing and hash table can be used to solve these problems. The main challenge is to find a proper index technique which improves query performance. This paper focuses on the novel approach for design and development of efficient indexing technique based on B+ tree. The privacy has been maintained by applying the AES encryption algorithm for the nodes. Genetic algorithm has been applied to generate the optimized B+ tree. The result analysis shows that the optimized B+ tree generated by our novel approach gives better result than the B+ tree based on different analysis parameters like number of nodes, memory, search time, insertion time etc.
{"title":"A Novel Approach for Generation of Optimized Image Index for Very Large Database","authors":"B. Jitkar, S. Raut","doi":"10.1109/ICCMC.2018.8488150","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8488150","url":null,"abstract":"The rapid and continuous growth in the multimedia technology, computational power and the availability of storage devices like NAS, the size of image databases increases day by day over the Internet through many academic, commercial and social websites. So, these image databases attracted the attention of the researchers for fast and efficient image retrieval. The mechanisms like indexing and hash table can be used to solve these problems. The main challenge is to find a proper index technique which improves query performance. This paper focuses on the novel approach for design and development of efficient indexing technique based on B+ tree. The privacy has been maintained by applying the AES encryption algorithm for the nodes. Genetic algorithm has been applied to generate the optimized B+ tree. The result analysis shows that the optimized B+ tree generated by our novel approach gives better result than the B+ tree based on different analysis parameters like number of nodes, memory, search time, insertion time etc.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"57 1","pages":"500-505"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84061238","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 : 2018-02-01DOI: 10.1109/ICCMC.2018.8487523
K. Reddy, Mohit Chaubey, N. Jeyanthi
Load balancing is a major challenge with today’s ever increasing traffic. Balancing huge amount of incoming requests is a huge concern. Although there are already a wide range of load balancing algorithms [1] [2] [3] at our disposal, deciding the most appropriate one is what leaves the users confused. If the load is not handled properly, it can lead to the breakdown of the entire network within seconds. Hence a strong and methodological comparison [4] [5] [6] [7] is made in this paper considering various functionalities to be handled by a server.
{"title":"Optimizing User Connection and Data Transfer within a Network","authors":"K. Reddy, Mohit Chaubey, N. Jeyanthi","doi":"10.1109/ICCMC.2018.8487523","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487523","url":null,"abstract":"Load balancing is a major challenge with today’s ever increasing traffic. Balancing huge amount of incoming requests is a huge concern. Although there are already a wide range of load balancing algorithms [1] [2] [3] at our disposal, deciding the most appropriate one is what leaves the users confused. If the load is not handled properly, it can lead to the breakdown of the entire network within seconds. Hence a strong and methodological comparison [4] [5] [6] [7] is made in this paper considering various functionalities to be handled by a server.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"124 1","pages":"173-179"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73141369","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 : 2018-02-01DOI: 10.1109/ICCMC.2018.8488069
Dhara Patel, Rajan Patel, Nimisha Patel
VANET (Vehicular Ad-hoc Network) are emerging as a prominent field of MANETs. VANET provides many lifesaving and commercial services. Scheduling of messages in VANET plays a very important role in case of emergency messages. According to message types is a mandate need Priority based Routing Protocol (PRP) in VANET. The main aim is focus on a safety messaging application for safe driving in distributed environment, i.e., ad hoc manner. Deadline based routing protocol (DBR) is proposed along with priority. Currently there is a lacuna in retrieval of various services provisioning in terms of message delivery on time due to frequently disconnectivity of topology in VANET. To mitigate this problem, proposed a hybrid VANET Cloud Fog computing using DBR (Deadline Based Reservation Strategy) for supporting reliable service provisioning. The requests are queued in different combinations of priorities to apply the scheduling algorithm. Once the combinations are applied, the request with the highest priority is served first.
车载自组织网络(Vehicular Ad-hoc Network, VANET)是车载自组织网络的一个重要领域。VANET提供许多救生和商业服务。VANET中的消息调度在紧急消息处理中起着非常重要的作用。基于优先级的路由协议(PRP)是基于报文类型的路由协议。主要目的是研究分布式环境下安全驾驶的安全消息传递应用。提出了基于截止日期的路由协议(DBR)和优先级。目前，由于VANET中拓扑的频繁断连，在消息及时传递方面存在各种服务供应检索的空白。为了缓解这一问题，提出了一种基于DBR (Deadline Based Reservation Strategy)的混合VANET云雾计算，以支持可靠的服务供应。请求以不同的优先级组合排队，以应用调度算法。一旦应用了这些组合，优先级最高的请求将首先得到服务。
{"title":"Cloud Assisted Adaptive Priority Scheduling using Deadline Based Reservation Strategy for VANET","authors":"Dhara Patel, Rajan Patel, Nimisha Patel","doi":"10.1109/ICCMC.2018.8488069","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8488069","url":null,"abstract":"VANET (Vehicular Ad-hoc Network) are emerging as a prominent field of MANETs. VANET provides many lifesaving and commercial services. Scheduling of messages in VANET plays a very important role in case of emergency messages. According to message types is a mandate need Priority based Routing Protocol (PRP) in VANET. The main aim is focus on a safety messaging application for safe driving in distributed environment, i.e., ad hoc manner. Deadline based routing protocol (DBR) is proposed along with priority. Currently there is a lacuna in retrieval of various services provisioning in terms of message delivery on time due to frequently disconnectivity of topology in VANET. To mitigate this problem, proposed a hybrid VANET Cloud Fog computing using DBR (Deadline Based Reservation Strategy) for supporting reliable service provisioning. The requests are queued in different combinations of priorities to apply the scheduling algorithm. Once the combinations are applied, the request with the highest priority is served first.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"17 1","pages":"442-445"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80324738","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 : 2018-02-01DOI: 10.1109/ICCMC.2018.8488103
Hemen Sharma, Shiv Kumar
Agriculture is most important for survival of human being on the earth. As we know that agriculture land is decreasing day by day while population increasing day by day. But it is fact that production is also increasing because of several technologies. It is also fact that income of farmer is not increasing to survive in current scenario because of that several farmers hanging themselves. That is why we require a free application that help them in real world to inform them to identify soil by the type & there composition with suggestion like suitable crops for the corresponding type of soil. In India there are various types of soil. Since soil is a store house of minerals. Farmers are depending on soil for growing different type of crops But mostly farmers are don’t know which crop are grow in which soil. We are now taking about soil of Rajasthan. In Rajasthan, main soil is in desert form. But south part of Rajasthan of soil where farmer can grow crops. In Rajasthan there are various type of soil are available sandy, saline, alkaline, calcareous soil are also present, we can classify the soil by image processing method in which we can see the color, energy, HSV etc.
{"title":"Soil Classification & Characterization Using Image Processing","authors":"Hemen Sharma, Shiv Kumar","doi":"10.1109/ICCMC.2018.8488103","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8488103","url":null,"abstract":"Agriculture is most important for survival of human being on the earth. As we know that agriculture land is decreasing day by day while population increasing day by day. But it is fact that production is also increasing because of several technologies. It is also fact that income of farmer is not increasing to survive in current scenario because of that several farmers hanging themselves. That is why we require a free application that help them in real world to inform them to identify soil by the type & there composition with suggestion like suitable crops for the corresponding type of soil. In India there are various types of soil. Since soil is a store house of minerals. Farmers are depending on soil for growing different type of crops But mostly farmers are don’t know which crop are grow in which soil. We are now taking about soil of Rajasthan. In Rajasthan, main soil is in desert form. But south part of Rajasthan of soil where farmer can grow crops. In Rajasthan there are various type of soil are available sandy, saline, alkaline, calcareous soil are also present, we can classify the soil by image processing method in which we can see the color, energy, HSV etc.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"11 1","pages":"885-890"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76033452","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 : 2018-02-01DOI: 10.1109/ICCMC.2018.8487845
Gaurav R Ingle, S. Umredkar
The Two-Phase Induction motor is the need of today’s era. The single-Phase induction motor (SPIM) is compressively used with single phase supply but could not be self-starting. This paper has a carrier-based PWM method to generate Two-phase supply to drive Asymmetrical Induction motor with two-leg voltage source inverter (VSI). And this supply is used for speed control of the motor with open loop v/f control. It gives the contribution in the direction of energy saving.
{"title":"Asymmetrical Two-Phase Induction Motor Using Two-Leg Voltage Source Inverter (VSI)","authors":"Gaurav R Ingle, S. Umredkar","doi":"10.1109/ICCMC.2018.8487845","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487845","url":null,"abstract":"The Two-Phase Induction motor is the need of today’s era. The single-Phase induction motor (SPIM) is compressively used with single phase supply but could not be self-starting. This paper has a carrier-based PWM method to generate Two-phase supply to drive Asymmetrical Induction motor with two-leg voltage source inverter (VSI). And this supply is used for speed control of the motor with open loop v/f control. It gives the contribution in the direction of energy saving.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"9 1","pages":"582-586"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76119723","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 : 2018-02-01DOI: 10.1109/ICCMC.2018.8487931
K. Anupama, S. Sri Gowri, B. Prabakara Rao
A variety of Multi Attribute Decision Making (MADM) algorithms have been applied to the problem of network selection in a heterogeneous wireless environment. As each kind of MADM approach has its own strong and weak points, it is quite difficult to ensure which MADM algorithm is more appropriate for network selection. Moreover, from decision making perspective, an algorithm that can provide minor improvement in network selection accuracy is more preferable, rather than applying classical approaches prevailing from decades. In this context, this paper makes an attempt to identify the most suitable MADM method among the established outranking PROMETHEE and ELECTRE algorithms. The algorithms are tested in a heterogeneous environment with four overlapping networks and their performance is compared in terms of Network Selection Accuracy and Network Congestion. PROMETHEE algorithm produced beneficial results when compared to ELECTRE.
{"title":"A Comparative Study of Outranking MADM Algorithms in Network Selection","authors":"K. Anupama, S. Sri Gowri, B. Prabakara Rao","doi":"10.1109/ICCMC.2018.8487931","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487931","url":null,"abstract":"A variety of Multi Attribute Decision Making (MADM) algorithms have been applied to the problem of network selection in a heterogeneous wireless environment. As each kind of MADM approach has its own strong and weak points, it is quite difficult to ensure which MADM algorithm is more appropriate for network selection. Moreover, from decision making perspective, an algorithm that can provide minor improvement in network selection accuracy is more preferable, rather than applying classical approaches prevailing from decades. In this context, this paper makes an attempt to identify the most suitable MADM method among the established outranking PROMETHEE and ELECTRE algorithms. The algorithms are tested in a heterogeneous environment with four overlapping networks and their performance is compared in terms of Network Selection Accuracy and Network Congestion. PROMETHEE algorithm produced beneficial results when compared to ELECTRE.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"5 1 1","pages":"904-907"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88594039","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 : 2018-02-01DOI: 10.1109/ICCMC.2018.8487908
B. Anushree, V. M. Arul Xavier
Cloud computing is one of the most important services which is utilized by people all over the globe. It provides direct access to several computing components or services whenever required by the users over the internet such as servers, applications, storage, network. Task scheduling is a vital part in the field of the cloud environment. User requests i.e tasks are scheduled to certain resources at a specific instance of time. It mainly focuses to minimize the makespan and maximize the resource utilization. It is an NP-Complete problem. There are numerous existing heuristic techniques for task scheduling till now but more enhancement and modification is needed for better performance and to increase the efficiency of task scheduling. In this paper, few latest task scheduling techniques have been reviewed and their performances were analyzed in terms of various metrics.
{"title":"Comparative Analysis of Latest Task Scheduling Techniques in Cloud Computing environment","authors":"B. Anushree, V. M. Arul Xavier","doi":"10.1109/ICCMC.2018.8487908","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487908","url":null,"abstract":"Cloud computing is one of the most important services which is utilized by people all over the globe. It provides direct access to several computing components or services whenever required by the users over the internet such as servers, applications, storage, network. Task scheduling is a vital part in the field of the cloud environment. User requests i.e tasks are scheduled to certain resources at a specific instance of time. It mainly focuses to minimize the makespan and maximize the resource utilization. It is an NP-Complete problem. There are numerous existing heuristic techniques for task scheduling till now but more enhancement and modification is needed for better performance and to increase the efficiency of task scheduling. In this paper, few latest task scheduling techniques have been reviewed and their performances were analyzed in terms of various metrics.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"1 1","pages":"608-611"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91121388","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 : 2018-02-01DOI: 10.1109/ICCMC.2018.8487847
Md. Aminul Islam, Md. Jahidul Haque
In this contemporary era of artificial intelligence, machine learning (ML) algorithms are getting significant attention for the analysis of textual analysis. In recent years, operational improvement in different corporate sectors of Bangladesh are achieved by implementing digitization of the process flow instead of using manual paper trails in offices. Nowadays, judicial sectors are included into sate wide digitalization process by archiving the judiciary records. Despite such improvement, autonomic categorizing of documents using textual analysis is not seen in labeling the correct class of a judicial document. In fact, officers spend lots of time in manual labeling of court related document. In our present investigation, we approached a textual analysis tool that can initiate towards the major solution for solving the manual categorization problem within the judicial sector of Bangladesh. Our objective is to label a normalized text document by implementing ML algorithm into suitable class in terms of the case type. In addition, grammatical analysis of English documents is integrated by the natural language processing (NLP) techniques as well as the filtering of feature sets by TF-IDF based term weighting scheme. The outcomes show the important impacts of NLP techniques for generating useful training data in KNN classification algorithm for the categorization of English documents in Bangladeshi judiciary sector.
{"title":"Evaluating Document Analysis with kNN Based Approaches in Judicial Offices of Bangladesh","authors":"Md. Aminul Islam, Md. Jahidul Haque","doi":"10.1109/ICCMC.2018.8487847","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487847","url":null,"abstract":"In this contemporary era of artificial intelligence, machine learning (ML) algorithms are getting significant attention for the analysis of textual analysis. In recent years, operational improvement in different corporate sectors of Bangladesh are achieved by implementing digitization of the process flow instead of using manual paper trails in offices. Nowadays, judicial sectors are included into sate wide digitalization process by archiving the judiciary records. Despite such improvement, autonomic categorizing of documents using textual analysis is not seen in labeling the correct class of a judicial document. In fact, officers spend lots of time in manual labeling of court related document. In our present investigation, we approached a textual analysis tool that can initiate towards the major solution for solving the manual categorization problem within the judicial sector of Bangladesh. Our objective is to label a normalized text document by implementing ML algorithm into suitable class in terms of the case type. In addition, grammatical analysis of English documents is integrated by the natural language processing (NLP) techniques as well as the filtering of feature sets by TF-IDF based term weighting scheme. The outcomes show the important impacts of NLP techniques for generating useful training data in KNN classification algorithm for the categorization of English documents in Bangladeshi judiciary sector.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"8 1","pages":"646-650"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89584083","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 : 2018-02-01DOI: 10.1109/ICCMC.2018.8487651
Sadaf A. H. Shaikh, D. Jadhav
For interactive human and computer interface (HCI) it is important that the computer understand facial expressions of human. With HCI the gap between computers and humans will reduce. The computers can interact in more appropriate way with humans by judging their expressions. There are various techniques for facial expression recognition which focuses on getting good results of human expressions. Most of these works are done on standard databases of foreign origin with six (Neutral, Happy, fear, Anger, Surprise, Sad) basic expression identification. We propose Zernike moments based feature extraction method with support vector machine to identify 8 expressions (including Disgust, and Contempt) on JAFFE and Radboud faces database with discriminative multi-manifold analysis technique with Single Sample Per person (SSPP) and finally compared results of Zernike with Hu moments.
对于人机交互界面(HCI)来说，计算机理解人的面部表情是非常重要的。有了HCI，计算机和人类之间的差距将会缩小。计算机可以通过判断人类的表情，以更合适的方式与人类互动。面部表情识别技术有很多种，其重点是要获得良好的人类表情结果。这些工作大多是在国外的标准数据库上完成的，有六种基本的表情识别(中性、快乐、恐惧、愤怒、惊讶、悲伤)。我们提出了基于Zernike矩的特征提取方法，并结合支持向量机在JAFFE和Radboud人脸数据库上，采用单样本Per person (Single Sample Per person, SSPP)的判别多形分析技术对8种表情(包括Disgust、蔑视)进行识别，最后将Zernike矩与Hu矩的结果进行比较。
{"title":"Human Face Detection and Facial Expression Identification","authors":"Sadaf A. H. Shaikh, D. Jadhav","doi":"10.1109/ICCMC.2018.8487651","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487651","url":null,"abstract":"For interactive human and computer interface (HCI) it is important that the computer understand facial expressions of human. With HCI the gap between computers and humans will reduce. The computers can interact in more appropriate way with humans by judging their expressions. There are various techniques for facial expression recognition which focuses on getting good results of human expressions. Most of these works are done on standard databases of foreign origin with six (Neutral, Happy, fear, Anger, Surprise, Sad) basic expression identification. We propose Zernike moments based feature extraction method with support vector machine to identify 8 expressions (including Disgust, and Contempt) on JAFFE and Radboud faces database with discriminative multi-manifold analysis technique with Single Sample Per person (SSPP) and finally compared results of Zernike with Hu moments.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"167 1","pages":"956-962"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74910445","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 : 2018-02-01DOI: 10.1109/ICCMC.2018.8487911
Mahendra Singh, C. Kumar, Prem Nath
P2P (Peer-to-Peer) systems are mainly designed for fixed wired networks and attracted researchers due to increase in the Internet based applications. Wireless multi-hop networks such as mobile ad-hoc networks (MANETs) and wireless mesh networks (WMNs) share many key characteristics with P2P networks like dynamic overlay, self-organization and decentralization. These networks have high degree of dynamicity due to churn (join and leave) of the nodes in the network. P2P networks suffer from challenges like malicious file spreading, free riding, whitewashing, poor resource search scalability, lack of a robust trust model, etc. The join and leave of the nodes at their will and it makes management of topology management and resource searching more challenging. The wireless multi-hop networks have their own challenges like limited bandwidth, limited backup power, security, overlay maintenance, mobility management, etc. When P2P protocols are implemented for wireless multi-hop networks, more challenges are added. But good thing is the deployment DHT (Distributed Hash Table) based protocols without any changes at network layer of wireless multi-hop networks. The DHT is a resource searching and retrieval mechanism in P2P networks. We have presented a comprehensive survey over the challenges and protocols for wireless multi-hop networks for P2P applications in this paper.
{"title":"Challenges and Protocols for P2P applications in Multi-hop Wireless Networks","authors":"Mahendra Singh, C. Kumar, Prem Nath","doi":"10.1109/ICCMC.2018.8487911","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487911","url":null,"abstract":"P2P (Peer-to-Peer) systems are mainly designed for fixed wired networks and attracted researchers due to increase in the Internet based applications. Wireless multi-hop networks such as mobile ad-hoc networks (MANETs) and wireless mesh networks (WMNs) share many key characteristics with P2P networks like dynamic overlay, self-organization and decentralization. These networks have high degree of dynamicity due to churn (join and leave) of the nodes in the network. P2P networks suffer from challenges like malicious file spreading, free riding, whitewashing, poor resource search scalability, lack of a robust trust model, etc. The join and leave of the nodes at their will and it makes management of topology management and resource searching more challenging. The wireless multi-hop networks have their own challenges like limited bandwidth, limited backup power, security, overlay maintenance, mobility management, etc. When P2P protocols are implemented for wireless multi-hop networks, more challenges are added. But good thing is the deployment DHT (Distributed Hash Table) based protocols without any changes at network layer of wireless multi-hop networks. The DHT is a resource searching and retrieval mechanism in P2P networks. We have presented a comprehensive survey over the challenges and protocols for wireless multi-hop networks for P2P applications in this paper.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"35 1","pages":"310-316"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75682333","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
扫码关注我们
求助内容：
应助结果提醒方式：