{"title":"A New Adaptive Transmission Scheduling in Packet Radio Networks","authors":"S. Madhavi","doi":"10.1109/ICNS.2008.49","DOIUrl":null,"url":null,"abstract":"The topology of the packet radio network changes dynamically. The initial slot assignments may cause interferences among the nodes while transmitting. In this paper, the author propose a new adaptive transmission scheduling to packet radio networks that computes the transmission assignments according to the changes in the topology. The node gathers information from its local neighborhood. In addition, this information is useful to reconstruct the slot assignments. The NATS consists of two stages. During the first stage, it obtained a minimal TDMA frame length and the corresponding transmission assignments. In the second stage, the NATS finds the maximum node transmissions. Results show that this method improves the guaranteed throughput and outperforms a 10% improvement over [Vhong and Huynh] .It is also shown that NATS outperforms TTR .","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth International Conference on Networking and Services (icns 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNS.2008.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The topology of the packet radio network changes dynamically. The initial slot assignments may cause interferences among the nodes while transmitting. In this paper, the author propose a new adaptive transmission scheduling to packet radio networks that computes the transmission assignments according to the changes in the topology. The node gathers information from its local neighborhood. In addition, this information is useful to reconstruct the slot assignments. The NATS consists of two stages. During the first stage, it obtained a minimal TDMA frame length and the corresponding transmission assignments. In the second stage, the NATS finds the maximum node transmissions. Results show that this method improves the guaranteed throughput and outperforms a 10% improvement over [Vhong and Huynh] .It is also shown that NATS outperforms TTR .
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
