The effect of outliers in the design of data gathering tours

Khaled Almiani, Sanjay Chawla, Anastasios Viglas

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

1 Citation (Scopus)

Abstract

We consider the problem of designing a tour for a mobile element in data producing sensor networks. The tour is designed to visit a subset of the nodes, chosen for their centrality in the network. This way the sensors that are not visited by the mobile element will need to transmit their data wirelessly. This may require several hops and therefore may reduce the lifetime of the network. The most common optimization objective for these data gathering problems is to minimize the amount of wireless transmission. For networks with relatively uniform density of nodes, there are several heuristics that work well in practice. However, if there are nodes that are placed far from the central locations of the network, then most proposed algorithms will end up designing a tour that may be skewed towards the outlier nodes. In this work we quantify the effect of outliers in the design of data gathering tours in wireless networks, and propose the use of an algorithm from data mining to address this problem. We provide experimental evidence that the tour planning algorithms that takes into account outliers can significantly improve the solution.

Original languageEnglish
Title of host publicationProceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP
PublisherIEEE Computer Society
Pages209-214
Number of pages6
ISBN (Print)9781479938445
DOIs
Publication statusPublished - 3 Oct 2014
Externally publishedYes
Event6th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2014 - Beijing
Duration: 13 Jul 201415 Jul 2014

Other

Other6th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2014
CityBeijing
Period13/7/1415/7/14

Fingerprint

Sensor networks
Data mining
Wireless networks
Planning
Sensors

Keywords

  • Data gathering
  • Mobile elements
  • Outlier detection
  • Path planning
  • Wireless network routing

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture

Cite this

Almiani, K., Chawla, S., & Viglas, A. (2014). The effect of outliers in the design of data gathering tours. In Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP (pp. 209-214). [6916466] IEEE Computer Society. https://doi.org/10.1109/PAAP.2014.23

The effect of outliers in the design of data gathering tours. / Almiani, Khaled; Chawla, Sanjay; Viglas, Anastasios.

Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP. IEEE Computer Society, 2014. p. 209-214 6916466.

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

Almiani, K, Chawla, S & Viglas, A 2014, The effect of outliers in the design of data gathering tours. in Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP., 6916466, IEEE Computer Society, pp. 209-214, 6th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2014, Beijing, 13/7/14. https://doi.org/10.1109/PAAP.2014.23
Almiani K, Chawla S, Viglas A. The effect of outliers in the design of data gathering tours. In Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP. IEEE Computer Society. 2014. p. 209-214. 6916466 https://doi.org/10.1109/PAAP.2014.23
Almiani, Khaled ; Chawla, Sanjay ; Viglas, Anastasios. / The effect of outliers in the design of data gathering tours. Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP. IEEE Computer Society, 2014. pp. 209-214
@inproceedings{7da90e2bce0641e2862703baafd4d878,
title = "The effect of outliers in the design of data gathering tours",
abstract = "We consider the problem of designing a tour for a mobile element in data producing sensor networks. The tour is designed to visit a subset of the nodes, chosen for their centrality in the network. This way the sensors that are not visited by the mobile element will need to transmit their data wirelessly. This may require several hops and therefore may reduce the lifetime of the network. The most common optimization objective for these data gathering problems is to minimize the amount of wireless transmission. For networks with relatively uniform density of nodes, there are several heuristics that work well in practice. However, if there are nodes that are placed far from the central locations of the network, then most proposed algorithms will end up designing a tour that may be skewed towards the outlier nodes. In this work we quantify the effect of outliers in the design of data gathering tours in wireless networks, and propose the use of an algorithm from data mining to address this problem. We provide experimental evidence that the tour planning algorithms that takes into account outliers can significantly improve the solution.",
keywords = "Data gathering, Mobile elements, Outlier detection, Path planning, Wireless network routing",
author = "Khaled Almiani and Sanjay Chawla and Anastasios Viglas",
year = "2014",
month = "10",
day = "3",
doi = "10.1109/PAAP.2014.23",
language = "English",
isbn = "9781479938445",
pages = "209--214",
booktitle = "Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - The effect of outliers in the design of data gathering tours

AU - Almiani, Khaled

AU - Chawla, Sanjay

AU - Viglas, Anastasios

PY - 2014/10/3

Y1 - 2014/10/3

N2 - We consider the problem of designing a tour for a mobile element in data producing sensor networks. The tour is designed to visit a subset of the nodes, chosen for their centrality in the network. This way the sensors that are not visited by the mobile element will need to transmit their data wirelessly. This may require several hops and therefore may reduce the lifetime of the network. The most common optimization objective for these data gathering problems is to minimize the amount of wireless transmission. For networks with relatively uniform density of nodes, there are several heuristics that work well in practice. However, if there are nodes that are placed far from the central locations of the network, then most proposed algorithms will end up designing a tour that may be skewed towards the outlier nodes. In this work we quantify the effect of outliers in the design of data gathering tours in wireless networks, and propose the use of an algorithm from data mining to address this problem. We provide experimental evidence that the tour planning algorithms that takes into account outliers can significantly improve the solution.

AB - We consider the problem of designing a tour for a mobile element in data producing sensor networks. The tour is designed to visit a subset of the nodes, chosen for their centrality in the network. This way the sensors that are not visited by the mobile element will need to transmit their data wirelessly. This may require several hops and therefore may reduce the lifetime of the network. The most common optimization objective for these data gathering problems is to minimize the amount of wireless transmission. For networks with relatively uniform density of nodes, there are several heuristics that work well in practice. However, if there are nodes that are placed far from the central locations of the network, then most proposed algorithms will end up designing a tour that may be skewed towards the outlier nodes. In this work we quantify the effect of outliers in the design of data gathering tours in wireless networks, and propose the use of an algorithm from data mining to address this problem. We provide experimental evidence that the tour planning algorithms that takes into account outliers can significantly improve the solution.

KW - Data gathering

KW - Mobile elements

KW - Outlier detection

KW - Path planning

KW - Wireless network routing

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

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

U2 - 10.1109/PAAP.2014.23

DO - 10.1109/PAAP.2014.23

M3 - Conference contribution

SN - 9781479938445

SP - 209

EP - 214

BT - Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP

PB - IEEE Computer Society

ER -