Connected moving objects with location sensors form the world of the Internet of Moving Things. This world includes people, animals, vehicles, drones, and vessels, to name a few. The conventional spatial libraries including Microsoft SQL Server Spatial (SqlSpatial) are primarily developed to evaluate spatial operations on stationary things. When it comes to real-world applications for the Internet of Moving Things that require realtime tracking and processing, the limitations of these libraries float to the surface. Unfortunately, the SqlSpatial library has very limited operations in this domain. This paper presents the Reactive eXtension Spatial (RxSpatial) library developed to provide real-time processing of spatio-temporal operations on moving objects connected through the Internet of Things. The superiority of the RxSpatial over the basic SqlSpatial is demonstrated throughout extensive experimental evaluations on real and synthetic data sets.

The spatial libraries that have been developed by Microsoft, IBM and Oracle have substantially changed the capabilities of geospatial computing. These libraries implement several functionalities that include intersection, distance, and area for various geospatial objects. These libraries came out to address a wealth of use cases that were challenging in that era. As time goes by, GPS devices and location-aware mobile technologies increased the demand for geospatial computing, in general, and for real time geostreaming, in particular. Existing commercial spatial libraries were originally designed to support operations on stationary objects with limited or no capabilities for moving objects. In this paper, we introduce the RxSpatial library, a real time reactive spatial library for spatiotemporal stream query processing. RxSpatial provides, (1) a front-end, which is a programming interface for developers who are familiar with the Microsoft. NET Reactive framework and the Microsoft SQL Server Spatial Library, and (2) a back-end for processing spatial operations in a streaming fashion. RxSpatial provides the programming convenience at the front end and the query processing efficiency at the back end.

Current commercial spatial libraries implemented strong support on functionalities like intersection, distance, and area for various stationary geospatial objects. The missing point is the support for moving object. Performing moving object real-time location tracking and computation on server side of GIS application is challenging because of high user volume of moving object to track, time complexity of analysis and computation, and requirement of real-timing. In this Demo, we present the RxSpatial, a real time reactive spatial library that consists of (1) a front-end, a programming interface for developers who are familiar with the Reactive framework and the Microsoft Spatial Library, and (2) a back-end for processing spatial operations in a streaming fashion. Then we provide the demonstration scenarios that show how RxSpatial is employed in real-world applications. The demonstration scenarios include criminal activity tracking, collaborative vehicle system, performance analysis and an interactive internal inspection.

The base station in IEEE 802.16, or WiMAX, networks allocates contention-based time slots for the mobile stations to transmit their requests for additional bandwidth. Using a technique called subchannelization, multiple concurrent transmissions by mobile stations can be admitted by the base station during the same contention period. For transmission during this period, each station employs a contention-resolution mechanism. In this paper, we develop an analytical model for the bandwidth request and resolution mechanism during this contention period when subchannelization is employed. The model is shown to accurately model the contention period when subchannelization is enabled. Performance metrics, such as throughput, average waiting time, and contention period capacity, show that adding more subchannels to the contention time slots increases throughput and reduces average waiting time. Several simulation results are carried out to validate the model.

IEEE 802.16 wireless networks, known as WiMAX, employ a mechanism for guaranteed time allocation to mobile stations in order to meet the different quality of service requirements for service flows. The base station allocates contention-based time slots for the stations to transmit their requests for additional bandwidth. Each contention time slot can accommodate a single transmission if there is no sub-channelization or multiple concurrent transmissions if the base station enables sub-channelization during the contention period. For transmission during this period, each station employs a contention-resolution mechanism. In this paper, we develop an analytical model for the bandwidth request and resolution mechanism during this contention period when sub-channelization is employed. The model is shown to accurately model the contention period when sub-channelization is enabled. Performance metrics, such as throughput and capacity, show that adding more subchannels to the contention time slots increases both the throughput and the capacity of the contention period carrying more successful bandwidth requests. Simulations with different parameter sets are carried out to validate the proposed model.

3G long term evolution (LTE) has emerged as a comprehensive evolution of the Universal Mobile Telecommunications System (UMTS). LTE system uses resource blocks which are the basic unit of exchanging information in both downlink and uplink. However, resource allocation scheme, which is a crucial component to guarantee quality of service, remains as an open issue. In this paper, we propose a novel cross-layer scheduling algorithm for LTE system that allocates resources, both as resource blocks and a modulation and coding scheme, among users with different traffic load. The algorithm minimizes the overall average packet delay and takes into account queueing theory, modulation and coding scheme supported by each user, channel condition, and available transmit power. Simulation results shows that the proposed algorithm provides substantial reduction in average delay compared to conventional algorithm.

The broad spread of packet data networks and the emergence of applications in multimedia communications, has created a driving force towards an improved quality of service (QoS) model for today's Internet. A primary component of this model is packet schedulers. We introduce a new frame-based scheduling technique called mini round robin (MRR) that is primarily designed for providing lower latency bounds, and lower start-up latency bound for low-rate but high-priority flows. This enables applications such as voice-over-IP to demand low delay despite the low reserved bit rate of the voice sessions.

The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved quality of service (QoS) model for today's Internet. A primary component of this model is packet schedulers. We introduce a new frame-based scheduling technique called mini round robin (MRR) designed primarily for providing lower latency bounds, and lower start-up latency bound for low-rate but high-priority flows. This enables applications such as voice-over-IP to demand low delay despite the low reserved bit rate of the voice sessions.

Current wireless multimedia applications may require different quality of service (QoS) measures such as throughput, packet loss rate, delay, and delay jitter. In this paper, we propose a transmission rate scheduling scheme for code division multiple access (CDMA) networks that can provide absolute QoS guarantees. The scheduling scheme uses several M/D/1 queues, each representing a different service class, and allocates a transmission rate to each queue so as to satisfy the different QoS requirements. In addition, the scheduling scheme provides relative differentiated services among the different service classes so that the network operator is able to tune QoS ratios between these classes independent of the class loads. An optimization problem is proposed that maximizes the transmission rate allocations among mobile stations (MSs). Analysis and simulation results are used to illustrate the viability of the scheduling scheme. Such a scheme can be applied in the emerging DS (differentiated services) Internet.