| Algorithm 2 Main steps of the B-DBR scheme |
| if void node or known sinks = 0 then |
| Queue the data packets |
| Re-schedule forward data packet() |
| else |
| ⟵ |
| if then |
| Forward the data packet |
| else |
| Queue the data packet |
| Re-schedule |
| Proposed_mechanism() |
| end if |
| end if |
| Algorithm 2 Main steps of the B-DBR scheme |
| if void node or known sinks = 0 then |
| Queue the data packets |
| Re-schedule forward data packet() |
| else |
| ⟵ |
| if then |
| Forward the data packet |
| else |
| Queue the data packet |
| Re-schedule |
| Proposed_mechanism() |
| end if |
| end if |