Intelligent Mobile Data Mules for Cost-Effcient Sensor Data Collection

##plugins.themes.academic_pro.article.main##

Prem Prakash Jayaraman
Arkady Zaslavsky
Jerker Delsing

Abstract

Sensor networks represent an important component of distributed pervasive infrastructure. A key challenge facing sensor networks is cost-effcient collection of data streaming from these distributed data sites. In this paper, we present a mobile data mule-based sensor data collection approach employing K-Nearest Neighbours queries. We propose a novel 3D-KNN algorithm that dynamically computes nearest sensors spread within a 3D environment around the data mule. The 3D-KNN algorithm incorporates a novel boundary estimation and neighbour selection algorithm to compute the nearest neighbour set. Further, we propose a neighbour prediction algorithm that computes sensor locations within the vicinity of the data mules' trajectory. We simulate the proposed 3D-KNN algorithm using GlomoSim validating its cost-effciency by extensive evaluations. Results of our simulations conclude the paper.

##plugins.themes.academic_pro.article.details##

How to Cite
Prem Prakash Jayaraman, Arkady Zaslavsky, & Jerker Delsing. (2010). Intelligent Mobile Data Mules for Cost-Effcient Sensor Data Collection. International Journal of Next-Generation Computing, 1(1), 73–90. https://doi.org/10.47164/ijngc.v1i1.6

References

  1. Abbasi, A.A., and Younis, M. 2007. A survey on clustering algorithms for wireless sensor networks.Computer Communications, 30, 2826-2841.
  2. Ahonen, T.T Explaining 4.6 billion mobile phone subscriptions on the planet http : ==communities