ABSTRACT
Many factors are attributed to the wide use of Wireless Sensor Networks (WSNs) in today's applications and across different environments. This chapter explores the problem of federating grid-based WSNs in forestry applications. It presents a relay-based approach, called Fixing Augmented network Damage Intelligently (FADI), using the minimum spanning tree algorithm. The performance of FADI is compared to the two approaches. The first algorithm forms a minimum spanning tree without considering the intersections of the irregular communication range and it is called as the Minimum Spanning Tree Approach (MSTA). The second is for solving a Steiner tree problem with the minimum number of Steiner points, and it is called as the Steiner with Minimum Steiner Points (SwMSP). The chapter compares the network as a heterogeneous WSN with two tiers. The first is formed by functional nodes and the second is a layer of Relay Nodes (RNs) which establish long-range communication across the network and to the sink.
