A Stochastic Hybrid Framework for Driver Behavior Modeling Based on Hierarchical Dirichlet Process

Scalability is one of the major issues for real-world Vehicle-to-Vehicle network realization. To tackle this challenge, a stochastic hybrid modeling framework based on a non-parametric Bayesian inference method, i.e., hierarchical Dirichlet process (HDP), is investigated in this paper. This framework is able to jointly model driver/vehicle behavior through forecasting the vehicle dynamical time-series. This modeling framework could be merged with the notion of model-based information networking, which is recently proposed in the vehicular literature, to overcome the scalability challenges in dense vehicular networks via broadcasting the behavioral models instead of raw information dissemination. This modeling approach has been applied on several scenarios from the realistic Safety Pilot Model Deployment (SPMD) driving data set and the results show a higher performance of this model in comparison with the zero-hold method as the baseline.Comment: This is the accepted version of the paper in 2018 IEEE 88th Vehicular Technology Conference (VTC2018-Fall) (references added, title and abstract modified

Cross-layer design of multi-hop wireless networks

MULTI -hop wireless networks are usually defined as a collection of nodes equipped with radio transmitters, which not only have the capability to communicate each other in a multi-hop fashion, but also to route each others’ data packets. The distributed nature of such networks makes them suitable for a variety of applications where there are no assumed reliable central entities, or controllers, and may significantly improve the scalability issues of conventional single-hop wireless networks. This Ph.D. dissertation mainly investigates two aspects of the research issues related to the efficient multi-hop wireless networks design, namely: (a) network protocols and (b) network management, both in cross-layer design paradigms to ensure the notion of service quality, such as quality of service (QoS) in wireless mesh networks (WMNs) for backhaul applications and quality of information (QoI) in wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of this Ph.D. dissertation, different network settings are used as illustrative examples, however the proposed algorithms, methodologies, protocols, and models are not restricted in the considered networks, but rather have wide applicability. First, this dissertation proposes a cross-layer design framework integrating a distributed proportional-fair scheduler and a QoS routing algorithm, while using WMNs as an illustrative example. The proposed approach has significant performance gain compared with other network protocols. Second, this dissertation proposes a generic admission control methodology for any packet network, wired and wireless, by modeling the network as a black box, and using a generic mathematical 0. Abstract 3 function and Taylor expansion to capture the admission impact. Third, this dissertation further enhances the previous designs by proposing a negotiation process, to bridge the applications’ service quality demands and the resource management, while using WSNs as an illustrative example. This approach allows the negotiation among different service classes and WSN resource allocations to reach the optimal operational status. Finally, the guarantees of the service quality are extended to the environment of multiple, disconnected, mobile subnetworks, where the question of how to maintain communications using dynamically controlled, unmanned data ferries is investigated

INRISCO: INcident monitoRing in Smart COmmunities

Major advances in information and communication technologies (ICTs) make citizens to be considered as sensors in motion. Carrying their mobile devices, moving in their connected vehicles or actively participating in social networks, citizens provide a wealth of information that, after properly processing, can support numerous applications for the benefit of the community. In the context of smart communities, the INRISCO [1] proposal intends for (i) the early detection of abnormal situations in cities (i.e., incidents), (ii) the analysis of whether, according to their impact, those incidents are really adverse for the community; and (iii) the automatic actuation by dissemination of appropriate information to citizens and authorities. Thus, INRISCO will identify and report on incidents in traffic (jam, accident) or public infrastructure (e.g., works, street cut), the occurrence of specific events that affect other citizens' life (e.g., demonstrations, concerts), or environmental problems (e.g., pollution, bad weather). It is of particular interest to this proposal the identification of incidents with a social and economic impact, which affects the quality of life of citizens.This work was supported in part by the Spanish Government through the projects INRISCO under Grant TEC2014-54335-C4-1-R, Grant TEC2014-54335-C4-2-R, Grant TEC2014-54335-C4-3-R, and Grant TEC2014-54335-C4-4-R, in part by the MAGOS under Grant TEC2017-84197-C4-1-R, Grant TEC2017-84197-C4-2-R, and Grant TEC2017-84197-C4-3-R, in part by the European Regional Development Fund (ERDF), and in part by the Galician Regional Government under agreement for funding the Atlantic Research Center for Information and Communication Technologies (AtlantTIC)

JiTS: Just-in-Time Scheduling for Real-Time Sensor Data Dissemination

We consider the problem of real-time data dissemination in wireless sensor networks, in which data are associated with deadlines and it is desired for data to reach the sink(s) by their deadlines. To this end, existing real-time data dissemination work have developed packet scheduling schemes that prioritize packets according to their deadlines. In this paper, we first demonstrate that not only the scheduling discipline but also the routing protocol has a significant impact on the success of real-time sensor data dissemination. We show that the shortest path routing using the minimum number of hops leads to considerably better performance than Geographical Forwarding, which has often been used in existing real-time data dissemination work. We also observe that packet prioritization by itself is not enough for real-time data dissemination, since many high priority packets may simultaneously contend for network resources, deteriorating the network performance. Instead, real-time packets could be judiciously delayed to avoid severe contention as long as their deadlines can be met. Based on this observation, we propose a Just-in-Time Scheduling (JiTS) algorithm for scheduling data transmissions to alleviate the shortcomings of the existing solutions. We explore several policies for non-uniformly delaying data at different intermediate nodes to account for the higher expected contention as the packet gets closer to the sink(s). By an extensive simulation study, we demonstrate that JiTS can significantly improve the deadline miss ratio and packet drop ratio compared to existing approaches in various situations. Notably, JiTS improves the performance requiring neither lower layer support nor synchronization among the sensor nodes

SAI: safety application identifier algorithm at MAC layer for vehicular safety message dissemination over LTE VANET networks

Vehicular safety applications have much significance in preventing road accidents and fatalities. Among others, cellular networks have been under investigation for the procurement of these applications subject to stringent requirements for latency, transmission parameters, and successful delivery of messages. Earlier contributions have studied utilization of Long-Term Evolution (LTE) under single cell, Friis radio, or simplified higher layer. In this paper, we study the utilization of LTE under multicell and multipath fading environment and introduce the use of adaptive awareness range. Then, we propose an algorithm that uses the concept of quality of service (QoS) class identifiers (QCIs) along with dynamic adaptive awareness range. Furthermore, we investigate the impact of background traffic on the proposed algorithm. Finally, we utilize medium access control (MAC) layer elements in order to fulfill vehicular application requirements through extensive system-level simulations. The results show that, by using an awareness range of up to 250 m, the LTE system is capable of fulfilling the safety application requirements for up to 10 beacons/s with 150 vehicles in an area of 2 × 2 km2. The urban vehicular radio environment has a significant impact and decreases the probability for end-to-end delay to be ≤100 ms from 93%–97% to 76%–78% compared to the Friis radio environment. The proposed algorithm reduces the amount of vehicular application traffic from 21 Mbps to 13 Mbps, while improving the probability of end-to-end delay being ≤100 ms by 20%. Lastly, use of MAC layer control elements brings the processing of messages towards the edge of network increasing capacity of the system by about 50%