Efficient data retrieval in faulty sensor networks using a mobile mule

Harel Yedidsion, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this paper, we study the problem of data gathering in ad-hoc sensor networks using a mobile entity called mule. The mule traverses the children of failed sensors, to prevent loss of data. Our objective is to define the optimal communication tree and the mule's placement such that the mule's overall traveling distance is minimized. We explore this problem in several network topologies including: unit disc graph on a line (UDL), general unit disc graph (UDG), and a complete graph with failing probabilities on the nodes (CGFP). We provide an optimal solution for the UDL problem and two approximation algorithms for the UDG problem. For the CGFP problem we outline the two possible structures of an optimal solution and provide near optimal approximation algorithms.

Original languageEnglish
Title of host publication2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9783901882906
DOIs
StatePublished - 27 Jun 2017
Event15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017 - Paris, France
Duration: 15 May 201719 May 2017

Conference

Conference15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017
Country/TerritoryFrance
CityParis
Period15/05/1719/05/17

ASJC Scopus subject areas

  • Control and Optimization
  • Modeling and Simulation
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Efficient data retrieval in faulty sensor networks using a mobile mule'. Together they form a unique fingerprint.

Cite this