Mobile Element Path Planning for Gathering Transit-Time Constrained Data

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI:10.1109/PDCAT.2011.53

Khaled Almiani, Anastasios Viglas, M. Aalsalem

{"title":"Mobile Element Path Planning for Gathering Transit-Time Constrained Data","authors":"Khaled Almiani, Anastasios Viglas, M. Aalsalem","doi":"10.1109/PDCAT.2011.53","DOIUrl":null,"url":null,"abstract":"In this paper we investigate the problem of gathering the data in wireless sensor network using a single Mobile Element. In particular we consider the case where the data are produced by measurements and they need to be delivered to a predefined sink within a given time interval from the time the measurement takes place. A mobile element travels the network in predefined paths, collect the data from the nodes, and deliver them to the sink by a single long-distance transmission. In this problem, the length of the mobile element path is bounded by pre-determined length. This path will visit a subset of the nodes. These selected nodes will work as caching points and will aggregate the other nodes' data. The caching point nodes are selected with the aim of reducing the energy expenditures due to multi-hop forwarding. We provide a heuristic-based solution for this problem. We evaluate the performance of our algorithm by comparing it to the optimal solution as well as the best well-known algorithms from the literature.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2011.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

Abstract

In this paper we investigate the problem of gathering the data in wireless sensor network using a single Mobile Element. In particular we consider the case where the data are produced by measurements and they need to be delivered to a predefined sink within a given time interval from the time the measurement takes place. A mobile element travels the network in predefined paths, collect the data from the nodes, and deliver them to the sink by a single long-distance transmission. In this problem, the length of the mobile element path is bounded by pre-determined length. This path will visit a subset of the nodes. These selected nodes will work as caching points and will aggregate the other nodes' data. The caching point nodes are selected with the aim of reducing the energy expenditures due to multi-hop forwarding. We provide a heuristic-based solution for this problem. We evaluate the performance of our algorithm by comparing it to the optimal solution as well as the best well-known algorithms from the literature.

查看原文本刊更多论文

移动单元路径规划收集传输时间约束数据

本文研究了在无线传感器网络中使用单个移动元件进行数据采集的问题。我们特别考虑这样一种情况，即数据是由测量产生的，并且需要在测量发生后的给定时间间隔内传递到预定义的接收器。移动元件以预定义的路径在网络中移动，从节点收集数据，并通过一次远距离传输将数据传送到接收器。在这个问题中，移动元素路径的长度由预先确定的长度限定。该路径将访问节点的一个子集。这些选定的节点将用作缓存点，并将聚合其他节点的数据。选择缓存点节点的目的是为了减少多跳转发带来的能量消耗。我们为这个问题提供了一个基于启发式的解决方案。我们通过将算法与最优解以及文献中最知名的算法进行比较来评估算法的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies

自引率

0.00%

发文量