Collecting data in ad-hoc networks with reduced uncertainty

Liron Levin, Alon Efrat, Michael Segal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the data gathering problem in wireless ad-hoc networks where a data mule traverses a set of sensors, each with vital information on its surrounding, and collects their data. The mule goal is to collect as much data as possible, thereby reducing the information uncertainty, while minimizing its travel distance. We show that the problem is solvable by a generalized version of the Prize Collecting Steiner Tree Problem, and present a dual-primal 6-approximation algorithm for solving it. Simulation results show that the proposed schema converges to the optimal results for varying set of topologies, such as grids, stars, linear and random networks.

Original languageEnglish (US)
Title of host publication2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013
Pages659-666
Number of pages8
StatePublished - 2013
Event2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013 - Tsukuba Science City, Japan
Duration: May 13 2013May 17 2013

Other

Other2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013
CountryJapan
CityTsukuba Science City
Period5/13/135/17/13

Fingerprint

Wireless ad hoc networks
Approximation algorithms
Ad hoc networks
Ad Hoc Networks
Stars
Topology
Uncertainty
Sensors
Primal-dual Algorithm
Steiner Tree Problem
Wireless Ad Hoc Networks
Random Networks
Schema
Approximation Algorithms
Star
Grid
Converge
Sensor
Simulation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Modeling and Simulation

Cite this

Levin, L., Efrat, A., & Segal, M. (2013). Collecting data in ad-hoc networks with reduced uncertainty. In 2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013 (pp. 659-666). [6576418]

Collecting data in ad-hoc networks with reduced uncertainty. / Levin, Liron; Efrat, Alon; Segal, Michael.

2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013. 2013. p. 659-666 6576418.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Levin, L, Efrat, A & Segal, M 2013, Collecting data in ad-hoc networks with reduced uncertainty. in 2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013., 6576418, pp. 659-666, 2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013, Tsukuba Science City, Japan, 5/13/13.
Levin L, Efrat A, Segal M. Collecting data in ad-hoc networks with reduced uncertainty. In 2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013. 2013. p. 659-666. 6576418
Levin, Liron ; Efrat, Alon ; Segal, Michael. / Collecting data in ad-hoc networks with reduced uncertainty. 2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013. 2013. pp. 659-666
@inproceedings{d85218a0a03f4029ab4d39b66665f311,
title = "Collecting data in ad-hoc networks with reduced uncertainty",
abstract = "We consider the data gathering problem in wireless ad-hoc networks where a data mule traverses a set of sensors, each with vital information on its surrounding, and collects their data. The mule goal is to collect as much data as possible, thereby reducing the information uncertainty, while minimizing its travel distance. We show that the problem is solvable by a generalized version of the Prize Collecting Steiner Tree Problem, and present a dual-primal 6-approximation algorithm for solving it. Simulation results show that the proposed schema converges to the optimal results for varying set of topologies, such as grids, stars, linear and random networks.",
author = "Liron Levin and Alon Efrat and Michael Segal",
year = "2013",
language = "English (US)",
isbn = "9783901882548",
pages = "659--666",
booktitle = "2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013",

}

TY - GEN

T1 - Collecting data in ad-hoc networks with reduced uncertainty

AU - Levin, Liron

AU - Efrat, Alon

AU - Segal, Michael

PY - 2013

Y1 - 2013

N2 - We consider the data gathering problem in wireless ad-hoc networks where a data mule traverses a set of sensors, each with vital information on its surrounding, and collects their data. The mule goal is to collect as much data as possible, thereby reducing the information uncertainty, while minimizing its travel distance. We show that the problem is solvable by a generalized version of the Prize Collecting Steiner Tree Problem, and present a dual-primal 6-approximation algorithm for solving it. Simulation results show that the proposed schema converges to the optimal results for varying set of topologies, such as grids, stars, linear and random networks.

AB - We consider the data gathering problem in wireless ad-hoc networks where a data mule traverses a set of sensors, each with vital information on its surrounding, and collects their data. The mule goal is to collect as much data as possible, thereby reducing the information uncertainty, while minimizing its travel distance. We show that the problem is solvable by a generalized version of the Prize Collecting Steiner Tree Problem, and present a dual-primal 6-approximation algorithm for solving it. Simulation results show that the proposed schema converges to the optimal results for varying set of topologies, such as grids, stars, linear and random networks.

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

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

M3 - Conference contribution

AN - SCOPUS:84883182239

SN - 9783901882548

SP - 659

EP - 666

BT - 2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013

ER -