{"title":"基于IEEE 802.15.4集群树拓扑的分布式信标调度","authors":"Nikumani Choudhury, Rakesh Matam","doi":"10.1109/INDICON.2016.7838864","DOIUrl":null,"url":null,"abstract":"The IEEE 802.15.4 standard provides a synchronization mechanism for devices connected in a star network topology using beacons. The lack of it in peer-to-peer network topology restricts its use to non-beacon mode. Addressing this issue, few protocols have been proposed based on either centralized or distributed approach. Irrespective of the approach, the three major criterion to evaluate different schemes are utilization of time slots, transmission count, and scalability. Centralized schemes are shown to incur high overhead and are not scalable. In this paper, we propose two distributed beacon scheduling mechanism that better utilize the available time slots, incur fewer transmissions and are highly scalable. In addition, the proposed works also lower the number of beacon frame collisions that otherwise leads to orphan nodes. The analytical study of both the mechanisms is presented along with proof of concept through simulation. A Markov chain model is defined to understand the different states of channel during transmission of frames.","PeriodicalId":283953,"journal":{"name":"2016 IEEE Annual India Conference (INDICON)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Distributed beacon scheduling for IEEE 802.15.4 cluster-tree topology\",\"authors\":\"Nikumani Choudhury, Rakesh Matam\",\"doi\":\"10.1109/INDICON.2016.7838864\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The IEEE 802.15.4 standard provides a synchronization mechanism for devices connected in a star network topology using beacons. The lack of it in peer-to-peer network topology restricts its use to non-beacon mode. Addressing this issue, few protocols have been proposed based on either centralized or distributed approach. Irrespective of the approach, the three major criterion to evaluate different schemes are utilization of time slots, transmission count, and scalability. Centralized schemes are shown to incur high overhead and are not scalable. In this paper, we propose two distributed beacon scheduling mechanism that better utilize the available time slots, incur fewer transmissions and are highly scalable. In addition, the proposed works also lower the number of beacon frame collisions that otherwise leads to orphan nodes. The analytical study of both the mechanisms is presented along with proof of concept through simulation. A Markov chain model is defined to understand the different states of channel during transmission of frames.\",\"PeriodicalId\":283953,\"journal\":{\"name\":\"2016 IEEE Annual India Conference (INDICON)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Annual India Conference (INDICON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDICON.2016.7838864\",\"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 IEEE Annual India Conference (INDICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDICON.2016.7838864","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed beacon scheduling for IEEE 802.15.4 cluster-tree topology
The IEEE 802.15.4 standard provides a synchronization mechanism for devices connected in a star network topology using beacons. The lack of it in peer-to-peer network topology restricts its use to non-beacon mode. Addressing this issue, few protocols have been proposed based on either centralized or distributed approach. Irrespective of the approach, the three major criterion to evaluate different schemes are utilization of time slots, transmission count, and scalability. Centralized schemes are shown to incur high overhead and are not scalable. In this paper, we propose two distributed beacon scheduling mechanism that better utilize the available time slots, incur fewer transmissions and are highly scalable. In addition, the proposed works also lower the number of beacon frame collisions that otherwise leads to orphan nodes. The analytical study of both the mechanisms is presented along with proof of concept through simulation. A Markov chain model is defined to understand the different states of channel during transmission of frames.