Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/14999
Nаziv: | Toward scalable cut vertex and link detection with applications in wireless ad hoc networks | Аutоri: | Stojmenović, Ivan Simplot-Ryl D. Nayak A. |
Dаtum izdаvаnjа: | 1-јан-2011 | Čаsоpis: | IEEE Network | Sažetak: | Ad hoc networks are expected to have some critical connectivity properties before partitioning. Timely partition prediction signals action for improving fault tolerance and performing some data or service replication so that the network can continue functioning after partition does occur. This article surveys existing prediction concepts and discusses their scalability, simplicity, correctness, speed, communication overhead, and applications. Existing centralized algorithms declare an edge or a node as critical if its removal will separate the network into several components. Several localized definitions of critical (or cut) nodes and links, and removable nodes, are demonstrated to be simple, useful, and scalable. A node is critical if the subgraph of p-hop neighbors of node (without the node itself) is disconnected. A link is critical if its endpoints have no common p-hop neighbors (assuming that the link between them does not exist). Definitions are extended toward local k-connectivity. The false positives mostly occur when alternative routes exist but are relatively long, and therefore may not provide satisfactory service in applications. Therefore, localized protocols provide faster and often more reliable partition warnings for possible timely replication decisions. This conceptual advance provides ingredients for establishing and restoring biconnectivity. © 2011 IEEE. | URI: | https://open.uns.ac.rs/handle/123456789/14999 | ISSN: | 08908044 | DOI: | 10.1109/MNET.2011.5687952 |
Nаlаzi sе u kоlеkciјаmа: | Naučne i umetničke publikacije |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
30
prоvеrеnо 10.05.2024.
Prеglеd/i stаnicа
12
Prоtеklа nеdеljа
7
7
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.