Spanning-Tree-Based Position-Based Routing in WSNs

Abstract

This paper presents the spanning-tree-based position-based routing (STBPR) algorithm that finds the best path from source to destination. In wireless sensor networks (WSNs), sensor nodes are densely deployed in the area and intermediate nodes collaborate in forwarding the packets toward the destination. In flooding, there are unnecessary transmissions that increase the overhead on the overall network. The proposed routing algorithm uses the position of the nodes, and based on the position, it uses directional routing (DIR) greedy routing approach that restricts the flooding. The main objective is to design an efficient algorithm that finds a shortest path, by avoiding the unnecessary transmissions. In this routing algorithm, we are using the concept of maximum spanning tree (MST) in each zone. The area is divided into a number of zones and finds a MST in each zone that reduces the number of links in a zone.