The Internet of Things (IoT) has emerged recently, and the importance of wireless sensor networks in the IoT environment has increased; thus, sensor platforms that can be used to provide a sensor-as-a-service have been studied widely. The sensor filtering techniques employed on sensor platforms are also becoming important as the number of sensors increases significantly in the IoT environment. In addition, Sensor Registry System (SRS) is a system for registering sensor metadata, which supports seamless semantic processing for sensor data. However, the SRS also requires sensor filtering techniques due to the increased number of sensors. Furthermore, the existing sensor filtering techniques have problems because they are influenced by the availability of mobile resources and the status of the mobile network.
In this dissertation, a path prediction-based sensor filtering method (PP-SFM) is, and path prediction-based SRS (PP-SRS) is developed, which is SRS that uses PP-SFM. First, an architecture is constructed for SRS and PP-SFM to develop PP-SRS, before presenting the detailed processes. Then the three-edge pattern-based path prediction algorithm (TEP-PP) is proposed for sensor filtering. TEP-PP divides segments when users move into road segments and it measures the weights of the road segments according to the GPS position of each user. In this dissertation, both SRS and PP-SFM are implemented and tested in experiments. To implement the SRS, a sensor registry data model is designed and the SRS is then developed as a web application. In addition, to implement the PP-SFM, a path repository data model is designed to develop PP-SFM where the RESTful API is used to connect with the PP-SFM. For the experiments, a GPS collector is developed that collects user GPS points. The weights use for path prediction are measured based on the collected user points.
The proposed method is evaluated by measuring the prediction accuracy, service reliability, and sensor preparation performance. The prediction accuracy is compared for a Markov algorithm and the TEP-PP algorithm, where the evaluation demonstrates that TEP-PP obtains higher accuracy. In the service reliability evaluation, simulations are performed with SRS, SRS with SFM, PP-SRS with the fast and close-range prediction algorithm, and PP-SRS with TEP. The simulator randomly generated access failures and then it determines whether the services are successful or not. The results show that PP-SRS with TEP delivered the highest service reliability. In the performance evaluation, the sensor preparation performance denotes the preparation time from receiving the sensor metadata process until semantic interpretation. The preparation time for PP-SRS is longer than that for SRS during the early phase, but the preparation time is shorter than SRS after a threshold value. According to the qualitative evaluation, PP-SFM is limited in terms of domain generality, but it has the advantages of fast service reaction, high compatibility, and high network adaptability in real-time.