Both 5G cellular and IoT technologies are expected to see widespread deployment in the next few years. At the practical level, 5G will see initial deployments in urban areas. This is perhaps fortuitous from an IoT perspective, since many “mainstream” applications of IoT will support Smart Cities, Smart Campuses and Smart Buildings. Bandwidth demand for a number of Smart City applications is the main driver for enhanced mobile broadband (eMBB)-based 5G services in general, and new-generation 5G IoT applications, in particular. In turn, the use of the millimeter wave spectrum is required to enable 5G cellular technologies to support high data rates. Millimeter wave solutions, however, impose a requirement for small cells. Generally, an implementer tries to use one or a small handful of IoT technologies; preferably, and for managerial simplicity, the implementer would want to use a cellular/5G IoT technology for all nodes, whether indoors or outdoors, instead of a heterogenous mix of various IoT technologies that have evolved over the years. This overview paper discusses a number of practical issues related to 5G-based IoT applications, particularly in Smart City environments, including the need for small cells, the transmission issues at millimeter wave frequencies, building penetration issues, the need for Distributed Antenna Systems, and the near term introduction of pre-5G IoT technologies such as NB-IoT and LTE-M, these being possible proxies for the commercial deployment and acceptance of 5G IoT.

This article looks at some of the challenges related to the deployment of the Internet Of Things (IoT), specifically to ascertain that security becomes an integral part of the technology rather than a bolted-on wrapper of limited efficacy. IoT security (IoTSec) is needed at all `layers' of the IoT environment and may be specific to the IoT `layer' in question.

The Internet of Things (IoT) is entering the daily operation of many industries; applications include but are not limited to smart cities, smart grids, smart homes, physical security, e-health, asset management, and logistics. For example, the concept of smart cities is emerging in multiple continents, where enhanced street lighting controls, infrastructure monitoring, public safety and surveillance, physical security, gunshot detection, meter reading, and transportation analysis and optimization systems are being deployed on a city-wide scale. A related and cost-effective user-level IoT application is the support of IoT-enabled smart buildings. Commercial space has substantial requirements in terms of comfort, usability, security, and energy management. IoT-based systems can support these requirements in an organic manner. In particular, power over Ethernet, as part of an IoT-based solution, offers disruptive opportunities in revolutionizing the in-building connectivity of a large swath of devices. However, a number of deployment-limiting issues currently impact the scope of IoT utilization, including lack of comprehensive end-to-end standards, fragmented cybersecurity solutions, and a relative dearth of fully-developed vertical applications. This paper reviews some of the technical opportunities offered and the technical challenges faced by the IoT in the smart building arena.

Number Theoretic Transforms (NTT) have been shown capable of implementing efficiently finite digital convolutions for signal processing applications in voice, video, and pattern recognition areas. In this paper the concept of Generalized Mersenne Numbers (GMN) is introduced with the goal of obtaining a new discrete transform having certain desirable properties. In particular we analyze Mersenne numbers rooted on 3, having the form m = 3t-2. Properties and necessary conditions of the GMN are investigated. Several structural characteristics are established.

In this paper, a technique is established and prepared tables are furnished for the sizing of trunk bundles which can be seized at both ends, but where different grade of service must be rendered at each end. An approximate approach is also discussed. These solutions find applications in the engineering of foreign exchange voice systems serving a customer base (low blocking) and interdepartmental communications (high blocking).

Protection against malicious failure is a very important issue in many network applications. While no general theory is easily developed, the following general statement emerges from any analysis: the combined link cost (topology) to guard against such failure is much higher than to protect against random failure. In this paper we first define precisely the concept of malicious failure and immediately show the severe cost implications. To constrast this a summary of the major results in random failure is provided. We then manually carry out some survivability computations on networks on a small number of nodes; we also address the issue of partial knowledge.

This paper describes an algorithm for estimating loss probability in a circuit-switched network. The estimate obtained by the algorithm is also compared with an estimate obtained through simulation.

It is shown that for typical operating parameters, the optimal packet length for a single link packet voice system is of the order of 300-700 bits. This is contrary to both the optimal length of a data packet (approximately 1000 bits), and documented experimental implementations of such network architecture for voice (approximately 1000 bits).

A store-and-forward broadcast radio network with mobile switching nodes is considered. The problems of monitoring connectivity changes in the network and updating information in switching nodes to enable routing of messages are addressed. Analytical models are developed for determining the fraction of time that switching nodes have correct information as a function of trajectory and speed for mobility, monitoring rate, traffic load, and network topology. The problems are parametrically investigated and results of monitoring rate to obtain performance requirements are obtained. These studies show that the monitoring rate is very sensitive to velocity; specifically, as the velocity doubles, so does the monitoring rate. These results are a first step in obtaining meaningful operating parameters to be used in experimental networks.

Recent studies have shown that packet radio networks (PRNET) can easily be saturated and become unstable unless efficient routing and flow control algorithms are used. To enable point-to-point packet transportation, network stations assign a code (label) to each repeater; the process of assigning such labels is referred to as "network initialization." The initialization procedure assumes that the network topology is not known a priori and is changing with time. Thus, the initialization procedure involves mapping of network topology, determining network structure (labels for repeaters), and transmitting labels to the repeaters. Although many authors have developed analytical models to study channel access schemes, no one has yet addressed directly the initialization issue. In this paper we present two models which enable one to estimate the optimal rates at which repeaters and stations must transmit connectivity information to minimize the network initialization time in a one-hop network. The first model assumes complete interference (all repeaters can communicate directly with each other), while the second (but more complex) model can provide initialization time under partial interference pattern. With these models we illustrate the effects of varying repeater and station transmission rates for small networks. Our most important results are that the network initialization time is relatively insensitive to the station transmission rate, but the repeater transmission rate must be carefully chosen to achieve rapid initialization.

A Packet Radio Network is a store-and-forward packet system employing radio links. A Mobile Packet Radio Network generalizes this system by allowing every radio unit to be independently in motion. In this paper a model for the analysis of connectivity as a function of time in such a network is presented and used to solve for parameters of interest. The model and the related analysis are guides for developing procedures for monitoring connectivity.

In this correspondence paper a technique for estimating the minimum number of frequencies required for Urban Mobile Radio Communication is presented. The technique is algebraic in origin and can be implemented as a computer algorithm.