In this paper, we investigate Network Coding for Video (NCV) which we apply for video streaming over wireless networks. NCV provides a basis for network coding. We use NCV algorithm to increase throughput and video quality. When designing NCV algorithm, we take the deadline as well as the decodability of the video packet at the receiver. In network coding, different flows of video packets are packed into a single packet at intermediate nodes and forwarded to other nodes over wireless networks. There are many problems that occur during transmission on the wireless channel. Network coding plays an important role in dealing with these problems. We observe the benefits of network coding for throughput increase thanks to applying broadcast operations on wireless networks. The aim of this study is to implement NCV algorithm using C programming language which takes the output of the H.264 video codec generating the video packets. In our experiments, we investigated improvements in terms of video quality and throughput at different scenarios.

To enhance the performance of the KASUMI Metamorphic Cipher, we apply a lightweight Metamorphic Structure. The proposed structure uses four lightweight bit-balanced operations in the function Meta-FO of the KASUMI Metamorphic Cipher. These operations are: XOR, INV, XNOR, and NOP for bitwise XOR, invert, XNOR, and no operation respectively building blocks of the Specialized Crypto Logic Unit (SCLU). In this work, we present a lightweight KASUMI Specialized-Metamorphic Cipher. In addition, we provide a Field Programmable Gate Array (FPGA) implementation of the proposed algorithm modification.

Network on chip has emerged as a long-term and effective method in Multiprocessor System-on-Chip communications in order to overcome the bottleneck in bus based communication architectures. Efficiency and performance of network on chip is so dependent on the architecture and structure of the network. In this paper a new structure and architecture for adaptive traffic control in network on chip using Code Division Multiple Access technique is presented. To solve the problem of synchronous access to bus based interconnection the code division multiple access technique was applied. In the presented structure that is based upon mesh topology and simple routing method we attempted to increase the exchanged data bandwidth rate among different cores. Also an attempt has been made to increase the performance by isolating the target address transfer path from data transfer path. The main goal of this paper is presenting a new structure to improve energy consumption, area and maximum frequency in network on chip systems using information coding and decoding techniques. The presented structure is simulated using Xilinx ISE software and the results show effectiveness of this architecture.

Since the last few decades, tremendous innovations and inventions have been observed in every field, but especially in wireless network technology. The prevailing demand curves and trends in this particular area of communication show the importance of real-time multimedia applications over several networks with guaranteed quality of service (QoS). The Next Generation Wireless Network (NGWN) consists of heterogeneous wireless networks that will grant high data rate and bandwidth to mobile users. The primary aim of Next Generation Wireless Network (NGWN) is to conceal heterogeneities and to achieve convergence of diverse networks to provide seamless mobility. So that mobile user can move freely between networks without losing the connection or changing the setting at any moment. When the mobile user moves between different networks, there is a requirement to handover the channel, from one network to another by considering its services, features and user preferences. Channel handover between two different networks is done with the help of vertical handoff (VHO). In a heterogeneous environment, numerous technologies co-exist with their unique characteristics. Therefore, it is very difficult to design efficient handoff decision algorithm. The poorly designed handoff algorithm tends to increase the traffic load and, thereby tend to dramatic decrease in quality of service. A mobile node equipped with multiple network interfaces will be able to access heterogeneous wireless access network. But the availability of alternatives give rise to a problem of unnecessary handoff. To avoid this, we have proposed a decision algorithm based on predictive received signal strength, hysteresis margin and dwell time to select an optimum target network. The handoff policies are designed using received signal strength (RSS), available bandwidth, service cost, user preference, type of application and network condition to reduce the number of handoffs, decision delay, probability of handoff failure and probability of unnecessary handoff. We have also made a comparative analysis of various vertical handoff decision algorithms in this paper.

There are many steganalysis methods, which can estimate length of a message embedded in least significant bits. It may be embedded either in spatial domain or in frequency domain. The well known approaches are Chi – Square test, RS steganalysis and Sample Pair steganalysis. Many commercial steganographic programs are based on LSB method. It is important to ensure undetectablity of a hidden message in a carrier. We present an analysis of steganographic security on data hiding approach using eight queen solutions. In this approach, relationship between message bytes and 8-queen solutions is embedded in the cover. Further, we propose a new approach to adjust the statistical properties of the cover image in such a way that the steganalyst may not be able to detect the presence of hidden message. The proposed approach is tested using steganalysis tool STEGEXPOSE and the experimental results found are within acceptable range.

Researchers have already shown the way, how to improve and compare the existing MANET routing protocols that help us to understand the basic feature and functionality of the various routing protocols. However, while these routing protocols have been proposed from different research groups in the literature, which shows the existing routing protocols, are not consistent to common framework to evaluate its performance. Moreover, these protocols are vulnerable to many collaborative attacks, due to its cooperative nature of routing algorithms. Hence, it is difficult for one to choose a proper routing protocol for a given application; therefore, we initially study and review to compare the different existing routing protocols in adversarial environment with varying traffic and mobility simulation scenarios. This paper addresses the comparison of various reactive routing protocols in adversarial environment. To achieve this, we had investigated with widely used NS-2 simulators for fair comparisons of different routing protocols. Furthermore, we also develop a collaborative adversary model for these existing routing protocols that can interfere with communications to subvert the normal operation of the network. Specifically, Our extensive simulation results shows the relative quantitative analysis for comparing the performance of reactive routing protocols such as AODV, DSR under adversarial environments with varying traffic and mobility simulation scenarios. Moreover, the performance of these protocols is measured with the various metrics such as throughput, end-to-end delay, packet delivery ratio, and routing overhead.

Grid computing incorporates dispersed resources to work out composite technical, industrial, and business troubles. Thus a capable scheduling method is necessary for obtaining the objectives of grid. The disputes of parallel computing are commencing with the computing resources for the number of jobs and intricacy, craving, resource malnourishment, load balancing and efficiency. The risk stumbling upon parallel computing is the enthusiasm to scrutinize different optimization techniques to achieve the tasks without unsafe surroundings. Here Cuckoo Genetic Optimization Algorithm (CGOA) is established that was motivated from cuckoo optimization algorithm (COA) and genetic algorithm (GA) for task scheduling in parallel environment (grid computing system). This CGOA is implemented on parallel dealing out for effective scheduling of multiple tasks with less schedule length and load balance. Here transmission time is evaluated with number of job set. This is computed with the help of job-processor relationship. This technique handles the issues well and the results show that complexity, load balance and resource utilization are finely managed.

Elliptic curves are some specific type of curves known as hyper elliptic curves. Compared to the integer factorization problem(IFP) based systems, using elliptic curve based cryptography will significantly decrease key size of the encryption. Therefore, application of this type of cryptography in systems that need high security and smaller key size has found great attention. Hyperelliptic curves help to make key length shorter. Many investigations are done with regard to improving computations, hardware and software implementation of these curves, their security and resistance against attacks. This paper studies and analyzes researches done about security and efficiency of hyperelliptic curves.