Model Each node works per round synchronized by a global clock (like GPS) The initial information of each node ID of itself Whether it is source or not(RB and ARB) Each node cannot receive two or more messages in one round Collision detection is not available The number of nodes in the network unknown Information about neighbors IDs are distinct integers between I and o(n)
Model The number of nodes in the network Information about neighbors unknown IDs are distinct integers between 1 and O(n) • Each node works per round synchronized by a global clock (like GPS). • The initial information of each node – ID of itself – Whether it is source or not (RB and ARB) • Each node cannot receive two or more messages in one round • Collision detection is not available
Model Each node works per round synchronized by a global clock (like GPS) The initial information of each node ID of itself Whether it is source or not(RB and ARB) Each node cannot receive two or more messages in one round Collision detection is not available receivable unreceivable(collision
Model receivable unreceivable(collision) • Each node works per round synchronized by a global clock (like GPS). • The initial information of each node – ID of itself – Whether it is source or not (RB and ARB) • Each node cannot receive two or more messages in one round • Collision detection is not available
Model Each node works per round synchronized by a global clock (like GPS) The initial information of each node ID of itself Whether it is source or not(RB and ARB) Each node cannot receive two or more messages in one round Collision detection is not available Collision detection collision distinguishable
Model distinguishable Collision detection collision • Each node works per round synchronized by a global clock (like GPS). • The initial information of each node – ID of itself – Whether it is source or not (RB and ARB) • Each node cannot receive two or more messages in one round • Collision detection is not available
Model Each node works per round synchronized by a global clock (like GPS) The initial information of each node ID of itself Whether it is source or not(RB and ARB) Each node cannot receive two or more messages in one round Collision detection is not available We consider tht model without collision detection collision otinguishade
Model distinguishable We consider tht model without collision detection collision • Each node works per round synchronized by a global clock (like GPS). • The initial information of each node – ID of itself – Whether it is source or not (RB and ARB) • Each node cannot receive two or more messages in one round • Collision detection is not available
Classes of graphs we consider Strongly connected Strongly connected graph and Bidirectional graph
Strongly connected and Bidirectional graph Strongly connected graph Classes of graphs we consider