With the rapid development of Artificial Intelligence and Internet of Things, an increasing number of computation intensive or delay sensitive biomedical data processing and analysis tasks are produced in vehicles, bringing more and more challenges to the biometric monitoring of drivers. Edge computing is a new paradigm to solve these challenges by offloading tasks from the resource-limited vehicles to Edge Servers in Road Side Units. However, most of the traditional offloading schedules for vehicular networks concentrate on the edge, while some tasks may be too complex for ESs to process. To this end, we consider a collaborative vehicular network in which the cloud, edge and terminal can cooperate with each other to accomplish the tasks. The vehicles can offload the computation intensive tasks to the cloud to save the resource of edge. We further construct the virtual resource pool which can integrate the resource of multiple ESs since some regions may be covered by multiple RSUs. In this paper, we propose a Multi-Scenario offloading schedule for biomedical data processing and analysis in Cloud-Edge-Terminal collaborative vehicular networks called MSCET. The parameters of the proposed MSCET are optimized to maximize the system utility. We also conduct extensive simulations to evaluate MSCET.
In RFID-assisted applications, the customers often request to provide the tag searching service to determine which specific tags are present in the system. In practice, tags are usually divided into different groups to represent different categories or brands. We found that the traditional tag searching protocols are not very appropriate for multi-group RFID scenarios because they cannot ensure that the searching results of each group satisfy the predefined reliability requirements. Therefore, we develop a series of effective multi-group tag searching schemes. B-Search is a basic method that leverages the filter vector and the indicator vector to perform tag searching for each group sequentially. G-Search and A-Search are two parallel multi-group tag searching schemes. G-Search selects the longest frame length as the frame length of all groups, while A-Search can adaptively adjust the frame length of each group to improve the searching efficiency. We evaluate the performance of the proposed protocols through theoretical analysis and discuss the optimal parameter settings to minimize the execution time. Extensive simulations illustrate that both G-Search and A-Search can achieve fast and effective multi-group tag searching.