{"title":"Optimal Target Set Selection via Opinion Dynamics","authors":"Prince Sharma, Shailendra Shukla","doi":"10.1109/PDGC.2018.8745846","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745846","url":null,"abstract":"The solution for handling the issue of mobile data is gaining significance due to the exponential rise in data traffic in recent years. Data traffic offloading becomes a challenging problem, if it is dependent only on infrastructure (femtocells, Bluetooth, WiFi). Opportunistic communications(mobile social networks, Delay tolerant networks) can enhance the offloading efficiently if the target nodes(helper nodes) are chosen optimally. In this paper, we have considered this problem and propose a Target Set Selection algorithm based on Opinion Dynamics. The opinion vector provides a weighed feedback for the community to select the helper nodes. To validate our algorithm, we have compare it with existing algorithm like heuristic approach and greedy approach of target set selection. Our result shows that the number of nodes identified in the Target Set can further be reduced by nearly 13% when compared with degree based greedy approach. Result also shows that our approach is nearly 58% better than the heuristic approach, infrastructure-based approach in terms of traffic forwarding via helper node.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127058685","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}
{"title":"Sentiment Analysis Framework of Twitter Data Using Classification","authors":"Medha Khurana, Anurag Gulati, Saurabh Singh","doi":"10.1109/PDGC.2018.8745748","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745748","url":null,"abstract":"Text mining is the way toward investigating and breaking down a lot of unstructured content information that can distinguish ideas, designs, subjects, catchphrases and different qualities in the information. Twitter is one of those forums that allow people across the world to put and exchange their views and ideas on several major and minor issues which are revolving around the world every day. Microblogging on twitter gains the interest of data researchers as there is an immense scope of mining and analysing the huge amount of unstructured data in several ways. In this paper, various algorithms for analysing the sentiments of the tweets have been discussed. Further, the performance of these algorithms has been compared based on certain metrics. Certain challenges while doing the study have also been described in terms of improvement and future scope. Since the machine learning algorithms have been performed on an unexplored dataset, language barriers to these algorithms have also been identified in terms of future scope and current feasibility of the algorithms. The analysis has been performed using classification algorithms - Naïve Bayes, Support Vector Machine and Random Forest. This experimental work has been executed in python and excel has been used to further evaluate and plot some of the results. Since the sentiment of the tweets cannot be beknown, test set has been manually prepared in order to prevent any errors in evaluating accuracy and precision of the models.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128117859","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}
{"title":"Network Protocol Analytics For End User Context Identification","authors":"Muna Kumar Singh, R. Nallaperumal, D P Sudhakar","doi":"10.1109/PDGC.2018.8745911","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745911","url":null,"abstract":"End user context identification on the server side can serve an important role in growing internet communication. Our target is to identify the mobility context of the end user on the server or sender side connected in a wireless network. Lack of previous work and unavailability of specific tools makes this work challenging. Naive approach includes, the trend of variation of throughput with mobility and Pearson correlation coefficient comparison of traced transport layer parameters. However both approach does not mark any strict signature for mobility of the end user, leads to lack of accuracy in estimation of mobility of the end user. Our approach is to model the traced parameters (parameters are traced using NS2) of the transport layer graphically using Bayesian Networks, then learn the joint probability distribution between the parameters using BNT toolbox of Matlab. Finally using graphical model, learned parameters from BNT toolbox and Pearson correlation coefficient we estimate the mobility context of end user with minimum error. Graphically modelling tracks the unknown relation between the parameters which is not carried out by Pearson correlation coefficient and Bayesian toolbox calculate the joint probability distribution between the parameters. Comparing the raw data with graphical model and Pearson coefficient gives the estimate of mobility of end user. Major advantage of this solution is its robustness because graphical model tracks the unknown relation between the parameters and Pearson coefficient tracks the correlation between them which has a fairly good variation with mobility.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124473910","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}
{"title":"LD_ASG: Load Balancing Algorithm in Cloud Computing","authors":"Vishalika, Deepti Malhotra","doi":"10.1109/PDGC.2018.8745948","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745948","url":null,"abstract":"Resource allocation is the key concern in cloud computing nowadays. Cloud resources (hardware & software) are allocated dynamically according to the demand of upcoming applications as well as user as requirement. Objective of service provider is to increase the utilization of resources which helps in load balancing in cloud computing. In this paper, a novel task-assignment model is proposed along with the load based task assignment algorithm and the selection processes involved in it i.e. the minimum loaded virtual machine is assigned the task so that the resources should be efficiently utilized. The experimentation is carried out with varying number of VMs to examine the performance of proposed algorithms to optimize the resource utilization.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"335 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113986985","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}
{"title":"NL-IDS: Trust Based Intrusion Detection System for Network layer in Wireless Sensor Networks","authors":"Umashankar Ghugar, J. Pradhan","doi":"10.1109/PDGC.2018.8745870","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745870","url":null,"abstract":"From the last few years, security in wireless sensor network (WSN) is essential because WSN application uses important information sharing between the nodes. There are large number of issues raised related to security due to open deployment of network. The attackers disturb the security system by attacking the different protocol layers in WSN. The standard AODV routing protocol faces security issues when the route discovery process takes place. The data should be transmitted in a secure path to the destination. Therefore, to support the process we have proposed a trust based intrusion detection system (NL-IDS) for network layer in WSN to detect the Black hole attackers in the network. The sensor node trust is calculated as per the deviation of key factor at the network layer based on the Black hole attack. We use the watchdog technique where a sensor node continuously monitors the neighbor node by calculating a periodic trust value. Finally, the overall trust value of the sensor node is evaluated by the gathered values of trust metrics of the network layer (past and previous trust values). This NL-IDS scheme is efficient to identify the malicious node with respect to Black hole attack at the network layer. To analyze the performance of NL-IDS, we have simulated the model in MATLAB R2015a, and the result shows that NL-IDS is better than Wang et al. [11] as compare of detection accuracy and false alarm rate.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124071669","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}
{"title":"A Decentralized Fuzzy C-Means Minimal Clustering Protocol for Energy Efficient Wireless Sensor Network","authors":"Parag Kumar Guha Thakurta, S. Roy","doi":"10.1109/PDGC.2018.8745853","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745853","url":null,"abstract":"A minimal clustering protocol based on Fuzzy-C means (FCM) is proposed for prolonging the lifetime of wireless sensor networks by balancing the node's energy consumption. The cluster formation of nodes is modeled as a fuzzy partition of sample space under an uneven distribution of the sensor nodes. The overall energy consumption of the networks depending on the minimal number of clusters is determined. A multicriteria objective function is proposed to select the CH. A decentralized method finds CH in each cluster itself reducing the energy consumption of the network. The efficiency of the proposed work over existing protocol are shown by various simulations.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121443577","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}
{"title":"A Compact two element U shaped MIMO Planar Inverted-F Antenna (PIFA) for 4G LTE Mobile Devices","authors":"Namita Sharma, Dishant Khosla","doi":"10.1109/PDGC.2018.8745741","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745741","url":null,"abstract":"In this paper a compact Planar Inverted F Antenna (PIFA) is presented for 4G LTE band. The proposed antenna have overall size of $85 mathbf{mm} times 50 mathbf{mm} times 4 mathbf{mm}$ while the radiating element is of a compact size $14.2 mathbf{mm} times 13 mathbf{mm}$. The compact size is achieved by using a U shaped slot on the radiating element compared to conventional rectangular radiator shape in PIFA. High peak gain is achieved having value of 5.90 dB at resonant frequency. By using an open ended slot on the ground plane the isolation between the radiating elements is improved. The value of Envelope Correlation Coefficient (ECC) is well below 0.5 and diversity gain is also quite near to 10 dB level. Both simulated and measured results are presented and compared.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122905828","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}
{"title":"Modified Cuckoo Search for Resource Allocation on Social Internet-of-Things","authors":"Himanshu Jindal, Hari Singh, M. Bharti","doi":"10.1109/PDGC.2018.8745772","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745772","url":null,"abstract":"The fundamental requirement for communication and computation across distinct application areas on Social Internet of Things (SIoT) is the resource discovery that demands appropriate reasoning for the optimal selection. With exponential growth of resources and their produced huge amount of heterogeneous data, various activities face challenges due to interoperability. In order to eliminate the challenge, the paper focuses on to propose an optimal resource selection technique namely, Modified Cuckoo Search (MCSA). The technique helps in reducing traffic congestion on network by selecting optimal resources in less time. The technique is tested on random dataset. The obtained results show that MCSA outperforms 22% approximately in comparison to nature-inspired, meta heuristic based machine learning algorithms i.e., Particle Swarm Optimization and Binary Genetic Algorithm.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129886814","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}
{"title":"Prevention of Malicious Nodes Using Genetic Algorithm in Vehicular Ad Hoc Network","authors":"Chetna Khurana, P. Yadav","doi":"10.1109/PDGC.2018.8745859","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745859","url":null,"abstract":"VANET a thrilling function via mobile ad-hoc network (MANETs). VANET is a dominant invention which can supply practical vehicle to roadside infrastructure (V2I) communiqué and vehicle to vehicle (V2V). VANETs are a natural configure scheme wherein node are automobile and WIFI technology are used to shape networks. VANETs is a accredited construct intelligent transportation system (ITS) which emphasis on road protection, visitor well being and traffic effectiveness. In existing work, the supply node use extra data well identified as pseudo reply packet (PRREP). Supply node saves all details regarding entire arriving package in look-up chart chosen as RREP_T. The chart save series of PRREP set in ascending way via using POP and PUSHES processes. If there is any kind of deviation in chart order will be measured to PRREP series got via malicious node and will be rejected via source. Shortest series digits gives peak priority and it is measured via series digits. Nodes that have irregular series digits are measured as malicious node and supply transmit message via network. But depending on sequence number is not useful concept for the detection of malicious node in the network. In the proposed work, we overcome this problem via usage of genetic algorithm to recover performance in network. If the node has less fitness value than the threshold value than it is considered as a misbehaviour node. By this technique we can improve the performance of network by removing malicious nodes. We used NS2 in the simulation to provide the implementation work to provide the efficiency in the network.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125511720","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}
{"title":"Network Security Metrics: Vital Ingredients for Measuring Networks Security","authors":"Naveen Bindra, M. Sood","doi":"10.1109/PDGC.2018.8745867","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745867","url":null,"abstract":"Networks are vulnerable. Attacks damage availability of network services and the reputation of the organizations. Researchers are trying hard to solve the puzzle of security. Nevertheless, the more we solve it, new challenges emerge and making it an unsolvable paradox. The security needs ‘measurement’ to catch up with the ever-increasing vectors, which in turn brings the ‘Security Metrics’ into the scene. Security metrics make the network more resilient and but they should be practical enough to make real-world predictions. To conceptualize and develop the metrics, one faces challenges as their development is easier said than done. This work explores the literature to find out the works done in this direction and highlights their merits besides analyzing the challenges in developing these metrics. We show ways to overcome these challenges along with the must-have ingredients of security metrics. This work aims to combine the strengths of best practices in developing efficient heuristics that accurately and inclusively assess the network security. We also propose four classes of network security metrics along with a simple methodology to develop the simple, effective and viable security metrics.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127842398","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}