Partition detection for large scale ad hoc networks
As the failure of a critical node will directly partition a network,a theorem for critical node identification was proved,which indicates that node degree Ni and elementary loop degree Mi of node i are two decisive factors for the exis-tence of a critical node and shows that Ni-Mi≥ 2 is the necessar...
Saved in:
Main Authors: | LI Jian-dong, TIAN Ye, SHENG Min, ZHANG Yan, YAO Jun-liang |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2008-01-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/74653061/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Topology control algorithm backing for network coding in cognitive wireless ad hoc networks
by: Jun LIU, et al.
Published: (2013-05-01) -
Critical nodes selection based on trust evaluation in Ad Hoc networks
by: Zhuo-chao LIU, et al.
Published: (2014-11-01) -
Research on adaptive fast sensing method of large-scale Ad Hoc network states based on four-quadrant classification
by: BAI Jingjing, et al.
Published: (2024-06-01) -
Planar t-spanner for wireless ad hoc network
by: LI Ming, et al.
Published: (2005-01-01) -
DSNAODV: Detecting Selfish Nodes based on Ad hoc On-demand Distance Vector routing protocol
by: Mahboubeh Vanday Baseri, et al.
Published: (2022-11-01)