{"title":"多媒体应用中基于低成本aca的组播路由","authors":"F. Sheikhshoaei, M. Asadi, S. Sadeghi, A. Mahani","doi":"10.1109/CSNDSP.2016.7574030","DOIUrl":null,"url":null,"abstract":"Energy efficient routing algorithm is an important issue in WSNs applications. In this paper we propose an ant colony algorithm based on smell factor, SUMACO, for delay-constraint multicast routing applications. Simulation results verify the speed of proposed algorithm to find the final tree of multicast routing. In Comparison with the conventional ant colony algorithm, the convergence speed and also the cost of SUMACO is strongly improved.","PeriodicalId":298711,"journal":{"name":"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Low cost ACA-based multicast routing for multi-media applications\",\"authors\":\"F. Sheikhshoaei, M. Asadi, S. Sadeghi, A. Mahani\",\"doi\":\"10.1109/CSNDSP.2016.7574030\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Energy efficient routing algorithm is an important issue in WSNs applications. In this paper we propose an ant colony algorithm based on smell factor, SUMACO, for delay-constraint multicast routing applications. Simulation results verify the speed of proposed algorithm to find the final tree of multicast routing. In Comparison with the conventional ant colony algorithm, the convergence speed and also the cost of SUMACO is strongly improved.\",\"PeriodicalId\":298711,\"journal\":{\"name\":\"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSNDSP.2016.7574030\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNDSP.2016.7574030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Low cost ACA-based multicast routing for multi-media applications
Energy efficient routing algorithm is an important issue in WSNs applications. In this paper we propose an ant colony algorithm based on smell factor, SUMACO, for delay-constraint multicast routing applications. Simulation results verify the speed of proposed algorithm to find the final tree of multicast routing. In Comparison with the conventional ant colony algorithm, the convergence speed and also the cost of SUMACO is strongly improved.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
