In this paper, we present a Quality of Experience (QoE) based upon the analyze the key Quality of Service (QoS) parameters such as delay, jitter, throughput, packet loss, packet inspection in the mesh networks which executing the better approach for reconfiguration wireless mesh networks in the routing protocol. In this system evaluates the actual QoE level for each mesh node taking into an account to calculate QoS parameters and then this response as reducing the node broadcasting rate and investigating the problems of selecting in which links would be established that all nodes are connected for cost of constructions are minimized.

The current research work in wireless sensor networks has mostly focused on the resolving issues related to power consumption and computational resource constraints in the wireless sensor networks .To achieve the same various specific routing schemes ,MAC and cross layered protocols and techniques have been proposed and designed .But with recent advances the privacy issues related to the data collected and transmitted by the wireless sensor networks had taken the center stage .Privacy preservation in wireless sensor networks has become more challenging because of the wireless nature of communication in WSN as well as its self organizing architecture. The present paper provides a comparative review of various privacy preserving mechanisms proposed and implemented in wireless sensor networks with respect to the privacy notions of k-anonymity and L-diversity. Along with the discussion and analysis the present work is an effort for the pavement of a way towards the future research in the field of privacy preservation in WSN.

The web is taking recently a large percentage of software products. The evolving nature of web applications put a serious challenge on testing, if we consider the dynamic nature of the current web. More precisely, testing both blocked contents and AJAX interfaces, might create new challenges in terms of test coverage and completeness. In this paper, we proposed enhancements and extensions of the current test automation activities. In the proposed framework, user interaction with AJAX interfaces is used to collect DOM violation states. A blocked content is accessed through multiple forms' submission with dynamic contents, and in each iteration the vulnerability events databases are modified. Next, the test cases database of possible vulnerable inputs for both AJAX and blocked contents is built. Finally, Coverage assessment is evaluated after executing those test cases based on several possible coverage aspects.

The traditional notion of a Adhoc wireless network is one in which there are a few Base Stations or Access Points and a number of Mobile Stations or Nodes. Security has become a primary concern in order to provide protected communication between mobile nodes in a hostile environment. The Adhoc networks pose a number of nontrivial challenges to security design, such as open peer-to-peer network architecture, shared wireless medium and network topology. These challenges clearly make a case for building multifence security solutions that achieve both road protection and desirable network performance. The general security objectives like authentication, confidentiality, integrity, availability and non-repudiation, the ad hoc routing protocols should also address location confidentiality, cooperation fairness and absence of traffic diversion. In this paper we attempt to analyze Challenges, Overview of Security, attacks, threats faced by the Adhoc network environment and provide a classification of the various security mechanisms.

The novel concept of grid computing, clusters of computational power is constructed from a network of many small and widespread different computers servers or workstations into a single resource. We now proceed to translate the grid security problem into specific grid security requirements. The purpose of Grid technologies is to support the secure sharing and scalable coordinated use of diverse resources in dynamic, distributed VOs. We propose a secure blueprint design for grid systems that addresses requirements for single sign-on, interoperability with local policies of any grid city of India, with dynamically varying resource demands.

Quantum cryptography, exclusively known as Quantum key distribution (QKD), has attracted a lot of attention in the recent years with the discovery that it can provide absolute secrecy for communications. We report a new architecture for constructing a fiber-based network of quantum key distribution using optical wavelength division multiplexing in the fiber, and also using some wavelength protocols. The advantages are discussed in detail for demonstrating the experimental report in the way of feasibility for the proposed architecture.

Mobile ad hoc network is infrastructure less type of network. In this paper we present the prevention mechanism for black hole in mobile ad hoc network. The routing algorithms are analyzed and discrete properties of routing protocols are defined. The discrete properties support in distributed routing efficiently. The protocol is distributed and not dependent upon the centralized controlling node. Important features of Ad hoc on demand vector routing (AODV) are inherited and new mechanism is combined with it to get the multipath routing protocol for Mobile ad hoc network (MANET) to prevent the black hole attack. When the routing path is discovered and entered into the routing table, the next step is taken by combined protocol to search the new path with certain time interval. The old entered path is refreshed into the routing table. The simulation is taken on 50 moving nodes in the area of 1000 x 1000 square meter and the maximum speed of nodes are 5m/sec. The result is calculated for throughput verses number of black hole nodes with pause time of 0 sec. to 40 sec., 120 sec. and 160 sec. when the threshold value is 1.0.

The rapid growth of wireless communication and its persistent use influences all walks of life. Mobile WiMAX IEEE 802.16e standard enabled convergence of mobile and fixed broadband networks through a common wide-area radio-access technology and flexible network architecture. It aims to provide seamless support to its users but an inevitable is that the long delay which occurs during the handoff management in every network process. This paper proposes a Dynamic Interval based Processing Algorithm to separate ping-pong users from the pool of users and to process them separately thus reducing the overhead of network re-entry process. Incoming users are divided into three categories like new user, old user and ping pong user. New user should undergo all the phases of network entry process, old user is provided with authentication key which leads to skipping of steps in generation of keys. Proposed algorithm deals with identifying the ping pong users by calculating the inter arrival duration and rate with same base station. When assured authenticated ping-pong users enter the network next time within the allotted time they will be provided with last used Traffic Encryption Key (TEK) thus bypassing key generation phase . It is observed that the proposed work performs the authentication phase and cancels the key generation phase which leads to minimum network entry delay and it saves to the maximum of 80% processing time. The network model was developed using Network Simulator and the algorithm was implemented in MATLAB GUIDE which gets connected to the database developed in MYSQL.This approach is justified through its timing analysis result which proves the efficient swift in the handoff processes.