Author: Yan, Haotian
Title: New protocols to reduce data aggregation delay for NB-IoT application
Advisors: Ho, Wang Hei (EIE)
Cheng, Chi Tsun (EIE)
Degree: M.Sc.
Year: 2019
Subject: Hong Kong Polytechnic University -- Dissertations
Internet of things
Wireless communication systems
Department: Department of Electronic and Information Engineering
Pages: 55 pages : illustrations
Language: English
Abstract: With the use of Protocol with lower power consumption such as Narrow Band Internet of Thing (NB-IoT) and LoRa, energy consumption problems can be solved in IoT application. However, the data aggregation delay problem should be consider in the data aggregation protocol. In this paper, we propose two protocols based on group division called Wheel-Based Data Aggregation Protocol (WBDAP) and Priority-Based Data Aggregation Protocol (PBDAP). WBDAP is proposed to speed up the data aggregation protocol for all the base stations. However, PBDAP, which considers the priority problem, is proposed to speed up the data aggregation for base stations with high priority. The simulation result shows that the base stations in WBDAP can gather data 33.3% faster than that in Delay-Aware Data Collection Network Structure (DADCNS) when the number of base stations is 3 and the number of nodes in one group is 256. And the base station with highest priority in PBDAP can gather the data 59.3% faster than that in DADCNS when the number of nodes in one group is 256 and the number of base stations is 3.
Rights: All rights reserved
Access: restricted access

Files in This Item:
File Description SizeFormat 
991022270856103411.pdfFor All Users (off-campus access for PolyU Staff & Students only)1.11 MBAdobe PDFView/Open

Copyright Undertaking

As a bona fide Library user, I declare that:

  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.

By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

Show full item record

Please use this identifier to cite or link to this item: