English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A mobile sensor network is a wireless network of sensor nodes that movearbitrarily. In this paper, we explore the use of a maximum stability spanningtree-based data gathering (Max.Stability-DG) algorithm and a minimum-distancespanning tree-based data gathering (MST-DG) algorithm for mobile sensornetworks. We analyze the impact of these two algorithms on the node failuretimes and the resulting coverage loss due to node failures. Both theMax.Stability-DG and MST-DG algorithms are based on a greedy strategy ofdetermining a data gathering tree when one is needed and using that tree aslong as it exists. The Max.Stability-DG algorithm assumes the availability ofthe complete knowledge of future topology changes and determines a datagathering tree whose corresponding spanning tree would exist for the longesttime since the current time instant; whereas, the MST-DG algorithm determines adata gathering tree whose corresponding spanning tree is the minimum distancetree at the current time instant. We observe the Max.Stability-DG trees toincur a longer network lifetime (time of disconnection of the network of livesensor nodes due to node failures), a larger coverage loss time for aparticular fraction of loss of coverage as well as a lower fraction of coverageloss at any time. The tradeoff is that the Max.Stability-DG trees incur a lowernode lifetime (the time of first node failure) due to repeated use of a datagathering tree for a longer time.

international journal of computer networks and communications

Node Failure Time and Coverage Loss Time Analysis for Maximum Stability  Vs Minimum Distance Spanning Tree based Data Gathering in Mobile Sensor  Networks