By transferring the channel allocation problem to the problem of switching law design for a switched system, different allocation schemes including state-dependent scheme, periodic allocation scheme and random allocation scheme are proposed.
Scheduled access supports either 1-periodic or m-periodic (m>1) allocations.
Due to the requirement of having a periodic slot allocation schedule, we need to find a common factor between the fractions that represent the requests of the different sensors.
We introduce an optimization problem that designs a periodic surgery allocation schedule as well as a recovery ward utilization plan, with a view at balancing patient arrivals and releases in the long term, in such a way that all surgeries are performed in a timely manner.
Nodes communicate with the hub in each superframe in 1-periodic scheduled allocation and in every m superframes in m-periodic scheduled access.
Unscheduled access supports 1-periodic, m-periodic, or round robin allocations.
On the basis of the fundamental access scheme, an intuitive time allocation strategy of the idle period is periodic sensing and accessing strategy.
Zhang [73] proposes to use persistent resource allocation for periodic M2M applications and indicate the condition for multiplexing multiple MTC devices with different reporting periods.
Following the same ideas, in[4], the authors presented a more flexible approach and proposed a CFP divided into more than 16 mini time slots for periodic real-time message allocation.
The first-round reservation assigns appropriate allocation slots for periodic data of different nodes.
