Algorithm 1. Energy-efficient link scheduling at the gateway.

Input:N CRBANs, List of idle channels Ck, and synchronized time of superframe T0 Output: List of data channel and the start_time for N CRBANs 1. For each Ck ∈ CU ∪ CL 2.   Find the sublist of CRBANs: SLk(t) = {SLk(t) ∩ Bi | Ck ∈ Li(t), 1 ≤ i ≤ N} 3.   Assign ΔT = T0 4.   Calculate T(CBi) as in (4) 5.    For each CBi ∈ SLk(t) 6.     Find CBi so that CBi has the highest priority value p(CBi) 7.     If (CBi is not scheduled) 8.        Set data channel for CBi: Chik(t) = 1 9.        Set start_time for CBi: ΔT(CBi) = ΔT 10.       Remove CBi out of SLk(t) 11.       Update ΔT = ΔT(CBi) + T(CBi) 12.       SYNC adds {Chik(t) = 1, ΔT(CBi)} 13.     Else 14        Continue 15      End If 16.    End For 17. End For 18. Broadcast SYNC