Critical nodes identification: A non-cooperative method for unknown topology information in ad hoc networks
The foundation of ad hoc networks lies in the guarantee of continuous connectivity. However, critical nodes, whose failure can easily destroy network connectivity, will influence the ad hoc network connectivity significantly. To protect the network efficiently, critical nodes should be identified ac...
Saved in:
Published in | China communications Vol. 20; no. 7; pp. 217 - 232 |
---|---|
Main Authors | , , , , , , |
Format | Journal Article |
Language | English |
Published |
China Institute of Communications
01.07.2023
State Key Laboratory of Integrated Services Networks,Xidian University,Xi'an,Shaanxi 710071,China Research Institute of Smart Transportation,Xidian University,Xi'an,Shaanxi 710071,China%National University of Defense Technology,Hefei,Anhui 410073,China |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | The foundation of ad hoc networks lies in the guarantee of continuous connectivity. However, critical nodes, whose failure can easily destroy network connectivity, will influence the ad hoc network connectivity significantly. To protect the network efficiently, critical nodes should be identified accurately and rapidly. Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information, this paper develops a critical node identification method to relax the prior topology information condition about critical nodes. Specifically, we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges, and prove the universality of the theorem in a realistic two-dimensional scenario. After that, we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node, the greater degree value of nodes with high probability. Moreover, we develop a novel strategy to improve the accuracy of critical node identification without topology information. Finally, simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks. |
---|---|
AbstractList | The foundation of ad hoc networks lies in the guarantee of continuous connectivity. However, critical nodes, whose failure can easily destroy network connectivity, will influence the ad hoc network connectivity significantly. To protect the network efficiently, critical nodes should be identified accurately and rapidly. Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information, this paper develops a critical node identification method to relax the prior topology information condition about critical nodes. Specifically, we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges, and prove the universality of the theorem in a realistic two-dimensional scenario. After that, we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node, the greater degree value of nodes with high probability. Moreover, we develop a novel strategy to improve the accuracy of critical node identification without topology information. Finally, simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks. The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy net-work connectivity,will influence the ad hoc network connectivity significantly.To protect the network ef-ficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identifica-tion methods for unknown topology that identify criti-cal nodes according to historical information,this pa-per develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realis-tic two-dimensional scenario.After that,we analyze the relationship between communication range and de-gree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation re-sults indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks. |
Author | Li, Wengang Zhang, Yunfeng Zhang, Yao Zuo, Peiang Li, Changle Yue, Wenwei Huang, Jun |
AuthorAffiliation | State Key Laboratory of Integrated Services Networks,Xidian University,Xi'an,Shaanxi 710071,China;Research Institute of Smart Transportation,Xidian University,Xi'an,Shaanxi 710071,China%National University of Defense Technology,Hefei,Anhui 410073,China |
AuthorAffiliation_xml | – name: State Key Laboratory of Integrated Services Networks,Xidian University,Xi'an,Shaanxi 710071,China;Research Institute of Smart Transportation,Xidian University,Xi'an,Shaanxi 710071,China%National University of Defense Technology,Hefei,Anhui 410073,China |
Author_xml | – sequence: 1 givenname: Wenwei surname: Yue fullname: Yue, Wenwei organization: State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, Shaanxi 710071, China; Research Institute of Smart Transportation, Xidian University, Xi'an, Shaanxi 710071, China – sequence: 2 givenname: Peiang surname: Zuo fullname: Zuo, Peiang organization: State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, Shaanxi 710071, China; Research Institute of Smart Transportation, Xidian University, Xi'an, Shaanxi 710071, China – sequence: 3 givenname: Wengang surname: Li fullname: Li, Wengang organization: State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, Shaanxi 710071, China; Research Institute of Smart Transportation, Xidian University, Xi'an, Shaanxi 710071, China – sequence: 4 givenname: Yao surname: Zhang fullname: Zhang, Yao organization: State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, Shaanxi 710071, China; Research Institute of Smart Transportation, Xidian University, Xi'an, Shaanxi 710071, China – sequence: 5 givenname: Yunfeng surname: Zhang fullname: Zhang, Yunfeng organization: State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, Shaanxi 710071, China; Research Institute of Smart Transportation, Xidian University, Xi'an, Shaanxi 710071, China – sequence: 6 givenname: Changle surname: Li fullname: Li, Changle organization: State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, Shaanxi 710071, China; Research Institute of Smart Transportation, Xidian University, Xi'an, Shaanxi 710071, China – sequence: 7 givenname: Jun surname: Huang fullname: Huang, Jun organization: National University of Defense Technology, Hefei, Anhui 410073, China |
BookMark | eNpNkDtPwzAURj0UiVK6MzB4YUzwI7UTtiriqUosMFtOfN26D7tyUkr59bgtA16udfSde6XvCg188IDQDSU54xWt7t_qOmeE8ZyQnHAxQEMqJM8mRSEv0bjrliS9Uggu2BCt6uh61-o19sFAh50B3zubSO-Cf8DTxH3WhrCFmNAX4A30i2CwDRHv_MqHvcd92IZ1mB-w8wlvTmr6Y23wIrTYQ78PcdVdowur1x2M_-YIfT49ftQv2ez9-bWezrKWVUWfaQnAJddNUVJCdally0wpSm5YZUtjSVGBYY0EKo2VtCiahlE-ISAZKwU1fITuznv32lvt52oZdtGni-pn3n8fqyGSUJFy5JxrY-i6CFZto9voeFCUqFOXKnWpjoIiRKUuk3J7VhwA_IuTiSgp5b_PwnT9 |
CODEN | CCHOBE |
CitedBy_id | crossref_primary_10_1007_s11227_024_06103_y |
ContentType | Journal Article |
Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
DBID | 97E RIA RIE AAYXX CITATION 2B. 4A8 92I 93N PSX TCJ |
DOI | 10.23919/JCC.2023.00.036 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005-present IEEE All-Society Periodicals Package (ASPP) 1998-Present IEEE Xplore CrossRef Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Economics |
EndPage | 232 |
ExternalDocumentID | zgtx202307016 10_23919_JCC_2023_00_036 10056811 |
Genre | orig-research |
GroupedDBID | -SI -SJ -S~ 0R~ 29B 2B. 2C0 4.4 5GY 6IK 92H 92I 92R 93N 97E AAHTB AAJGR AASAJ AAXDM ABPEJ ABQJQ ABVLG AENEX AKJIK ALMA_UNASSIGNED_HOLDINGS ATWAV AZLTO BEFXN BFFAM BGNUA BKEBE BPEOZ CAJEI CAJEJ EBS EJD HZ~ IFIPE IPLJI JAVBF M43 O9- OCL RIA RIE RIG RNS TCJ TGT U1G U5S U5T AAYXX CITATION Q-- Q-9 4A8 PSX |
ID | FETCH-LOGICAL-c294t-a7ee373ab48101a8a7c2d8683d29f8df049ed2b7e17df7144bb21350e722861d3 |
IEDL.DBID | RIE |
ISSN | 1673-5447 |
IngestDate | Tue Feb 13 23:37:25 EST 2024 Fri Aug 23 04:05:20 EDT 2024 Wed Jun 26 19:37:53 EDT 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 7 |
Keywords | node location informa-tion critical nodes Ad hoc networks communication range ID generation strategy |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c294t-a7ee373ab48101a8a7c2d8683d29f8df049ed2b7e17df7144bb21350e722861d3 |
PageCount | 16 |
ParticipantIDs | wanfang_journals_zgtx202307016 crossref_primary_10_23919_JCC_2023_00_036 ieee_primary_10056811 |
PublicationCentury | 2000 |
PublicationDate | 2023-07-01 |
PublicationDateYYYYMMDD | 2023-07-01 |
PublicationDate_xml | – month: 07 year: 2023 text: 2023-07-01 day: 01 |
PublicationDecade | 2020 |
PublicationTitle | China communications |
PublicationTitleAbbrev | ChinaComm |
PublicationTitle_FL | China Communications |
PublicationYear | 2023 |
Publisher | China Institute of Communications State Key Laboratory of Integrated Services Networks,Xidian University,Xi'an,Shaanxi 710071,China Research Institute of Smart Transportation,Xidian University,Xi'an,Shaanxi 710071,China%National University of Defense Technology,Hefei,Anhui 410073,China |
Publisher_xml | – name: China Institute of Communications – name: Research Institute of Smart Transportation,Xidian University,Xi'an,Shaanxi 710071,China%National University of Defense Technology,Hefei,Anhui 410073,China – name: State Key Laboratory of Integrated Services Networks,Xidian University,Xi'an,Shaanxi 710071,China |
SSID | ssj0000866362 |
Score | 2.3204699 |
Snippet | The foundation of ad hoc networks lies in the guarantee of continuous connectivity. However, critical nodes, whose failure can easily destroy network... The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy net-work... |
SourceID | wanfang crossref ieee |
SourceType | Aggregation Database Publisher |
StartPage | 217 |
SubjectTerms | Ad hoc networks communication range Complexity theory critical nodes ID generation strategy Internet Network topology node location information Performance analysis Social networking (online) Topology |
Title | Critical nodes identification: A non-cooperative method for unknown topology information in ad hoc networks |
URI | https://ieeexplore.ieee.org/document/10056811 https://d.wanfangdata.com.cn/periodical/zgtx202307016 |
Volume | 20 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LSwMxEA7qRS--xfooOXjxsGv2lWy8lWIpBXuy0Nuy2cxWKeyK3QXtr3eSbFUEwVsICYR8ecwkM99HyE2Kq4Sj3-AlUqODwnnhydhoaDClAikUcJso_Djl41k8mSfzLlnd5sIAgA0-A98U7V--rovWPJXhDmeGLwudnW0hpUvW-npQQducR1ZANODCfPjHwn1LhpEM5N1kOPSNVLjPmM8sIfP3NWR1VWzWTlXm1eLHBTM6INPN0FxcydJvG-UX61-sjf8e-yHZ70xNOnBr44hsQXVMdjeZyKsTstzoHNCq1rCiL7oLHbJo3dMB1ldeUdev4PjBqdObpmjo0rYyz3EVbZzKwgftKFhNVyzTXNPnuqCVCzNfnZLZ6OFpOPY68QWvCGXceLkAiESUq9hQgOVpLopQpzyNdCjLVJfoWYAOlYBA6FKgW6ZUGEQJAxGGKQ90dEZ2cJBwTigveSKAFxxiFedMoYuFp0iSSoG7XyWqR243WGSvjmMjQ9_E4pYhbpnBLWMsQ9x65NTM7Y92blp7pN-hl3WbcJWtF8276YqnWsAv_uh4SfZMGxeBe0V2mrcWrtHOaFTfrq9PiULOEg |
link.rule.ids | 315,783,787,799,27938,27939,55088 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LSwMxEA6ih3rxLdZnDl487Jp9JbveSlFqrT0peAubzaxKYbfYLWh_vZNkqyII3kJIIOTLYyaZ-T5CzlNcJRz9Bi_JNDoonBdeFhsNDaZUkAkF3CYK34_54DEePiVPbbK6zYUBABt8Br4p2r98XRdz81SGO5wZvix0dtYSY1i4dK2vJxW0znlkJUQDLsyXfyzcx2QYZUF2Oez3fSMW7jPmM0vJ_H0RWWUVm7dTlXn1_OOKudkk4-XgXGTJxJ83yi8Wv3gb_z36LbLRGpu051bHNlmBaod0lrnIs10yWSod0KrWMKOvug0esnhd0R7WV15R11NwDOHUKU5TNHXpvDIPchVtnM7CB21JWE1XLNNc05e6oJULNJ_tkceb64f-wGvlF7wizOLGywVAJKJcxYYELE9zUYQ65Wmkw6xMdYm-BehQCQiELgU6ZkqFQZQwEGGY8kBH-2QVBwkHhPKSJwJ4wSFWcc4UOll4jiRpJnD_q0R1ycUSCzl1LBsSvROLm0TcpMFNMiYRty7ZM3P7o52b1i45bdGT7TacycVz82664rkW8MM_Op6RzuDhfiRHt-O7I7Ju2rt43GOy2rzN4QStjkad2rX2CX3u0V8 |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Critical+Nodes+Identification%3AA+Non-Cooperative+Method+for+Unknown+Topology+Information+in+Ad+Hoc+Networks&rft.jtitle=%E4%B8%AD%E5%9B%BD%E9%80%9A%E4%BF%A1%EF%BC%88%E8%8B%B1%E6%96%87%E7%89%88%EF%BC%89&rft.au=Wenwei+Yue&rft.au=Peiang+Zuo&rft.au=Wengang+Li&rft.au=Yao+Zhang&rft.date=2023-07-01&rft.pub=State+Key+Laboratory+of+Integrated+Services+Networks%2CXidian+University%2CXi%27an%2CShaanxi+710071%2CChina&rft.issn=1673-5447&rft.volume=20&rft.issue=7&rft.spage=217&rft.epage=232&rft_id=info:doi/10.23919%2FJCC.2023.00.036&rft.externalDocID=zgtx202307016 |
thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fzgtx%2Fzgtx.jpg |