Various radio technologies address the diverse performance requirements of today's ITS applications and compete for deployment. Instead of choosing a specific technology, a heterogeneous mix of currently available as well as emerging V2X technologies is considered. Benefits are: the support of mixed deployments, flexible technology choice based on application requirements and reliability enhancements achieved by redundancy concepts. Besides presenting the highly heterogeneous architecture, we show the implementation design of its main components. Further we present a proof-of-concept implementation, which is validated in the Dresden test-bed for different use cases.

In this paper we introduce an Intelligent Transport System (ITS), designed for enabling cooperative driving manoeuvres in mixed traffic scenarios considering heterogeneous communications and cloud infrastructure systems. We present an architecture that enables connected vehicles to access ITS services independent of their underlying communication technology. This is achieved by introducing a large scale communication system including the road-side infrastructure as well as a heterogeneous cloud. We present insights from the Automated Connected Vehicle (ACV) concept and examine human factors elaborating on the experience of two aspects: driving in an ACV as well as driving in a Non-Automated Connected Vehicle (NACV), interacting with an ACV. Furthermore, we present insights of initial demonstrations, emphasizing that the system works well in real traffic scenarios.

The fifth generation (5G) of mobile networks is envisioned to support new applications having demanding requirements, such as low latency and high reliability, which is the focus of this article along with enhanced traditional mobile broadband and massive sensing. Different approaches have already been proposed to achieve low latency while guaranteeing high reliability. However, the challenge of efficient resource utilization remains. In this article, concepts for a flexible and low-latency-enabling mobile network architecture are presented, along with strategies for staying efficient. The work is put in perspective with respect to ongoing standardization activities. Finally, future visions for network management architectures and 5G's impact on economic aspects are discussed.

Automated driving is an active topic of research, while first results have already found their way into productive use. Nonetheless, nearly all of today’s vehicles are still non-automated. Most modern vehicles, however, are equipped with communication capabilities. Hence, combining these two developments and enabling sophisticated cooperative maneuvers is an important step in the development of Intelligent Transport System (ITS). In this work, we describe a heterogeneous architecture that enables connected vehicles to access ITS services both via a mobile communication system and via the road-side infrastructure. The introduced ITS is designed to realize cooperative maneuvers in mixed traffic scenarios using heterogeneous cloud infrastructure systems. This work shows the Automated Connected Vehicle (ACV) concept used and the human factors while driving an ACV as well as driving a Non-Automated Connected Vehicle (NACV) that interacts with an ACV. Furthermore, we show that the system works well in real traffic scenarios by presenting insights of demonstrations.

A vertex subset W⊆ V of the graph G=(V,E) is an independent dominating set if every vertex in V\ W is adjacent to at least one vertex in W and the vertices of W are pairwise non-adjacent. The independent domination polynomial is the ordinary generating function for the number of independent dominating sets in the graph. We investigate in this paper properties of the independent domination polynomial and some interesting connections to well known counting problems.

A vertex subset W subset of V of the graph G = (V, E) is a total dominating set if every vertex of the graph is adjacent to at least one vertex in W. The total domination polynomial is the ordinary generating function for the number of total dominating sets in the graph. We investigated some graph products for a generalization of the total domination polynomial, called the trivariate total domination polynomial. We also show that the chromatic polynomial is encoded in the independent domination polynomial of some graph products. These results have a wide applicability to other domination related graph polynomials, e.g. the domination polynomial, the independent domination polynomial or the independence polynomial. (C) 2015 Elsevier B.V. All rights reserved.

This paper introduces a trivariate graph polynomial that is a common generalization of the domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial of a graph. This new graph polynomial, called the bipartition polynomial, permits a variety of interesting representations, for instance as a sum ranging over all spanning forests. As a consequence, the bipartition polynomial is a powerful tool for proving properties of other graph polynomials and graph invariants. We apply this approach to show that, analogously to the Tutte polynomial, the Ising polynomial introduced by Andren and Markstrom in [3], can be represented as a sum over spanning forests.