Discovering Time Dependent Multicast Network Using Β-Synchronizer
Abstract— When we consider the traditional routing algorithm, it requires minimum eight to ten seconds to transfer the
packet from source to destination. These type of algorithms will increases time, message and space complexity of node. To
avoid this problem we propose the Fast Time Dependent Shortest Path algorithm with messages in multicast wireless sensor
network which is basically similar to a distributed Bellman-Ford algorithm and augmented with a β-synchronizer. β-
synchronizer is a special type of synchronizer which has an initialization phase and after initialization it will select a leader
and the spanning tree is rooted around this leader. Now this leader will check all the leaf nodes in the tree are safe or not, if it
is safe then packets forwarded over the network by sending acknowledgement to all nodes.