Efficient Multicast Routing Algorithms for Scalable Wireless Network

Abstract

Maintaining the day to day scaling network nodes is challenge. The existing hierarchical and non hierarchical is handling the growing network nodes randomly with overhead of recursive logic with repeaters and power consumption which comes at cost. The span of individual network which is a cluster of nodes is limited, if there are multiple individual networks which are grouped together, then forms the non- hierarchical structure. The existing algorithms to link the source with the destination is purely random propagation, which uses more number of repeater nodes and looping leading to the consumption more power, which is redundant. To overcome the overhead of purely random propagation algorithm , there came another algorithm called non repetitive random propagation ,which uses the concept of distant repeaters ,which also creates redundancy .