Search

The communication in the quantum networks is based on optical channels to take the advantage of analog, optical and digital communication system. Single data which carries information over the channel can be termed as solid state atoms or photons. The reliable channel is the one which carries the same state from the sending node to destination there can be superposition of states. practically ideal channel does not exist, the optical Gaussian channel which is considered as a degradable quantum channel. The optical interfaces and standard signal format would allow interconnecting fiber optic transmission equipment through multiple networks which carries information generated by multiple users of the network. Taking the infrastructure of existing telecommunication use the quantum information so that it is secure by its nature.

In 2014, 54% of the total global population was urban residents. The prediction was a growth of nearly 2% each year until 2020 leading to more pressure on the transportation system of cities. Cities should be making their streets run smarter instead of just making them bigger or building more roads. This leads to the proposed system which will use a Raspberry pi and Camera for tracking the number of vehicles leading to time-based monitoring of the system.

The realization of IoT boom has motivated scientific community to enhance IoT into a more acceptable modeling of real world. Social Internet of Things (SIoT) is a step in this direction. The concept of SIoT presents social relationship aspect to network of IoT devices. It also represents real-world activities in the form of concrete model. Hence, SIoT may be termed as IoT network with social relationship affiliation. The nature of relationship among various SIoT members determines the interactions that will take place among them. Work done by researchers presents various models upon which social relationship interactions can be based. Among them the concept of trust which is the most appropriate way to quantify the reliability of interactions among members of the SIoT is found. In this paper, different trust management models for SIoT are reviewed. Trust model based on multiplicative attribute graph (MAG) model is considered as the basic concept of this survey. The different trust models are also compared using different metrics.

Asynchronous Transfer Mode has exposed the importance of differentiated-QoS for the various types of services that requires asynchronous mode of transfer. The connections allow the network to guarantee quality of service (QoS) by limiting the number of VC through classification of VCs based on various service classes, connection oriented and connectionless data service. The proposed work presents a multicast QoS provisioning scheme by using network preprocessing technique for finding ideal transmission path. To evaluate the performance of proposed model over state- of-art model, simulation was run considering parameter for slot success ratio and throughput performance considering varied switches and transceiver. Results indicate the significant performance improvement over state-of-art technique.

The increasing healthcare costs and fast growth of the elderly population in the world impose big challenges for remote medical monitoring in an effective way. Wireless Body Sensor Network is a current solution which can monitor physiological parameters of the human body and send vital sign values to the medical server for remote monitoring. The body sensors sense, compute, and communicate physiological signs through wireless media using radio waves. In this process heat is generated in and around human body tissues, reason being electromagnetic energy used by sensor antennas and energy usage by electronic circuits of the sensor node. This affects human tissues and therefore it is important to reduce the heat in designing routing protocols to ensure thermal-safety Quality of Service. In this paper a routing protocol to ensure thermal protection, based on potential based routing policy is proposed and simulation studies show that the protocol performs better in comparison to other existing related protocols.

High speed networks dominate both the wide-area network (WAN) and local area network (LAN). Audio conferencing & video conferencing demand for greater bandwidth, high speed and reliable transfer of data. For this an efficient and flexible multicast capability is required. Existing and available methods does not address all demands. Because of high speed and small cell size, ATM network present difficulties in effectively controlling congestion. A study was conducted on congestion occurrence in ABR traffic. A game theoretical approach called Iterated elimination of strictly dominated action is used to study the congestion in network. A node’s action which is strictly dominated is never best response. A node’s action which is strictly dominating results in congestion. An action profile is rationalizable if and only if it survives iterated elimination of strictly dominated actions.

Cloud Computing has achieved immense popularity due to its unmatched benefits and characteristics. With its increasing popularity and round the clock demand, cloud based data centers often suffer with problems due to over-usage of resources or under-usage of capable servers that ultimately leads to wastage of energy and overall elevated cost of operation. Virtualization plays a key role in providing cost effective solution to service users. But on datacenters, load balancing and scheduling techniques remain inevitable to provide better Quality of Service to the service users and maintenance of energy efficient operations in datacenters. Energy-Aware resource allocation and job scheduling mechanisms in VMs has helped datacenter providers to reduce their cost incurrence through predictive job scheduling and load balancing. But it is quite difficult for any SLA oriented systems to maintain equilibrium between QoS and cost incurrence while considering their legal assurance of quality, as there should not be any violations in their service agreement. This paper presents some state-of-the-art works by various researchers and experts in the arena of cloud computing systems and particularly emphasizes on energy aware resource allocations, job scheduling techniques, load balancing and price prediction methods. Comparisons are made to demonstrate usefulness of the mechanisms in different scenarios.

In this paper, we review the routing models that use both the Generic and Game theoretical methodologies. A very common assumption in the analysis and development of networking algorithms is the full co-operation of the participating nodes. However, the reality may differ considerably. The existence of multiple domains belonging to different authorities or even the selfishness of the nodes themselves could result in a performance that significantly deviates from the expected one. Even though Game theory is known to be extensively used in the field of economics and biology, it is used for the analysis and modeling of protocols in several layers, including routing. This review aims at providing an elucidation of the terminology and principles behind game theory and the most popular Generic and Game theoretic recent routing models.

DoS attacks pose one of the most serious threats to firewalls which are considered as the first line of defence in any network. An attacker may use potential probing technique to discover last matching rules of a firewall rule set and hence trigger low-rate DoS attack that floods the firewall with traffic targeting rules at the bottom of policy. We propose a countermeasure technique in which DoS attack is detected by observing CPU load and ask all clients to solve a computational difficult problem and servicing the clients that provide the result.

A wireless ad hoc network is characterized by a distributed, dynamic, self organizing architecture. one of the problems that cause severe degradation in system performance of ad hoc network is dropping packets by misbehaving nodes. Non-cooperative actions of nodes are usually called selfishness; selfish nodes try to benefit from other nodes but refuse to forward packets of other nodes. using the notion of trust and activity, a strategy driven approach to enforce cooperation among participants of ad hoc networks is proposed in the paper.

The process of disguising a plaintext into ciphertext is called encryption and back into plaintext is called decryption. A cryptographic algorithm, is also called a cipher, is the mathematical function used for encryption and decryption. Many algorithms are available for this purpose. Triple DES is such an algorithm. Encryption using triple DES is possible in two different ways; they are triple DES with two keys and triple DES with three different keys. Cryptanalysis can be used to recover the plaintext of a message from the ciphertext without access to or knowing the key. Exhaustive key search remains the most practical and efficient attack on Triple DES with two keys. The principles of quantum mechanics can be used to build and analyze a quantum computer and its algorithms. Quantum searching is one such algorithm. The key search in Triple DES with two keys is possible using quantum search algorithm, which is more efficient compare to any other methods. In this paper we are presenting how quantum search can be used to crack Triple DES with two keys searching for a key.

Quantum computing is an important field of research that applies concepts of quantum physics to building more efficient computers. Although only rudimentary quantum computers have been built so far, many researchers believe that quantum computing has great potential and the quantum computers can efficiently perform some tasks which are otherwise not feasible on a classical computer, The Hamiltonian cycle problem is to determine whether a given graph has a Hamiltonian cycle or not. This problem belongs to the class of NP-complete problems, widely believed to intractable or hard on classical computers. Design of faster-than-classical quantum algorithms for important algorithmic problems has been an interesting intellectual adventure and achievement all along and their existence keeps being one of the key stimuli to those trying to overcome enormous technology problems to build (powerful) quantum computers. In this paper, we have used undirected graphs with varied number of vertices and we have shown how to determine the existence of a Hamiltonian cycle in a given graph. We have also illustrated how quantum search can be applied to obtain the solution of the Hamiltonian cycle problem much faster than the classical approach.