11 research outputs found

    Performance Evaluation of UHF RFID Technologies for Real-Time Bus Recognition in the Taipei Bus Station

    No full text
    Transport stations such as airports, ports, and railways have adopted blocked-type pathway management to process and control travel systems in a one-directional manner. However, this excludes highway transportation where large buses have great variability and mobility; thus, an instant influx of numerous buses increases risks and complicates station management. Focusing on Taipei Bus Station, this study employed RFID technology to develop a system platform integrated with modern information technology that has numerous characteristics. This modern information technology comprised the following systems: ultra-high frequency (UHF) radio-frequency identification (RFID), ultrasound and license number identification, and backstage graphic controls. In conclusion, the system enabled management, bus companies, and passengers to experience the national bus station’s new generation technology, which provides diverse information and synchronization functions. Furthermore, this technology reached a new milestone in the energy-saving and efficiency-increasing performance of Taiwan’s buses

    Handling Neighbor Discovery and Rendezvous Consistency with Weighted Quorum-Based Approach

    No full text
    Neighbor discovery and the power of sensors play an important role in the formation of Wireless Sensor Networks (WSNs) and mobile networks. Many asynchronous protocols based on wake-up time scheduling have been proposed to enable neighbor discovery among neighboring nodes for the energy saving, especially in the difficulty of clock synchronization. However, existing researches are divided two parts with the neighbor-discovery methods, one is the quorum-based protocols and the other is co-primality based protocols. Their distinction is on the arrangements of time slots, the former uses the quorums in the matrix, the latter adopts the numerical analysis. In our study, we propose the weighted heuristic quorum system (WQS), which is based on the quorum algorithm to eliminate redundant paths of active slots. We demonstrate the specification of our system: fewer active slots are required, the referring rate is balanced, and remaining power is considered particularly when a device maintains rendezvous with discovered neighbors. The evaluation results showed that our proposed method can effectively reschedule the active slots and save the computing time of the network system

    Gaussian Process Regression Plus Method for Localization Reliability Improvement

    No full text
    Location data are among the most widely used context data in context-aware and ubiquitous computing applications. Many systems with distinct deployment costs and positioning accuracies have been developed over the past decade for indoor positioning. The most useful method is focused on the received signal strength and provides a set of signal transmission access points. However, compiling a manual measuring Received Signal Strength (RSS) fingerprint database involves high costs and thus is impractical in an online prediction environment. The system used in this study relied on the Gaussian process method, which is a nonparametric model that can be characterized completely by using the mean function and the covariance matrix. In addition, the Naive Bayes method was used to verify and simplify the computation of precise predictions. The authors conducted several experiments on simulated and real environments at Tianjin University. The experiments examined distinct data size, different kernels, and accuracy. The results showed that the proposed method not only can retain positioning accuracy but also can save computation time in location predictions

    Handling Neighbor Discovery and Rendezvous Consistency with Weighted Quorum-Based Approach

    No full text
    Neighbor discovery and the power of sensors play an important role in the formation of Wireless Sensor Networks (WSNs) and mobile networks. Many asynchronous protocols based on wake-up time scheduling have been proposed to enable neighbor discovery among neighboring nodes for the energy saving, especially in the difficulty of clock synchronization. However, existing researches are divided two parts with the neighbor-discovery methods, one is the quorum-based protocols and the other is co-primality based protocols. Their distinction is on the arrangements of time slots, the former uses the quorums in the matrix, the latter adopts the numerical analysis. In our study, we propose the weighted heuristic quorum system (WQS), which is based on the quorum algorithm to eliminate redundant paths of active slots. We demonstrate the specification of our system: fewer active slots are required, the referring rate is balanced, and remaining power is considered particularly when a device maintains rendezvous with discovered neighbors. The evaluation results showed that our proposed method can effectively reschedule the active slots and save the computing time of the network system

    Localization Reliability Improvement Using Deep Gaussian Process Regression Model

    No full text
    With the widespread use of the Global Positioning System, indoor positioning technology has attracted increasing attention. Many systems with distinct deployment costs and positioning accuracies have been developed over the past decade for indoor positioning. The method that is based on received signal strength (RSS) is the most widely used. However, manually measuring RSS signal values to build a fingerprint database is costly and time-consuming, and it is impractical in a dynamic environment with a large positioning area. In this study, we propose an indoor positioning system that is based on the deep Gaussian process regression (DGPR) model. This model is a nonparametric model and it only needs to measure part of the reference points, thus reducing the time and cost required for data collection. The model converts the RSS values into four types of characterizing values as input data and then predicts the position coordinates using DGPR. Finally, after reinforcement learning, the position coordinates are optimized. The authors conducted several experiments on a simulated environment by MATLAB and physical environments at Tianjin University. The experiments examined different environments, different kernels, and positioning accuracy. The results showed that the proposed method could not only retain the positioning accuracy, but also save the computation time that is required for location estimation

    Belief Interval of Dempster-Shafer Theory for Line-of-Sight Identification in Indoor Positioning Applications

    No full text
    Location data are among the most widely used contextual data in context-aware and ubiquitous computing applications. Numerous systems with distinct deployment costs and levels of positioning accuracy have been developed over the past decade for indoor positioning purposes. The most useful method focuses on the received signal strength (RSS) and provides a set of signal transmission access points. Furthermore, most positioning systems are based on non-line-of-sight (NLOS) rather than line-of-sight (LOS) conditions, and this cause ranging errors for location predictions. Hence, manually compiling a fingerprint database measuring RSS involves high costs and is thus impractical in online prediction environments. In our proposed method, a comparison method is derived on the basis of belief intervals, as proposed in Dempster-Shafer theory, and the signal features are characterized on the LOS and NLOS conditions for different field experiments. The system performance levels were examined with different features and under different environments through robust testing and by using several widely used machine learning methods. The results showed that the proposed method can not only retain positioning accuracy but also save computation time in location predictions

    On the Dynamic RSS Feedbacks of Indoor Fingerprinting Databases for Localization Reliability Improvement

    No full text
    Location data is one of the most widely used context data types in context-aware and ubiquitous computing applications. To support locating applications in indoor environments, numerous systems with different deployment costs and positioning accuracies have been developed over the past decade. One useful method, based on received signal strength (RSS), provides a set of signal transmission access points. However, compiling a remeasurement RSS database involves a high cost, which is impractical in dynamically changing environments, particularly in highly crowded areas. In this study, we propose a dynamic estimation resampling method for certain locations chosen from a set of remeasurement fingerprinting databases. Our proposed method adaptively applies different, newly updated and offline fingerprinting points according to the temporal and spatial strength of the location. To achieve accuracy within a simulated area, the proposed method requires approximately 3% of the feedback to attain a double correctness probability comparable to similar methods; in a real environment, our proposed method can obtain excellent 1 m accuracy errors in the positioning system
    corecore