A routing algorithm for region division based on virtual spider web model

Abstract

A disjoint multipath routing algorithm based on region division is proposed to resolve problems such as potential “hot area” around the sink node and path instability caused by frequent movement of routing nodes in the mobile wireless sensor network. This paper first improves the regional division model of the whole network by learning from the predation of spiders, and increases the number of nodes in the inner area by enlarging the width of the inner ring to alleviate the “hot area” problem. Then, three modes based on distance priority, angle priority, and weight priority are proposed to ensure the independence between the paths when generating the disjoint multipath of the mobile node in a certain divided area. Meanwhile, the method of selecting “borrowing node” with minimum weights is adopted to ensure the effectiveness of the path and deal with the path link break problem. Simulation experiments show that the proposed algorithm has a lower packet loss rate and path failure rate than EM-GMR and AGEM algorithms, which effectively prolongs the lifetime of the entire network and is more applicable to networks with dense nodes.