An efficient technique for IP address auto-configuration for nodes is an important component in the MANET setup. Previously proposed approaches either need a broadcast over complete network and / or need a duplicate a...
详细信息
An efficient technique for IP address auto-configuration for nodes is an important component in the MANET setup. Previously proposed approaches either need a broadcast over complete network and / or need a duplicate address detection mechanism leading to an inefficient latency and overhead in assignment of addresses. In this paper, an Extended Prime Number Address Allocation (EPNA) technique has been proposed that is conflict free and distributed technique. EPNA does not require broadcast and address assignment can be completed with in maximum of four hop communications. In this technique a large number of nodes are empowered to act as proxies to assign the addresses and most of the time it is one-hop communication. Analytical results show that EPNA is capable of auto-configuring any node without much latency and overhead irrespective of address space. The proposed algorithm also gives even IP address distribution and low complexity for small as well large sized MANET.
High speed networks provide realtime variable bit rate service with diversified traffic flow characteristics and quality requirements. The variable bit rate traffic has stringent delay and packet loss requirements. Th...
详细信息
High speed networks provide realtime variable bit rate service with diversified traffic flow characteristics and quality requirements. The variable bit rate traffic has stringent delay and packet loss requirements. The burstiness of the correlated traffic makes dynamic buffer management highly desirable to satisfy the Quality of Service (QoS) requirements. This paper presents an algorithm for optimization of adaptive buffer allocation scheme for traffic based on loss of consecutive packets in data-stream and buffer occupancy level. Buffer is designed to allow the input traffic to be partitioned into different priority classes and based on the input traffic behavior it controls the threshold dynamically. This algorithm allows input packets to enter into buffer if its occupancy level is less than the threshold value for priority of that packet. The threshold is dynamically varied in runtime based on packet loss behavior. The simulation is run for two priority classes of the input traffic - realtime and non-realtime classes. The simulation results show that Adaptive Partial Buffer Sharing (ADPBS) has better performance than Static Partial Buffer Sharing (SPBS) and First In First Out (FIFO) queue under the same traffic conditions.
The contention-based DCF suffers from collision seriously under heavy load conditions. In this paper, a novel medium access control protocol called Contention-Polling Duality Coordination Function (CPDCF) is proposed ...
详细信息
ISBN:
(纸本)9781424443376
The contention-based DCF suffers from collision seriously under heavy load conditions. In this paper, a novel medium access control protocol called Contention-Polling Duality Coordination Function (CPDCF) is proposed to enhance the DCF-based MAC protocol. A polling ACK mechanism is introduced to admit the designated station to transmit without performing any contention process. By eliminating collisions and preventing waste from idle backoff slots, the system capacity is increased effectively. A mathematical model is developed to analyze the saturation throughput of the CPDCF with various CP combinations. The performance in terms of fairness is studied as well. The model accuracy is verified via extensive simulations. Numerical results show that the well-managed CPDCF can achieve a significantly higher system capacity than the legacy DCF does. The proposed CPDCF is quite feasible, effective, and can be easily integrated with the widespread DCF-based devices.
In recent years, with the development of the economy and the advancement of the national income, personal healthcare has been becoming an important issue. Since the health examination can help people understand their ...
详细信息
Abstract Robust performance of a flight control system in the presence of parametric uncertainty and external disturbances is of paramount importance to a manned space flight program. The present research is concerned...
详细信息
In this paper we present a new approach for secure transmission of message by modified version of Playfair cipher combining with random number generator methods. To develop this method of encryption technique, one of ...
详细信息
ISBN:
(纸本)9781424437740
In this paper we present a new approach for secure transmission of message by modified version of Playfair cipher combining with random number generator methods. To develop this method of encryption technique, one of the simplest methods of random number generator methods called linear feedback shift register (LFSR) has been used. Playfair cipher method based on polyalphabetic cipher. It is relatively easy to break because it still leaves much of the structure and a few hundred of letters of ciphertext are sufficient. Here we are mapping random numbers to secret key of Playfair cipher method and corresponding numbers will be transmitted to the recipient instead of alphabetical letter. This method rapidly increases security of the transmission over an unsecured channel.
In this paper, I present a new approach for generating sub-words using the Chebyshev Polynomials in place of traditional S-Box formation in AES algorithm, which is based on using look-up tables. S-Box computation is a...
详细信息
In this paper, I present a new approach for generating sub-words using the Chebyshev Polynomials in place of traditional S-Box formation in AES algorithm, which is based on using look-up tables. S-Box computation is a time-consuming operation in AES algorithm as it is required in every round. So it is desirous to overcome the overhead of S-Box computation using any other computational techniques. It is in my best of knowledge that it is a truly new approach for expanding keys in Passport Protocol.
Negative Correlation Learning (NCL) has been successfully applied to construct neural network ensembles. It encourages the neural networks that compose the ensemble to be different from each other and, at the same tim...
详细信息
VISTA, a dynamic information visualization system, which allows the user to interactively observe potential clusters in a series of continuously changing visualizations, incorporates the algorithmic clustering results...
详细信息
VISTA, a dynamic information visualization system, which allows the user to interactively observe potential clusters in a series of continuously changing visualizations, incorporates the algorithmic clustering results, and serves as an effective validation and refinement tool for irregularly shaped clusters. The validation and visual clustering is performed by tuning the parameter alpha for dominating attributes. Identification of the dominating attributes for visual tuning and visual distance computation process becomes tedious, when the dimensionality of the dataset increases. One common approach to solve this problem is dimensionality reduction. Most of the existing dimensionality reduction techniques are ldquowrapper methodsrdquo, that requires the use of class labels. This paper proposes a novel filter feature selection method for interactive visual clustering based on the outlier score of the features. The experimental results show that the proposed method works well in finding the dominating attributes and eases the visual distance computation process.
Data grid supports a variety of scientific applications that require access to large amount of data with various qualities of service requirements. Ensuring efficient access to such large and widely distributed datase...
详细信息
Data grid supports a variety of scientific applications that require access to large amount of data with various qualities of service requirements. Ensuring efficient access to such large and widely distributed datasets is hindered by high latencies. Effective scheduling in grid can reduce the amount of data transferred among nodes by dispatching a job to node where most of the required data is available. In addition to efficient scheduling, dynamic replication strategies are regarded as one of the major optimization technique for reducing access latency. In this paper, we propose a two-phase dynamic replication strategy coupled with two-stage job scheduling to provide an integrated environment for efficient access to data and job scheduling. Simulation results demonstrate that JS 2 DR 2 improves the data access time in data grids and the gain increases with the increase in work load.
暂无评论