基于标签贪婪算法的Ad Hoc网络最小能耗组播路由

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2011-10-10 DOI:10.1109/CyberC.2011.28

Lin Lin, Qiwu Wu

{"title":"基于标签贪婪算法的Ad Hoc网络最小能耗组播路由","authors":"Lin Lin, Qiwu Wu","doi":"10.1109/CyberC.2011.28","DOIUrl":null,"url":null,"abstract":"We study the problem of computing multicast trees with minimal energy consumption in multi-hop wireless ad hoc networks. We demonstrate in this paper, that for two multicast trees having the same number of forwarding nodes in an ad hoc network, the one with least steiner nodes consumes least bandwidth. A greedy Label Based Greedy Algorithm (LBGA) is presented. Our algorithm LBGA with time complexity O(n^2) is an improvement of the existed multicast algorithms. At the end of the paper, we give an example to show the improvement on three representative algorithms by our LBGA.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"145 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Label Based Greedy Algorithm for Minimum Energy Consumption Multicast Routing in Ad Hoc Networks\",\"authors\":\"Lin Lin, Qiwu Wu\",\"doi\":\"10.1109/CyberC.2011.28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of computing multicast trees with minimal energy consumption in multi-hop wireless ad hoc networks. We demonstrate in this paper, that for two multicast trees having the same number of forwarding nodes in an ad hoc network, the one with least steiner nodes consumes least bandwidth. A greedy Label Based Greedy Algorithm (LBGA) is presented. Our algorithm LBGA with time complexity O(n^2) is an improvement of the existed multicast algorithms. At the end of the paper, we give an example to show the improvement on three representative algorithms by our LBGA.\",\"PeriodicalId\":227472,\"journal\":{\"name\":\"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"volume\":\"145 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CyberC.2011.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2011.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

研究了多跳无线自组织网络中以最小能量消耗计算组播树的问题。本文证明了在ad hoc网络中，对于具有相同转发节点数的两棵组播树，斯坦纳节点数最少的那棵树消耗的带宽最少。提出一种基于贪婪标签的贪婪算法(LBGA)。本文提出的时间复杂度为0 (n^2)的LBGA算法是对现有多播算法的改进。在文章的最后，我们给出了一个例子，展示了我们的LBGA对三种代表性算法的改进。

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

查看原文本刊更多论文

A Label Based Greedy Algorithm for Minimum Energy Consumption Multicast Routing in Ad Hoc Networks

We study the problem of computing multicast trees with minimal energy consumption in multi-hop wireless ad hoc networks. We demonstrate in this paper, that for two multicast trees having the same number of forwarding nodes in an ad hoc network, the one with least steiner nodes consumes least bandwidth. A greedy Label Based Greedy Algorithm (LBGA) is presented. Our algorithm LBGA with time complexity O(n^2) is an improvement of the existed multicast algorithms. At the end of the paper, we give an example to show the improvement on three representative algorithms by our LBGA.

求助全文

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

来源期刊

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery

自引率

0.00%

发文量