if (intermediate node j does not receive a data packet from its neighbor i in reserved slot)
{ it deletes a row, which indicates that the node i and corresponding reserved slots will be deleted
from its reservation table;
it deletes a row, which indicates that the node j itself and corresponding reserved slots will be
deleted from its reservation table;
it informs its neighbors about the updates in its reservation table by broadcasting the update
packets;
neighbors perform the Algorithm 3, which is modified to delete a row in reservation table;
}  end if
Algorithm 4