周期性传感器应用的数据采集

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

Khaled Almiani, M. Aalsalem, Rafeeq Al-Hashemi

{"title":"周期性传感器应用的数据采集","authors":"Khaled Almiani, M. Aalsalem, Rafeeq Al-Hashemi","doi":"10.1109/PDCAT.2011.34","DOIUrl":null,"url":null,"abstract":"In this paper we consider the problem of data gathering in wireless sensor network using Mobile Elements. In particular, we consider the situations where the data produced by the nodes must be delivered to the sink within a pre-defined time interval. Mobile elements travel the network and collect the data of nodes, and deliver them to the sink. Each node must be visited by a mobile element, which then must deliver this node data to the sink with the given time interval. The goal is to plan the tours of the mobile elements that minimize the total travelling time. Several variations of this problem have been investigated in the literature. We propose an algorithmic solution that outperforms that best known comparable scheme for this problem by an average of 40%.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Data Gathering for Periodic Sensor Applications\",\"authors\":\"Khaled Almiani, M. Aalsalem, Rafeeq Al-Hashemi\",\"doi\":\"10.1109/PDCAT.2011.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the problem of data gathering in wireless sensor network using Mobile Elements. In particular, we consider the situations where the data produced by the nodes must be delivered to the sink within a pre-defined time interval. Mobile elements travel the network and collect the data of nodes, and deliver them to the sink. Each node must be visited by a mobile element, which then must deliver this node data to the sink with the given time interval. The goal is to plan the tours of the mobile elements that minimize the total travelling time. Several variations of this problem have been investigated in the literature. We propose an algorithmic solution that outperforms that best known comparable scheme for this problem by an average of 40%.\",\"PeriodicalId\":137617,\"journal\":{\"name\":\"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"volume\":\"61 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.34\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文研究了基于移动元素的无线传感器网络数据采集问题。特别是，我们考虑了节点产生的数据必须在预定义的时间间隔内传递到接收器的情况。移动单元在网络中穿行，收集节点的数据，并将其传送到接收器。每个节点必须由一个移动元素访问，然后该元素必须按照给定的时间间隔将该节点数据传递到接收器。目标是规划移动元素的旅行，使总旅行时间最小化。这个问题的几个变体已经在文献中进行了研究。我们提出了一个算法解决方案，它比这个问题上最著名的可比方案平均高出40%。

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

查看原文本刊更多论文

Data Gathering for Periodic Sensor Applications

In this paper we consider the problem of data gathering in wireless sensor network using Mobile Elements. In particular, we consider the situations where the data produced by the nodes must be delivered to the sink within a pre-defined time interval. Mobile elements travel the network and collect the data of nodes, and deliver them to the sink. Each node must be visited by a mobile element, which then must deliver this node data to the sink with the given time interval. The goal is to plan the tours of the mobile elements that minimize the total travelling time. Several variations of this problem have been investigated in the literature. We propose an algorithmic solution that outperforms that best known comparable scheme for this problem by an average of 40%.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量