Collecting data in ad-hoc networks with reduced uncertainty

Liron Levin, Alon Efrat, Michael Segal

Research output: Contribution to journalArticle

13 Citations (Scopus)

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 information as possible thereby reducing the information uncertainty but in the same time avoid visiting some of the nodes to minimize its travel distance. We study the problem when the mule travels over a tree or a tour and propose a 3-approximation algorithm that minimizes both the information uncertainty and travel distance. We also show the applicability of our approach for solving data collection problems in varying domains such as temperature monitoring, surveillance systems and sensor placement. Simulation results show that the proposed solution converges to the optimal for varying set of topologies, such as grids, stars, linear and random networks.

Original languageEnglish (US)
Pages (from-to)71-81
Number of pages11
JournalAd Hoc Networks
Volume17
DOIs
StatePublished - Jun 2014

Fingerprint

Ad hoc networks
Wireless ad hoc networks
Sensors
Approximation algorithms
Stars
Topology
Monitoring
Temperature
Uncertainty

Keywords

  • Approximation algorithm
  • Data gathering
  • Mule traversal
  • Optimization

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

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

In: Ad Hoc Networks, Vol. 17, 06.2014, p. 71-81.

Research output: Contribution to journalArticle

Levin, Liron ; Efrat, Alon ; Segal, Michael. / Collecting data in ad-hoc networks with reduced uncertainty. In: Ad Hoc Networks. 2014 ; Vol. 17. pp. 71-81.
@article{a81b7cab26df468b88239bc973e2c8e7,
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 information as possible thereby reducing the information uncertainty but in the same time avoid visiting some of the nodes to minimize its travel distance. We study the problem when the mule travels over a tree or a tour and propose a 3-approximation algorithm that minimizes both the information uncertainty and travel distance. We also show the applicability of our approach for solving data collection problems in varying domains such as temperature monitoring, surveillance systems and sensor placement. Simulation results show that the proposed solution converges to the optimal for varying set of topologies, such as grids, stars, linear and random networks.",
keywords = "Approximation algorithm, Data gathering, Mule traversal, Optimization",
author = "Liron Levin and Alon Efrat and Michael Segal",
year = "2014",
month = "6",
doi = "10.1016/j.adhoc.2014.01.005",
language = "English (US)",
volume = "17",
pages = "71--81",
journal = "Ad Hoc Networks",
issn = "1570-8705",
publisher = "Elsevier",

}

TY - JOUR

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

AU - Levin, Liron

AU - Efrat, Alon

AU - Segal, Michael

PY - 2014/6

Y1 - 2014/6

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 information as possible thereby reducing the information uncertainty but in the same time avoid visiting some of the nodes to minimize its travel distance. We study the problem when the mule travels over a tree or a tour and propose a 3-approximation algorithm that minimizes both the information uncertainty and travel distance. We also show the applicability of our approach for solving data collection problems in varying domains such as temperature monitoring, surveillance systems and sensor placement. Simulation results show that the proposed solution converges to the optimal 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 information as possible thereby reducing the information uncertainty but in the same time avoid visiting some of the nodes to minimize its travel distance. We study the problem when the mule travels over a tree or a tour and propose a 3-approximation algorithm that minimizes both the information uncertainty and travel distance. We also show the applicability of our approach for solving data collection problems in varying domains such as temperature monitoring, surveillance systems and sensor placement. Simulation results show that the proposed solution converges to the optimal for varying set of topologies, such as grids, stars, linear and random networks.

KW - Approximation algorithm

KW - Data gathering

KW - Mule traversal

KW - Optimization

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

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

U2 - 10.1016/j.adhoc.2014.01.005

DO - 10.1016/j.adhoc.2014.01.005

M3 - Article

VL - 17

SP - 71

EP - 81

JO - Ad Hoc Networks

JF - Ad Hoc Networks

SN - 1570-8705

ER -