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: | , , , , |
|---|---|
| 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!
|
| _version_ | 1841537570142420992 |
|---|---|
| author | LI Jian-dong TIAN Ye SHENG Min ZHANG Yan YAO Jun-liang |
| author_facet | LI Jian-dong TIAN Ye SHENG Min ZHANG Yan YAO Jun-liang |
| author_sort | LI Jian-dong |
| collection | DOAJ |
| description | 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 necessary and sufficient condition for node i being critical.Based on the theorem,a distributed topology partition detection algorithm（distributed partition detection protocol,DPDP） was presented for large scale networks,which achieves the goal of partition detection efficiently by detecting critical nodes in a local area.Theoretic analysis and experiment results show that DPDP has the advantages of low complexity,high accuracy,low cost as well as good scalability,and is superior to other algorithms. |
| format | Article |
| id | doaj-art-c5354a8d734b40b7be0f685729721d35 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2008-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-c5354a8d734b40b7be0f685729721d352025-01-14T08:30:58ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2008-01-01546174653061Partition detection for large scale ad hoc networksLI Jian-dongTIAN YeSHENG MinZHANG YanYAO Jun-liangAs 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 necessary and sufficient condition for node i being critical.Based on the theorem,a distributed topology partition detection algorithm（distributed partition detection protocol,DPDP） was presented for large scale networks,which achieves the goal of partition detection efficiently by detecting critical nodes in a local area.Theoretic analysis and experiment results show that DPDP has the advantages of low complexity,high accuracy,low cost as well as good scalability,and is superior to other algorithms.http://www.joconline.com.cn/zh/article/74653061/wireless ad hoc networklarge scalepartition detectioncritical node |
| spellingShingle | LI Jian-dong TIAN Ye SHENG Min ZHANG Yan YAO Jun-liang Partition detection for large scale ad hoc networks Tongxin xuebao wireless ad hoc network large scale partition detection critical node |
| title | Partition detection for large scale ad hoc networks |
| title_full | Partition detection for large scale ad hoc networks |
| title_fullStr | Partition detection for large scale ad hoc networks |
| title_full_unstemmed | Partition detection for large scale ad hoc networks |
| title_short | Partition detection for large scale ad hoc networks |
| title_sort | partition detection for large scale ad hoc networks |
| topic | wireless ad hoc network large scale partition detection critical node |
| url | http://www.joconline.com.cn/zh/article/74653061/ |
| work_keys_str_mv | AT lijiandong partitiondetectionforlargescaleadhocnetworks AT tianye partitiondetectionforlargescaleadhocnetworks AT shengmin partitiondetectionforlargescaleadhocnetworks AT zhangyan partitiondetectionforlargescaleadhocnetworks AT yaojunliang partitiondetectionforlargescaleadhocnetworks |