Wireless Network Dynamic Topology Routing Protocol Based on Aggregation Tree Model

Abstract

As the scale of the network increases, especially wireless and mobile networks comes into fashion, the problem of network dynamic topology management turns into a focus topic in the network world. When network information changes, frequent route computing and network state updates can cause computing and traffic overhead, respectively. Therefore, minimum of influence to network structure has been identified as one of the key issues in designing dynamic network routing protocols. A novel protocol, which is based on Aggregation Tree Routing Model (ATRM) as well as an effective ball-and-string algorithm, is introduced in this paper which aims to minimize the alteration of network topology and to speed up the minimum cost route computation. This routing protocol is applicable to all kinds of networks, including Internet, ad hoc and wireless sensor networks. The simulations show that our protocol not only results in significantly lower overhead, but also gives high levels of dynamic network topology management performance while keeping practical.