时延容忍网络的节能稀疏路由协议

2017 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 1900-01-01 DOI:10.1109/ICCNC.2017.7876234

Max Hastings, Shuhui Yang

{"title":"时延容忍网络的节能稀疏路由协议","authors":"Max Hastings, Shuhui Yang","doi":"10.1109/ICCNC.2017.7876234","DOIUrl":null,"url":null,"abstract":"In this paper we demonstrate how limiting the number of copies each message that a node can send out as seen in Spray And Wait can be combined with probabilistic protocols such as Prophet, ProphetV2, and one that we created called Sparse. By limiting the number of copies that each node can send out we allow the routing protocols to scale much better than before when the number of nodes and messages created are increased.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Energy-efficient sparse routing protocol for Delay Tolerant Networks\",\"authors\":\"Max Hastings, Shuhui Yang\",\"doi\":\"10.1109/ICCNC.2017.7876234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we demonstrate how limiting the number of copies each message that a node can send out as seen in Spray And Wait can be combined with probabilistic protocols such as Prophet, ProphetV2, and one that we created called Sparse. By limiting the number of copies that each node can send out we allow the routing protocols to scale much better than before when the number of nodes and messages created are increased.\",\"PeriodicalId\":135028,\"journal\":{\"name\":\"2017 International Conference on Computing, Networking and Communications (ICNC)\",\"volume\":\"116 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Computing, Networking and Communications (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNC.2017.7876234\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2017.7876234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

在本文中，我们演示了如何限制节点可以发送的每个消息的副本数量，如Spray And Wait中所见，可以与概率协议(如Prophet, ProphetV2和我们创建的称为Sparse的协议)相结合。通过限制每个节点可以发送的副本数量，当创建的节点和消息数量增加时，我们允许路由协议比以前更好地扩展。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Energy-efficient sparse routing protocol for Delay Tolerant Networks

In this paper we demonstrate how limiting the number of copies each message that a node can send out as seen in Spray And Wait can be combined with probabilistic protocols such as Prophet, ProphetV2, and one that we created called Sparse. By limiting the number of copies that each node can send out we allow the routing protocols to scale much better than before when the number of nodes and messages created are increased.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 International Conference on Computing, Networking and Communications (ICNC)

自引率

0.00%

发文量