Abstract
In link state routing algorithms, two schemes are used to reduce the routing overhead, namely the coverage-controlled broadcasting scheme and the efficient broadcasting scheme. However, the coverage-controlled broadcasting scheme introduces sub-optimal routing problems, which prevents the routing algorithms to further reduce the broadcasting overhead. To tackle the problem, we combine the strengths of the coverage-controlled broadcasting scheme and the efficient broadcasting scheme, and propose a Virtual backbone assisted Link State Routing algorithm with Expanding-ring search (VE-LSR). The algorithm reduces the broadcasting overhead by using virtual backbones, which also provide more tolerance to the cost of sub-optimal routing, and reduces the total overhead. The performance of the algorithm is analyzed, and the total cost of the algorithm is obtained by numerical methods.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call