Browsing by Author "Wu, Kun-Ru"

Now showing 1 - 20 of 21

A Survey of Intelligent Video Surveillance Systems: History, Applications and Future
(2015-01-01)
Fan, Chung-Shuo
;
Liang, Jia-Ming
;
Lin, Yi-Ting
;
Wu, Kun-Ru
;
Li, Kuan-Yi
With advances in wireless network infrastructure providing powerful support for surveillance video communications, it is practical to meet the needs of intelligent surveillance systems in a wide range of applications. This survey offers a comprehensive overview of state-of-the-art technologies for intelligent video surveillance systems so as to provide researchers in this field with a summary of the progress achieved to date. The evolution of surveillance systems is outlined as well. In addition, the representative technologies for environment modeling, object classification, object tracking, behavioral analysis, and database implementation are summarized. Finally, we list several detailed discussions on possible future research directions.
A Web-based Camera Dispatch System for Video Surveillance with Dynamic Requirements
(2015-01-01)
Li, Kuan-Yi
;
Liang, Jia-Ming
;
Fan, Chung-Shuo
;
Tseng, Yu-Chee
;
Lin, Yi-Ting
Video surveillance systems are commonly used to monitor environments, such as factories, shopping malls, offices, and schools, for safety and security. However, traditional closed-circuit television cameras can only capture static scenes. When unexpected events happen, such as fire accidents or stranger intrusion, the recorded video data cannot provide immediate and precise information. In this work, we design a camera dispatch system for video surveillance with pan-tilt-zoom (PTZ) cameras, which can monitor event-areas/targets real-timely and flexibly. Users can dynamically define the monitoring requirements, such as pixel-per-foot and viewing-angle of the event-areas/targets. Then, a dispatch algorithm will decide the most necessary cameras and corresponding settings to monitor the event-areas/targets immediately. The control panel is implemented as a web-based service. The demo shows that users can easily monitor potential event-areas/targets anywhere, anytime through a web browser.
A Web-based, Real-time Video Surveillance System by Leveraging PTZ Cameras
(2015)
Li, Kuan-Yi
;
Liang, Jia-Ming
;
Fan, Chung-Shuo
;
Wu, Kun-Ru
;
Lin, Yi-Ting
Video surveillance systems are commonly used for environmental monitoring. Nevertheless, existing systems such as [1, 2] can only monitor scenes statically. When an accident or a fire event happens, we cannot get the critical pictures and check those situations immediately. Therefore, we propose to leverage pan-tilt-zoom (PTZ) cameras and develop a real-time surveillance system, where the PTZ cameras can rotate in a horizontal plane by panning and in a vertical plane by tilting, and adjust the focal length by zooming, so we can control these cameras dynamically for the emergent area. Especially for the accessibility, we implement this system as a web service to help users easily define the emergent area and preview the video of cameras remotely. Specifically, our system is composed of multiple PTZ cameras and a web server, as shown in Fig. 1. The PTZ cameras are with fixed positions and can be controlled to pan, tilt, and zoom remotely by the web server. The web server maintains a website to provide the real-time surveillance service, consisting of two procedures: area setting and video displaying. The area setting is for users to define the monitored area, including the range and location of the monitored area. Then, all the cameras will be dispatched and face to the center of the monitored area. Finally, the video displaying procedure will show the monitoring results, including the video streams and the rotation parameters of the dispatched cameras. Fig. 2 shows the control panel of the implemented prototype, where there are two PTZ cameras deployed in the monitoring environment. On this panel, the left part is for video displaying and the right part is for the monitored area setting. More specifically, for the right part, the upper side is the floor plan of the monitoring environment which users can define the location of the emergent area by clicking on. On the lower left side, users can further specify the details of the area, such as its length and width. After setting, the monitored area will be marked as the red-dotted rectangle on the floor plan. Finally, the monitoring results, such as the coverage ratio of the monitored area and the rotation parameters of the cameras, will be shown on the lower central side. Note that the system also allows users to control the cameras manually on the lower right side.
Aggregating Small Packets in M2M Networks: An OM2M Implementation
(2016-01-01)
Lee, Sheng-Chieh
;
Wu, Kun-Ru
;
Hsu, Ching-Kuo
;
Chang, Po-Yen
;
Liang, Jia-Ming
IoT (Internet of Things) and M2M (machine to machine) have attracted a lot of attention since more and more devices are expected to connect to the Internet for special purposes such as environment monitoring, home automation, industrial surveillance, and e-Health care. Currently, the OM2M (Open source platform for M2M communication) is a promising project which implements oneM2M and SmartM2M standards as an open-source platform for integrating various M2M services, applications, and devices. However, the individual data generated from those IoT/M2M devices is usually quite small, which incurs a lot of control overhead and thus decreases network performance significantly. Therefore, in this work we design and implement an OM2M 'plugin' that can aggregate small IoT data effectively. We will show how the plugin works and verify the effectiveness on the network bandwidth in this demonstration.
Channel-Hopping Scheme and Channel-Diverse Routing in Static Multi-Radio Multi-Hop Wireless Networks
(2015-01-01)
Lin, Ting-Yu
;
Wu, Kun-Ru
;
Yin, Guang-Chuen
;
電機資訊學士班
;
Undergraduate Honors Program of Electrical Engineering and Computer Science
In modern wireless networks with multiple orthogonal (non-overlapping) channels available, one essential performance topic is how to effectively exploit channel diversity to enable parallel communications. Generally, having a radio interface hop through all available channels produces better spectrum diversity than binding it permanently to one channel, at the cost of channel switching delays and potentially compromised network connectivity. Moreover, multi-hop communications become challenging due to the lack of a common rendezvous for discovering routes and the difficulty of relaying packets from hop to hop. In this paper, we propose a multi-radio channel-hopping scheme (CHS) that preserves network connectivity. We prove that less than three radios are required by CHS in order to achieve good channel overlapping in widespread IEEE 802.11-based wireless systems. Corresponding channel-diverse routing (CDR) protocol is devised to realize efficient multi-hop communications. Simulation results demonstrate that the proposed CDR outperforms other strategies in static IEEE 802.11a multi-hop networking environments.
Data Offloading for Dynamic Point Selection in Cloud Radio Access Networks (C-RAN)
(2018-01-01)
Hsu, Ching-Kuo
;
Liang, Jia-Ming
;
Chen, Jen-Jee
;
Wu, Kun-Ru
;
Tseng, Yu-Chee
For next generation mobile communications. Cloud-RAN (C-RAN) is an emerging network architecture to provide broadband services. C-RAN separates computation entities, i.e., Baseband Units (BBUs), from base stations (BSs) and puts BBUs in a cloud located in a centralized network. With C-RAN, UEs can receive data from multiple collaborative cells and thus can leverage the dynamic point selection (DPS) technology to improve network efficiency. When user equipments (UEs) enter a hotspot and can not be served due to congestion, data offloading from the hotspot to its neighboring cells may take place to balance heterogeneous cells' loads. This work shows how to integrate such DPS offloading with the Discontinuous Reception (DRX) mechanism, which allows UEs to turn off their radio interfaces in a periodical manner. We address the resource allocation problem in heterogeneously-loaded C-RAN by optimizing UEs' energy consumption based on DRX while reserving sufficient bandwidths for UEs considering their quality-of-service (QoS) through DPS. We propose an offloading-based DPS scheduling scheme by exploiting not only maximal instantaneous throughputs but also minimal energy cost. Simulation results show that our scheme can improve throughput, resource utilization, and energy consumption as compared to existing schemes.
Demo: A ROS-based Robot with Distributed Sensors for Seamless People Tracking
(2019-01-01)
Zhang, Ling-Yan
;
Wu, Kun-Ru
;
Ke, Ting-Yuan
;
Wang, Chih-Hsiang
;
Tseng, Yu-Chee
This paper presents a robot for people identification and tracking developed on robot operating system (ROS). It achieves modulized, light-weight, low-cost, and high-performance design goals even with the existence of distributed sensors. The key idea is to utilize wearable devices to enhance the people tracking capability of a robot through instant wireless communications and multi-sensory data fusion. Experimental results in a realistic environment demonstrate that our robot can keep tracking a specific person at a safe distance even without seeing the biological features of the person, who walks in a crowd with complex trajectories.
Demo: Tagging IoT Data in a Drone View
(2019-01-01)
Van, Lan-Da
;
Chang, Chun-Hao
;
Tong, Kit-Lun
;
Wu, Kun-Ru
;
Zhang, Ling-Yan
Both cameras and IoT devices have their particular capabilities in tracking moving objects. Their correlations are, however, unclear. In this work, we consider using a drone to track ground objects. We demonstrate how to retrieve IoT data from devices, which are attached on human objects, and correctly tag them on the human objects captured by a drone view. This is the first work correlating IoT data and computer vision from a drone camera. Potential applications of this work include aerial surveillance, people tracking, and intelligent human-drone interaction.
Design and Implementation of Image Electronic Fence with 5G technology for Smart Farms
(2019-01-01)
Hsu, Ching-Kuo
;
Chiu, Yen-Hao
;
Wu, Kun-Ru
;
Liang, Jia-Ming
;
Chen, Jen-Jee
The 5G era brings the rapid development of the Internet of Things (IoT). New technologies, such as image recognition, have promoted the traditional agriculture to a new milestone. Through advanced research and development of image recognition, it can intelligently monitor the growth of crops and effectively reduce agricultural damages, while avoiding crops being stolen and reducing the manpower of farms. In this paper, we design and implement an image electronic fence based on the technology of image recognition and sensor fusion with 5G technology for smart farms. By applying cameras and beacon tags, our system can identify whether the incoming/leaving people are authorized or not at the entry and exit of farms. In addition, with the high speed and low latency of 5G technology, the video data of cameras can be transmitted in a flash and fused with the beacon detection. In this way, the incoming/leaving people can be identified efficiently so as to avoid the farms being damaged. Based on field trials, we validate that the identification accuracy of our system approaches 90% in average.
EARC: Enhanced Adaptation of Link Rate and Contention Window for IEEE 802.11 Multi-Rate Wireless Networks
(2012-09-01)
Lin, Ting-Yu
;
Tsai, Ching-Yi
;
Wu, Kun-Ru
;
傳播研究所
;
Institute of Communication Studies
IEEE 802.11 wireless network supports multiple link rates at the physical layer. Each link rate is associated with a certain required Signal-to-Interference-and-Noise Ratio (SINR) threshold for successfully decoding received packets. On transmission failures, the 802.11 DCF performs a binary exponential backoff mechanism to discourage channel access attempts, hoping to reduce congestion. When traditional link adaptation is applied, both rate reduction and binary backoff represent double penalties for this wireless link, which may cause overly conservative transmission attempts. On the other hand, once transmission succeeds, 802.11 DCF resets the backoff contention window to the minimum value to encourage channel access attempts. At the same time, traditional link adaptation may also decide to increase the data rate, which leads to overly aggressive transmission attempts. We observe this improper interaction of link rate and backoff mechanism that harms the 802.11 system performance, due to separate consideration of those two parameters. In this paper, we propose to jointly adapt the rate and backoff parameters. Specifically, an Enhanced Adaptation of link Rate and Contention window, abbreviated as EARC, is devised. EARC is a closed-loop (receiver-assisted) link rate adaptation protocol that jointly considers the backoff mechanism. With only one extra byte carried by the DATA packet, EARC incurs little controlling overhead despite its receiver-assisted nature. Moreover, since SINR information commonly utilized by receiver-assisted protocols is not precisely supported in real devices, we introduce a rate selection reference (RSR) table empirically derived by constantly monitoring the environmental energy level and reception behavior. The RSR table then guides the receiver to select the best sustainable rate for the transmitter. Simulation results demonstrate the RSR table is a practical option for making the rate decision, and the proposed EARC approach is effective in maintaining high system throughput, compared to other link adaptation algorithms.
Efficient and Consistent Flow Update for Software Defined Networks
(2018-03-01)
Wu, Kun-Ru
;
Liang, Jia-Ming
;
Lee, Sheng-Chieh
;
Tseng, Yu-Chee
;
資訊工程學系
Software defined network (SDN) provides flexible and scalable routing by separating control plane and data plane. With centralized control, SDN has been widely used in traffic engineering, link failure recovery, and load balancing. This work considers the flow update problem, where a set of flows need to be migrated or rearranged due to change of network status. During flow update, efficiency and consistency are two main challenges. Efficiency refers to how fast these updates are completed, while consistency refers to prevention of blackholes, loops, and network congestions during updates. This paper proposes a scheme that maintains all these properties. It works in four phases. The first phase partitions flows into shorter routing segments to increase update parallelism. The second phase generates a global dependency graph of these segments to be updated. The third phase conducts actual updates and then adjusts dependency graphs accordingly. The last phase deals with deadlocks, if any, and then loops back to phase three if necessary. Through simulations, we validate that our scheme not only ensures freedom of blackholes, loops, congestions, and deadlocks during flow updates, but is also faster than existing schemes.
Energy-Efficient Dynamic Point Selection for Cloud Radio Access Networks (C-RAN)
(2017-01-01)
Hsu, Ching-Kuo
;
Liang, Jia-Ming
;
Wu, Kun-Ru
;
Chen, Jen-Jee
;
Tseng, Yu-Chee
Cloud-RAN (C-RAN) is a promising network architecture for next-generation wireless communications. C-RAN separates computation entities, i. e., Baseband Units (BBUs) from base stations (BSs), and puts BBUs in a cloud located at a centralized network. With C-RAN, user equipments (UEs) can receive data from multiple collaborative cells and thus can leverage the dynamic point selection (DPS) technology to improve network efficiency. To save the energy of UEs, 3GPP LTE-A has defined the Discontinuous Reception (DRX) mechanism to allow UEs to turn off their radio interfaces and go to sleep in a periodical manner. However, how to cooperate DRX with DPS under the C-RAN architecture is still an open issue. Therefore, this paper addresses the resource allocation problem in C-RAN by asking how to optimize the energy conservation of UEs based on DRX while reserving sufficient bandwidths for UEs considering their quality-of-service (QoS) in C-RAN with DPS. To solve this problem, we propose an energy-efficient DPS scheduling scheme. The key idea of our scheme is to serve the UEs in the intersection of cells continuously and allocate resource tightly to avoid additional wake-up intervals. Extensive simulation results show that our scheme can serve more UEs while enhancing throughput and reducing their energy consumption as compared to the existing schemes.
Energy-Efficient Uplink Resource Units Scheduling for Ultra-Reliable Communications in NB-IoT Networks
(2018-01-01)
Liang, Jia-Ming
;
Wu, Kun-Ru
;
Chen, Jen-Jee
;
Liu, Pei-Yi
;
Tseng, Yu-Chee
For 5G wireless communications, the 3GPP Narrowband Internet of Things (NB-IoT) is one of the most promising technologies, which provides multiple types of resource unit (RU) with a special repetition mechanism to improve the scheduling flexibility and enhance the coverage and transmission reliability. Besides, NB-IoT supports different operation modes to reuse the spectrum of LTE and GSM, which can make use of bandwidth more efficiently. The IoT application grows rapidly; however, those massive kir devices need to operate for a very long time. Thus, the energy consumption becomes a critical issue. Therefore, NB-IoT provides discontinuous reception operation to save devices' energy. But, how to further reduce the transmission energy while ensuring the required ultra-reliability is still an open issue. In this paper, we study how to guarantee the reliable communication and satisfy the quality of service (QoS) while minimizing the energy consumption for IoT devices. We first model the problem as an optimization problem and prove it to be NP-complete. Then, we propose an energy-efficient, ultra-reliable, and low-complexity scheme, which consists of two phases. The first phase tries to optimize the default transmit configurations of devices which incur the lowest energy consumption and satisfy the QoS requirement. The second phase leverages a weighting strategy to balance the emergency and inflexibility for determining the scheduling order to ensure the delay constraint while maintaining energy efficiency. Extensive simulation results show that our scheme can serve more devices with guaranteed QoS while saving their energy effectively.
Energy-Efficient Uplink Scheduling for Ultra-Reliable Communications in NB-IoT Networks
(2018-01-01)
Liu, Pei-Yi
;
Wu, Kun-Ru
;
Liang, Jia-Ming
;
Chen, Jen-Jee
;
Tseng, Yu-Chee
The 3GPP Narrowband Internet of Thing (NB-IoT) is the promising technology that can provide multiple types of resource unit (RU) with a special repetition mechanism to improve the scheduling flexibility and transmission reliability. Since the IoT devices need to operate for a very long time, the energy consumption becomes a critical issue. In this paper, we study how to guarantee the quality of service (QoS) while minimizing the energy consumption for IoT devices. We first model the problem and then propose an energy-efficient scheme, which consists of two stages. The first stage tries to incur the lowest energy consumption of devices and satisfy their QoS requirement. The second stage determines the scheduling order to ensure the delay constraint while maintaining energy efficiency. Simulation results show that our scheme can serve more devices while saving their energy.
Enhanced Deployment Algorithms for Heterogeneous Directional Mobile Sensors in a Bounded Monitoring Area
(2017-03-01)
Lin, Ting-Yu
;
Santoso, Hendro Agus
;
Wu, Kun-Ru
;
Wang, Gui-Liu
;
電機工程學系
Good deployment of sensors empowers the network with effective monitoring ability. Different from omnidirectional sensors, the coverage region of a directional sensor is determined by not only the sensing radius (distance), but also its sensing orientation and spread angle. Heterogeneous sensing distances and spread angles are likely to exist among directional sensors, to which we refer as heterogeneous directional sensors. In this paper, we target on a bounded monitoring area and deal with heterogeneous directional sensors equipped with locomotion and rotation facilities to enable the sensors self-deployment. Two Enhanced Deployment Algorithms, EDA-I and EDA-II, are proposed to achieve high sensing coverage ratio in the monitored field. EDA-I leverages the concept of virtual forces (for sensors movements) and virtual boundary torques (for sensors rotations), whereas EDA-II combines Voronoi diagram directed movements and boundary torques guided rotations. EDA-I computations can be centralized or distributed that differ in required energy and execution time, whereas EDA-II only allows centralized calculations. Our EDA-II outperforms EDA-I in centralized operations, while EDA-I can be adapted into a distributed deployment algorithm without requiring global information and still achieves comparably good coverage performance to its centralized version. To the best of our knowledge, this is perhaps the first work to employ movements followed by rotations for sensors self-deployment. Performance results demonstrate that our enhanced deployment mechanisms are capable of providing desirable surveillance level, while consuming moderate moving and rotating energy under reasonable execution time.
Enhanced scheduling schemes with energy conservation for dynamic point selection in cloud radio access networks
(2020-02-01)
Hsu, Ching-Kuo
;
Liang, Jia-Ming
;
Wu, Kun-Ru
;
Chen, Jen-Jee
;
Tseng, Yu-Chee
In 5G mobile communications, Cloud-RAN (C-RAN) (Camps-Mur et al. in IEEE Commun Mag 57:99-105, 2019) is proposed to provide broadband services. It separates computation entities, i.e., baseband units (BBUs), from base stations and puts all BBUs in a centralized cloud. Existing researches have investigated how to enhance user equipments (UEs) to receive data from multiple collaborative cells by leveraging the dynamic point selection(DPS) technology. Collaborative transmission may cause higher energy consumption for UEs. Although 3GPP has defined the discontinuous reception (DRX) mechanism by regulating UEs to turn off their radio interfaces in a periodical manner, how to well coordinate DRX with DPS under the C-RAN architecture is still left as an open issue. This paper is the first one addressing this resource optimization problem in C-RAN with DPS, which asks how to optimize DRX parameters of UEs by considering their quality-of-service (QoS). We prove this problem to be NP-complete, and then propose two effective and efficient DPS solutions, called serving-ratio(SR) scheme and cost-aware (CA) scheme. SR serves UEs based on a special 'serving ratio' to ensure UEs receiving continuous subframes, especially for those in cell intersections. On the other hand, CA exploits the strategies of minimal scheduling costs to balance energy and throughput efficiency in a perspective way. Extensive simulation results validate that our schemes can successfully achieve higher system throughput, provide better resource utilization, and serve more UEs while guaranteeing their QoS and saving considerable energy as compared to existing schemes.
Global Sensor Deployment and Local Coverage-Aware Recovery Schemes for Smart Environments
(2015-07-01)
Lin, Ting-Yu
;
Santoso, Hendro Agus
;
Wu, Kun-Ru
;
電機資訊學士班
;
Undergraduate Honors Program of Electrical Engineering and Computer Science
One critical issue, for a wireless sensor network (WSN) to operate successfully, is to provide sufficient sensing coverage. Define the smart sensing environment as a sensing system with the capability to sense the environment and respond properly in an automated manner. In this paper, we target on smart sensing environments and deal with heterogeneous sensors (here sensor heterogeneity is defined as sensors having different sensing ranges) equipped with actuation facilities to assist in the sensor self-deployment. A coverage-aware sensor automation (CASA) protocol is proposed to realize an automated smart monitoring network. Two centralized algorithms are included in the CASA protocol suite: enhanced virtual forces algorithm with boundary forces (EVFA-B) and sensor self-organizing algorithm (SSOA). Unlike most previous works that tackle the deployment problem only partially, we intend to address the problem from both global deployment (EVFA-B) and local repairing (SSOA) perspectives. The EVFA-B protocol exerts weighted attractive and repulsive forces on each sensor based on predefined distance thresholds. Resultant forces then guide the sensors to their suitable positions with the objective of enhancing the sensing coverage (after a possibly random placement of sensors). Furthermore, in the presence of sensor energy depletions and/or unexpected failures, our SSOA algorithm is activated to perform local repair by repositioning sensors around the sensing void (uncovered area). This capability of local recovery is advantageous in terms of saving the communication and moving energies. Performance of the proposed sensor deployment strategies is evaluated in terms of surveillance coverage, monitoring density, network self-healing competence, and moving energy consumption. We also implement our CASA protocol suite in a real-life monitoring network (MoNet) to demonstrate the protocol feasibility and validate the MoNet detection capability of emergency events.
Joint Adaptation of IEEE 802.11 Link Rate and Backoff Parameters: Prototyping Validation
(2015-01-01)
Wu, Kun-Ru
;
Lin, Ting-Yu
;
電信工程研究所
;
Institute of Communications Engineering
In IEEE 802.11, DCF performs a binary exponential backoff mechanism to control channel access attempts, in order to reduce congestion. When transmission fails, both binary exponential backoff and rate reduction are performed, which may induce overly conservative transmission attempts. On the other hand, once transmission succeeds, rate adaptation may decide to increase the data rate and DCF resets the contention window to minimum value, which results in overly aggressive transmission attempts. Motivated by this, we propose a mechanism entitled Enhanced Adaptation of link Rate and Contention window, abbreviated as EARC. EARC is a receiver-assisted link rate adaptation protocol that jointly considers the backoff mechanism. We implement EARC in a real-life testbed to observe its performance. Empirical results validate that EARC enhances system throughput by judiciously adapting to both the link rate and backoff parameters.
Smart Surveillance with Context and Location Sensitivity and Quality Control
(2016-01-01)
Wu, Kun-Ru
;
Liang, Jia-Ming
;
Zhang, Xin
;
Li, Kuan-Yi
;
Lin, Yi-Ting
Smart video surveillance systems are essentials in modern environments to ensure safety and security for lives and property. In order to capture critical clues of reconnaissance, it is important to automatically and dynamically control the surveillance sensitivity and quality for detecting abnormal/suspicious events to perform high quality monitoring. In this work, we design a smart video surveillance system, which fully utilizes pan tilt-zoom (PTZ) cameras and well integrates with environment sensors (such as fire/motion/door sensors) while cooperating with wearable devices that can adaptively monitor events and ensure the surveillance quality in terms of pixel-per-foot (PPF), viewing angles, timeliness, and accuracy. In addition, this system also supports to define the special monitoring tasks and surveillance requirements, such as the surveillance timeliness and duty cycle for particular moving objects to be tracked per time unit. Then, a smart camera dispatch algorithm will calculate and determine the best cameras set with the corresponding configurations to accomplish the surveillance tasks effectively and precisely. We will show how our system realizes smart detecting and monitoring in this demonstration by leveraging PTZ cameras, environmental sensors and wearable devices.
Spatial and Temporal Aggregation for Small and Massive Transmissions in LTE-M Networks
(2017-01-01)
Chang, Po-Yen
;
Liang, Jia-Ming
;
Chen, Jen-Jee
;
Wu, Kun-Ru
;
Tseng, Yu-Chee
Machine-to-machine (M2M) communication is one of the key technologies to realize Internet of Things (IoT). Since IoT applications are mainly for smart sensing, such as metering, home surveillance, disaster detection, and e-health, their special sensing/uploading behaviors will result in periodic and/or eventdriven small data transmissions, which may potentially decrease the radio resource efficiency. On the other hand, the widespread deployment of IoT raises the concurrent massive connectivity of IoT devices. How to solve these two problems is a critical issue. In this paper, we investigate an uplink resource allocation problem which considers the periodic, event-driven, and query-based IoT traffic behaviors over LTE-M. The proposed approach takes advantage of data aggregation and both spatial and temporal reuse. Our solution exploits long-term static scheduling for periodic data to ensure the latency and data rate, and employs short-term dynamic scheduling for event-driven, query-based data to improve transmission efficiency. Therefore, both small data and massive connectivity problems are relieved. Extensive simulation results show that the proposed scheme can improve resource efficiency and enlarge network capacity effectively.