ad hoc网络中的高效组播树算法

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI:10.1109/MAHSS.2004.1392194

A. Penttinen

{"title":"ad hoc网络中的高效组播树算法","authors":"A. Penttinen","doi":"10.1109/MAHSS.2004.1392194","DOIUrl":null,"url":null,"abstract":"We propose an efficient heuristic algorithm for multicast tree construction in ad hoc networks. The objective is to connect a source node to a set of destination nodes with a sequence of transmissions so that the number of transmissions is minimized. The algorithm utilizes shortest path information, which can be obtained from unicast routing tables for fully distributed implementation. In addition to multicast routing, the algorithm is applicable to stateless multicast forwarding for small multicast groups.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"785 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Efficient multicast tree algorithm for ad hoc networks\",\"authors\":\"A. Penttinen\",\"doi\":\"10.1109/MAHSS.2004.1392194\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an efficient heuristic algorithm for multicast tree construction in ad hoc networks. The objective is to connect a source node to a set of destination nodes with a sequence of transmissions so that the number of transmissions is minimized. The algorithm utilizes shortest path information, which can be obtained from unicast routing tables for fully distributed implementation. In addition to multicast routing, the algorithm is applicable to stateless multicast forwarding for small multicast groups.\",\"PeriodicalId\":150940,\"journal\":{\"name\":\"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)\",\"volume\":\"785 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MAHSS.2004.1392194\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MAHSS.2004.1392194","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 17

摘要

提出了一种有效的启发式算法，用于自组织网络中组播树的构建。目标是通过传输序列将源节点连接到一组目标节点，从而使传输数量最小化。该算法利用了最短路径信息，可以从单播路由表中获得最短路径信息，实现完全分布式。除了组播路由外，该算法还适用于小组播组的无状态组播转发。

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

查看原文本刊更多论文

Efficient multicast tree algorithm for ad hoc networks

We propose an efficient heuristic algorithm for multicast tree construction in ad hoc networks. The objective is to connect a source node to a set of destination nodes with a sequence of transmissions so that the number of transmissions is minimized. The algorithm utilizes shortest path information, which can be obtained from unicast routing tables for fully distributed implementation. In addition to multicast routing, the algorithm is applicable to stateless multicast forwarding for small multicast groups.

求助全文

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

来源期刊

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)

自引率

0.00%

发文量