Vice President
Desh Bhagat University, Mandi Gobindgarh
An eminent academician & excellent administrator with 28 years of experience in General Administration, Research & Development and Teaching Functions. Possessing high academic credibility, clear strategic vision and outstanding leadership qualities. Currently, serving as Vice President of Desh Bhagat University and Professor of Computer Science and Engineering in Desh Bhagat University, Punjab, India. He has also served as Founder Vice Chancellor, CT University, Ludhiana for 5.7 years. He has published scientific research publications in reputed International Journals including SCI indexed and Scopus indexed Journals such as Journal of Intelligent and Fuzzy Systems, Journal of Applied Sciences, International Journal of Scientific and Technology Research (IJSTR), International Journal of Advanced Research in Engineering and Technology (IJARET), International Journal of Light and Electron Optics (Optik Elsevier Journal). International Journal of Computer Science and Communication Engineering (IJCSCE), International Journal of Advanced Research in Computer science and Software Engineering, Maxwell’s Sciences and many more. Apart from this, he has attended many National, International Conferences and IEEE Conferences of repute like Springer, Elsevier in India as well as abroad. He has visited more than 20 countries in his academic career for presenting his scientific research. His major areas of Research are Machine Learning, Artificial Intelligence, Deep learning, Parallel processing, Computational Neurosciences, Bio-inspired Computing, Security in Cloud Computing. He has also chaired various International Conferences of Springer, Elsevier. He has guided 12 Ph.D Scholars and currently guiding 8 Research Scholars. He is also an eminent reviewer of many reputed Journals like Elsevier, Springer etc. Has more than 100 research publications in various national, international conferences and journals to credit.Taught various subjects like Computer System Architecture, Database Management System, Operating System, Compiler Design, Microprocessor, System Analysis & Design.
Desh Bhagat University, Mandi Gobindgarh
CT University, Ludhiana
CT University, Ludhiana
RIMT University, Mandi Gobindgarh
RIMT Institutes, Mandi Gobindgarh
RIMT- IET , Mandi Gobindgarh
RIMT- IET, Mandi Gobindgarh
RIMT- IMCT, Mandi Gobindgarh
BBSB Engineering College, Fatehgarh Sahib
Ph.D. in Computer Science & Engg. (Parallel Processing)
Punjab Technical University, Jalandhar
M.E (Computer Science)
Thapar Institute of Engineering & Technology, Patiala
B.E (Computer Technology)
Nagpur University
Area of Research : Parallel Processing
Title of Thesis : Some Aspects of Performance Measures in Parallel Processing
Having more than 100 research publications in various national, international conferences and journals to credit, Dr. Harsh has authored a book on Parallel Processing published by Aberdeen University Press Services, USA. 12 Ph.D scholars have completed their doctorate under his supervision. Has supervised 12 M.Tech Scholars and 2 M.Phil scholars.
Contributed towards the following Papers Published/Communicated in International Journals/Conferences, National Conferences:
The renal cancer is very serious and rapidly growing disease. It is very necessary that the abnormalities in renal or kidney of a patient will be identified so that cancer will not reach to its advanced stage or phase. Therefore, the early detection of renal cancer is very important to save the life and to increase the life span of particular patient. In this study, an intelligent system using adaptive neuro-fuzzy inference system (ANFIS) is proposed to diagnose renal cancer. This proposed system helps to classify the various stages of renal cancer such as no cancer, stage 1, stage 2, stage 3 or stage 4 cancer. Hence, the prime objective of this study is to diagnose renal cancer by using adaptive neuro-fuzzy inference system (ANFIS). There are seven input variables that are given to the system. These are haematuria (blood in urine), red blood cell count, flank pain, tumour size, Von Hippel-Lindau gene, high blood pressure and trichloroethylene exposure. Similarly, the output corresponding to given inputs is stage of renal cancer. The output can be no cancer, stage 1, stage 2, stage 3 or stage 4 of renal cancer. The MATLAB software is used to implement this adaptive neuro-fuzzy inference system (ANFIS). The developed medical intelligent system for the detection of renal cancer shows the correct and accurate results with accuracy 96%.
The ever increasing demand of data traffic due to emerging services and applications has evolved the need of high capacity, high speed and highly spectral efficient optical systems with advanced modulation formats. We compare the performance of single channel coherent optical system for 112 Gb/s with Dual polarization modulation techniques i.e. DP- QPSK(Dual Polarization Quadrature phase shift keying), DP-16QAM(Dual Polarization −16 Quadrature amplitude Modulation) and DP-32QAM(Dual Polarization −32 Quadrature amplitude Modulation) with DSP (Digital Signal Processing)module for SSMF(standard single mode fiber) in terms of tolerance to fiber nonlinearities which is investigated through the effect of power and distance on %EVM and requirement of OSNR using numerical simulations. ned shows that the coherent optical systems with higher order modulation formats are less tolerant to fiber nonlinearities i.e the performance of DP-QPSK coherent systems with DSP module is better than the DP-16QAM and DP-32QAM coherent systems as they are more tolerant to fiber nonlinearities. The results obtained can be used for the design of compensation techniques for fiber nonlinearities in cohResults obtaierent optical systems using higher order modulation formats.
The abnormal and anomalous observations even in the advanced technological era proves to be the biggest jolt to the concerned industry. To reduce and eliminate the outliers from the massive data streams...
Curse of Dimensionality and the attribute relevance is the matter of great concern now these days while dealing with the higher dimensional data sets or Big Data, especially to detect the projected outliers. The objective of this research paper is to construct a Robust and a scalable model to prominently highlight the higher dimensional outliers in an effective and an efficient manner. Methods/Analysis: In order to detect the projected outliers, an algorithm EKFFK-Means with a hybrid approach is constructed using two important methodologies- Extended Kalman Filter (EKF) and Fuzzy K-Means. EKF is used to linearize the higher dimensional data by estimating the current mean and covariance by enhancing the Kalman gain and then fuzzy K-Means confirms the outlying property of each data instance and categorizes them in an effective and an efficient way using the membership label. Findings: A model EKFFK-Means is constructed that further creates 30 clusters from the complete data set to detect the projected outliers and various parameters like accuracy, cluster validity, True positive rate, False positive rate , robustness and cluster quality are calculated. Improvements : This algorithm is further compared with HPStream and CLUStream and is proved better against various parameters.
Region of interest detection in ultrasound image is a challenging task due to heterogeneous texture and presence of speckle noise. The ultrasound scanning is most frequently used tool to examine the patient for abnormities, especially presence of stone, in the kidney. Automatic object detection in ultrasound images is burning research areas and the present research work is in the same direction. We have developed an application, which helps the medical practitioner to identify the stone region in the ultrasound image. It is a semiautomatic system in which practitioner need to select the region, which is analyzed, by the proposed system for presence of stone. The feature extraction is applied on cropped regions, which may contain stone. The various features such as Contrast, Angular second moment, Entropy and Correlation are used. The KNN classifier is used to classification based on training image dataset. The overall accuracy of classification system is around 91%. The confusion matrix is also prepared to analyze the complexity and accuracy of the proposed system.
Kidney ultrasound imaging is an economical, non invasive, real time diagnosis system which is used to measure abnormalities in the shape, size and location of the kidneys in the body. The presence of speckle noise degrades the visual quality of ultrasound images. The primary objective of the research under taken is to detect the renal stone in ultrasound images. The present research paper discusses an algorithm based on cellular automata and nonlocal mean for suppression of the speckle noise. The cellular automatons are dynamic systems to represent the particular problem in terms of specific pattern. This concept is exploited to distinguish the noise from the object being target. The kidney ultrasound images are denoised to detect presence of renal stone in the image.
We study and compare the performance of 112Gb/s Dual polarization coherent optical system for single channel coherent system with different modulation techniques,DP- QPSK(Dual Polarization Quadrature phase shift keying), DP-16QAM(Dual Polarization 16 qadrature amplitude Modulation) using numerical simulations with inline DCF(dispersion compensation fiber) and without inline DCF( but with DSP module for dispersion compensation)using SSMF(standard single mode fiber) for the effect of fiber nonlinearities. Inline dispersion post compensation system was explored to mitigate the impact of transmission impairments. Results obtained shows that the performance of DP-QPSK coherent systems with inline dispersion post compensation is better than the electronic dispersion compensation using DSP module as with DCF they have more tolerance to fiber nonlinearities than those with electronic dispersion compensation but for DP-16QAM coherent system the performance with electronic dispersion compensation is better than with inline dispersion compensation.
We have presented Digital Image watermarking for gray scale images which implemented in frequency domain. In this paper, a binary watermark pattern was constructed from the information content of the image by selecting the minimum value from every block of size and was disordered with the help of Arnold Transform. Peak signal to Noise Ratio and Normalized Cross-correlation are computed to measure image quality. Experimental result shows that the watermarking algorithm is robust against common signal processing attacks and this is also tested against multiple attacks and obtained result reveals the high effectiveness of the method.
We investigated the performance of Raman-EDFA hybrid optical amplifier using SOA booster for 100 channels DWDM transmission system with each channel having data rate of 10 Gbps at reduced channel spacing of 0.2 nm.....
Outliers are the data objects that do not conform to the normal behaviour and usually deviates from the remaining data objects may be due to some outlying property ....
With the Advancement of time and technology, Outlier Mining methodologies help to sift through the large amount of interesting data patterns and winnows the malicious data entering in any field of concern...
We have been living in an era of rapid integration of IT technologies into business processes and people’s day to day lives. Large volumes of functional and non functional data is being produced everywhere which companies desire to make use of. Data mining techniques and data analytics have become essential in making useful sense of this sea of data for any business to prosper. Taking an example of retail sector, internet users in India have been becoming increasingly aware and receptive towards online retail. Noticing this traditional retailers have been focusing on increasing their online presence and adapting to new marketing strategies thereby utilizing this medium. In this paper we discuss in detail the facets of online retail, e shopping and changing needs of consumers also our research objectives and how we propose to identify the factors influential in affecting consumer perception and their satisfaction rate.
Interconnection networks (IN) play very important role in various parallel processing applications. The connectivity pattern used in interconnection networks greatly determines the performance of the system. Multistage Interconnection Network is also an IN. The interconnection pattern used also determines the fault tolerance of the network. This paper introduces a new irregular fault tolerant multistage interconnection network named Irregular Modified Shuffle Network (IMSN). IMSN is analyzed in terms of fault tolerance and it has been observed that IMSN provides more alternate paths than existing networks such as Improved Four Tree Network (IFTN), Modified Alpha Network (MALN) and New Irregular Augmented Shuffle Network (NIASN).
Abstract—Hybrid amplification based on Raman-EDFA optical amplifier in combination with Semiconductor optical amplifier (SOA) booster .....
Ultrasound imaging can be used as an initial evaluation method in Urological diagnosis to examine kidney problems. The diagnosis helps doctor to access abnormalities in kidney like abnormality in size and shape of kidneys, presence of swelling, cysts, ulcer and stones. However, the Ultrasound diagnosis is more popular as compare to Computed Tomography (CT) and Magnetic Resonance Imaging (MRI) scanning, but it suffers with speckle noise. The speckle noise is an inherited property of ultrasound images which shows bright particles in the ultrasound images.
In the present position of global networking, we want to protect our digital contents i.e. audios, videos, pictures and texts from unauthorized copying. For this reason, Digital Image watermarking Techniques have been developed to the copyright protection of digital data from illegal modification and reproduction. It is used in various areas like broadcast monitoring, copyright protection and also for owner identification. This paper highlights the basic model of Digital watermarking including its types and applications and also about various attacks on watermarked images. In this paper we also discussed about two methods i. e spatial domain and frequency domain.
Inter-processors communication is one of the key issues of the system performance. The ability of networks to continue operating despite failures at minimum cost are major concerns in determining the overall system performance. In this paper, a new irregular multistage interconnection network is proposed named as Irregular Augmented Shuffle Exchange Network-4 (IASEN-4). The Performance of IASEN-4 is measured over some popular MINs in terms of permutation passable, fault-tolerance and cost effectiveness. It has been observed that IASEN-4 provides much better fault tolerance by providing more paths between any pair of source-destination at lesser cost as compared to other popular networks such as IASEN-3[12], IAON [8] and IASEN-2[11]. Key Words: Multistage Interconnection Networks, Irregular Augmented Shuffle Exchange Network, Irregular Advance Omega Network, Permutation Passable, Cost-Effectiveness.
The Multistage Interconnection Networks (MINs) are basically a class of high-speed computer networks that usually consist of processing elements (PEs) at one end and memory elements (MEs) at the other end of the network. These PEs and MEs are connected by switching elements (SEs) which are themselves usually connected to each other in stages, hence the name. MINs are typically used as a low-latency interconnection as opposed to traditional packet switching networks because interconnecting processors and linking them efficiently to memory module is not an easy task. Hence, an interconnection network which can provide a desired connectivity and optimum performance is required. This paper presents a new type of such Irregular Multi-Stage Interconnection Network (MIN) named as Irregular Augmented Shuffle Exchange Network-4 (IASEN-4). The study of the existing regular and irregular multistage interconnection networks was carried out and their performance parameters were analyzed followed by the designing of IASEN-4 and computation of its respective performance factors. This proposed network is compared with the existing networks, viz. IASEN-3, IAON and IASEN-2 in terms of Bandwidth, Probability of Acceptance, Processor Utilization, Processing Power and Throughput. In this paper, we have proved that IASEN-4 is much better than the above-mentioned networks by comparing their aforesaid parameters.
In this paper variety of fault tolerant multistage interconnection networks that have been proposed in literature are surveyed .Fault tolerant networks are capable of handling requests even in presence of faults although at reduced performance. Various networks which we have surveyed include Augmented Baseline Network (ABN) , Irregular Augmented Baseline Network (IABN), Modified Augmented Baseline Network (MABN), Augmented Shuffle Exchange Network (ASEN-2), Irregular Augmented Shuffle Exchange Network (IASEN), Irregular Augmented Shuffle Network (IASN),Improved Irregular Augmented Shuffle Network(IIASN), New Irregular Augmented Shuffle Network( NIASN), Modified Augmented Shuffle Exchange Network (MASEN), Irregular Augmented Shuffle Exchange Network–3 (IASEN-3), Modified Alpha Network (MALN), Advance Irregular Alpha Multistage Interconnection Network (AIAMIN2), Irregular Advance Omega Network (IAON).
Data Mining simply refers to the extraction of very interesting patterns of the data from the massive data sets. Outlier detection is one of the important aspects of data mining which actually finds out the observations that are deviating from the common expected behavior...
Outlier detection for higher dimensional stream data is a new and an emerging concept. To detect the higher dimensional outliers i.e. the projected outliers is itself a very challenging task...
Wireless sensor network, IEEE 802.15.4/Zigbee is a specification for a suite of high level communication protocols that interconnects simple low power low processing capability wireless nodes for the transfer of data This paper aims at finding out the suitable mobility model that determines the effective positioning of nodes that gives the best throughput. In this study, the effect of four different mobility models, such as group, random walk, random waypoint and pursue mobility models has evaluated on various IEEE 802.15.4 based zigbee standard network. After the intensive simulations, it has been seen that by using the tree topology for the placement of nodes in the network and by configuring the movement of the nodes according to the group mobility model, network gives the maximum throughput and possess minimum data dropped in the network. So, it has concluded that under the given conditions, group mobility model outperforms other three mobility models.
Fiber-optic communication systems have revolutionized the telecommunications industry. It has number of advantages over electrical transmission Recently, the interest lies in the increase of spectral efficiency as well as tolerance against dispersion effects and fiber nonlinearities which are today’s the most limiting factors in ultra long haul communication systems. With the new possibilities offered for the high speed digital circuits, coherent systems have attracted a lot of attention during the last years. Coherent detection is a promising technology to increase optical receiver sensitivity, enables supporting of more spectrally efficient modulation formats such as quadrature phase shift keying (QPSK) and quadrature amplitude modulation (QAM) and allows digital signal processing for compensation of transmission impairments.
Data Mining is the process of extracting previously unknown but significant information from large databases. It is also termed as the exploration and analysis of large quantities of data in order to discover valid, novel, potentially useful, and ultimately understandable patterns in data. Data and Information or Knowledge has a significant role on human activities. Data mining is the knowledge discovery process by analyzing the large volumes of data from various perspectives and summarizing it into useful information. To analyze, manage and make a decision of such type of huge amount of data we need techniques called the data mining.
Mobile ad hoc networks communicate without any fixed infrastructure or ant centralized domain. All the nodes are free to move randomly within the network and share information dynamically. To achieve an efficient routing various protocols have been developed so far which vary in their nature and have their own salient properties. In this paper, we have discussed one of the latest protocols i.e. Dynamic Manet on demand (DYMO) routing Protocol, implemented and analysed its performance with other similar protocols against different parameters. Finally a comparison has been presented between all of them.
A mobile ad-hoc network (MANET) is basically called as a network without any central administration or fixed infrastructure. It consists of a number of mobile nodes that use to send data packets through a wireless medium. There is always a need of a good routing protocol in order to establish the connection between mobile nodes since they possess the property of dynamic changing topology. Further, in all the existing routing protocols, mobility of a node has always been one of the important characteristics in determining the overall performance of the ad hoc network. Thus, it is essential to know about various mobility models and their effect on the routing protocols. In this paper, we have made an attempt to compare different mobility models and provide an overview of their current research status. The main focus is on Random Mobility Models and Group Mobility Models. Firstly, we present a survey of the characteristics, drawbacks and research challenges of mobility modeling. At the last we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Also, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.
The Performance of a system depends directly on the time required to perform an operation and number of these operations that can be performed concurrently. High performance computing systems can be designed using parallel processing. The effectiveness of these parallel systems rests primarily on the communication network linking processors and memory modules. Hence, an interconnection network that provides the desired connectivity and performance at minimum cost is required for communication in parallel processing systems. Multistage interconnection networks provide a compromise between shared bus and crossbar networks.
Digital information is easy to transfer and store but this property of digital information becomes harmful to itself as it can be easily copied and distributed on the internet. Thus, number of efforts are going on to protect the copyright of the owner like Steganography, digital signatures etc. But digital watermarking comes out to be most effective tool among these. It can be applied on text, image, audio and video files in number of ways which are effective for any specific application.
Piracy in the presence of internet and computers proves to be a biggest damage to the industry. Easy editing and copying of images yields a great damage to the owner as original images can be distributed through internet very easily. To reduce the piracy and duplicity of the digital multimedia files, digital watermarking technique is dominating over the other available techniques. There are certain methods or attacks which are used to damage the watermark. One of the major attacks is histogram equalization and reducing the number of histogram equalized levels. Thus, there is a need to develop a method so that the watermark can be protected after histogram equalization.
In this paper, we discuss the basic routing technique of ants and study the change in pheromone values at each node. Also the optimal paths can then be computed based on the shortest cumulative pheromone count between source and destination nodes. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. The ants or control packets collect information about the network conditions and are used to update and maintain the routing tables. Ants based routing is gaining more popularity because of its adaptive and dynamic nature. A number of Swarm Intelligence based, more specially Ant Colony Optimization (ACO) based routing algorithms are proposed by researchers. A version of ant routing protocol called AntNet has been implemented to work within the network simulator ns-2. Routing tables and Pheromone tables have been computed for each node in the network. On the basis of these tables we have tried to compute the shortest and most optimal path between source node and destination node.
Routing in an ad hoc network is always a challenging task because of the free and random movement of nodes. This high node mobility sometimes results in route failures and decreased network performance. Itfurther degrades the overall performance of the routing protocol. In this study we have analyzed the effect of two node mobility parameters, i.e. varying speed and number of nodes, on the throughput of Ad hoc on-demandDistance Vector Routing Protocol. The performance is experimentally tested and compared using ns2 simulator.The simulation results are graphically shown and explained.
Apart from tremendous research being done all around the globe, still ad hoc networks are a big challenge for the researchers. Routing in an ad hoc network is extremely challenging because of its dynamic nature, limited bandwidth and power energy. Somehow, Swarm Intelligence based techniques such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for ad hoc networks. ACO based routing is an efficient routing scheme based on the behaviour of foraging ants. The collective behaviour of ants helps to find the shortest path from the nest to a food source, by deposition of a chemical substance called pheromone on the visited nodes. This mechanism from collective intelligence is applied to the ad hoc network by researchers. In this paper, we have brought some characteristics as well as performance analysis of the proposed ACO based ad hoc routing protocols and compare them with the well-known ad hoc routing protocols. The results presented in the last also help the researchers to understand the differences among various ACO based routing algorithms and to choose appropriate protocol for their research work. Our study shows how this approach has significantly improved the performance of the ad hoc networks.
A number of routing protocols has been proposed in recent years for possible use of Mobile Ad Hoc Networks in various application areas such as military, govt. etc. In this paper we have presented a comprehensive review of these protocols with a particular focus on their security aspects. Further we have presented a comparison of some of the existing Routing Protocols of MANETs. The base criteria for comparison is routing methodologies and the information used to make routing decisions. All the protocols have to meet five security requirements: confidentiality, integrity, authentication, non-repudiation and availability, with respect to which the analyses of secure versions of proposed protocols are discussed.
Ant algorithms and swarm intelligence systems have been offered as a novel computational approach that replaces the traditional emphasis on control, preprogramming and centralization with designs featuring autonomy, emergence and distributed functioning. These designs provide scalable, flexible and robust, able to adapt quickly changes to changing environments and to continue functioning even when individual elements fail. These properties make swarm intelligence very attractive for mobile ad hoc networks. These algorithms also provide potential advantages for conventional routing algorithms. Ant Colony Optimization is popular among other Swarm Intelligence Techniques.In this paper a detailed comparison of different Ant based algorithms is presented. The comparative results will help the researchers to understand the basic differences among various existing Ant colony based routing algorithms.
Proteins are the most important macromolecules of life. The knowledge of protein function is an important link for the development of drugs, crop development and synthetic bio-chemicals like bio fuels. Different techniques are applied for the protein function prediction. These techniques are based on protein sequence, protein structure, genomic data, protein interaction networks etc. In this paper we will use docking for the prediction of protein function .The docking technique makes the database search faster .By applying docking for the protein function prediction we can easily find the complementary proteins for the target proteins during the drug discovery process which makes this process fast. . Docking technique also helps in classification of enzymes and their mechanisms .By applying docking the virtual screening of the compounds could be done.
In recent years, a vast research has been seen going on in the field of Mobile Ad Hoc Networks (MANETs). Due to limited resources in MANETs, to design an efficient and reliable routing strategy is still a challenge. An intelligent routing strategy is required to efficiently use the limited resources. Also the algorithms designed for traditional wired networks such as link-state or distance vector, does not scale well in wireless environment. Routing in MANETs is a challenging task and has received a tremendous amount of attention from researchers around the world. To overcome this problem a number of routing protocols have been developed and the number is still increasing day by day. It is quite difficult to determine which protocols may perform well under a number of different network scenarios such as network size and topology etc. In this paper we provide an overview of a wide range of the existing routing protocols with a particular focus on their characteristics and functionality. Also, the comparison is provided based on the routing methodologies and information used to make routing decisions. The performance of all the routing protocols is also discussed. Further this study will help the researchers to get an overview of the existing protocols and suggest which protocols may perform better with respect to varying network scenarios.
The corporate LAN has evolved from a passive background business component to a highly active, highly visible core asset that enterprises rely on to support day-to-day operations critical to their market success. Today’s network is a strategic instrument that must be accessible anytime from anywhere—simultaneously offering fast, secure, reliable services at scale regardless of location. It has also evolved from traditional client/server data flow support to peer-to-peer flow support, and it must also accommodate an increasing number of devices and services. The main aim of this research paper is to demonstrate the need for implementation of switches in the design of LANs using OPNET-MODELER. The performance of a 16-station LAN using first a simple hub, and then a switch and two hubs is compared. By analyzing the graphs, it is concluded that traffic performance of a network after deploying switches is better.
Piracy in the presence of internet and computers proves to be a biggest jolt to the concerned industry. To reduce the piracy and duplicity of the images, digital watermarking technique is having an edge over the other available techniques. In this paper, a blind digital watermarking algorithm is presented which is robust enough to resist the watermark against the attacks. The algorithm exploits the random sequence generated by Arnold and Chaos transformations. Discrete wavelet transformation of third level decomposition is used to convert the image into its frequency domain. The binary watermark is embedded into its HL3 domain. The evaluation of the algorithm is calculated in terms of peak signal to noise ratio and non correlation. The results prove that the algorithm is robust enough to handle the attacks like JPEG, filtering, and different types of noise attacks.
The field of Mobile Ad hoc Networks (MANETs) has gained an important part of the interest of researchers and become very popular in last few years. MANETs can operate without fixed infrastructure and can survive rapid changes in the network topology. They can be studied formally as graphs in which the set of edges varies in time. The main method for evaluating the performance of MANETs is simulation. This paper is subjected to the on-demand routing protocols with identical loads and environment conditions and evaluates their relative performance with respect to the two performance metrics: average End-to-End delay and packet delivery ratio. We investigated various simulation scenarios with varying pause times. From the detailed simulation results and analysis, a suitable routing protocol can be chosen for a specified network and goal.
A mobile ad-hoc network is a self-configuring network of mobile routers, connected by wireless links, which are free to move randomly and organize themselves arbitrarily. These types of networks operate in the absence of any fixed infrastructure which makes them easy to deploy but it becomes difficult to make use of the existing routing techniques for network services. This poses a number of challenges in ensuring the security of the communication. Because of the changing topology special routing protocols have been proposed to face the routing problem in MANETs. The paper contains two major sections: one presenting the secure routing protocol functionality and their comparison, the other presenting threats faced by the ad hoc network environment and provides a classification of various security mechanisms. We attempt to analyze the respective strengths and vulnerabilities of the existing routing protocols and suggest a broad and comprehensive framework that can provide a tangible solution. The paper closes with a conclusion and an outlook on evolving trends in secure ad hoc routing.
In this paper, a new type of MIN, New Irregular Augmented Shuffle Network (NIASN) is proposed. The proposed NIASN and existing IASN, QT, ASEN-2 MINs are analyzed and compared. The proposed network NIASN provides much better Bandwidth, Probability of acceptance, Throughput, Processor Utilization, and Processing Power than existing MINs.
Testability design is an effective way to realize the fault detection and isolation. It becomes crucial in the case of Aspect Oriented designs where control flows are generally not hierarchical, but are diffuse and distributed over the whole architecture. In this paper, we concentrate on detecting, pinpointing and suppressing potential testability weaknesses of a UML Aspect-class diagram. The attribute significant from design testability is called “class interaction”: it appears when potentially concurrent client/supplier relationships between classes exist in the system. These interactions point out parts of the design that need to be improved, driving structural modifications or constraints specifications, to reduce the final testing effort. This paper does an extensive review on testability of aspect oriented software, and put forth some relevant information about class-level testability.
Health care has become one of the most important services. Hospitals, physicians, insurers, and managed-care firms are networking, merging, and forming integrated organizations to finance and deliver health care. This paper mainly does some research on the problem of secure data flow. Data access is enabled via internet browser technology. Relevant patient and image acquisition information is extracted from the DICOM images and stored into a relational database. Patient information such as radiological findings are transferred from the Radiological Information System (RIS) into the database. Image data is accessed viewer. Since data security mechanisms either by a fast preview tool , a DICOM encryption of sensitive patient data is implemented. The method allows a dynamic selection of the data to be encrypted.
In this paper we present a survey of various existing secure routing protocols for mobile ad hoc networks (MANETs). A mobile ad-hoc network is a self-configuring network of mobile nodes, connected by wireless links, which act as routers and are free to move randomly and organize themselves arbitrarily. These types of networks operate in the absence of any fixed infrastructure which makes them easy to deploy but it becomes difficult to make use of the existing routing techniques for network services. In order to facilitate communication within the network, a Routing Protocol (RP) is used to discover routes between nodes. The primary goal of such an ad-hoc network RP is correct and efficient route establishment between a pair of nodes so that messages may be delivered in time. The wireless and distributed nature of MANETs poses security a great challenge to system designers. This paper contains two main sections: first section presents a short literature study on various types of security attacks and routing security schemes that have been proposed to prevent and/or detect these attacks and second gives a state-or-the-art review of the existing secure Routing Protocols designed for MANETs with a comparison for typical representatives.
The Performance of a system depends directly on the time required to perform an operation and number of these operations that can be performed concurrently. High performance computing systems can be designed using parallel processing. The effectiveness of these parallel systems rests primarily on the communication network linking processors and memory modules. Hence, an interconnection network that provides the desired connectivity and performance at minimum cost is required for communication in parallel processing systems. Multistage interconnection networks provide a compromise between shared bus and crossbar networks. In this paper, a new class of Irregular, Fault-tolerant multistage interconnection network named as Irregular Augmented Shuffle Network (IASN) has been proposed. The network has less number of stages as compared to existing irregular networks. Various performance parameters have been analyzed which shows better performance of the proposed network than the existing networks. The reliability of a network is evaluated in terms of MTTF. It has been the IASN has a higher MTTF for upper and lower bound in comparison bound in comparison to networks such as ASEN-2 and ABN and is comparable to FT network.
Two pass routing scheme is described for communication in a multiprocessor system employing a unique-path multistage interconnection network in the presence of faults in the network. It is capable of tolerating all single faults and many multiple faults in all except the first and last stages of the network. The routing scheme is useful for tolerating both permanent as well as intermittent faults in the network. The hardware over head for implementing the scheme is very small and no time-penalty is paid in the fault-free case.
Two pass routing scheme is described for communication in a multiprocessor system employing a unique-path multistage interconnection network in the presence of faults in the network. It is capable of tolerating all single faults and many multiple faults in all except the first and last stages of the network. The routing scheme is useful for tolerating both permanent as well as intermittent faults in the network. The hardware over head for implementing the scheme is very small and no time-penalty is paid in the fault-free case.
I would be happy to talk to you if you need my assistance in your research.
You can find me at my office located at Desh Bhagat University, Mandi Gobindgarh, Punjab.
I am at my office every day from 9:00 am to 5:00 pm, but you may consider a call to fix an appointment.