{"title":"CAMT:用于自组织网络的核心辅助组播树","authors":"M. U. Farooq, N. Tapus","doi":"10.1109/ROEDUNET-RENAM.2014.6955327","DOIUrl":null,"url":null,"abstract":"Generally, the multicast routing protocols for mobile ad hoc networks (MANETs) build and maintain a group shared (tree or mesh-based) multicast delivery structure, which results in inefficient propagation of multicast traffic. In this article, a source tree based multicast routing protocol CAMT is proposed. CAMT employs only a fraction of nodes (core nodes) to disseminate their own and their neighbors' multicast interests to the network, while assuring the representation of all multicast receivers in these messages. As a result, only a small number of multicast group interest messages are generated. Moreover, CAMT benefits from the multipoint relay (MPR) optimizations to minimize retransmissions of these messages. Based on the information learnt through these messages, any multicast sender can generate a shortest path tree (rooted at itself), spanning across all core nodes interested in a particular multicast group. Simulation results indicate that the proposed protocol performs well under different network conditions.","PeriodicalId":340048,"journal":{"name":"2014 RoEduNet Conference 13th Edition: Networking in Education and Research Joint Event RENAM 8th Conference","volume":"225 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"CAMT: Core assisted multicast tree for ad hoc networks\",\"authors\":\"M. U. Farooq, N. Tapus\",\"doi\":\"10.1109/ROEDUNET-RENAM.2014.6955327\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Generally, the multicast routing protocols for mobile ad hoc networks (MANETs) build and maintain a group shared (tree or mesh-based) multicast delivery structure, which results in inefficient propagation of multicast traffic. In this article, a source tree based multicast routing protocol CAMT is proposed. CAMT employs only a fraction of nodes (core nodes) to disseminate their own and their neighbors' multicast interests to the network, while assuring the representation of all multicast receivers in these messages. As a result, only a small number of multicast group interest messages are generated. Moreover, CAMT benefits from the multipoint relay (MPR) optimizations to minimize retransmissions of these messages. Based on the information learnt through these messages, any multicast sender can generate a shortest path tree (rooted at itself), spanning across all core nodes interested in a particular multicast group. Simulation results indicate that the proposed protocol performs well under different network conditions.\",\"PeriodicalId\":340048,\"journal\":{\"name\":\"2014 RoEduNet Conference 13th Edition: Networking in Education and Research Joint Event RENAM 8th Conference\",\"volume\":\"225 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 RoEduNet Conference 13th Edition: Networking in Education and Research Joint Event RENAM 8th Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROEDUNET-RENAM.2014.6955327\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 RoEduNet Conference 13th Edition: Networking in Education and Research Joint Event RENAM 8th Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROEDUNET-RENAM.2014.6955327","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
CAMT: Core assisted multicast tree for ad hoc networks
Generally, the multicast routing protocols for mobile ad hoc networks (MANETs) build and maintain a group shared (tree or mesh-based) multicast delivery structure, which results in inefficient propagation of multicast traffic. In this article, a source tree based multicast routing protocol CAMT is proposed. CAMT employs only a fraction of nodes (core nodes) to disseminate their own and their neighbors' multicast interests to the network, while assuring the representation of all multicast receivers in these messages. As a result, only a small number of multicast group interest messages are generated. Moreover, CAMT benefits from the multipoint relay (MPR) optimizations to minimize retransmissions of these messages. Based on the information learnt through these messages, any multicast sender can generate a shortest path tree (rooted at itself), spanning across all core nodes interested in a particular multicast group. Simulation results indicate that the proposed protocol performs well under different network conditions.