A dynamic broadcast radius-based clustering and routing algorithm for WSN

Abstract

With development of Internet of Things, wireless sensor networks (WSN) become larger and larger and if the present clustering and routing methods are widely used in large scale WSN, “energy hole” problem will deteriorate. To alleviate “energy hole” problem of WSN, a dynamic broadcast radius-based clustering and routing algorithm (DBRCR) is proposed. The algorithm calculates node broadcast radius every round, and based on the broadcast radius the neighbor table is established. Then according to the degrees of nodes, construct clusters iteratively. Finally, finding intra-cluster communication path based on data transmission success rate and routing for the inter-cluster communication based on nodes' residual energy and transmission energy consumption to minimize the data packet-loss rate and prolong the network lifetime.