Time-synchronized neighbor nodes based redundant robust routing (TSN2R3) for mobile sensor networks

Wonjong Noh, Kyungsoo Lim, Jihoon Lee, Sunshin An

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

This paper proposes a new on-demand redundant-path routing protocol considering time synchronization based path redundancy as one of route selection criteria. Path redundancy implies how many possible redundant paths may exist on a route to be built up. Our proposal aims to establish a route that contains more redundant paths toward the destination by involving intermediate nodes with relatively mode adjacent nodes in a possible route. Our approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. We have evaluated the performance of our routing scheme through a series of simulations using the Network Simulator 2 (ns-2).

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsHolger Karl, Adam Wolisz, Andreas Willig
PublisherSpringer Verlag
Pages250-262
Number of pages13
ISBN (Print)3540208259, 9783540208259
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2920
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Time-synchronized neighbor nodes based redundant robust routing (TSN<sup>2</sup>R<sup>3</sup>) for mobile sensor networks'. Together they form a unique fingerprint.

Cite this