{"title":"动态信道访问协议的分布式仿真","authors":"C. Cismasu, C. Tropper","doi":"10.1109/MASCOT.2002.1167093","DOIUrl":null,"url":null,"abstract":"We make use of time warp for the distributed simulation of a dynamic channel allocation scheme known as channel segregation. Channel segregation requires that signal strength computation be made continuously, imposing a heavy load on the simulation. We compare the performance of the channel segregation algorithm to a fixed channel allocation algorithm. The main objective of our experiments was to determine limitations on our ability to make use of distributed simulation for wireless networks.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed simulation of dynamic channel access protocols\",\"authors\":\"C. Cismasu, C. Tropper\",\"doi\":\"10.1109/MASCOT.2002.1167093\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We make use of time warp for the distributed simulation of a dynamic channel allocation scheme known as channel segregation. Channel segregation requires that signal strength computation be made continuously, imposing a heavy load on the simulation. We compare the performance of the channel segregation algorithm to a fixed channel allocation algorithm. The main objective of our experiments was to determine limitations on our ability to make use of distributed simulation for wireless networks.\",\"PeriodicalId\":384900,\"journal\":{\"name\":\"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.2002.1167093\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2002.1167093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed simulation of dynamic channel access protocols
We make use of time warp for the distributed simulation of a dynamic channel allocation scheme known as channel segregation. Channel segregation requires that signal strength computation be made continuously, imposing a heavy load on the simulation. We compare the performance of the channel segregation algorithm to a fixed channel allocation algorithm. The main objective of our experiments was to determine limitations on our ability to make use of distributed simulation for wireless networks.