 |
Next, I¡¯d like to explain the priority scheduling algorithm.
In SIGO, a timer-based priority scheduling algorithm is used. In this algorithm, the node with the highest priority rebroadcasts the data packet first. When other relay candidate nodes overhear packets from nodes with a higher priority, they discard their pending packets. Each relay candidate node rebroadcasts the packet only when it has not received any packet from the node with a higher priority than itself until its timer expires.
The above equation is applied when node i is a street intersection node, and
the under equation is applied when node i is located outside the intersection.
The larger the value calculated by these equations, the higher the priority is assigned to node i. |
IEEE/ICACT20220087 Slide.15
[Big Slide]