Paramjeet Singh

Enhanced Local Repair AODV (ELRAODV)

AODV is one of the most common reactive protocols used in MANET [1]. This paper proposes enhancement in popular on demand routing protocol AODV [2] by improving its local repair mechanism. Enhanced Local Repair AODV (ELRAODV) makes mobile nodes more aware of the local connectivity by extending original HELLO to NHELLO message in AODV as proposed in [3]. That extra information of the local neighbors allows ELRAODV to repair a route by sending a unicast request instead to broadcast in original AODV. The results show that ELRAODV performs better in terms of routing overhead, end to end delay than classic AODV. The simulation is done through network Simulator-2 (ns2).

Routing and wavelength assignment in WDM optical networks

Routing and wavelength assignment (RWA) is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. In wavelength division multiplexing (WDM) optical networks, there is a need to maximize the number of connections established and to minimize the blocking probability using limited resources. This paper presents efficient RWA strategies, which minimizes the blocking probability. Simulation results show that the performance of the proposed strategies is much better than the existing strategy

Efficient wavelength assignment strategy for wavelength-division multiplexing optical networks

When a physical network and its required connections are given, the routing and wavelength assignment RWA is a problem. A suitable path and wavelength must be selected from among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. In the absence of wave- length conversion, a lightpath must use the same wavelength on all fiber links that it spans. In wavelength-division multiplexing WDM optical net- works, there is a need to maximize the number of connections accepted and to minimize the number of connections rejected, i.e., the blocking probability. We propose a new strategy to assign the wavelength. Then we compare the performance of the proposed strategy with commonly used wavelength assignment strategies in terms of the number of at- tempts required to establish the given connection. The comparison shows that fewer attempts are required for the proposed strategy, lead- ing to a reduced connection establishment time.

Sentimental analysis of social media using R language and Hadoop: Rhadoop

The growth of Technology of World Wide Web has changed the way of expressing peoples views, opinions and Sentiments about others. Mostly they use blogs, Social sites, online discussions etc. This leads to the generation of massive amount of data. Gleaning information from massive storage of data is a big challenge for the companies in these days. This paper leverages the sentimental analysis of Twitter data using R language which is helpful for collecting the sentiments information in the form of either positive score, negative score or somewhere in between them. Then we perform the analysis of tweets data that are having a size of TBs means big data using R language and Rhadoop Connector. Here the problem is related with “performance”?? When we extract the information from petabytes of data we focus on the analysis of big data. This paper shows the performance estimation on two different platforms R language and Rhadoop tool.

Ants Optimization for Minimal Test Case Selection and Prioritization as to Reduce the Cost of Regression Testing

testing is the major process in software development life cycle. Regression testing is very costly and inevitable activity that is to be performed in a restricted environment to ensure the validity of modified software. It is inefficient to re- run every test case from test suite when some kind of modification is done in the software. Test case selection and prioritization techniques select and organize the test cases in a test suite based on some criteria such that the faults are covered quickly with minimum execution time. This task can be done on basis of the Ant Colony Optimization technique (ACO) of Swarm Intelligence as it is not deeply studied yet. The main objective of this thesis is to solve the path problem: Means to find the shortest path and Resolve the time problem: Means to minimize the time of finding shortest path. Because of time and cost constraint, it is not possible to perform extensive regression testing. Techniques such as test case selection and prioritization are used to solve the problem of time and cost constraints. In this paper we are modifying the previous technique to get better results in case of execution time and then the Effectiveness of techniques is checked with the help of APFD metric.

Modified PSO: A Bio-inspired Algorithm for Color and Gray Level Enhancement

The use of modified version of PSO had declared the optimum solutions and act as remedy incase of particle stagnation. Traditional PSO lost its identity due to impact and strength of MPSO. Recent literatures show how modified particle swarm had achieved its name and fame over its parental algorithm called as PSO by optimizing. In this paper we exploit its advantage over image enhancement for improving image contents. This makes handy for visualizing the information from enhanced images. Work deal with use of parameterized transformation and objective function for local/global information and entropy/edge information respectively by modified PSO. Quality of Image is controlled by scaling factor and helps us in situation like gamut. Enhancement is wide study and we had attempted to use MPSO for this field. Results clearly visualize the effect of color image enhancement and gray scale level enhancement.

Detecting and Preventing Attacks in MANET

MANET network is a type of decentralized network and is high vulnerable network which requires secure communication.A significant security issue in manet is to protect the network layer from malicious nodes that misbhaves often to obtain the data that is not broadcasted for them i.e gray hole attacks aka selective forwarding attack that leads to denial of service attack(DoS) .In this paper The overall objective is to find the nodes which frequently misbehaves and based upon their miss ratio they will be eliminated from the network. The proposed strategy does not allow unauthorized nodes to access the data frames multicast by the initiators. The proposed strategy is designed and implemented in MATLAB using mathematics toolbox. The experimental results have shown significant improvement in detecting the malicious nodes. General Terms Attacks in MANET.

Survivability strategy for large and scalable WDM optical networks

The restoration control strategy can be either centralized or distributed. In centralized control, there is a central controller to keep track of the state of the network. It is also responsible for selecting the path for data transmission. Most of the work done in this field is based on centralized control. For large networks, distributed control is preferred over centralized control because of low control overhead. Distributed control strategy requires exchange of control messages among nodes. The distributed control generally results in the possibility of resource reservation conflicts among simultaneous path establishments and poor resource utilization. In this paper, we have proposed one distributed control based strategy that avoids the problem of resource reservation conflicts along with the efficient utilization of resources. The resource utilization is enhanced by using backup multiplexing technique i.e. there can be resource sharing between backup light-paths. The proposed strategy is based on proactive approach i.e. the backup lightpath is established along with primary lightpath to avoid time delay in searching the alternate path for affected traffic after failure to avoid data loss.

Dynamic survivability strategies in WDM optical networks

In this paper, we have given three dynamic restoration strategies which gives better performance than existing strategy. The proposed strategies take into consideration the number of channels required/allocated on the links, the neighborhood information etc. for symmetrical distribution of data on the links to some extent. The simulation results show that the proposed strategies results in better performance in terms of blocking probability as compared to the existing strategy

Reusability-based quality framework for software components

Component based software engineering (CBSE) is a pivotal approach to software development since it helps to give much aspired benefits like reusability, on-time delivery, high quality at low cost to software companies. Therefore, individual software components must be selected with care as these are crucial to the success of the CBSE approach. The selection of a highly reusable and high-quality component is still a herculean task since stakeholders with varying expectations are involved in the software engineering process. This paper presents a reusability based quality model, which is suited to the identification and evaluation of software components. Three major stakeholders are recognized, which are important in the selection of a software component as well as to the development of software. In the proposed model, only those quality properties are incorporated that are preferred by stakeholders and necessary to increase the reuse of software components.