{"title":"涓滴算法的分析评价:迈向高效、公平、快速、可靠的数据传播","authors":"Thomas M. M. Meyfroyt","doi":"10.1109/WoWMoM.2015.7158155","DOIUrl":null,"url":null,"abstract":"Wireless sensor networks require communication protocols for efficiently propagating and maintaining data in a distributed fashion. Ideally, a communication protocol is able to disseminate data quickly to all nodes in the network using as few transmissions as possible, while distributing transmission load fairly. In the context of wireless sensor networks the Trickle algorithm is a popular protocol serving as the basis for many of the current communication protocols. In this study we analyze the performance of Trickle with respect to efficiency, fairness, reliability and propagation speed. Additionally, we show how small extensions to the algorithm can improve its performance.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An analytic evaluation of the Trickle algorithm: Towards efficient, fair, fast and reliable data dissemination\",\"authors\":\"Thomas M. M. Meyfroyt\",\"doi\":\"10.1109/WoWMoM.2015.7158155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless sensor networks require communication protocols for efficiently propagating and maintaining data in a distributed fashion. Ideally, a communication protocol is able to disseminate data quickly to all nodes in the network using as few transmissions as possible, while distributing transmission load fairly. In the context of wireless sensor networks the Trickle algorithm is a popular protocol serving as the basis for many of the current communication protocols. In this study we analyze the performance of Trickle with respect to efficiency, fairness, reliability and propagation speed. Additionally, we show how small extensions to the algorithm can improve its performance.\",\"PeriodicalId\":221796,\"journal\":{\"name\":\"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WoWMoM.2015.7158155\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WoWMoM.2015.7158155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An analytic evaluation of the Trickle algorithm: Towards efficient, fair, fast and reliable data dissemination
Wireless sensor networks require communication protocols for efficiently propagating and maintaining data in a distributed fashion. Ideally, a communication protocol is able to disseminate data quickly to all nodes in the network using as few transmissions as possible, while distributing transmission load fairly. In the context of wireless sensor networks the Trickle algorithm is a popular protocol serving as the basis for many of the current communication protocols. In this study we analyze the performance of Trickle with respect to efficiency, fairness, reliability and propagation speed. Additionally, we show how small extensions to the algorithm can improve its performance.