Data Gathering with Minimum Number of Relay Packets in Wireless Sensor Networks

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/111923

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/111923

题名:	Data Gathering with Minimum Number of Relay Packets in Wireless Sensor Networks
作者:	Cheng, Chien-Fu;Li, Lung-Hao;Wang, Chen-Chuan
关键词:	Sensors;Mobile communication;Wireless sensor networks;Relays;Delays;Energy consumption;Batteries
日期:	2017-11
上传时间:	2017-11-01 02:10:32 (UTC+8)
摘要:	The data gathering problem is an important issue in wireless sensor networks (WSNs). In general, mobile elements are used to collect the sensed data of sensors to reduce the problem of unbalanced energy consumption caused by multi-hop transmission. However, in time-sensitive applications of WSNs where mobile elements are used to collect time-sensitive data, we must pay particular attention to the length of the traveling path to ensure that data are still useful after delivered to the sink. In this paper, we focus on how to plan a traveling path that meets the delay requirement of time-sensitive applications for data collection and reduces the amount of relay packets in the WSNs. The proposed algorithm is called Timeliness Traveling Path Planning (TTPP) algorithm. Based on the least squares curve approach, the proposed TTPP algorithm can find the best-fitting curve for any given set of sensors by reducing the amount of relay packets in the WSNs. The effectiveness of the proposed TTPP algorithm is confirmed through extensive simulations.
關聯:	IEEE Sensors Journal 17(21), p.7196 - 7208
DOI:	10.1109/JSEN.2017.2750768
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
Data Gathering With Minimum Number of Relay Packets in Wireless Sensor Networks.pdf		5508Kb	Adobe PDF	2	检视/开启
index.html		0Kb	HTML	205	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章