{"title":"无线团网中利用带内全双工的邻居发现","authors":"Yuichi Miyaji, H. Uehara","doi":"10.1109/ICCNC.2017.7876276","DOIUrl":null,"url":null,"abstract":"In wireless ad hoc networks, neighbor discovery is essential for medium access control and routing. In this paper, we propose a new neighbor discovery algorithm utilizing in-band full duplex. This algorithm employs a reservation scheme with full duplex into an existing algorithm based on half-duplex. We analyze neighbor discovery time of both algorithms with absorbing Markov chain models and simulations. These results show our proposed algorithm shortens neighbor discovery. Furthermore, we discuss an affinity between the proposed algorithm and an existing one with full duplex.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Neighbor discovery utilizing in-band full duplex in wireless clique networks\",\"authors\":\"Yuichi Miyaji, H. Uehara\",\"doi\":\"10.1109/ICCNC.2017.7876276\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In wireless ad hoc networks, neighbor discovery is essential for medium access control and routing. In this paper, we propose a new neighbor discovery algorithm utilizing in-band full duplex. This algorithm employs a reservation scheme with full duplex into an existing algorithm based on half-duplex. We analyze neighbor discovery time of both algorithms with absorbing Markov chain models and simulations. These results show our proposed algorithm shortens neighbor discovery. Furthermore, we discuss an affinity between the proposed algorithm and an existing one with full duplex.\",\"PeriodicalId\":135028,\"journal\":{\"name\":\"2017 International Conference on Computing, Networking and Communications (ICNC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Computing, Networking and Communications (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNC.2017.7876276\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2017.7876276","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Neighbor discovery utilizing in-band full duplex in wireless clique networks
In wireless ad hoc networks, neighbor discovery is essential for medium access control and routing. In this paper, we propose a new neighbor discovery algorithm utilizing in-band full duplex. This algorithm employs a reservation scheme with full duplex into an existing algorithm based on half-duplex. We analyze neighbor discovery time of both algorithms with absorbing Markov chain models and simulations. These results show our proposed algorithm shortens neighbor discovery. Furthermore, we discuss an affinity between the proposed algorithm and an existing one with full duplex.