一种在无线传感器网络中使用最近会合点和移动元件进行数据收集的方案

Abdullah Alomari, N. Aslam, W. Phillips, Frank Comeau
{"title":"一种在无线传感器网络中使用最近会合点和移动元件进行数据收集的方案","authors":"Abdullah Alomari, N. Aslam, W. Phillips, Frank Comeau","doi":"10.1109/WD.2014.7020793","DOIUrl":null,"url":null,"abstract":"A variety of wireless sensor network (WSN) applications have been proposed. However, the efficiency of WSNs, as well as their ability to interact with different environments, varies. Many challenges and problems to be solved remain. Overcoming these challenges requires a protocol that will design and provide a highly efficient system, thus helping the WSN to transmit data in a suitable time. In WSNs with Mobile Elements (MEs), the task is first to find an effective way to minimize the length of the tour that the ME follows for data gathering. However, the minimized tour length should still offer access to all nodes in the networks for data collection form the sensor nodes. In this paper, we propose a protocol that results in a shorter ME tour length than previously proposed protocols, using closest rendezvous points (CRPs) distributed throughout the network. Furthermore, this proposed protocol offers access to all nodes inside the network for the exchange of data with the MEs, as facilitated by the suggested CRP algorithm. One or more nodes can be represented by a single CRP that provides connectivity to all of the nodes within its wireless range. In cases where a greater number of MEs are used, less time is required to traverse the network for data gathering. This research demonstrates that the tour time can be reduced significantly by using more than one ME.","PeriodicalId":311349,"journal":{"name":"2014 IFIP Wireless Days (WD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A scheme for using closest rendezvous points and Mobile Elements for data gathering in wireless sensor networks\",\"authors\":\"Abdullah Alomari, N. Aslam, W. Phillips, Frank Comeau\",\"doi\":\"10.1109/WD.2014.7020793\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A variety of wireless sensor network (WSN) applications have been proposed. However, the efficiency of WSNs, as well as their ability to interact with different environments, varies. Many challenges and problems to be solved remain. Overcoming these challenges requires a protocol that will design and provide a highly efficient system, thus helping the WSN to transmit data in a suitable time. In WSNs with Mobile Elements (MEs), the task is first to find an effective way to minimize the length of the tour that the ME follows for data gathering. However, the minimized tour length should still offer access to all nodes in the networks for data collection form the sensor nodes. In this paper, we propose a protocol that results in a shorter ME tour length than previously proposed protocols, using closest rendezvous points (CRPs) distributed throughout the network. Furthermore, this proposed protocol offers access to all nodes inside the network for the exchange of data with the MEs, as facilitated by the suggested CRP algorithm. One or more nodes can be represented by a single CRP that provides connectivity to all of the nodes within its wireless range. In cases where a greater number of MEs are used, less time is required to traverse the network for data gathering. This research demonstrates that the tour time can be reduced significantly by using more than one ME.\",\"PeriodicalId\":311349,\"journal\":{\"name\":\"2014 IFIP Wireless Days (WD)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IFIP Wireless Days (WD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WD.2014.7020793\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IFIP Wireless Days (WD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WD.2014.7020793","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

各种各样的无线传感器网络(WSN)应用已经被提出。然而,无线传感器网络的效率以及它们与不同环境交互的能力是不同的。还有许多挑战和问题有待解决。克服这些挑战需要一个协议来设计和提供一个高效的系统,从而帮助WSN在适当的时间内传输数据。在具有移动元素的wsn中,任务首先是找到一种有效的方法来最小化移动元素在收集数据时所遵循的行程长度。然而,最小的行程长度应该仍然能够访问网络中的所有节点,以便从传感器节点收集数据。在本文中,我们提出了一种协议,该协议使用分布在整个网络中的最近会合点(CRPs),比以前提出的协议产生更短的ME巡回长度。此外,该提议的协议提供了访问网络内所有节点的机会,以便与MEs交换数据,正如建议的CRP算法所促进的那样。一个或多个节点可以由一个CRP表示,该CRP提供与其无线范围内所有节点的连接。在使用大量MEs的情况下,遍历网络进行数据收集所需的时间更少。本研究表明,使用多个ME可以显著缩短行程时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A scheme for using closest rendezvous points and Mobile Elements for data gathering in wireless sensor networks
A variety of wireless sensor network (WSN) applications have been proposed. However, the efficiency of WSNs, as well as their ability to interact with different environments, varies. Many challenges and problems to be solved remain. Overcoming these challenges requires a protocol that will design and provide a highly efficient system, thus helping the WSN to transmit data in a suitable time. In WSNs with Mobile Elements (MEs), the task is first to find an effective way to minimize the length of the tour that the ME follows for data gathering. However, the minimized tour length should still offer access to all nodes in the networks for data collection form the sensor nodes. In this paper, we propose a protocol that results in a shorter ME tour length than previously proposed protocols, using closest rendezvous points (CRPs) distributed throughout the network. Furthermore, this proposed protocol offers access to all nodes inside the network for the exchange of data with the MEs, as facilitated by the suggested CRP algorithm. One or more nodes can be represented by a single CRP that provides connectivity to all of the nodes within its wireless range. In cases where a greater number of MEs are used, less time is required to traverse the network for data gathering. This research demonstrates that the tour time can be reduced significantly by using more than one ME.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信