mSCTP Based Decentralized Mobility Framework
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2011, Vol 2, Issue 9
Abstract
To conceive the full potential of wireless IP services, Mobile Nodes (MNs) must be able to roam seamlessly across different networks. Mobile Stream Control Transmission Protocol (mSCTP) is a transport layer solution, which unlike Mobile IP (MIP), provides seamless mobility with minimum delay and negligible packet loss. However, mSCTP fails to locate the current IP address of the mobile node when Correspondent Node (CN) wants to initiate a session. In this paper, we propose DHT Chord to provide the required location management. Chord is a P2P algorithm, which can efficiently provide the IP address of the called MN by using its key-value mapping. The proposed decentralized mobility framework collectively exploits the multihoming feature of mSCTP, and efficient key-value mapping of chord to provide seamless mobility. Suitability of the framework is analyzed by preliminary analysis of chord lookup efficiency, and mSCTP handover procedure using overlay weaver and NS-2. Performance analysis shows that mSCTP multihoming feature and Chord efficient key-value mapping can provide a non-delayed, reliable, and an efficient IP handover solution.
Authors and Affiliations
Waqas A. Imtiaz , M. Afaq , Mohammad A. U. Babar
Keywords
Related Articles
- EP ID EP102973
- DOI -
- Views 75
- Downloads 0
Analysis and Maximizing Energy Harvesting from RF Signals using T-Shaped Microstrip Patch Antenna
The advancement of the modern world requires catering the power crisis. New methodologies for energy harvesting were considered, but their succession in a different environment is still to explore. This paper deals with...
Variability of Acoustic Features of Hypernasality and it’s Assessment
Hypernasality (HP) is observed across voiced phonemes uttered by Cleft-Palate (CP) speakers with defective velopharyngeal (VP) opening. HP assessment using signal processing technique is challenging due to the variabilit...
FRoTeMa: Fast and Robust Template Matching
Template matching is one of the most basic techniques in computer vision, where the algorithm should search for a template image T in an image to analyze I. This paper considers the rotation, scale, brightness and contra...
Detection and Feature Extraction of Collective Activity in Human-Computer Interaction
Time-based online media, such as video, has been growing in importance. Still, there is limited research on information retrieval of time-coded media content. This work elaborates on the idea of extracting feature charac...
Probabilistic Distributed Algorithm for Uniform Election in Triangular Grid Graphs
Probabilistic algorithms are designed to handle problems that do not admit deterministic effective solutions. In the case of the election problem, many algorithms are available and applicable under appropriate assumption...