A comparative study of two classical topology-transparent scheduling algorithms for multi-hop packet radio networks

Abstract

The aim of topology-transparent scheduling algorithms for multi-hop wireless networks is to find a schedule for the nodes that does not need re-computation when the network topology changes. It caters to highly dynamic scenarios where topology changes occur faster than the speed at which schedule updates can be orchestrated. These algorithms normally take… (More)

Topics

10 Figures and Tables

Cite this paper

@article{Dash2016ACS, title={A comparative study of two classical topology-transparent scheduling algorithms for multi-hop packet radio networks}, author={Dipti Dash and Debarshi Kumar Sanyal and Arup Sarkar and Dibyajyoti Guha}, journal={2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)}, year={2016}, pages={2011-2016} }