Skip to main content

2019 | Buch

Futuristic Trends in Network and Communication Technologies

First International Conference, FTNCT 2018, Solan, India, February 9–10, 2018, Revised Selected Papers

herausgegeben von: Dr. Pradeep Kumar Singh, Dr. Marcin Paprzycki, Bharat Bhargava, Jitender Kumar Chhabra, Narottam Chand Kaushal, Prof. Yugal Kumar

Verlag: Springer Singapore

Buchreihe : Communications in Computer and Information Science

insite
SUCHEN

Über dieses Buch

This book constitutes the refereed proceedings of the First International Conference on Futuristic Trends in Network and Communication Technologies, FTNCT 2018, held in Solan, India, in February 2018.

The 37 revised full papers presented were carefully reviewed and selected from 239 submissions. The prime aim of the conference is to invite researchers from different domains of network and communication technologies to a single platform to showcase their research ideas. The selected papers are organized in topical sections on communication technologies, Internet of Things (IoT), network technologies, and wireless networks.

Inhaltsverzeichnis

Frontmatter

Communication Technologies

Frontmatter
Implementation of AES-128 Using Multiple Cipher Keys

The growth in communication technology has connected billions of people all over the globe. The frequent sharing of data among individuals, organizations and even countries has raised concerns over the security and privacy of the communication process. A successful solution to this problem is Encryption, which converts the data to an unintelligible form. The keys for encrypting and decrypting the data are known only to authorised users. Thus, encryption can efficiently secure the communication process. The technique presented here is a modified form of Advanced Encryption Standard (AES) with multiple cipher keys of length 128 bits. AES uses symmetric cryptography which means that same keys are used for encryption and decryption. AES is known to be resistant against any known cryptanalytic attacks. Although it is known to be secure, various improvements have been suggested previously to further enhance the security of AES. The proposed technique enhances the security by using three cipher keys. By increasing the no. of keys, the encryption and decryption times are increased. Trading off with the increase in encryption time, advantage is gained because the attempt to hack the data will require drastic efforts and thus security is increased.

Shivani Sachdeva, Ajay Kakkar
S-BOX Architecture

Substitution-Box (S-BOX) is the most critical block in the Advanced Encryption Standard (AES) algorithm, consumes 75% of total power during encryption. The primary idea to implement S-BOX is to have a unique byte substitution. In this paper 4 different architecture of SBOX discussed; (a) look-up table or ROM based S-BOX contains a pre-computed value stored at defined address (b) modified look-up table based approach which uses decoders and multiplexer makes overall substitution faster (c) computational method has composite field architecture to compute the substitution byte (d) blend of computational method and look up table method where pre-computed multiplicative inverse values are stored in lookup table to reduce power consumption. Look up table based method requires a fetching circuit from a certain location, suffers from area overhead; to overcome that to be substituted values are divided into groups and using decoders and multiplexer that values will be fetched. The computational method requires complex computation result in high power consumption. To overcome that one particular module is pre-computed and stored in a look-up table in the last method. The overall objective of this paper is to implement S-box using different methods and to come up with method which is optimum as far as the area, power, delay parameters are concerned and security wise robust. In this work a comparative study of all these methods has been explored with CMOS 180 nm, 90 nm, and 45 nm technology node.

Abhishek Kumar, Sokat Tejani
Nonlinear Impairments in Fiber Optic Communication Systems: Analytical Review

Fiber optic communications provides an enormous bandwidth for high speed data transmission. Optical fiber is an excellent transmission medium due to its robustness and low losses. However, the dispersive and nonlinear effects of an optical fiber may lead to signal distortions. In long haul communication systems, transmission impairments accumulate over the fiber distance and utterly distort the signal. By compensating for dispersive and nonlinear impairments the transmission performance can be significantly improved. In the present work, a theoretical analysis of various kinds of optical fiber nonlinearities, their thresholds and managements is carried out. Also, it focusses on various digital and optical methods to compensate for dispersive and nonlinear distortions, which significantly enhance transmission performance and system capacity. All over the paper, current applications dealing with these effects have been referred. The present paper will help the researchers in this field to find the aggregate material on the subject and further narrowing the topic selection for research work.

Payal, Suresh Kumar
Hybrid Wavelet Transformation and Improved Wavelet Shrinkage Algorithm Method for Reduction of Speckle Noise

Speckle noise weakens the visual quality of the image thereby limiting the accuracy of Computer aided diagnostic techniques for ultrasound image. An improved method for reduction of multiplicative speckle noise based on Wavelet Shrinkage Guided filter has been proposed in this paper. The Daubechies20 wavelet transformation has been used for the decomposition of the ultrasound images and then an improved wavelet shrinkage algorithm has been utilized for filtering the high-frequency component. The improved quantitative results show the effectiveness of the technique.

Mandeep Kaur, Neeraj Julka, Satish Saini
Signal Processing Methods for Identification of Sudden Cardiac Death

Sudden cardiac death (SCD) is defined as sudden natural death occurring within few minutes to an hour from the onset of symptoms due to known or unknown cardiac cause. An early stage prediction or identification of SCD has become a major challenge among the medical fraternity to save the life of SCD affected person. For prediction of sudden cardiac death, three distinct kinds of markers viz. markers of structural heart disease, markers of electrical instability and markers of abnormal autonomic balance have been devised. Based on these markers, many signal processing techniques like signal averaged electrocardiography, extraction of longer QRS duration, identification of QT-dispersion, and feature extraction from T-wave alternans, heart rate variability (HRV), and heart rate turbulence (HRT) with data mining, statistical and machine learning algorithms are fused together to validate the SCD prediction accuracy. But despite significant advances in the engineering research and medical science, there is no standard technique adopted to identify the SCD at an early stage which limits the fusion of any method into a medical product due to its own limitations. This paper is therefore, designed to discuss different signal processing methods based on these three markers in order to predict sudden cardiac death at an early and alarming stage. The contents embodied in this paper would benefit the community of the research groups designing signal processing algorithms for early prediction of SCD which will help the clinicians to save the precious life of the SCD affected patients.

Reeta Devi, Hitender Kumar Tyagi, Dinesh Kumar
Hybrid Technique to Reduce PAPR in OFDM

Orthogonal Frequency Division Multiplexing (OFDM) is typically a system used in encoding digital data. It has huge benefits among which primary are high spectral efficiency upon Inter Symbol Interference (ISI) and robustness. It also has some drawbacks, the main hitch in OFDM system is High Peak to Average Power Ratio (PAPR). In order to minimize PAPR, many techniques are available among which some common and efficient are Partial Transmit Sequence (PTS), Selected Mapping (SLM), Coding, Interleaving, Companding, Peak windowing, Peak reduction, Envelope Scaling. Every method has both edge and snag. The simplest is clipping. There are also some complex techniques like PTS, SLM. In this paper the proposed method is a hybrid combination of Repeated Frequency Domain Filtering and Clipping (RFDFC) and Absolute Exponential Companding (AEC). This method not only bring PAPR to 3.5 dB as compared to 10.5 dB in original, but is also easy to implement.

Hardeep Singh, Harbinder Singh, Dinesh Arora
Detection of Signals by the Frequency-Time Contrast Method

A detection algorithm and a detector structure based on the time-frequency contrast method are proposed. The analysis of the detection characteristics for the case of a linear detector and distribution of the signal- interference mixture according to the Rayleigh-Rice law is carried out. It is shown that the detector ensures a constant false alarm rate when the interference dispersion is changed. A block diagram of the detector that implements the proposed algorithm is presented. The carried out research shows the expediency of using the method when detecting single radio pulses with an inaccurately known carrier frequency. It is shown that the use of an increased reference sample of interference with N = 1 to N = 5 makes it possible to reduce (at L = 1) the probability of false alarm with $$ P_{F} = \, 0.166 $$ to $$ P_{F} = \, 0.015 $$ .

Konstantin Rumyantsev, Aatoliy Zikiy, Pavel Zlaman
Single Photon Algorithm of Search of a Pulse Radiation Source

A new spatiotemporal search for pulsed radiation with a single-channel processing of the photon flux is proposed. The algorithm allows up to two device activations during the observation of the decomposition element. Reasons for activation of the amplitude discriminator (AD) during the analysis of the time frame are analyzed at repeated survey in the next time frame. The search algorithm provides an extension of the permissible range of changes in the intensity of background radiation on 25…50%. Thus the probability of the signal skip decreases more than in 4 times in comparison with an analog that allows only one activation of the search equipment. For the correct detection of the useful radiation with probability more than 90% the median number of signal photoelectrons in pulse shall be more than three. Implementation of an algorithm allows to reduce emissive power of the transmitter by 5 times.

K. Y. Rumyantsev, K. B. Bamatgireeva, Y. K. Mironov
A Robust Approach of Copyright Protection for Digital Videos Using Zero Padding Algorithm Technique

Copyright protections of the multimedia is become most highlighted area for the researchers because of velocity of multimedia data. Every day a huge amount of data is generating and to prove the ownership of data, it is a basic need of certain security programs. In this paper, a new approach of copyright protection for digital videos, SWEA (Split watermark embedding algorithm) with Zero Padding Algorithm (ZPA) is proposed. With the help of this algorithm, it is hard to know the original pattern of watermark because of SWEA and minimizing the perceptual degradation of watermarked video because of ZPA. Here in this paper ‘db1’ wavelet domain is used for embedding the watermark in the low frequency sub-band of the original identical frame (I-frame), based on the energy of high-frequency sub-band in an adaptive manner. SCD (Scene changed detection) is used to find out the identical frame (I-frame). The proposed algorithm has undergone various attacks, such as compression, uniform noise, Gaussian noise frame repetition and frame averaging attacks. The proposed algorithm, sustain all the above attacks and offers improved performance compared with the other methods from the literature.

Jabir Ali, Satya Prakash Ghrera
Optimal Camera Placement for Multimodal Video Summarization

Video Surveillance systems are used to monitor, observe and intercept the changes in activities, features and behavior of objects, people or places. A multimodal surveillance system incorporates a network of video cameras, acoustic sensors, pressure sensors, IR sensors and thermal sensors to capture the features of the entity under surveillance, and send the recorded data to a base station for further processing. Multimodal surveillance systems are utilized to capture the required features and use them for pattern recognition, object identification, traffic management, object tracking, and so on. The proposal is to develop an efficient camera placement algorithm for deciding placement of multiple video cameras at junctions and intersections in a multimodal surveillance system which will be capable of providing maximum coverage of the area under surveillance, which will leads to complete elimination or reduction of blind zones in a surveillance area, maximizing the view of subjects, and minimizing occlusions in high vehicular traffic areas. Furthermore, the proposal is to develop a video summarization algorithm which can be used to create summaries of the videos captured in a multi-view surveillance system. Such a video summarization algorithm can be used further for object detection, motion tracking, traffic segmentation, etc. in a multi-view surveillance system.

Vishal Parikh, Priyanka Sharma, Vedang Shah, Vijay Ukani

Internet of Things (IoT)

Frontmatter
Future Perspectives in Elastic Optical Networks

The new generation Elastic Optical Networks (EONs) based on Orthogonal Frequency Division Multiplexing (OFDM) can accommodate exponentially increasing heterogeneous data traffic efficiently and economically. In EONs, the optimum channel spacing between various subcarriers is very crucial for its efficient performance. The use of Sub-Carrier Multiplexing (SCM) in EONs is visualized as an evolving field. This paper present the evaluation of SCM based EONs for both mathematical and simulative model. The designed SCM-EON network is analytically evaluated for its performance with different modulation techniques (Direct Modulation and External Modulation). The performance of system is also evaluated for amplification using Semiconductor Optical Amplifier (SOA) and Erbium Doped Fiber Amplifier (EDFA). Simulative results show that Optical Phase Modulation (OPM) along with EDFA offers enhanced performance for the proposed model. It has also been observed that OPM is a better technique for SCM and hence it can be deduced that the combination will boost EONs efficiency in handling network resources.

Suresh Kumar, Deepak Sharma
Intelligent Traffic Management System for Smart Cities

In present-day times, the number of vehicles has increased drastically, but in contrast, the capabilities of our roads and transportation systems still remain underdeveloped and as a result, fail to cope with this upsurge in the number of vehicles. As a consequence, traffic jamming, road accidents, increase in pollution levels are some of the common traits that can be observed in our new age cities. With the emergence of the Internet of Things and its applicability in Smart Cities, creates a perfect platform for addressing traffic-related issues, thus leading to the establishment of Intelligent Traffic Management Systems (ITMS). The work presented in this paper talks about an intelligent traffic management system that lays its foundation on Cloud computing, Internet of Things and Data Analytics. Our proposed system helps to resolve the numerous challenges being faced by traffic management authorities, in terms of predicting an optimum route, reducing average waiting time, traffic congestion, travel cost and the extent of air pollution. The system aims at using machine learning algorithms for predicting optimum routes based upon traffic mobilization patterns, vehicle categorization, accident occurrences and levels of precipitation. Finally, the system comes up with the concept of a green corridor, wherein emergency services are allowed to travel without facing any kinds of traffic congestion.

Abhirup Khanna, Rohit Goyal, Manju Verma, Deepika Joshi
A Hybrid Query Recommendation Technique in Information Retrieval

As the amount of information available online is enormous, search engines continue to be the best tools to find relevant and required information in the least amount of time. However, with this growth of internet, the number of pages indexed in search engines is also increasing rapidly. The major concern at present is no more having enough information or not; it is rather having too much information which is in numerous different formats, languages and without any measure of precision. Therefore, it is essential to devise techniques that can benefit the process of extracting useful information suitable for users’ demands. Several mechanisms have been developed and some methods have been enhanced by researchers from all over the world to generate better or more relevant query that can be provided as suggestion to the user for enriched Information Retrieval. The objective of this paper is to summarize and analyze the various techniques adopted to optimize the Web Search process to support the user. The existing strategies developed in this scenario are also compared using standard IR metrics to evaluate the relevance of results.

Neelanshi Wadhwa, Rajesh Kumar Pateriya, Sonika Shrivastava
Predicting the Risk Factors Influencing the Behavioral Intention to Adopt Mobile Banking Services: An Exploratory Analysis

Mobile Banking is a next big challenge in the technologically dependent era after Mobile Commerce and there are many factors that are influencing the use of M-banking Services, perceived Risk is one of them. Although perceived Risk as a single construct has been studied by many researchers but in this paper, empirical research has been done to find out the actual characteristics of Perceived Risk and the reason for refusing the use of m-banking services by the users in the technologically advanced era. In order to study the reason behind the reluctance in using m-banking services, a more detailed study of attributes of Perceived Risk has been conducted. This research work is intended to examine the six components of Perceived Risk. In this study EFA was applied on various measures of Risk to ascertain the different underlying variables affecting the individual’s Behavioral Intention to adopt m-banking services. After applying EFA researcher has applied SEM in order to investigate the association between the factors. The results of this empirical testing found that out of all the six variables only four variables i.e. Social Risk, Psychological Risk, Time Risk and Financial Risk were statistically significant as per results of this study and these are the main factors affecting the influence of Behavioral Intention towards using m-banking services in the Indian context.

Nitin Nayak, Vikas Nath, Nancy Singhal
An Online Monitoring System for Measuring Human Attention Level Based on Brain Activities

One of the major organ and resource in human is brain which is interconnected with millions of neurons, these neurons can be used to know the attention of human at different time intervals. The human brain waves plays a vital role in controlling and monitoring the devices and environment. The EEG sensor is used to transfer brain waves using Bluetooth and automated through a microcontroller for knowing the attention of the Human brain. The major system in the designed work is with Arduino Mega Microcontroller which is programmed to monitor the attention of the brain activities. All the readings helps in predicting the status of the human brain Activity. The quality of the work is defined by recording the mental states of human brain by different frequencies of brain waves. The different frequencies are detected are alpha, beta, gamma and delta patterns. In the carried work real time simulation and testing is done on breadboard. The implementation results are clearly shown by signifying each step importance. The outcomes of the carried work are monitored in real time and checked through Internet of things (IOT). The carried work is tested on different participants and they were advised to analyze and think on various tasks such as left, right, forward and back. The data is although collected from various participants for correlation and deviation values. In general the analysis is performed with the thinking data and computed in terms of attention levels. Further to this it can be used for Alzheimer’s disease and cognitive impaired people to know the exact thinking of the people and their needs or requirements.

Haitham Mohammed Al Balushi, Satish Masthenahally Nachappa
Privacy Preserving Ranked Multi Keyword Context Sensitive Fuzzy Search Over Encrypted Cloud Data

The privacy preserving search feature is very useful for a cloud user to retrieve the desired encrypted documents easily, securely and cost effectively in the cloud. However, a search query issued by the user may sometimes have mis-typos i.e. wrongly typed words. The mis-typos could occur because of the addition or drop of letter(s) from the word or by swapping of characters in a word. At times such mis-typos may have many spelling suggestions against them within a given threshold, of which only a few makes sense as per the context of the query. Also the mistyped word may sometimes result in another valid word from the dictionary or the word list and hence the mis-spelt word may go unnoticed. Recent works in cloud address the issue of fuzzy search. However, these approaches do not suggest a word suitable as per the context and co-occurrence with other words of the query for such mis-typos. This paper presents a privacy preserving scheme ‘Context Sensitive Fuzzy Search’ (CSFS) in a cloud computing environment that address these issues. CSFS uses Levenshtein distance and neighbor co-occurrence statistics computed from encrypted query click logs and suggest(s) word(s) from the generated suggestions and set distance as per their co-occurring frequency with other words of the query. The results achieved show that the spelling suggestions listed are as per the context of the query and have high recall value.

Anu Khurana, Rama Krishna Challa, Navdeep Kaur
Blended Learning for Calculus Course: WebBLoC

In this paper, the study of Blended Learning (BL) for Calculus Course is proposed. Based on the observation, most of first year students of Universiti Malaysia Sabah (UMS) that have taken calculus course failed due to unsuitable learning approach. The traditional classroom learning used for teaching makes students misunderstand the concept and lack of enthusiasm in learning calculus course, since their first impression is to consider the calculus a difficult course in university and college. In order to overcome the problem, three objectives were proposed in this project, which are to identify the suitable media for BL in calculus using quantitative method, to develop the web-based system, namely as WebBLoC, based on selected media using calculus syllabus and finally to evaluate the developed system. For the development, the Waterfall model is used as a system development method to study the BL system. In general, this project expected to decrease the number of students failed in calculus and provide them more understanding the concepts and formulas of calculus by using the developed BL system (WebBLoC).

Aslina Baharum, Nur Shahida Ab Fatah, Nurhafizah Moziyana Mohd Yusop, Nurainna Ramli, Noor Fzlinda Fabeil, Song Teck Kang
Shared Folder Based Virtual Machine Migration in Cloud Computing

Virtual Machine Migration (VMM) is a process to migrate Virtual Machine (VM) from one physical host to another physical host. VMM is a complex task and can degrade the performance of overall cloud computing experience. VMM generates heavy network traffic that leads to network congestion. This network congestion further leads to packet loss and increases the total migration time. To handle such problem, we have proposed Shared Folder Based Migration (SFBM) approach to minimize the total migration time and network congestion. SFBM approach uses the modified pre-copy migration technique to relocate the data from source host to destination host. We have categorized the data into two categories: (1) working data set (2) data at rest. In proposed SFBM approach, we send the current working data set at the time of migration and resumes the VM at the destination host without sending data at rest. The data at rest reaches the destination from time to time according to the client request. This may increase the page fault but leads to less network congestion effectively speed up the transmission and making delay negligible to end user. We further analysed the proposed SFBM approach in different scenarios. The results show that proposed SFBM approach significantly reduces the total migration time and packet loss up to 91% and 32% respectively in scenario of no data requested after VM migration.

Yashveer Yadav, C. Rama Krishna

Network Technologies

Frontmatter
Wideband Monopole Planar Antenna with Stepped Ground Plane for WLAN/WiMAX Applications

A microstrip line fed compact monopole antenna is presented for the WLAN and WiMAX applications. The proposed antenna has a compact size of dimensions 34 × 20 × 1.6 mm3. A stepped shaped defected ground plane is used for the bandwidth enhancement. The parametric study is performed to obtain the best results for the design process of the antenna. The effect of asymmetric U-shaped strip and step slots in the ground plane provide an enhanced bandwidth. The antenna gives the measured impedance bandwidth of 105.21% (2.23–7.18 GHz). The simulated antenna gain is varying in the range of 2.39–4.68 dBi for the entire band of operation. Radiation efficiency is higher than 75.0% throughout the entire operating band. Measured radiation patterns are almost omnidirectional in H-plane and dumbbell shape pattern in E-plane. The antenna parameters are calculated using CST Microwave Studio and the simulated results are validated with the measured results.

Rakesh N. Tiwari, Prabhakar Singh, Binod Kumar Kanaujia, Partha Bir Barman
Node Activity Based Routing in Opportunistic Networks

In mobile networks, the problem of intermittent and truncated connectivity leads to the growth of opportunistic networks. In opportunistic networks, the disconnected mobile nodes communicated whenever they get opportunity to share the information or their connectivity is resumed. Because of this intermittent connectivity, routing in this type of networks becomes very challenging. Efficient use of resources is extremely important in such conditions. In this work, we propose an innovative routing strategy for opportunistic networks based on the node’s activities. In NABR, we consider node’s past behavior and activities to maximize the message delivery ratio under opportunistic network environment. We also propose a buffer management scheme that efficiently use buffer storage of nodes to reduce message drop rate. To simulate and demonstrate the performance of the proposed NABR protocol the ONE simulator is used and results are compared with existing routing schemes.

Prashant Kumar, Naveen Chauhan, Narottam Chand
Taxonomy of DDoS Attacks in Software-Defined Networking Environment

Software Defined Networking brings in the concept of “Programmable Network” in the networking domain which in turn lends flexibility, simplicity for managing the network. The key idea behind this simplicity is decoupling of the control plane from the data plane. Nevertheless, such decoupling of the planes also acquaints SDN to the most critical type of attack, i.e., DDoS attack. Our goal is to showcase a concise survey of DDoS attacks in SDN and then present comparative solutions against these DDoS attacks. Firstly, we discuss the life cycle of DDoS attack in SDN. Then several taxonomies of DDoS attacks which affect SDN environment have been discussed, followed by which analysis is performed to cover the taxonomy of solutions for this severe type of attacks. Finally, we present, future research directions that will be a crucial idea to defend such attacks in near future.

Tushar Ubale, Ankit Kumar Jain
Organization and Protection on the Basis of a Multi-agent System of Distributed Computing in a Computer Network to Reduce the Time for Solving Large-Scale Tasks

Special compilers are often used to solve multivariate tasks with time constraints. However, in this case, the cost of solving the problem is significantly increased and the time required to organize access to such a computing environment is required. At present, the use of distributed computing organized in a computer network is one of the most accessible and widespread technologies for reducing the time for solving large-scale tasks. Many different approaches for organization of distributed computing in a computer network are grid technology, metacomputing (BOINC, PVM and others). The purpose of most of the existing approaches for creating centralized systems of distributed computing is their main disadvantage.We propose to organize solutions to such a problem as multivariate modeling by creating distributed computing in a computer network based on a decentralized multi-agent system. A typical computer network is selected as a computing environment. A self-organizing distributed computing system based on a decentralized multi-agent system is proposed as a computer system. A system is a set of agents performing the same algorithm. We propose an agent algorithm for a decentralized multi-agent system. Agents working on this algorithm create a self-organizing distributed computing system and protect the results of calculations from such a thunderstorm as “denial of service”.

Sergey Khovanskov, Konstantin Rumyantsev, Vera Khovanskova
Mobility in MANET Using Robot: A Review

Recently, MANET (Mobile Ad Hoc Network) researchers have shown increased interest towards using mobile robot technology for their testbed platforms. Despite the existence of articles that discuss the usage of mobile robot technology pertaining to MANET testbed from the perspective of MANET researcher, the discussion provided in the papers are rather lacklustre as it is not the sole purpose of those articles. Hence, this review aims to discuss MANET testbeds that were facilitated with mobile robot technology from previous undertaken researches. With the wealth of information provided in this paper, it is hoped that this paper will be the ultimate source of reference for other MANET researchers who need to choose the most suitable mobile robots with real mobility in their MANET testbeds.

Farkhana Muchtar, Abdul Hanan Abdullah, Siti Nor Zawani Ahmmad, Yugal Kumar
Software Defined Network-Based Vehicular Adhoc Networks for Intelligent Transportation System: Recent Advances and Future Challenges

With the worldwide growth in vehicles due to the increase in population, Vehicular ad hoc networks (VANETs) have attracted researchers both from academia as well as the industry. It provides a smart and efficient driving experience for drivers. Traditional VANET suffers from various issues of security, QoS, and latency. To address these problems, software-defined network (SDN) based VANET is one of the key components in the field of transportation systems. It plays an important role in VANET and also provides features such as flexibility and programmability. It also deals with security, dynamism and heterogeneous features of the VANET environment. It helps the VANET in scalability and dynamic deciding the optimal path and aids the routing in situations of a congestion in VANET. In this paper, we have explored the suitability of SDN in VANET. We have also compared the various state-of-the-art approaches existing. These approaches are based on the concepts of clustering, geo broadcast, road side unit (RSU) based Geocast, fog and SDN based VANET, cloud-based VANET. It is evident from the literature that SDN based VANET provides better QoS, latency, and also efficiently handles heterogeneity. It also has good efficiency in comparison to a traditional network. Security is a crucial parameter in the SDN and hence has been explored in the paper. We have further highlight the open issues and challenges encountered while merging the VANET with SDN. This paper give insights to the researchers willing to start work in this domain.

Hardik Trivedi, Sudeep Tanwar, Priyank Thakkar
P-TORA: A TORA Modification Under TCP E2E-NewReno Model

Mobile Ad-hoc network, generally recognized as MANET is a non-wired, self-reliant and multi-hop network comprising of portable nodes that acts like a router in the network-system. It is a dynamic network having no central control. Evaluating the performance of MANET routing protocol is a present research topic. Reactive type of MANET routing protocol is popularly used nowadays because of the amenities provided by them. TORA (Temporally Ordered Routing Algorithm) is on-demand (Reactive) protocol. It is highly adaptive, multihop and the best for dense networks. This paper describes MANET along with the detailed study of TORA and the Proposed TORA protocol with some modifications in Original TORA. The modifications are done using TCP E2E New Reno operating model with the intention to enhance the performance of Original TORA. The new protocol was born and the name given is P-TORA. NS2 (Network Simulator 2) is a simulation tool used for measuring the performance of TORA and P-TORA in the MANET.

Radhika Patel, Bimal Patel, Sandip Patel, Amit Parmar
A Hybrid Approach for Requirements Prioritization Using Logarithmic Fuzzy Trapezoidal Approach (LFTA) and Artificial Neural Network (ANN)

Requirements prioritization (RP) is a crucial phase of requirements engineering (RE) to rank the requirements as per their priority weight in software development process. The existing technique like FAHP (Fuzzy analytical hierarchy process) is a very suitable methodology for requirements prioritization used in the fuzzy background suffers from a number of limitations like FAHP technique does not grant the accurate priority as per the client hope, create many conflicts in priority vectors and may outcome in dissimilar conclusion which are unacceptable for a fuzzy pair-wise comparison matrix. Fuzzy preference approach (FPA) and extent analysis (EA) based nonlinear techniques are efficient but create many issues like ambiguity, time complexity, scalability, provides negative degree of membership function, inconsistency and generates many non uniqueness optimal solution in fuzzy environment. In this research a hybrid approach for requirements prioritization using ‘LFTA with ANN’ proposed to overcome these issues providing the most client fulfillment with all technical characteristics. The case study performed on MATLAB software and result observed for a real life example ‘college selection’ with three selection criteria’s that illustrates the decision making result for requirements prioritization is better than previous techniques with higher priority. The proposed hybrid approach is oriented to resolve the classical gaps and meet up the client fulfillment of decision making in real applications. A hybrid approach is examined on real-life assignment for students (‘selection of best college’ based on three criteria’s), with existent colleges and college selection criteria’s are discussed in the fuzzy AHP.

Yash Veer Singh, Bijendra Kumar, Satish Chand, Deepak Sharma

Wireless Networks

Frontmatter
Improved Computation of Change Impact Analysis in Software Using All Applicable Dependencies

Different types of environment and user changes necessitate changes in the source code of the software and these changes also get propagated to other entities of the software. Change Impact Analysis (CIA) is one technique which helps the developers to know about the risks involved in changing different entities of the software system. This type of analysis can be carried out by computing different dependencies present in the source code. This paper proposes a new approach to compute CIA based on 8 different types of source code dependencies, out of which 3 dependencies are being introduced for the first time in this paper. The performance of the proposed technique is evaluated over four different software and results indicate that new dependencies used by us contribute significantly in accurate computation of CIA.

Mrinaal Malhotra, Jitender Kumar Chhabra
Self-optimization in LTE: An Approach to Reduce Call Drops in Mobile Network

Unwanted terminations of an on-going wireless conversation become the biggest issue of the whole world. Call drop degrades the voice call quality and impacted the quality of service of the network. Researchers, industries, and telecom- vendors are bothered to improve the call quality in existing telecom infrastructure and already proposed many valuable solutions which have own pros and cons but still there is no optimized reliable solution to reduce call drop has been deployed till now. This research paper focuses on some background reasons for call drop in existing wireless infrastructure and proposed the self-optimization concept to handle the overall network issue automatically in perspective of call drops minimization in mobile networks. This Research paper proposed some robust functionality of self-optimizing network such as automatic neighbor list optimization, mobility load balancing optimization and handover optimization approach used to improve voice call quality and make a self-automated mobile network that would be fruitful to reduce call drop rate.

Divya Mishra, Anuranjan Mishra
Performance Analysis of CBR and VBR Applications on Different Multicast Routing Protocols Over MANET

MANET has become one of the most economical means of group communication where other means of communications are either not feasible or very expensive. Traffic pattern plays a key role in achieving the quality of service (QoS) in various applications of the MANET. In this paper, Constant Bit Rate (CBR) and Variable Bit Rate (VBR) traffic patterns with varying density of nodes are considered to observe the performance of Multicast MAODV, PUMA, and ODMRP in terms of QoS parameters such as end-to-end (E2E) delay, routing load and packet delivery ratio (PDR) to propose and design the new multicast routing protocols in future. From the analysis, it is observed that it is difficult to rank the multicast protocols on the basis of performance under CBR and VBR, but the overall performance of ODMRP multicast protocols is more optimized than PUMA and MAODV under CBR than VBR.

Dinesh Chander, Rajneesh Kumar
Modified Trust Value Based Approach to Secure Wireless Sensor Networks

The unattended nature of the WSN makes the nodes susceptible to various attacks. Among many of the possible attacks, ones that are focused on draining nodes’ energy are most dangerous since they leave the network dead. This paper proposes a scheme to detect the aggressive behavior of nodes by using the packet- forwarding behavior of the nodes. Trust value is lessened if in any case there is a difference between the number of packets forwarded by the sensor hub during data transmission is discovered abnormal. In this way, after a certain number of rounds, nodes which are acting as aggressive will be removed. For transmitting the information over the system effectively when the abnormal hub is to be expelled from existing path would require second way promptly accessible, to take care of this issue in this method two nearest neighboring hubs are chosen to shape two ways. The rendition of the system is analyzed on the basis of remaining energy, packet forwarding ratio, and throughput.

Pardeep Kaur, Sandeep Kad
PF-AID-2KAP: Pairing-Free Authenticated Identity-Based Two-Party Key Agreement Protocol for Resource-Constrained Devices

An adequate construction of shared session key for wireless-resource constrained devices is a challenging task than conventional wired, memory and power-rich devices. Since several two-party key establishment schemes have been proposed but they are not suitable for resource-constrained devices. It has been seen that pairing operations on elliptic curves are computationally more costly than scalar multiplication and addition operations on the elliptic curve. In this article, we proposed pairing-free two-party authenticated ID-based key agreement protocol (PF-AID-2KAP) for such resource constrained devices. Under the assumption to solve ECDLP and CDHP problems, the propose PF-AID-2KAP scheme is provably secure. Further, we show that the key agreement scheme is resilience to following adversarial attacks: perfect forward secrecy, MITM attack, key control, known session key security. As compared to other schemes, our proposed system have less running time, less bandwidth cost and takes less number message exchange during communication.

Mahender Kumar, P. C. Saxena
Monitoring of Network to Analyze the Traffic and Analysis of Audit Trails Using Process Mining

Monitoring of network is an essential part of the current digital world to analyze the traffic in the organizational networks to detect the intrusions and cyber-attacks. For Intrusion detection system, many approaches have been used till now, but network administrators are still facing the problems due to false alarms. In this manuscript, we have monitored the organization network in real time for the analysis. We have also compared the different data mining approaches being used for intrusion detection method and malicious activities detection in the database using log mining approach. A model is proposed using process mining approach to detect the malicious transaction automatically in the database. The process mining approach can help to reduce the false positive alarms as compared to the current intrusion detection and prevention systems. To implement the process mining concept, audit trails for road traffic fine management process was collected and it has been analyzed to generate the processes using PRoM tool.

Ved Prakash Mishra, Balvinder Shukla, Abhay Bansal
DV-HOP Based Hybrid Range-Free Localization Methods for Wireless Sensor Networks

Localization in a Wireless Sensor Network (WSN) is the process of discovering location by a location unaware node with the help of known locations of reference nodes. Among the available localization techniques, a category of localization technique called range-free localization has received considerable attention in the WSN research due to low processing, memory, and energy overheads. However, each localization method has its own advantages and limitations in the view of performance. To this end, this paper analyses four well-known range-free localization methods such as Distance Vector Hop (DV-HOP), 2D-Hyperbolic (2DH), Weighted Centroid Localization (WCL) and Concentric Anchor Based (CAB) localization with respect to their performance. With the experience gained from the analysis, this paper then proposes and analyses the performance of DV-HOP based hybrid localization methods for WSNs. The simulation results from MATLAB shown that the DV-HOP with 2DH resulting into high localization accuracy as compared to other methods.

Ananya Dwivedi, P. Raghu Vamsi
Analysis of Enhanced Hybrid Approach Using Greedy Perimeter Stateless Routing in VANET

With the advent in VANET (Vehicular Adhoc Network) technology, the need of innovation in social issues is demanding at high pace. VANET correspondence as of late turned into an undeniably prominent research point in the zone of wireless networking. Routing in VANET is an essential subject. Position based routing protocols are more reasonable for VANET when contrasted with every other protocol. GPSR is a standout amongst most appropriate routing protocol that works as position based. Here a hybrid PHRHLS (A Movement Prediction based Joint Routing and Hierarchal Location Based Service) approach collaborating HLS area advantage and GPSR protocol is utilized. In this GPSR protocol has been improved and our model gives enhanced outcome regarding parcel average latency and packet delivery ratio (PDR).

Ashish Kr. Luhach, Isha, Neha, X. Z. Gao
Power Consumption Analysis in Multi-hop Networks of Mobile Environments

The recent advances in cellular technologies have led to the introduction of 4G, LTE and 5G wireless services, with the usage of OFDM which is complex in computation but can easily be taken care of. The paper made an attempt to highlight the characteristics of two standards of IEEE to keep an open option for selecting devices. The proposed system utilizes the concept of multihop relay and has handled power consumption at the mobile station for battery utilization under high mobile environment. An attempt is made to calculate the power utilization at all the nodes to analyze the power consumed at the base, mobile and relay node in IEEE standard 802.11 and 802.16. Different energy and battery models were used for enhancing the performance. To increase the spectrum of the signal CDMA is used in between RN and BS and OFDMA is used in between BS and MS. The objective is to check for an optimal solution in between two standards of IEEE 802.11 and 802.16 if any one of it is to be selected.

Fahmina Taranum, Khaleel Ur Rahman Khan, Muhammed Aleemuddin
Anonymity Preserving Authentication and Key Agreement Scheme for Wireless Sensor Networks

The main purpose of our paper is to design efficient smartcard based authentication and session key agreement scheme for wireless sensor networks. Our scheme uses registration phase for both user and sensor nodes. We analyze security and simulation results using AVISPA shows that our scheme is secure against attacks.

Deepti Singh, Samayveer Singh, Bijendra Kumar, Satish Chand
Performance Investigation of Energy Efficient HetSEP for Prolonging Lifetime in WSNs

In this work, we investigate the performance of heterogeneous stable election protocol (HetSEP) for prolonging the network lifetime. An order-5 heterogeneous energy network model is proposed in this work that can defines the order-1, order-2, order-3, order-4, and order-5 heterogeneity. We consider the SEP protocol to calculate the lifetime of the network and consequently describe its accomplishments as HetSEP-1, HetSEP-2, HetSEP-3, HetSEP-4, and HetSEP-5. The SEP protocol is HetSEP-1 in which all the sensor nodes have same amount of energy. The HetSEP-2, HetSEP-3, HetSEP-4, and HetSEP-5, contain two, three, four, and five orders of energy, respectively. The network lifetime increases as increasing the order of heterogeneity. The HetSEP-2, HetSEP-3, HetSEP-4, & HetSEP-5, prolong the lifetime of the network 100.39%, 126.12%, 186.56%, & 285.67%, in respect to the increase the energy of the network by 65.0%, 72.58%, 107.10%, & 208.40% with respect to the HetSEP-1.

Samayveer Singh, Pradeep Kumar Singh
Backmatter
Metadaten
Titel
Futuristic Trends in Network and Communication Technologies
herausgegeben von
Dr. Pradeep Kumar Singh
Dr. Marcin Paprzycki
Bharat Bhargava
Jitender Kumar Chhabra
Narottam Chand Kaushal
Prof. Yugal Kumar
Copyright-Jahr
2019
Verlag
Springer Singapore
Electronic ISBN
978-981-13-3804-5
Print ISBN
978-981-13-3803-8
DOI
https://doi.org/10.1007/978-981-13-3804-5