Recent Advances in Computer Science and Communications - Volume 13, Issue 6, 2020

Background: It is important to minimize energy consumption that improves battery life, system reliability and other environmental concerns and energy optimization is turning into a very important in the tiny devices in Internet of Things (IoT) research area with the increasing demand for battery operated devices. IoT need battery life improvement in tiny device, so power optimization is significant. Methods: In this paper an Experimental Design (ED) is proposed for the performance improvement in terms of energy and run time. Among the many sutras of optimizations, by using the Green computing the products are work with limited battery. This proposed technique results in reduce power conumption. Results: The result shows that the proposed Energy saving on tiny devices based on IoT are the energy consumed and run time by the code after applying optimization techniques, which is the minimum among all four. Besides reduction in energy and runtime, reduction in the number of executed instructions is also achieved. Conclusion: This paper comprehensively describes the. Its average performance percentage reached 91.1 % for energy, the performance reduction in energy and runtime, reduction in the number of executed instructions is also achieved. The performance holds better for Common subexpression elimination. So, we can say the proposed Experimental Design (ED) is effective in reduction of energy consumption and runtime of the program.

Background: Web personalization is kind of method that is applied to modify a web site to suit the exact needs of the users, achieving the advantage of data accomplished for the understanding the directional conduct of users concerning inclusion of more materials in the web framework. Methods: In this paper an Finding Large Itemsets produce all blends of things that comprises of a bolstering an incentive over a client illustrated least support. The total number of exchanges which consists of the itemset is nothing but the support for an itemset. For the purpose of ranking the list, the calculated values with the user ranked list are offered to the fuzzy-bat. Results: The result shows that the proposed methodology that perceives the challenge of mining affiliation presides over in an organization of exchanges could be defined as the problem of producing all the affiliation henceforth making a decision which would possess bolster esteem more significant in comparison to a client that exemplified least support as well as certainty esteem more noteworthy than a client characterized least certainty. Conclusion: This paper comprehensively describes the our proposed the preciseness of the system is in contrast to a great extent with the present method for the varied questions that has been provided. The computed esteems with the client positioned rundown are provided to the fluffy bat to rank the rundown. The proposed technique has been compared with the prevailing fuzzy technique with regard to the response time as well as the precision.

Background: Wireless Networks treat Mobile Ad hoc Network as a network that requires no preexisting infrastructure for setting up the network and is self-organized dynamically, which is made on impermanent basis. Before transmitting the packets from the source to the destination node, route is searched to the destination node from the source node. Due to the absence of special routers in this network, the nodes themselves act as routers and co-operates in performing the routing mechanism. During the packet dispatch to the destination from the source, there might be a critical attack which leads to the dropping of the packet. This dropping of packets is the most popular risks in mobile ad hoc networks. Objective: To find a detection mechanism for collaborative packet dropping in Mobile Ad hoc network. Methods: The proposed work refers to the diverse properties of collective packet dropping intrusions and scrutinizes the classes of proposed protocols with specific topographies warehoused in wireless ad hoc networks. Results: The results of End-to-End delay shows that Mobile Ad hoc Network beneath supportive black hole intrusion had a minor decrease and are more efficient in terms of performance. Conclusion: In this paper, we mainly engrossed on the special routing protocols existing in MANET like AODV, DSR, and DSDV in detecting the packet dropping attack in a MANET. Hence we refer to the diverse stuffs in collaborative packet dropping attacks and scrutinize classifications of proposed protocols with certain configurations warehoused in mobile ad hoc networks.

Background: In 21^st century one of the emerging issues is to secure the information stored and communicated in digital form. There is no assurance that the data we have sent may be hacked by any hacker and the data we have sent may reach correctly to the receiver or not. Thus, confidentiality, integrity, and authentication services play major role in Internet communication. Encryption is the process of encoding messages in such a way that only authorized parties can read and understand after successful decryption. Several data security techniques have been emerged in recent years, but still there is a need to develop new and different techniques to protect the digital information from attackers. This paper provides a new idea for data encryption and decryption using the notion of binary tree traversal to secure digital data. Objective: To develop a new data encryption and decryption method using the notion of binary tree traversal to secure data. Method: The proposed method uses both transposition and substitution techniques for converting plaintext into ciphertext. The notion binary tree in-order traversal is adapted as transposition and Caesar cipher technique for substitution. Results: From the result, it observed that the repeating letters in the plaintext are replaced with different cipher letters. Hence, it is infeasible to predict the plaintext message easily using letter frequency analysis. From the experimental result, it is concluded that the proposed method provides different ciphertext for the same plaintext message when the number of round varies. The time taken by the proposed method for encryption is very less. Conclusion: A simple encryption method using binary tree in-order traversal and Caesar cipher is developed. Encrypting data using binary tree traversals is a different way while compared with other traditional encryption methods. The proposed method is fast, secure and can be used to encrypt short messages in real time applications.

Objectives: Sentiment Analysis (SA) has a big role in Big data applications regarding consumer attitude detection, brand/product positioning, customer relationship management and market research. SA is a natural language processing method to track the public mood on a specific product. SA builds a system to collect/examine opinions on a product in comments, blog posts, re- views or tweets. Machine learning applicable to Sentiment Analysis belongs to supervised classifi- cation in general. Methods: Two sets of documents, training and test set are required in machine learning based classification: Training set is used by classifiers to learn documents differentiating character- istics; it is thus called supervised learning. Results: Test sets validate the classifier’s performance. Se- mantic orientation approach to SA is unsupervised learning because it requires no prior training for mining data. It measures how far a word is either positive or negative. This paper uses a hybrid GA- DE optimization technique for sentiment classification to classify features from movie reviews and medical data. Conclusion: Our research has enhanced the variables on learning rate as well as momentum values which are optimized by genetic approach that in turn improve the accuracy of classification procedure.

Background: Limited energy capacity of battery operated Wireless Sensor Networks (WSNs) is the prime impediment in the ubiquity of WSNs as the network lifetime depends on the available energy at the nodes. Prolonging the network lifetime is the principal issue in WSNs and the challenge lies in devising a strategy for judicious use of available energy resources. Routing has been one of the most commonly used strategies for minimizing and balancing the energy consumption of nodes in a WSN. Methods: Routing in large networks has been proved to be NP-Hard and therefore meta heuristic techniques have been applied for handling this problem. Quantum-inspired algorithms are relatively new meta heuristic techniques which have been shown performing better than their traditional counter- parts. Therefore, Quantum inspired ant Based Energy balanced Routing (QBER) algorithm has been proposed in this paper for addressing the problem of energy balanced routing in WSNs. Results: Simulation results confirm that the proposed QBER algorithm performs comparatively better than other quantum inspired routing algorithms for WSNs. Conclusion: In this paper, a Quantum Inspired Ant-based routing (QBER) algorithm has been proposed for solving the problem of energy balanced routing in wireless sensor networks.

Background: Cloud computing is used to deliver IT resources over the internet. Due to the popularity of cloud computing, nowadays, most of the scientific workflows are shifted towards this environment. Many algorithms have been proposed in the literature to schedule scientific workflows in the cloud, but their execution cost is very high as they are not meeting the user-defined deadline constraint. Aims: This paper focuses on satisfying the user-defined deadline of a scientific workflow while minimizing the total execution cost. Methods: So, to achieve this, we proposed a Cost-Effective under Deadline (CEuD) constraint workflow scheduling algorithm. Results: The proposed CEuD algorithm considers all the essential features of the Cloud and resolves the major issues such as performance variation and acquisition delay. Conclusion: We compared the proposed CEuD algorithm with the existing literature algorithms for scientific workflows (i.e., Montage, Epigenomics, and CyberShake) and obtained better results for minimizing the overall execution cost of the workflow while satisfying the user-defined deadline.

Aims: The paper has introduced an algorithmic modification of M.L.Das's previous work done of " IoT Mutual Authentication". Background: IoT has proven that if there exists a thing on the earth then it is bound to be connected to the internet to tell its feature on its own. IoT plays a remarkable role in all aspects of our daily lives it covers entertainment, sports, healthcare, education, security, automobiles, industrial as well as home appliances and many more real time applications. To ease our everyday activities, it reinforcing the way people interact with their surroundings. This holistic view brings some major concerns in terms of security and privacy. Objective: The objective of the work is to increase security and protect the algorithm from various attackers so to use with real time application. Method: In this we have used XoR (Exclusive OR) operation and because of this we can protect the algorithm from DoS attacks, bypass attack, intruder attack and allow user to change password. Conclusion: The proposed work has secured all the connected IoT devices to work inde-pendently and secured because every device has to verify at each step in the IoT system before initiating its operation.

Background: Network Functions Virtualization (NFV) is a paradigm shift in the way network operators deploy and manage their services. The basic idea behind this new technology is the separation of network functions from the traditional dedicated hardware by implementing them as a software that is able to run on top of general-purpose hardware. Thus, the resulting pieces of software are called Virtual Network Functions (VNFs). NFV is expected, on one hand, to lead to increased deployment flexibility and agility of network services and, on the other hand, to reduce operating and capital expenditures. One of the major challenges in NFV adoption is the NFV Infrastructure's Resource Allocation (NFVI-RA) for the requested VNF-Forwarding Graph (VNF-FG). This problem is named VNF-forwarding graph mapping problem and is known to be an NP-hard problem. Objective: To address the VNF-FG mapping problem, the objective is to design a solution that uses a meta-heuristic method to minimize the mapping cost. Methods: To cope with this NP-Hard problem, this paper proposes an algorithm based on Greedy Randomized Adaptive Search Procedure (GRASP), a cost-efficient meta-heuristic algorithm, in which the main objective is to minimize the mapping cost. Another method named MARA (Most Available Resource Algorithm) was devised with the objective of reducing the Substrate Network’s resources use at the bottleneck clusters. Results: The Performance evaluation is conducted using real and random network topologies to confront the proposed version of GRASP with another heuristic, existing in the literature, based on the Viterbi algorithm. The results of these evaluations reveal the efficiency of the proposed GRASP ‘s version in terms of reducing the cost mapping and performs consistently well across all the evaluations and metrics. Conclusion: The problem of VNF-FG mapping is formalized, and a solution based on GRASP meta- heuristic is proposed. Performance analysis based on simulations are given to show the behavior and efficiency of this solution.

Background: IoT networks are being used frequently for meeting the requirements of some specifications such as applications related to automobiles, aerospace, etc. The performance is always an issue as many intricacies exist built into the developed IoT networks such as handling heterogeneity, failures of communication paths, lack of bandwidth, non-availability of alternate paths for communication, etc. Many layers exist in an IoT network. Each layer built using specific technology and is faced with many performance bottlenecks addressed. The performance of the entire network is affected when there are many performance issues in any layer. The performance of an IoT network must be analyzed considering all the layers and the issues related to those layers. Objective: The main objective of this paper is to present the way the performance of an IoT network improved by using a specific networking topology used at the gateway level of the IoT network. Methods: Receiving data in multiple low-speed channels using different communication systems, stacking the same and transmitting results using the splitters using dual high-speed channels to improve the time required for transmission and also to reduce the latency at the gateway level. Results: The splitter method introduced at the gateway level improved the performance of the IoT network from 1519 Microseconds to 1029 Microseconds for transmitting 100 data packets either way. Throughput as such improved from 0.31 packets / Microsecond to 0.19 packets / Microsecond. Conclusion: The performance of IoT networks suffers due to various reasons. The performance of an IoT network gets improved at gateway by using splitters that merge and bifurcate the communication traffic.