Shortest Path Solution to Wireless Sensor Networks Using Edge-Based Three-Point Steiner Tree Concept

摘要

Wireless sensor networks have gained immense significance and popularity in modern technology especially as a result of emerging concepts like the Internet of Things (IoT). These networks are usually under constant pressure to scale-up in order to meet the ever-growing demand. Under such situations, it is often required to connect two existing adjacent, but independent, networks so that they form a single larger network. Some of the networks may even have mobile nodes. This paper proposes an effective method for placing a bridge node in the intersection of coverage region of two networks using a combination of Steiner tree algorithm and concept of edge nodes-Edge-based Three-Point Steiner (EdTPS) tree-such that communication across the network can be carried out with the shortest possible path.