TITLE

Pre-emptive Dynamic Source Routing: A Repaired Backup Approach and Stability Based DSR with Multiple Routes

AUTHOR(S)
Maity, Susmit; Saha, Soumen; Sahnawaj, Sk.; Saha, Barun Kumar; Bhunia, C. T.
PUB. DATE
June 2008
SOURCE
Journal of Computing & Information Technology;Jun2008, Vol. 16 Issue 2, p91
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
DSR algorithm is applied to selects best path for communication between two nodes in a highly dynamic environment. As highly dynamic environment changes frequently, the probability of breakage of established path is high in such environment. Every time when established path breaks, a new route has to be discovered for communication between the nodes. In order to avoid path discovery every time,we propose the modification of the existing DSR algorithm. The modification proposed is based on a backup route (second best route). The back up routes will be provided by the destination node to the source node along with the best route during the process of path discovery. During the path maintenance process, in case any intermediate node identifies that the signal strength falls below a threshold indicating that the established route is about to break, the intermediate node sends a caution message to the source node. The source node switches the communication through the backup path, apprehending that the established route is about to break. As the communication through the backup route takes place, the previous established route is repaired, if possible. If repaired, the route will act as the new backup route. This process of toggling between backup route and established route reduces the call for path discovery to a large extent. The stability in consideration of failure of common link and nodes in the back up repaired algorithm has been investigated with new algorithm for stable route selection.
ACCESSION #
33116304

 

Related Articles

  • Mathematical Framework for A Novel Database Replication Algorithm. Yadav, Sanjay Kumar; Singh, Gurmit; Yadav, Divakar Singh // International Journal of Modern Education & Computer Science;Oct2013, Vol. 5 Issue 9, p1 

    In this paper, the detailed overview of the database replication is presented. Thereafter, PDDRA (Pre-fetching based dynamic data replication algorithm) algorithm as recently published is detailed. In this algorithm, further, modifications are suggested to minimize the delay in data replication....

  • Regeneration of Replicated Objects: A Technique and Its Eden Implementation. Pu, Calton; Noe, Jerre D.; Proudfoot, Andrew // IEEE Transactions on Software Engineering;Jul88, Vol. 14 Issue 7, p936 

    We have designed and implemented a replicated directory system based on a method called regeneration. The directory system allows selection of arbitrary objects to be replicated, choice of the number of replicas for each object, and placement of the copies on machines with independent failure...

  • Backup Plan.  // Network Dictionary;2007, p57 

    A definition of the term "backup plan" is presented. It refers to a plan for backing up important data, program and other business information according to certain schedule or algorithm.

  • Detection of false alarm in handling of selfish nodes in MANET with congestion control. Shanthi, Ms. I.; Shanthi, D. Sorna // International Journal of Computer Science Issues (IJCSI);Jan2013, Vol. 10 Issue 1, p449 

    In a mobile ad hoc network, the mobile nodes will have the characteristics of mobility and constraints in resources. Since, the mobility is high, the nodes may move randomly and fastly, which lead to network partitioning. The resource constraints leads to a big problem as decrease in performance...

  • A novel dynamic network data replication scheme based on historical access record and proactive deletion. Wang, Zhe; Li, Tao; Xiong, Naixue; Pan, Yi // Journal of Supercomputing;Oct2012, Vol. 62 Issue 1, p227 

    Data replication is becoming a popular technology in many fields such as cloud storage, Data grids and P2P systems. By replicating files to other servers/nodes, we can reduce network traffic and file access time and increase data availability to react natural and man-made disasters. However, it...

  • Relief for remote-office backup blues. Radding, Alan // Storage Magazine;Mar2006, Vol. 5 Issue 1, p10 

    The article addresses several issues with regards to the backing up of remote-office data. One of information technology's (IT) biggest problem is data backup, and with compliance mandates requiring companies to protect their data, it seems unlikely that the issue will be resolved soon. Several...

  • Products of the Year 2010. Burton, Andrew; Castagna, Rich; Erickson, Todd; Lelii, Sonia; Raffo, Dave; Sliwa, Carol; Troy, Sue // Storage Magazine;Feb2011, Vol. 10 Issue 2, p11 

    The article introduces the best new or updated backup storage products in the various categories of this magazine's 2010 Products of the Year competition.

  • Back up your phone. YATES, DARREN // Techlife Australia (Bauer Media Group);Dec2012, Issue 6, p104 

    The article offers tips on how to back up the phone to avoid data loss. It suggests to navigate the phone to "Accounts & sync" then to "Managed Accounts" down to "Back up my data" and "Automatic restore." It notes the option "SMS Backup & Restore" to save text messages. It also recommends the...

  • A dynamic data replication strategy using access-weights in data grids. Chang, Ruay-Shiung; Chang, Hui-Ping // Journal of Supercomputing;Sep2008, Vol. 45 Issue 3, p277 

    Data grids deal with a huge amount of data regularly. It is a fundamental challenge to ensure efficient accesses to such widely distributed data sets. Creating replicas to a suitable site by data replication strategy can increase the system performance. It shortens the data access time and...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics