A study of Adaptive Replication Technique in routing time-constrained messages (VoIP) in MANET
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 6
Abstract
Imposing the constraint of timely delivery on usual messages is referred as time-constrained messages. The utility of such messages depends upon the time at which they arrive at their destination. Due to contention among randomly arriving messages at each node/link and multi-hops between the source and destination that a message must travel, it is difficult to guarantee the timely delivery of such messages. In case of faulty links or node, it is likely impossible for messages to reach at required destination in time. To handle such type of faults, the idea of sending multiple copies or replicated copies is used. The probability of successful message delivery within time will be increased through sending multiple copies through disjoint routes, as at least one copy will be reached within time. But this will degrade the network performance due to congestion and other problems. Therefore, it is require sending only optimum number of copies through disjoint routes. Such copies are estimated on the basis of network load and message deadline. In this paper, we present the method to estimate the optimum number of copies. The system is designed for developing replication strategy named as Adaptive Fault Tolerance Replication Technique (AFTRT) for VoIP applications used for Mobile Ad hoc Network. The parameters such as end-to-end latency, node delivery index and message delivery probability are determine by the destination and send as feedback to the source. Based on this information, source replicates the message. The performance study is conducted through simulation using NS2 simulator.
Authors and Affiliations
SWATI SAXENA , Dr. MADHAVI SINHA
Keywords
Related Articles
- EP ID EP155408
- DOI -
- Views 74
- Downloads 0
MRI Brain Abnormalities Segmentation using K-Nearest Neighbors (k-NN)
Segmentation of medical imagery remains as a challenging task due to complexity of medical images. This study proposes a method of k-Nearest Neighbor (k-NN) in abnormalities segmentation of Magnetic Resonance Imaging (MR...
A Novel Density based improved k-means Clustering Algorithm – Dbkmeans
Abstract: Mining knowledge from large amounts of spatial data is known as spatial data mining. It becomes a highly demanding field because huge amounts of spatial data have been collected in various applications ranging...
A Study on Similarity Computations in Template Matching Technique for Identity Verification
This paper describes a study on the development of a human face verification system by merely using template matching (TM) as the main verification engine. In contrast to common face recognition techniques, our approach...
Capacity Estimation of Multi-Service Cellular Network Dimensioning and Planification Network
Planning and dimensioning process of a multi-service network WCDMA should consider the whole parameters characterising the radio cell. Among these, we are interested in the required total BTS power and maximum capacity s...
A Novel Biometric system for Person Recognition Using Palm vein Images
The palm vein is one of the most reliable physiological characteristics that can be used to distinguish between individuals. In recent years, it receives more attention from the researchers. In this paper, we present a n...