Link Expiration Time and Minimum Distance Spanning Trees based Distributed Data Gathering Algorithms for Wireless Mobile Sensor Networks

Abstract

The high-level contributions of this paper are the design and development of two distributed spanning tree-based data gathering algorithms for wireless mobile sensor networks and their exhaustive simulation study to investigate a complex stability vs. node-network lifetime tradeoff that has been hitherto not explored in the literature. The topology of the mobile sensor networks changes dynamically with time due to random movement of the sensor nodes. Our first data gathering algorithm is stability-oriented and it is based on the idea of finding a maximum spanning tree on a network graph whose edge weights are predicted link expiration times (LET). Referred to as the LET-DG tree, the data gathering tree has been observed to be more stable in the presence of node mobility. However, stability-based data gathering coupled with more leaf nodes has been observed to result in unfair use of certain nodes (the intermediate nodes spend more energy compared to leaf nodes), triggering pre-mature node failures eventually leading to network failure (disconnection of the network of live nodes). As an alternative, we propose an algorithm to determine a minimum-distance spanning tree (MST) based data gathering tree that is more energy-efficient and prolongs the node and network lifetimes, at the cost frequent tree reconfigurations.

Deterministic Static Sensor Node Placement in Wireless Sensor Network based on Territorial Predator Scent Marking Behaviour

“…Coverage ensures the monitoring area is covered by at least one sensor node while connectivity is required to make sure that every sensor node is directly connected to the sink node or indirectly connected to the sink node via any other sensor nodes. Two sensor nodes that are outside the communication range of each other cannot communicate directly [1]. Consequently, connectivity cannot be guaranteed.…”