Scenario | Description |
EECBR | In this scenario the events are routed using our virtual topology and our EECBR rules. |
Progress-based routing | It this case, geographic routing is performed to route the events from the publishers to the interested subscribers. The progress-based routing is a type of greedy routing where the events are routed to the best neighbors. The process is repeated until reaching the destination. The progress is defined as the distance between a node S and the projection A’ of a neighbor node A onto the line connecting S and final destination D [52] . |
Distance-based routing | It this case, geographic routing is performed to route the events from the publishers to the interested subscribers. The neighbor which is closest to the destination is selected [52] . |
Greedy routing | In this case, each publisher sends its events to the neighbor with the highest energy [52] . |
Distance-energy routing | In this case, a metric that combines the distance and the energy has been defined as a * distance + b * energy where a and b are two random variables between 0 and 1. The neighbor having the best distance-energy metric is selected [53] . |