Transmissions scheduling is a key design problem in packet radio networks,relevant to TDMA and CDMA systems.A large number of topology-dependent scheduling algorithms are available,in which changes of topology inevitably require recomputation of transmission schedules.The need for constant adaptation of schedules to mobile topologies entails significant,sometime insormountable problems.These are,protocol overhead due to recomputation,performance penalty due to suspension of transmissions dunng schedule reorganization,exchange of control message and new schedule broadcast, and importantly,if topology changes at a rate at which new schedules can be recomputed and distributed,the network can suffer a catastrophic failure.In this paper,we propose a robust scheduling protocol which is unique in providing a topology transparent solutlon to scheduled access in multi-hop mobile radio networks.The proposed solution adds the main advantages of random access protocols to scheduled access.Similarly to random access,it is robust in presence of mobile nodes.Unlike random access,however,it does not Suffer from inherent instability,and unpredictable performance.Similarly to scheduled 8ccess,it guarantees that every transmission is successfully received within a known deadline.Unlike current scheduled access,its transmission schedules are independent of topology changes.Further,the proposed solution is inherently fair and traffic adaptive.
展开▼
