Skip navigation
  • 中文
  • English

DSpace CRIS

  • DSpace logo
  • Home
  • Research Outputs
  • Researchers
  • Organizations
  • Projects
  • Explore by
    • Research Outputs
    • Researchers
    • Organizations
    • Projects
  • Communities & Collections
  • SDGs
  • Sign in
  • 中文
  • English
  1. National Taiwan Ocean University Research Hub
  2. 電機資訊學院
  3. 資訊工程學系
Please use this identifier to cite or link to this item: http://scholars.ntou.edu.tw/handle/123456789/20272
DC FieldValueLanguage
dc.contributor.authorChien-Fu Chengen_US
dc.contributor.authorChao-Fu Yuen_US
dc.date.accessioned2022-02-11T03:15:46Z-
dc.date.available2022-02-11T03:15:46Z-
dc.date.issued2018-06-06-
dc.identifier.issn2327-4662-
dc.identifier.urihttp://scholars.ntou.edu.tw/handle/123456789/20272-
dc.description.abstractSensing data gathering is an important and fundamental issue in the Internet of Things. However, for battery-powered sensors, energy depletion is unavoidable. Using mobile sinks to collect sensing data by one-hop transmission is an effective way to prolong the lifetime of wireless sensor networks but will inevitably cause an excessive long delay time of data gathering. In order to reduce the delay time of mobile data gathering, it is necessary to incorporate multihop transmission into mobile data gathering. In this paper, a new mobile data gathering algorithm with multihop transmission is proposed to reduce the delay time of data gathering. The proposed algorithm is called the bounded relay combine-TSP-reduce (BR-CTR). The BR-CTR algorithm visits the convergence area of sensors' communication ranges to reduce the number of visiting points. The BR-CTR algorithm is integrated with a path adjustment mechanism, which can further shorten the planned traveling path effectively. In performance evaluation, we compare the BR-CTR algorithm not only with the existing mobile data gathering algorithms with onehop transmission but also with the existing mobile data gathering algorithms with multihop transmission in terms of the length of traveling path, delay time, network lifetime, and buffer size requirement. Experimental results indicate that the proposed algorithm has high performance on all the above-mentioned indices.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.relation.ispartofIEEE Internet of Things Journalen_US
dc.subjectRelaysen_US
dc.subjectWireless sensor networksen_US
dc.subjectSensor phenomena and characterizationen_US
dc.subjectInternet of Thingsen_US
dc.subjectApproximation algorithmsen_US
dc.subjectSignal processing algorithmsen_US
dc.subjectInternet of Things (IoT)en_US
dc.subjectmobile data gatheringen_US
dc.subjectrelay hop bounden_US
dc.subjecttraveling pathen_US
dc.titleMobile Data Gathering with Bounded Relay in Wireless Sensor Networksen_US
dc.typejournal articleen_US
dc.identifier.doi10.1109/JIOT.2018.2844680-
dc.identifier.isiWOS:000450251900059-
dc.relation.journalvolume5en_US
dc.relation.journalissue5en_US
dc.relation.pages3891-3907en_US
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.cerifentitytypePublications-
item.languageiso639-1en-
item.fulltextno fulltext-
item.grantfulltextnone-
item.openairetypejournal article-
crisitem.author.deptDepartment of Computer Science and Engineering-
crisitem.author.deptCollege of Electrical Engineering and Computer Science-
crisitem.author.deptNational Taiwan Ocean University,NTOU-
crisitem.author.parentorgCollege of Electrical Engineering and Computer Science-
crisitem.author.parentorgNational Taiwan Ocean University,NTOU-
Appears in Collections:資訊工程學系
Show simple item record

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
2
checked on Jun 27, 2023

Page view(s)

166
Last Week
0
Last month
1
checked on Jun 30, 2025

Google ScholarTM

Check

Altmetric

Altmetric

Related Items in TAIR


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Explore by
  • Communities & Collections
  • Research Outputs
  • Researchers
  • Organizations
  • Projects
Build with DSpace-CRIS - Extension maintained and optimized by Logo 4SCIENCE Feedback