Effectiveness of enhanced tight finite scheme in quantum key distribution protocol for network communication

Classical cryptography is mainly about the challenge to compute the secret key using current computing system. We tend to hide our information from being stealing by others. In order to do so, in this research paper we are proposing a method that use the law of physics in communication in terms of cryptography and key distribution by applying quantum theorems and principle. Using BB84 protocol as a base in quantum key distribution together with the implementation of tight finite key that compress the Shannon entropy and Von Neumann theory. Our multiparty system would be a new area of authentication. Throughout this paper, we are going to prove that our method will give a small error rate between the initial key rates with the final key rate then will impact the attack resilient. Yet the key cannot be formed and transferred simply

Comparative analysis of AODV, DSDV and GPSR routing protocols in MANET scenarios of real urban area

The widespread deployment of MANET networks that employ IEEE 802.11 as the underlying technology has attracted a great deal of research attention in both academia and industry. This has led to many new protocols specifically designed for MANET. Ad-hoc routing protocols are given most of the attention as they are the responsible of creating and maintaining the links between nodes in this network. These protocols might differ depending on the application and network architecture. Moreover, different protocols provide different performance depending on their ability to face network challenging, such as density of nodes, mobility speeds and number of connections. The main aim of this paper is to study the performance of different routing protocols in MANET with different network parameters. For this purpose, a thorough literature study is performed to identify the issues affecting the routing protocols performance and present a classification for the various approaches pursued. Then, a comparative analysis study has been conducted by simulating different routing protocols, taking into consideration different challenges and network parameters. On the basis of achieved results from the comparative study, recommendations are made for better selection of protocol regarding to application nature in the presence of considered challenges. As corroborated by intensive simulation experiments, reducing the overhead caused by sending routing messages is vital for good performance

Evaluation Study for Delay and Link Utilization with the New-Additive Increase Multiplicative Decrease Congestion Avoidance and Control Algorithm

As the Internet becomes increasingly heterogeneous, the issue of congestion avoidance and control becomes ever more important. And the queue length, end-to-end delays and link utilization is some of the important things in term of congestion avoidance and control mechanisms. In this work we continue to study the performances of the New-AIMD (Additive Increase Multiplicative Decrease) mechanism as one of the core protocols for TCP congestion avoidance and control algorithm, we want to evaluate the effect of using the AIMD algorithm after developing it to find a new approach, as we called it the New-AIMD algorithm to measure the Queue length, delay and bottleneck link utilization, and use the NCTUns simulator to get the results after make the modification for the mechanism. And we will use the Droptail mechanism as the active queue management mechanism (AQM) in the bottleneck router. After implementation of our new approach with different number of flows, we expect the delay will less when we measure the delay dependent on the throughput for all the system, and also we expect to get end-to-end delay less. And we will measure the second type of delay a (queuing delay), as we shown in the figure 1 bellow. Also we will measure the bottleneck link utilization, and we expect to get high utilization for bottleneck link with using this mechanism, and avoid the collisions in the link

A discrete event simulation for utility accrual scheduling in uniprocessor environment

This research has focused on the proposed and the development of an event based discrete event simulator for the existing General Utility Scheduling (GUS) to facilitate the reuse of the algorithm under a common simulation environment. GUS is one of the existing TUF/UA scheduling algorithms that consider the Time/Utility Function (TUF) of the executed tasks in its scheduling decision in a uniprocessor environment. The scheduling optimality criteria are based on maximizing accrued utility accumulated from execution of all tasks in the system. These criteria are named as Utility Accrual (UA). The TUF/ UA scheduling algorithms are design for adaptive real time system environment. The developed GUS simulator has derived the set of parameter, events, performance metrics and other unique TUF/UA scheduling element according to a detailed analysis of the base model

Improving utility accrual scheduling algorithm for adaptive real-time system

In this paper, we proposed a preemptive utility accrual scheduling (or PUAS) algorithm to further extend the functionalities of General Utility Scheduling (or GUS) algorithm proposed by Peng Li [1]. Both of these algorithms are developed for adaptive real-time system environment where untoward effects such as deadline misses and overloads are tolerable. The proposed algorithm focused on an independent task model, which works on deadline constraints that are specified by using step time/utility functions (or TUFs). The proposed algorithm improves the GUS algorithm by preempting the tasks that GUS abort due to its lower PUD, lowering abortion ratio which in turn increase accrued utility. This met the scheduling objective of maximizing utility, which are achieved thru completion of all tasks. Results from our simulations showed that the proposed algorithm PUAS achieved higher utility and lower abortion ration compared to GUS algorithm. This in effect, produced a much lower average response time, making PUAS more efficient in time-critical application domain

The delay with new-additive increase multiplicative decrease congestion avoidance and control algorithm.

As the Internet becomes increasingly heterogeneous, the issue of congestion control becomes ever more important. And the queue length and end-to-end (congestion) delays are some of the important things in term of congestion avoidance and control mechanisms. In this research we continued to study the performances of the New-Additive Increase Multiplicative Decrease (AIMD) algorithm as one of the core protocols for TCP congestion avoidance and control mechanism, we want now to evaluate the effect of using the New-AIMD algorithm to measure the queue length and end-to-end delays and we will use the NCTUns simulator to get the results after make the modification of the mechanism. And we will use the Drop tail mechanism as Active Queue Management (AQM) in the bottleneck router. After implementation of our new approach with different number of flows, we will measure the delay for two types of delays (queuing delay and end-to-end delay), we expect the delay will be less with using our mechanism comparing with the mechanism in the previous study. Now and after got this results as low delay for bottleneck link case, we know the New-AIMD mechanism work as well under the network condition in the experiments

An adaptive reliable multicast protocol in ad hoc networks

Multicasting is an essential service for ad-hoc wireless networks. In multicast communication, many reliable multicast schemes were studied in order to overcome packet losses in the network. This paper describes our effort to build a Source Tree Reliable Multicast protocol for ad-hoc networks (STRM). STRM provides the delivery of an ordered contiguous sequence of data packets from one sender to many receivers in an ad-hoc network. It is designed to support applications based on bulk data transfer, like files, images and software packages. The core to its support of node mobility, and also what makes the protocol unique, is the dynamic selection of a sub set of 1-hop neighbors from the sender as its Forward Servers (FSs). The key idea behind selecting this sub set 1-hop neighbors is to forward the retransmit lost data packets that needed by some receivers to achieve higher throughput and to receive the ACK packet from receivers to avoid the ACK-implosion problem inherent in any reliable multicast scheme. Finally, simulation results show that the protocol has high delivery ratio and low end-to-end delay comparing with ReMHoc protocol

QuCCs: an experimental of quantum key distribution using quantum cryptography and communication simulator

The applications of quantum information science move towards bigger and better dimensions for the next generation technology. In the field of quantum cryptography and quantum computation, the world already witnessed various groundbreaking tangible products and promising results. Quantum cryptography is one of the mature fields of quantum mechanics and the devices are already available in the markets. In order to reach the heights of digital cryptography, the current state of quantum cryptography is still under various researches. However, the complexity of quantum cryptography is high due to combination of hardware and software. The lack of effective simulation tool to design and analyze the quantum cryptography experiments delays the reaching distance of the success. Therefore, in this paper, a framework to achieve an effective single photon based quantum cryptography simulation tool is proposed. The limitations of a commercial photonic simulation tool based experiments are also highlighted. Finally, the ideas for achieving one-stop simulation package for quantum based secure key distribution experiments are discussed. The proposed modules of simulation framework have been analyzed from the programming perspective

Co-channel interference mitigation techniques in multi-cell OFDMA Relay-Based Cellular Networks: a survey

Orthogonal Frequency Division Multiplexing Access (OFDMA) technology along with cooperative relay networks are generally described as an appropriate applicant for developed cellular networks because of the improvements to system performance through flexible resource allocation schemes. In these networks interference-aware resource allocation or interference coordination, represents an important role in raising resource utilization as well as enhancing cell throughput. This paper focuses on existing co-channel interference mitigation methods in multi-cell OFDMA Relay Based Cellular Networks (RBCNs). It aims to utilize the advantages of relay stations while reducing the negative effects of introduced interference. This research first presents the general system model scenarios of interference in RBCNs and provides an overview of the problem. It then compares the potential interference scenarios in these systems. Our study examines the techniques based on the frequency reuse factor they use and shows that even by maintaining the frequency reuse at one; we can maximize the system throughput