Multi-Channel networks has been widely implemented and used in wired domain. The use of multi-channel provides increased network performance by efficiently utilizing the available bandwidth. The notion of multi-channels in wireless domain isn't as mature as their wired counterparts are. In past, many protocols have been invented using the concept of multi-channels in wireless domain. In this paper, all these major techniques has been presented, discussed and compared with respect to medium access control (MAC) methods of these techniques and protocols.

Multi-channel medium access control protocols: review and comparison

Intelligent stress calculation and scheduling in segmented processor systems using buddy approach

Multidimensional Scaling and Visualization of Patterns in Prime Numbers

Because of their complex behaviour, simple mathematical and digital hardware representation, one-dimensional (1D) chaotic functions were the earliest choices of cryptologists for applying chaos theory to cryptography. It was discovered later that most of these functions suffer from orbits collapsing into a specific period, especially under finite precision realization and weakness because of their limited number of control parameter(s). This in turn exposed many security issues and was proven to be vulnerable to various types of attacks. This paper addresses the issue of limited number of control parameters by introducing a 1D chaotic function with five control parameters (in addition to the initial condition). Analysis of the function implies its chaotic properties in addition to its ability to generate a cryptographically secured random stream of numbers. To further elaborate on its robustness, a new image encryption algorithm incorporating the function as its random number generator is presented. Various analyses of the new scheme confirm it to be secure with good confusion-diffusion properties.

/pdf/an-image-encryption-scheme-using-a-1d-chaotic-double-section-3rjm6ljz59.pdf

An Image Encryption Scheme Using a 1D Chaotic Double Section Skew Tent Map

Energy Efficient Communication Using Reconfigurable Directional Antenna in MANET

Searching is a prime operation in computer science and numerous methods has been devised to make it efficient. Hashing is one such searching technique with objective of limiting the searching complexity to O (1) i.e. finding the desired item in one attempt. But achieving complexity of O (1) is quite difficult or usually not possible. This happens because there is no perfect mapping function for insertion and searching; and this imperfection of hashing function results in collisions. The algorithm and technique presented in this article minimizes the number of collisions by removing the problem of clustering. Clustering occurs when the data items congregates in one particular area thus increasing the number of collisions and results in increased number of probes to insert and search an item. During trials runs the proposed algorithm have shown considerable improvements over all major hashing algorithms in terms of performance.

A novel prime numbers based hashing technique for minimizing collisions

Novel stress calculation in parallel processor systems using buddy approach with enhanced short term CPU scheduling

Wireless sensor networks are self-organizing networks in which sensor nodes with limited resource are scattered in an area of interest to gather information. WSNs need to have effective node’s energy management methods for stable and seamless communication. Power efficient clustering is done in WSN to prolong the life of the network. In WSN, many algorithms are developed to save energy of sensor nodes and to increase the lifetime of the network. This paper provides an energy efficient clustering algorithm inspired by prophet routing protocol to enhance the cluster based operation of the nodes. Adaptive learning is implemented for head selection for efficientcommunication. Simulation results confirm the efficiency of the mechanism.

/pdf/stochastic-approach-for-energy-efficient-clustering-in-wsn-1hpxx6j95j.pdf

Rohit K. Bhullar

Papers

Intelligent stress calculation and scheduling in segmented processor systems using buddy approach

A novel prime numbers based hashing technique for minimizing collisions

Novel stress calculation in parallel processor systems using buddy approach with enhanced short term CPU scheduling

Stochastic Approach for Energy-Efficient Clustering in WSN