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

Wonjong Noh; Kyungsoo Lim; Jihoon Lee; Sunshin An

doi:10.1007/978-3-540-24606-0_17

Time-synchronized neighbor nodes based redundant robust routing (TSN²R³) for mobile sensor networks

Wonjong Noh, Kyungsoo Lim, Jihoon Lee, Sunshin An

* Honorary professors

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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 language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Holger Karl, Adam Wolisz, Andreas Willig
Publisher	Springer Verlag
Pages	250-262
Number of pages	13
ISBN (Print)	3540208259, 9783540208259
DOIs	https://doi.org/10.1007/978-3-540-24606-0_17
Publication status	Published - 2004

Publication series

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

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-24606-0_17

Cite this

Noh, W., Lim, K., Lee, J., & An, S. (2004). Time-synchronized neighbor nodes based redundant robust routing (TSN²R³) for mobile sensor networks. In H. Karl, A. Wolisz, & A. Willig (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 250-262). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2920). Springer Verlag. https://doi.org/10.1007/978-3-540-24606-0_17

Time-synchronized neighbor nodes based redundant robust routing (TSN²R³) for mobile sensor networks. / Noh, Wonjong; Lim, Kyungsoo; Lee, Jihoon et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Holger Karl; Adam Wolisz; Andreas Willig. Springer Verlag, 2004. p. 250-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2920).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Noh, W, Lim, K, Lee, J & An, S 2004, Time-synchronized neighbor nodes based redundant robust routing (TSN²R³) for mobile sensor networks. in H Karl, A Wolisz & A Willig (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2920, Springer Verlag, pp. 250-262. https://doi.org/10.1007/978-3-540-24606-0_17

Noh W, Lim K, Lee J, An S. Time-synchronized neighbor nodes based redundant robust routing (TSN²R³) for mobile sensor networks. In Karl H, Wolisz A, Willig A, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 250-262. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-24606-0_17

Noh, Wonjong ; Lim, Kyungsoo ; Lee, Jihoon et al. / Time-synchronized neighbor nodes based redundant robust routing (TSN²R³) for mobile sensor networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Holger Karl ; Adam Wolisz ; Andreas Willig. Springer Verlag, 2004. pp. 250-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{103c39e91eab4b28ae32342eba4bccc7,

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

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).",

author = "Wonjong Noh and Kyungsoo Lim and Jihoon Lee and Sunshin An",

year = "2004",

doi = "10.1007/978-3-540-24606-0_17",

language = "English",

isbn = "3540208259",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "250--262",

editor = "Holger Karl and Adam Wolisz and Andreas Willig",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - CHAP

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

AU - Noh, Wonjong

AU - Lim, Kyungsoo

AU - Lee, Jihoon

AU - An, Sunshin

PY - 2004

Y1 - 2004

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=35048823284&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048823284&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-24606-0_17

DO - 10.1007/978-3-540-24606-0_17

M3 - Chapter

AN - SCOPUS:35048823284

SN - 3540208259

SN - 9783540208259

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 250

EP - 262

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Karl, Holger

A2 - Wolisz, Adam

A2 - Willig, Andreas

PB - Springer Verlag

ER -