11 research outputs found

    Analysis of Hybrid Buffering and Retransmission in OBS Networks

    Get PDF
    Burst contention is a major problem in the Optical Burst Switching (OBS) networks. Due to inadequate contention resolution techniques, the burst loss is prominent in OBS. In order to resolve contention fiber delay lines, wavelength converters, deflection routing, burst segmentation, and retransmission are used. Each one has its own limitations. In this paper, a new hybrid scheme is proposed which combines buffering and retransmission, which increases the mean number of bursts processed in the system. In this hybrid method, retransmission with controllable arrival and uncontrollable arrival is analyzed. Normally all the bursts reach the first hop and few of them go for second hop to reach destination. After all the bursts reach the destination the server may go for maintenance activity or wait for the arrival of next burst. We model it as a batch arrival single server retrial queue with buffer. Numerical results are analyzed to show the mean number of bursts processed in the system with uncontrollable arrival and controllable arrivals

    Technique to generate a face and palm vein-based fuzzy vault for a multi-biometric cryptosystem

    No full text
    Template security of biometric systems is a vital issue and needs critical focus. The importance lies in the fact that unlike passwords, stolen biometric templates cannot be revoked. Hence, the biometric templates cannot be stored in plain format and needs strong protection against any forgery. In this paper, we present a technique to generate face and palm vein-based fuzzy vault for multi-biometric cryptosystem. Here, initially the input images are pre-processed using various processes to make images fit for further processing. In our proposed method, the features are extracted from the processed face and palm vein images by finding out unique common points. The chaff points are added to the already extracted points to obtain the combined feature vector. The secret key points which are generated based on the user key input (by using proposed method) are added to the combined feature vector to have the fuzzy vault. For decoding, the multi-modal biometric template from palm vein and face image is constructed and is combined with the stored fuzzy vault to generate the final key. Finally, the experimentation is conducted using the palm vein and face database available in the CASIA and JAFFE database. The evaluation metrics employed are FMR (False Match Ratio) and GMR (Genuine Match Ratio). From the metric values obtained for the proposed system, we can infer that the system has performed well

    Efficient Data Gathering and Improving Network Lifetime in Wireless Sensor Networks

    No full text
    Abstract-In large-scale wireless sensor networks the datagathering mechanism to introducing mobility into the network. . We consider the location service in a WSN, where each sensor needs to maintain its location information by 1) frequently updating its location information within its neighboring set of polling points in the network. In the previous work a mobile data collector, for convenience called an M-collector for gathering information from the sensor and send to sink node. Mcollector could be a mobile robot or a vehicle equipped with a powerful transceiver and battery, working like a mobile base station and gathering data while moving through the field. An M-collector starts the data-gathering tour periodically from the static data sink, polls each sensor while traversing its transmission range, then directly collects data from the sensor in single-hop communications, and finally transports the data to the static sink. Since data packets are directly gathered without relays and collisions, the lifetime of sensors is expected to be prolonged. In this paper, we mainly focus on the problem of minimizing the length of each data-gathering tour and remove the redundancy for data gathering. We develop a stochastic sequential decision framework to analyze this problem. Under a Markovian mobility model, the location update decision problem is modeled as a Markov Decision Process (MDP). For the work with strict distance/ time and energy constraints, we consider utilizing single and multiple M-collectors and propose a datagathering algorithm where multiple M-collectors traverse through several shorter subtours concurrently to satisfy the distance/time and energy constraints. To identify the redundancy of data from the sensor using Pearson auto correlated technique. Our proposed system for mobile data gathering scheme can improve the scalability and balance the energy consumption among sensors

    Performance Evaluation of Priority Based OBS Networks with Negative Bursts

    No full text
    In Optical Burst Switching networks there is a need for the promising solution to minimize the burst loss. When a burst enters into the ingress node of the network and finds the server free, burst transmission takes place normally. If the server is busy, the burst would enter into the buffer at the ingress node and the burst retransmission takes place after sometime or the burst leaves the network as impatient burst. This reduces number of bursts being processed in the network. To avoid burst loss, buffering and retransmission techniques are combined. The effect due to the presence of positive bursts and negative bursts and the effect of pre emptive priority on the number of bursts being processed in the network are analyzed
    corecore