Goodbye, ALOHA!

©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft

(R2051) Analysis of MAP/PH1, PH2/2 Queueing Model with Working Breakdown, Repairs, Optional Service, and Balking

In this paper, a classical queueing system with two types of heterogeneous servers has been considered. The Markovian Arrival Process (MAP) is used for the customer arrival, while phase type distribution (PH) is applicable for the offering of service to customers as well as the repair time of servers. Optional service are provided by the servers to the unsatisfied customers. The server-2 may get breakdown during the busy period of any type of service. Though the server- 2 got breakdown, server-2 has a capacity to provide the service at a slower rate to the current customer who is receiving service when the moment of server-2 struck with breakdown. In the period of vacation/closedown of server-1 and the server-2 is in working breakdown or under repair process, the arrival of customers may balk the system due to the impatient. Stability conditions has derived for our system and the stationary probability vector was evaluated by using the matrix analytical method. This model also examined at the analysis of busy period,waiting time distribution and system performance measures. The numerical illustrations are provided with the aid of two dimensional and three dimensional graphs

Vehicular Dynamic Spectrum Access: Using Cognitive Radio for Automobile Networks

Vehicular Dynamic Spectrum Access (VDSA) combines the advantages of dynamic spectrum access to achieve higher spectrum efficiency and the special mobility pattern of vehicle fleets. This dissertation presents several noval contributions with respect to vehicular communications, especially vehicle-to-vehicle communications. Starting from a system engineering aspect, this dissertation will present several promising future directions for vehicle communications, taking into consideration both the theoretical and practical aspects of wireless communication deployment. This dissertation starts with presenting a feasibility analysis using queueing theory to model and estimate the performance of VDSA within a TV whitespace environment. The analytical tool uses spectrum measurement data and vehicle density to find upper bounds of several performance metrics for a VDSA scenario in TVWS. Then, a framework for optimizing VDSA via artificial intelligence and learning, as well as simulation testbeds that reflect realistic spectrum sharing scenarios between vehicle networks and heterogeneous wireless networks including wireless local area networks and wireless regional area networks. Detailed experimental results justify the testbed for emulating a mobile dynamic spectrum access environment composed of heterogeneous networks with four dimensional mutual interference. Vehicular cooperative communication is the other proposed technique that combines the cooperative communication technology and vehicle platooning, an emerging concept that is expected to both increase highway utilization and enhance both driver experience and safety. This dissertation will focus on the coexistence of multiple vehicle groups in shared spectrum, where intra-group cooperation and inter-group competition are investigated in the aspect of channel access. Finally, a testbed implementation VDSA is presented and a few applications are developed within a VDSA environment, demonstrating the feasibility and benefits of some features in a future transportation system

Modeling of the Space Station Freedom data management system

The Data Management System (DMS) is the information and communications system onboard Space Station Freedom (SSF). Extensive modeling of the DMS is being conducted throughout NASA to aid in the design and development of this vital system. Activities discussed at NASA Ames Research Center to model the DMS network infrastructure are discussed with focus on the modeling of the Fiber Distributed Data Interface (FDDI) token-ring protocol and experimental testbedding of networking aspects of the DMS

Flexible Scheduling in Middleware for Distributed rate-based real-time applications - Doctoral Dissertation, May 2002

Distributed rate-based real-time systems, such as process control and avionics mission computing systems, have traditionally been scheduled statically. Static scheduling provides assurance of schedulability prior to run-time overhead. However, static scheduling is brittle in the face of unanticipated overload, and treats invocation-to-invocation variations in resource requirements inflexibly. As a consequence, processing resources are often under-utilized in the average case, and the resulting systems are hard to adapt to meet new real-time processing requirements. Dynamic scheduling offers relief from the limitations of static scheduling. However, dynamic scheduling offers relief from the limitations of static scheduling. However, dynamic scheduling often has a high run-time cost because certain decisions are enforced on-line. Furthermore, under conditions of overload tasks can be scheduled dynamically that may never be dispatched, or that upon dispatch would miss their deadlines. We review the implications of these factors on rate-based distributed systems, and posits the necessity to combine static and dynamic approaches to exploit the strengths and compensate for the weakness of either approach in isolation. We present a general hybrid approach to real-time scheduling and dispatching in middleware, that can employ both static and dynamic components. This approach provides (1) feasibility assurance for the most critical tasks, (2) the ability to extend this assurance incrementally to operations in successively lower criticality equivalence classes, (3) the ability to trade off bounds on feasible utilization and dispatching over-head in cases where, for example, execution jitter is a factor or rates are not harmonically related, and (4) overall flexibility to make more optimal use of scarce computing resources and to enforce a wider range of application-specified execution requirements. This approach also meets additional constraints of an increasingly important class of rate-based systems, those with requirements for robust management of real-time performance in the face of rapidly and widely changing operating conditions. To support these requirements, we present a middleware framework that implements the hybrid scheduling and dispatching approach described above, and also provides support for (1) adaptive re-scheduling of operations at run-time and (2) reflective alternation among several scheduling strategies to improve real-time performance in the face of changing operating conditions. Adaptive re-scheduling must be performed whenever operating conditions exceed the ability of the scheduling and dispatching infrastructure to meet the critical real-time requirements of the system under the currently specified rates and execution times of operations. Adaptive re-scheduling relies on the ability to change the rates of execution of at least some operations, and may occur under the control of a higher-level middleware resource manager. Different rates of execution may be specified under different operating conditions, and the number of such possible combinations may be arbitrarily large. Furthermore, adaptive rescheduling may in turn require notification of rate-sensitive application components. It is therefore desirable to handle variations in operating conditions entirely within the scheduling and dispatching infrastructure when possible. A rate-based distributed real-time application, or a higher-level resource manager, could thus fall back on adaptive re-scheduling only when it cannot achieve acceptable real-time performance through self-adaptation. Reflective alternation among scheduling heuristics offers a way to tune real-time performance internally, and we offer foundational support for this approach. In particular, run-time observable information such as that provided by our metrics-feedback framework makes it possible to detect that a given current scheduling heuristic is underperforming the level of service another could provide. Furthermore we present empirical results for our framework in a realistic avionics mission computing environment. This forms the basis for guided adaption. This dissertation makes five contributions in support of flexible and adaptive scheduling and dispatching in middleware. First, we provide a middle scheduling framework that supports arbitrary and fine-grained composition of static/dynamic scheduling, to assure critical timeliness constraints while improving noncritical performance under a range of conditions. Second, we provide a flexible dispatching infrastructure framework composed of fine-grained primitives, and describe how appropriate configurations can be generated automatically based on the output of the scheduling framework. Third, we describe algorithms to reduce the overhead and duration of adaptive rescheduling, based on sorting for rate selection and priority assignment. Fourth, we provide timely and efficient performance information through an optimized metrics-feedback framework, to support higher-level reflection and adaptation decisions. Fifth, we present the results of empirical studies to quantify and evaluate the performance of alternative canonical scheduling heuristics, across a range of load and load jitter conditions. These studies were conducted within an avionics mission computing applications framework running on realistic middleware and embedded hardware. The results obtained from these studies (1) demonstrate the potential benefits of reflective alternation among distinct scheduling heuristics at run-time, and (2) suggest performance factors of interest for future work on adaptive control policies and mechanisms using this framework

Telecommunications media for the delivery of educational programming

The technical characteristics of various telecommunications media are examined for incorporation into educational networks. FM radio, AM radio, and VHF and UHF television are considered along with computer-aided instruction. The application of iteration networks to library systems, and microform technology are discussed. The basic principles of the communications theory are outlined, and the operation of the PLATO 4 random access system is described

Smart Sensing and Performance Analysis for Cognitive Radio Networks

Static spectrum access policy has resulted in spectrum scarcity as well as low spectrum utility in today\u27s wireless communications. To utilize the limited spectrum more efficiently, cognitive radio networks have been considered a promising paradigm for future network. Due to the unique features of cognitive radio technology, cognitive radio networks not only raise new challenges, but also bring several fundamental problems back to the focus of researchers. So far, a number of problems in cognitive radio networks have remained unsolved over the past decade. The work presented in this dissertation attempts to fill some of the gaps in the research area of cognitive radio networks. It focuses primarily on spectrum sensing and performance analysis in two architectures: a single cognitive radio network and multiple co-existing cognitive radio networks. Firstly, a single cognitive radio network with one primary user is considered. A weighted cooperative spectrum sensing framework is designed, to increase the spectrum sensing accuracy. After studying the architecture of a single cognitive radio network, attention is shifted to co-existing multiple cognitive radio networks. The weakness of the conventional two-state sensing model is pointed out in this architecture. To solve the problem, a smart sensing model which consists of three states is designed. Accordingly, a method for a two-stage detection procedure is developed to accurately detect each state of the three. In the first stage, energy detection is employed to identify whether a channel is idle or occupied. If the channel is occupied, received signal is further analyzed at the second stage to determine whether the signal originates from a primary user or an secondary user. For the second stage, a statistical model is developed, which is used for distance estimation. The false alarm and miss detection probabilities for the spectrum sensing technology are theoretically analyzed. Then, how to use smart sensing, coupled with a designed media access control protocol, to achieve fairness among multiple CRNs is thoroughly investigated. The media access control protocol fully takes the PU activity into account. Afterwards, the significant performance metrics including throughput and fairness are carefully studied. In terms of fairness, the fairness dynamics from a micro-level to macro-level is evaluated among secondary users from multiple cognitive radio networks. The fundamental distinctions between the two-state model and the three-state sensing model are also addressed. Lastly, the delay performance of a cognitive radio network supporting heterogeneous traffic is examined. Various delay requirements over the packets from secondary users are fully considered. Specifically, the packets from secondary users are classified into either delay-sensitive packets or delay-insensitive packets. Moreover, a novel relative priority strategy is designed between these two types of traffic by proposing a transmission window strategy. The delay performance of both a single-primary user scenario and a multiple-primary user scenario is thoroughly investigated by employing queueing theory

A PC-based data acquisition system for sub-atomic physics measurements

Modern particle physics measurements are heavily dependent upon automated data acquisition systems (DAQ) to collect and process experiment-generated information. One research group from the University of Saskatchewan utilizes a DAQ known as the Lucid data acquisition and analysis system. This thesis examines the project undertaken to upgrade the hardware and software components of Lucid. To establish the effectiveness of the system upgrades, several performance metrics were obtained including the system's dead time and input/output bandwidth.Hardware upgrades to Lucid consisted of replacing its aging digitization equipment with modern, faster-converting Versa-Module Eurobus (VME) technology and replacing the instrumentation processing platform with common, PC hardware. The new processor platform is coupled to the instrumentation modules via a fiber-optic bridging-device, the sis1100/3100 from Struck Innovative Systems.The software systems of Lucid were also modified to follow suit with the new hardware. Originally constructed to utilize a proprietary real-time operating system, the data acquisition application was ported to run under the freely available Real-Time Executive for Multiprocessor Systems (RTEMS). The device driver software provided with sis1100/3100 interface also had to be ported for use under the RTEMS-based system. Performance measurements of the upgraded DAQ indicate that the dead time has been reduced from being on the order of milliseconds to being on the order of several tens of microseconds. This increased capability means that Lucid's users may acquire significantly more data in a shorter period of time, thereby decreasing both the statistical uncertainties and data collection duration associated with a given experiment