Please use this identifier to cite or link to this item:
|Title:||Pritrans: A prioritized converge-cast scheme using consensus ranking in wireless sensor networks||Authors:||Tao, S.
|Issue Date:||2010||Citation:||Tao, S.,Chan, M.C.,Muravyov, S.,Tarakanov, E. (2010). Pritrans: A prioritized converge-cast scheme using consensus ranking in wireless sensor networks. 2010 IEEE Sensors Applications Symposium, SAS 2010 - Proceedings : 251-256. ScholarBank@NUS Repository. https://doi.org/10.1109/SAS.2010.5439432||Abstract:||Data packets collected in wireless sensor networks may contain information of different importance, including regular updates and critical data triggered by important events. In a converge-cast tree, packets routed towards the data sink may be dropped due to network contention. In order to improve the reliability of critical packets, we propose a prioritized transmission scheme named Pritrans. By overhearing the data packets transmitted by the neighbors, each node will compute the consensus relation based on the packet contents and maintain a consistent ranking within the neighborhood. The parent node will send feedback messages to adjust the packet rate of child nodes proportional to their ranking, such that the channel can be prioritized for transmission of important packets. A preemptive queuing method is applied in the intermediate nodes, enabling an incoming packet with high priority to evict a low priority one when the queue is full. The simulation results in TOSSIM show that the Pritrans scheme can effectively increase the delivery rate of critical packets in a congested network scenario. © 2009 IEEE.||Source Title:||2010 IEEE Sensors Applications Symposium, SAS 2010 - Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/41070||ISBN:||9781424449897||DOI:||10.1109/SAS.2010.5439432|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 27, 2020
checked on Nov 24, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.