机会路由中候选节点数的估计方法

Xinyou Zhang, Chen Lei-yi, Huanlai Xing
{"title":"机会路由中候选节点数的估计方法","authors":"Xinyou Zhang, Chen Lei-yi, Huanlai Xing","doi":"10.1109/PDCAT.2016.072","DOIUrl":null,"url":null,"abstract":"Because of the number of candidate nodes in opportunistic routing is too large, this paper proposed an estimation method on the number of candidate nodes based on distance (DBNCE). This method sets the number of candidate nodes for each node which participates in forwarding data package according to the distance between current node and the destination, also combines the two factors: network density and the number of neighbor nodes in current node. Simulation results show that using DBNCE in opportunistic routing will reduce the number of candidate nodes effectively while guarantee the rate of data transmission, and improve the performance of the network.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Estimation Method on the Number of Candidate Nodes in Opportunistic Routing\",\"authors\":\"Xinyou Zhang, Chen Lei-yi, Huanlai Xing\",\"doi\":\"10.1109/PDCAT.2016.072\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Because of the number of candidate nodes in opportunistic routing is too large, this paper proposed an estimation method on the number of candidate nodes based on distance (DBNCE). This method sets the number of candidate nodes for each node which participates in forwarding data package according to the distance between current node and the destination, also combines the two factors: network density and the number of neighbor nodes in current node. Simulation results show that using DBNCE in opportunistic routing will reduce the number of candidate nodes effectively while guarantee the rate of data transmission, and improve the performance of the network.\",\"PeriodicalId\":203925,\"journal\":{\"name\":\"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT.2016.072\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2016.072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对机会路由中候选节点数量过大的问题,提出了一种基于距离的候选节点数量估计方法。该方法根据当前节点与目的节点的距离,结合网络密度和当前节点的邻居节点数两个因素,为每个参与转发数据包的节点设置候选节点数。仿真结果表明,在机会路由中使用DBNCE可以在保证数据传输速率的同时有效减少候选节点数量,提高网络性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Estimation Method on the Number of Candidate Nodes in Opportunistic Routing
Because of the number of candidate nodes in opportunistic routing is too large, this paper proposed an estimation method on the number of candidate nodes based on distance (DBNCE). This method sets the number of candidate nodes for each node which participates in forwarding data package according to the distance between current node and the destination, also combines the two factors: network density and the number of neighbor nodes in current node. Simulation results show that using DBNCE in opportunistic routing will reduce the number of candidate nodes effectively while guarantee the rate of data transmission, and improve the performance of the network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Learning-Based System for Monitoring Electrical Load in Smart Grid A Domain-Independent Hybrid Approach for Automatic Taxonomy Induction CUDA-Based Parallel Implementation of IBM Word Alignment Algorithm for Statistical Machine Translation Optimal Scheduling Algorithm of MapReduce Tasks Based on QoS in the Hybrid Cloud Pre-Impact Fall Detection Based on Wearable Device Using Dynamic Threshold Model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1