{"title":"TDMA自组织网络的广播调度问题","authors":"D. Arivudainambi, D. Rekha","doi":"10.1145/2185216.2185334","DOIUrl":null,"url":null,"abstract":"A domain specific memetic algorithm is proposed for solving the optimum time division multiple access broadcast scheduling problem in Ad-hoc networks. During disaster relief, broadcast scheduling problem in Ad-hoc network is deployed efficiently. The aim is to increase the total number of transmissions in optimized time slot with high channel utilization in a less computation time. The results were compared with other algorithms for broadcast scheduling problem.","PeriodicalId":180836,"journal":{"name":"International Conference on Wireless Technologies for Humanitarian Relief","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Broadcast scheduling problem for TDMA ad-hoc networks\",\"authors\":\"D. Arivudainambi, D. Rekha\",\"doi\":\"10.1145/2185216.2185334\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A domain specific memetic algorithm is proposed for solving the optimum time division multiple access broadcast scheduling problem in Ad-hoc networks. During disaster relief, broadcast scheduling problem in Ad-hoc network is deployed efficiently. The aim is to increase the total number of transmissions in optimized time slot with high channel utilization in a less computation time. The results were compared with other algorithms for broadcast scheduling problem.\",\"PeriodicalId\":180836,\"journal\":{\"name\":\"International Conference on Wireless Technologies for Humanitarian Relief\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Wireless Technologies for Humanitarian Relief\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2185216.2185334\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Wireless Technologies for Humanitarian Relief","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2185216.2185334","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Broadcast scheduling problem for TDMA ad-hoc networks
A domain specific memetic algorithm is proposed for solving the optimum time division multiple access broadcast scheduling problem in Ad-hoc networks. During disaster relief, broadcast scheduling problem in Ad-hoc network is deployed efficiently. The aim is to increase the total number of transmissions in optimized time slot with high channel utilization in a less computation time. The results were compared with other algorithms for broadcast scheduling problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
