Browsing by Author "Huang, Teng-Wei"

Now showing 1 - 2 of 2

Give Me a Hint: An ID-Free Small Data Transmission Protocol for Dense IoT Devices
(2017-01-01)
Ren, Yi
;
Wu, Ren-Jie
;
Huang, Teng-Wei
;
Tseng, Yu-Chee
;
資訊工程學系
IoT (Internet of Things) has attracted a lot of attention recently. IoT devices need to report their data or status to base stations at various frequencies. The IoT communications observed by a base station normally exhibit the following characteristics: (1) massively connected, (2) lightly loaded per packet, and (3) periodical or at least mostly predictable. The current design principals of communication networks, when applied to IoT scenarios, however, do not fit well to these requirements. For example, an IPv6 address is 128 bits, which is much longer than a 16-bit temperature report. Also, contending to send a small packet is not cost-effective. In this work, we propose a novel framework, which is slot-based, schedule-oriented, and identity-free for uploading IoT devices' data. We show that it fits very well for IoT applications. The main idea is to bundle time slots with certain hashing functions of device IDs, thus significantly reducing transmission overheads, including device IDs and contention overheads. The framework is applicable from small-scale body-area (wearable) networks to large-scale massively connected IoT networks. Our simulation results verify that this framework is very effective for IoT small data uploading.
r-Hint: A Message-Efficient Random Access Response for mMTC in 5G Networks
(2017-01-01)
Huang, Teng-Wei
;
Ren, Yi
;
Lin, Kate Ching-Ju
;
Tseng, Yu-Chee
;
資訊工程學系
Massive Machine Type Communication (mMTC) has attracted increasing attention due to the explosive growth of IoT devices. Random Access (RA) for a large number of mMTC devices is especially difficult since the high signaling overhead between User Equipments (UEs) and an eNB may overwhelm the available spectrum resources. To address this issue, we propose "respond by hint" (r-Hint), an ID-free handshaking protocol for contention-based RA in mMTC. The core idea of r-Hint is to avoid sequentially notifying contending UEs of their IDs by broadcasting a hint in the RA Response (RAR). To do so, we exploit the concept of prime factorization and hashing to encode the hint such that UEs can extract their required information accordingly. Our simulation results show that r-Hint reduces the RAR message size by 20%-40%. Such reduction can be translated to around 50% improvement of spectrum efficiency in LTE-M.