Adaptive redundancy for data propagation exploiting dynamic sensory mobility

Athanasios Kinalis, Sotiris Nikoletseas · 2008

Motivated by emerging applications, we consider sensor net-works where the sensors themselves (not just the sinks) are mobile. Furthermore, we focus on mobility scenarios char-acterized by heterogeneous, highly changing mobility roles in the network. To capture these high dynamics of diverse sensory motion we propose a novel network parameter, the mobility level, which, although simple and local, quite accu-rately takes into account both the spatial and speed charac-teristics of motion. We then propose adaptive data dissem-ination protocols that use the mobility level estimation to optimize performance, by basically exploiting high mobility (redundant message ferrying) as a cost-effective replacement of flooding, e.g., the sensors tend to dynamically propagate less data in the presence of high mobility, while nodes of high mobility are favored for moving data around. These dissem-ination schemes are enhanced by a distance-sensitive proba-bilistic message flooding inhibition mechanism that further reduces communication cost, especially for fast nodes of high mobility level, and as distance to data destination decreases. Our simulation findings demonstrate significant performance gains of our protocols compared to non-adaptive protocols, i.e., adaptation increases the success rate and reduces la-tency (even by 15%) while at the same time significantly reducing energy dissipation (in most cases by even 40%). Also, our adaptive schemes achieve significantly higher mes-sage delivery ratio and satisfactory energy-latency trade-offs when compared to flooding when sensor nodes have limited message queues. Categories and Subject Descriptors: C.2.1 [Network

Read the paper · More papers on PaperTik