R. Annur, N. Wattanamongkhol, S. Nakpeerayuth, L. Wuttisittikulkij, J. Takada
{"title":"Applying the Tree Algorithm with Prioritization for Body Area Networks","authors":"R. Annur, N. Wattanamongkhol, S. Nakpeerayuth, L. Wuttisittikulkij, J. Takada","doi":"10.1109/ISADS.2011.74","DOIUrl":null,"url":null,"abstract":"Wireless Body Area Networks (WBANs) are allowed to be applied in medical and non-medical fields. In this paper we present a prioritization mechanism for emergency case in both medical and non-medical WBANs applications. The main idea of this mechanism is to allow highest priority nodes or nodes of emergency to get the channel immediately at the expense of low priority nodes. This mechanism postpones the reservation of low priority nodes until the all high priority nodes are resolved. We apply a collision resolution protocol, tree algorithm, to achieve our goal. It can be observed from the simulation results that tree algorithm allows high priority nodes to get the channel first without contending with the low priority ones.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Tenth International Symposium on Autonomous Decentralized Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISADS.2011.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
Wireless Body Area Networks (WBANs) are allowed to be applied in medical and non-medical fields. In this paper we present a prioritization mechanism for emergency case in both medical and non-medical WBANs applications. The main idea of this mechanism is to allow highest priority nodes or nodes of emergency to get the channel immediately at the expense of low priority nodes. This mechanism postpones the reservation of low priority nodes until the all high priority nodes are resolved. We apply a collision resolution protocol, tree algorithm, to achieve our goal. It can be observed from the simulation results that tree algorithm allows high priority nodes to get the channel first without contending with the low priority ones.