随机虚拟骨干树结合改进BDCP的无线传感器网络多级路由算法
针对无线传感器网络（WSN）中传统路由算法簇首能量消耗不平衡而限制网络寿命的问题，提出了一种基于随机虚拟骨干树（RVBT）结合改进退避分布式聚类协议（IBDCP）的能量感知路由算法。首先，将所有传感器节点组成不同的簇；然后，利用IBDCP为每个节点初始化时间延迟，并开始竞争；最后，节点通过考虑自己的剩余能量和距离决定是否加入CH，汇聚节点构建CH的随机虚拟骨干树，以促进数据的路由。仿真结果表明，该算法能够实现恒定消息和线性时间复杂度，在网络寿命、能量消耗和其他参数方面均优于其他现有的算法，其中网络寿命比EMRA延长至少15％，比退避分布式聚类（BDCP）延长至少150％。...
Saved in:
| Published in | 计算机应用研究 Vol. 33; no. 8; pp. 2454 - 2457 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
内蒙古商贸职业学院,呼和浩特,010070%内蒙古大学 计算机学院,呼和浩特,010021
2016
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2016.08.047 |
Cover
| Abstract | 针对无线传感器网络（WSN）中传统路由算法簇首能量消耗不平衡而限制网络寿命的问题，提出了一种基于随机虚拟骨干树（RVBT）结合改进退避分布式聚类协议（IBDCP）的能量感知路由算法。首先，将所有传感器节点组成不同的簇；然后，利用IBDCP为每个节点初始化时间延迟，并开始竞争；最后，节点通过考虑自己的剩余能量和距离决定是否加入CH，汇聚节点构建CH的随机虚拟骨干树，以促进数据的路由。仿真结果表明，该算法能够实现恒定消息和线性时间复杂度，在网络寿命、能量消耗和其他参数方面均优于其他现有的算法，其中网络寿命比EMRA延长至少15％，比退避分布式聚类（BDCP）延长至少150％。 |
|---|---|
| AbstractList | TN915.04; 针对无线传感器网络（WSN）中传统路由算法簇首能量消耗不平衡而限制网络寿命的问题，提出了一种基于随机虚拟骨干树（RVBT）结合改进退避分布式聚类协议（IBDCP）的能量感知路由算法。首先，将所有传感器节点组成不同的簇；然后，利用 IBDCP 为每个节点初始化时间延迟，并开始竞争；最后，节点通过考虑自己的剩余能量和距离决定是否加入 CH，汇聚节点构建 CH 的随机虚拟骨干树，以促进数据的路由。仿真结果表明，该算法能够实现恒定消息和线性时间复杂度，在网络寿命、能量消耗和其他参数方面均优于其他现有的算法，其中网络寿命比 EMRA 延长至少15％，比退避分布式聚类（BDCP）延长至少150％。 针对无线传感器网络（WSN）中传统路由算法簇首能量消耗不平衡而限制网络寿命的问题，提出了一种基于随机虚拟骨干树（RVBT）结合改进退避分布式聚类协议（IBDCP）的能量感知路由算法。首先，将所有传感器节点组成不同的簇；然后，利用IBDCP为每个节点初始化时间延迟，并开始竞争；最后，节点通过考虑自己的剩余能量和距离决定是否加入CH，汇聚节点构建CH的随机虚拟骨干树，以促进数据的路由。仿真结果表明，该算法能够实现恒定消息和线性时间复杂度，在网络寿命、能量消耗和其他参数方面均优于其他现有的算法，其中网络寿命比EMRA延长至少15％，比退避分布式聚类（BDCP）延长至少150％。 |
| Abstract_FL | Aiming at the problems of cluster unbalanced energy consumption limiting the network lifetime in traditional routing algorithm of wireless sensor networks (WSN),this paper proposed a new energy-aware routing algorithm based on improved backoff distributed clustering protocol (IBDCP)and random virtual backbone trees (RVBT).Firstly,it organized the sensor nodes into different clusters.Then,used IBDCP to initialize time delay for each node to competition.Finally,in order to form a cluster,the nodes were considered their residual energy and distance to decide whether to join CH,and built random virtual backbone trees in the sink to facilitate the routing of data.It proves that the algorithm can achieve constant news and linear time complexity,and experimental results show that this algorithm is superior to other existing in aspects of the network life-time,energy consumption and other parameters.And the network lifetime is extended at least 15% than EMRA’s and at least 150% more than the BDCP’s. |
| Author | 冯建平 李华 |
| AuthorAffiliation | 内蒙古商贸职业学院,呼和浩特010070 内蒙古大学计算机学院,呼和浩特010021 |
| AuthorAffiliation_xml | – name: 内蒙古商贸职业学院,呼和浩特,010070%内蒙古大学 计算机学院,呼和浩特,010021 |
| Author_FL | Feng Jianping Li Hua |
| Author_FL_xml | – sequence: 1 fullname: Feng Jianping – sequence: 2 fullname: Li Hua |
| Author_xml | – sequence: 1 fullname: 冯建平 李华 |
| BookMark | eNo9kE9LAkEYxudgkFpfIjp02e2dnXV29lj2FwQ7eJdx2jGXWsslYu8egg4VGeIm6CFIOhTVIbTCL9Pu6Ldow-j0PDz8eF7eJ4NSXt1zEFrGoBOb2quuXvN9T8cAWCPUzukGYKoD08G0Uij9n8-jjO-7AKaBbUij4jS8jLujSSeML3rTx0E0fI371-rjJro6j1vDyfhufSO_p8Jm3O6r0fj7sx83e1FnoL4SqBvdh2r0MHl_Vq0X9dSO324X0Jzkh76z-KdZVNraLOV3tEJxeze_VtAEBaaZpuSUCIuDwSxGMXUI5ZJx6TiEYF7BMmdUOAgglhQkR1jisC0rAgTdtyQnWbQyqz3jnuRetezWTxtecrDs-m4QBO7v98DAZAm6NEPFQd2rntQS-LhRO-KNoEyTPQxsYiA_Hix7fA |
| ClassificationCodes | TN915.04 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.3969/j.issn.1001-3695.2016.08.047 |
| DatabaseName | 维普期刊资源整合服务平台 中文科技期刊数据库-CALIS站点 中文科技期刊数据库-7.0平台 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | Multi-level routing algorithm of WSN based on fusion of random virtual backbone trees and backoff distributed clustering |
| DocumentTitle_FL | Multi-level routing algorithm of WSN based on fusion of random virtual backbone trees and backoff distributed clustering |
| EndPage | 2457 |
| ExternalDocumentID | jsjyyyj201608048 669521410 |
| GrantInformation_xml | – fundername: 内蒙古自然科学基金资助项目; 内蒙古自治区高等学校教学改革科学研究资助项目 funderid: (NJZY315); (2015NMJG069) |
| GroupedDBID | -0Y 2B. 2C0 2RA 5XA 5XJ 92H 92I 92L ACGFS ALMA_UNASSIGNED_HOLDINGS CCEZO CQIGP CUBFJ CW9 TCJ TGT U1G U5S W92 ~WA 4A8 93N ABJNI PSX |
| ID | FETCH-LOGICAL-c608-44fa63c7a02878616e36af8afee331ab1f52ba0c037fc3538c0319fbc0c6d7fa3 |
| ISSN | 1001-3695 |
| IngestDate | Thu May 29 03:54:51 EDT 2025 Wed Feb 14 10:17:24 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 8 |
| Keywords | 多级路由算法 multi-level routing algorithm wireless sensor network energy-aware 能量感知 无线传感器网络 退避分布式聚类协议 random virtual backbone trees backoff distributed clustering protocol 随机虚拟骨干树 |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c608-44fa63c7a02878616e36af8afee331ab1f52ba0c037fc3538c0319fbc0c6d7fa3 |
| Notes | 51-1196/TP Feng Jianping , Li Hua （ 1. Inner Mongolia Business ＆ Trade Vocational College, Hohhot 010070, China; 2. School of Computer Science, Inner Mongolia University, Hohhot 010021, China） Aiming at the problems of cluster unbalanced energy consumption limiting the network lifetime in traditional routing algorithm of wireless sensor networks （ WSN ） , this paper proposed a new energy-aware routing algorithm based on improved backoff distributed clustering protocol （IBDCP） and random virtual backbone trees （RVBT）. Firstly, it organized the sensor nodes into different clusters. Then, used IBDCP to initialize time delay for each node to competition. Finally, in order to form a cluster, the nodes were considered their residual energy and distance to decide whether to join CH, and built random virtual backbone trees in the sink to facilitate the routing of data. It proves that the algorithm can achieve constant news and linear time complexity, and experimental results show that this algorithm is superior to othe |
| PageCount | 4 |
| ParticipantIDs | wanfang_journals_jsjyyyj201608048 chongqing_primary_669521410 |
| PublicationCentury | 2000 |
| PublicationDate | 2016 |
| PublicationDateYYYYMMDD | 2016-01-01 |
| PublicationDate_xml | – year: 2016 text: 2016 |
| PublicationDecade | 2010 |
| PublicationTitle | 计算机应用研究 |
| PublicationTitleAlternate | Application Research of Computers |
| PublicationYear | 2016 |
| Publisher | 内蒙古商贸职业学院,呼和浩特,010070%内蒙古大学 计算机学院,呼和浩特,010021 |
| Publisher_xml | – name: 内蒙古商贸职业学院,呼和浩特,010070%内蒙古大学 计算机学院,呼和浩特,010021 |
| SSID | ssj0042190 ssib001102940 ssib002263599 ssib023646305 ssib051375744 ssib025702191 |
| Score | 2.019951 |
| Snippet | ... TN915.04; 针对无线传感器网络（WSN）中传统路由算法簇首能量消耗不平衡而限制网络寿命的问题，提出了一种基于随机虚拟骨干树（RVBT）结合改进退避分布式聚类协议（IBDCP）的能量感知路由算法。首先，将所有传感器节点组成不同的簇；然后，利用 IBDCP... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 2454 |
| SubjectTerms | 多级路由算法 无线传感器网络 能量感知 退避分布式聚类协议 随机虚拟骨干树 |
| Title | 随机虚拟骨干树结合改进BDCP的无线传感器网络多级路由算法 |
| URI | http://lib.cqvip.com/qk/93231X/201608/669521410.html https://d.wanfangdata.com.cn/periodical/jsjyyyj201608048 |
| Volume | 33 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NTxQxFG9wSdSL30ZEzZrQE1mcz0577OzOhphoNMGE22ZmdgbCYVGBA5w5mHhQI4awksDBROJBox4MqOGfcWfgv_C9TllWQgD1MmnaX9_re68zr5207xEyJBIVtQXD7De9ihNbaUVEaVoJm4nJrDB0HZVs4t59NvrIuTvujveVzvScWpqbjUbihUPvlfyLVaEO7Iq3ZP_Csl2iUAFlsC88wcLwPJGNaSCokJTXacCoqFJf0oBToSqhhvtU1BEjJZWcBi71BfUtbJIGFSYNPOoDxsYmYVDOFR0HYUDHr1PhD_u16oNhRCIjRwE87I59JWICwFdVDUMAcnRxDMgRMLUeRlVsko4anuouPcUICNYVCyClwDJALkDQt2mRHXNvAY14aJV_wrTsLj6BSEGqGABKqmokyN79DYlYzhRbF4emewPE3ocA3RrlgcJiofcPSXF1U81mTYu7SvkWyo41dZQUVaFaUUyQjmOBm5RXld64UgXopEYlU9YEvVkw7VVHExWLBUvhQRsuSgGycIFjVSnT4WNKLfeYMcATVa0ZDR-jxP8ZTXERXbs5PEhnM21A7QeLgCT6fee9Ts0p4nzrBRJGIDzM-dqCCeV8kcVIlwUen2QqTG4RWvVAePOpman5-fkpBMHmxeGnSL_leaZbIv3Sr_n1_bU9LIV7Yz1aGEZpfy-NiRBYj_PC7IzgjbvOyzVtz1WpHoplmgONRagSPc7TZEgLcecoETAGy-R0a-IJrCzVRb9WGrYmetakYxfIOb2ZLMviy3CR9C1MXiLn9xK1lLXfvkwe7rZfZKtbOyvt7Pna7oeNzuaXbP1V_v115-WzbGlzZ_ttGV_zct5ezJbX863tXz_Ws8W1zspG_hNgq5137Xzr_c63T_nS5_zjcvb1zRUyVg_GqqMVnUulEoNeK46ThsyOvRC2Ex5nJktsFqY8TJPEts0wMlPXikIjNmwvjW1YBMV4uzGNYiNmTS8N7auk1JpuJddIOXR4YnhWE_ZmsB2M3Mg0IzMy7DBiViQic4AMdhXUeFyEzGkw0KKFR8oHyG2tsob-kM40Dk6B6yfADJKzWC5-ht4gpdmnc8lN2B7MRrf0xPkN_NbO2w |
| linkProvider | EBSCOhost |
| 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=%E9%9A%8F%E6%9C%BA%E8%99%9A%E6%8B%9F%E9%AA%A8%E5%B9%B2%E6%A0%91%E7%BB%93%E5%90%88%E6%94%B9%E8%BF%9B+BDCP+%E7%9A%84%E6%97%A0%E7%BA%BF%E4%BC%A0%E6%84%9F%E5%99%A8%E7%BD%91%E7%BB%9C%E5%A4%9A%E7%BA%A7%E8%B7%AF%E7%94%B1%E7%AE%97%E6%B3%95&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%BA%94%E7%94%A8%E7%A0%94%E7%A9%B6&rft.au=%E5%86%AF%E5%BB%BA%E5%B9%B3&rft.au=%E6%9D%8E%E5%8D%8E&rft.date=2016&rft.pub=%E5%86%85%E8%92%99%E5%8F%A4%E5%95%86%E8%B4%B8%E8%81%8C%E4%B8%9A%E5%AD%A6%E9%99%A2%2C%E5%91%BC%E5%92%8C%E6%B5%A9%E7%89%B9%2C010070%25%E5%86%85%E8%92%99%E5%8F%A4%E5%A4%A7%E5%AD%A6+%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%AD%A6%E9%99%A2%2C%E5%91%BC%E5%92%8C%E6%B5%A9%E7%89%B9%2C010021&rft.issn=1001-3695&rft.volume=33&rft.issue=8&rft.spage=2454&rft.epage=2461&rft_id=info:doi/10.3969%2Fj.issn.1001-3695.2016.08.047&rft.externalDocID=jsjyyyj201608048 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F93231X%2F93231X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjyyyj%2Fjsjyyyj.jpg |