Efficient data retrieval in faulty sensor networks using a mobile mule

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

doi:10.23919/WIOPT.2017.7959880

Efficient data retrieval in faulty sensor networks using a mobile mule

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 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 language	English
Title of host publication	2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017
Publisher	Institute of Electrical and Electronics Engineers
ISBN (Electronic)	9783901882906
DOIs	https://doi.org/10.23919/WIOPT.2017.7959880
State	Published - 27 Jun 2017
Event	15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017 - Paris, France Duration: 15 May 2017 → 19 May 2017

Conference

Conference	15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017
Country/Territory	France
City	Paris
Period	15/05/17 → 19/05/17

ASJC Scopus subject areas

Control and Optimization
Modeling and Simulation
Computer Networks and Communications

Access to Document

10.23919/WIOPT.2017.7959880

Cite this

Yedidsion, H., Banik, A., Carmi, P., Katz, M. J., & Segal, M. (2017). Efficient data retrieval in faulty sensor networks using a mobile mule. In 2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017 Article 7959880 Institute of Electrical and Electronics Engineers. https://doi.org/10.23919/WIOPT.2017.7959880

@inproceedings{c0cdecbcd6e249b59082e9da2e39ce0e,

title = "Efficient data retrieval in faulty sensor networks using a mobile mule",

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.",

author = "Harel Yedidsion and Aritra Banik and Paz Carmi and Katz, {Matthew J.} and Michael Segal",

note = "Publisher Copyright: {\textcopyright} 2017 IFIP.; 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017 ; Conference date: 15-05-2017 Through 19-05-2017",

year = "2017",

month = jun,

day = "27",

doi = "10.23919/WIOPT.2017.7959880",

language = "English",

booktitle = "2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

}

Yedidsion, H, Banik, A, Carmi, P , Katz, MJ & Segal, M 2017, Efficient data retrieval in faulty sensor networks using a mobile mule. in 2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017., 7959880, Institute of Electrical and Electronics Engineers, 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017, Paris, France, 15/05/17. https://doi.org/10.23919/WIOPT.2017.7959880

Efficient data retrieval in faulty sensor networks using a mobile mule. / Yedidsion, Harel; Banik, Aritra; Carmi, Paz et al.
2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017. Institute of Electrical and Electronics Engineers, 2017. 7959880.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient data retrieval in faulty sensor networks using a mobile mule

AU - Yedidsion, Harel

AU - Banik, Aritra

AU - Carmi, Paz

AU - Katz, Matthew J.

AU - Segal, Michael

PY - 2017/6/27

Y1 - 2017/6/27

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85026220185&partnerID=8YFLogxK

U2 - 10.23919/WIOPT.2017.7959880

DO - 10.23919/WIOPT.2017.7959880

M3 - Conference contribution

AN - SCOPUS:85026220185

BT - 2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017

PB - Institute of Electrical and Electronics Engineers

T2 - 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2017

Y2 - 15 May 2017 through 19 May 2017

ER -

Efficient data retrieval in faulty sensor networks using a mobile mule

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this