| 1. |
- Baiocchi, Andrea, et al.
(författare)
-
Age of Information in IEEE 802.11p
- 2021
-
Ingår i: 2021 IFIP/IEEE International Symposium on Integrated Network Management (IM). - : IEEE. - 9783903176324 - 9781728190419 ; , s. 1024-1031
-
Konferensbidrag (refereegranskat)abstract
- Vehicle-to-Everything (V2X) communication is essential for facilitating connected and automated driving, where vehicles and other road traffic participants share data instantaneously and cooperate to solve tricky traffic situations in milliseconds. This paper proposes two stochastic models for the V2X standard IEEE 802.11p to characterize amongst other things the Age of Information (AoI), a recently-proposed metric that measures the freshness of information. The first model is based on renewal process analysis of a tagged station with mean field approximation, while the second one adopts Markov chain approach with network level view. Analytical results show that IEEE 802.11p, given its adaptability to event-triggered and aperiodic messaging, supports advanced cooperative driving scenarios.
|
|
| 2. |
- Balasubramaniam, Sasitharan, et al.
(författare)
-
Exploiting bacterial properties for multi-hop nanonetworks
- 2014
-
Ingår i: IEEE Communications Magazine. - Piscataway, NJ, USA : IEEE Press. - 0163-6804 .- 1558-1896. ; 52:7, s. 184-191
-
Tidskriftsartikel (refereegranskat)abstract
- Molecular communication is a relatively new communication paradigm for nanomachines where the communication is realized by utilizing existing biological components found in nature. In recent years researchers have proposed using bacteria to realize molecular communication because the bacteria have the ability to swim and migrate between locations, carry DNA contents (i.e. plasmids) that could be utilized for information storage, and interact and transfer plasmids to other bacteria (one of these processes is known as bacterial conjugation). However, current proposals for bacterial nanonetworks have not considered the internal structures of the nanomachines that can facilitate the use of bacteria as an information carrier. This article presents the types and functionalities of nanomachines that can be utilized in bacterial nanonetworks. A particular focus is placed on the bacterial conjugation and its support for multihop communication between nanomachines. Simulations of the communication process have also been evaluated, to analyze the quantity of bits received as well as the delay performances. Wet lab experiments have also been conducted to validate the bacterial conjugation process. The article also discusses potential applications of bacterial nanonetworks for cancer monitoring and therapy. © 2014 IEEE.
|
|
| 3. |
- Bocharova, Irina, et al.
(författare)
-
Characterizing Packet Losses in Vehicular Networks
- 2019
-
Ingår i: IEEE Transactions on Vehicular Technology. - Piscataway, NJ : IEEE. - 0018-9545 .- 1939-9359. ; 68:9, s. 8347-8358
-
Tidskriftsartikel (refereegranskat)abstract
- To enable testing and performance evaluation of new connected and autonomous driving functions, it is important to characterize packet losses caused by degradation in vehicular (V2X) communication channels. In this paper we suggest an approach to constructing packet loss models based on the socalled Pseudo-Markov chains (PMC). The PMC based model needs only short training sequences, has low computational complexity, and yet provides more precise approximations than known techniques. We show how to learn PMC models from either empirical records of packet receptions, or from analytical models of fluctuations in the received signal strength. In particular, we validate our approach by applying it on (i) V2X packet reception data collected from an active safety test run, which used the LTE network of the AstaZero automotive testing site in Sweden, and (ii) variants of the Rician fading channel models corresponding to two models of correlations of packet losses. We also show that initializing the Baum-Welch algorithm with a second order PMC model leads to a high accuracy model. © 2019 IEEE.
|
|
| 4. |
- Bocharova, Irina, et al.
(författare)
-
Low Delay Inter-Packet Coding in Vehicular Networks
- 2019
-
Ingår i: Future Internet. - Basel : MDPI. - 1999-5903. ; 11:12
-
Tidskriftsartikel (refereegranskat)abstract
- In Cooperative Intelligent Transportation Systems (C-ITSs), vehicles need to wirelessly connect with Roadside units (RSUs) over limited durations when such point-to-point connections are possible. One example of such communications is the downloading of maps to the C-ITS vehicles. Another example occurs in the testing of C-ITS vehicles, where the tested vehicles upload trajectory records to the roadside units. Because of real-time requirements, and limited bandwidths, data are sent as User Datagram Protocol (UDP) packets. We propose an inter-packet error control coding scheme that improves the recovery of data when some of these packets are lost; we argue that the coding scheme has to be one of convolutional coding. We measure performance through the session averaged probability of successfully delivering groups of packets. We analyze two classes of convolution codes and propose a low-complexity decoding procedure suitable for network applications. We conclude that Reed–Solomon convolutional codes perform better than Wyner–Ash codes at the cost of higher complexity. We show this by simulation on the memoryless binary erasure channel (BEC) and channels with memory, and through simulations of the IEEE 802.11p DSRC/ITS-G5 network at the C-ITS test track AstaZero.
|
|
| 5. |
- Bocharova, Irina, et al.
(författare)
-
Modeling Packet Losses in Communication Networks
- 2019
-
Ingår i: 2019 IEEE International Symposium on Information Theory. - Piscataway, N.J. : IEEE. - 9781538692912 - 9781538692905 - 9781538692929 ; , s. 1012-1016
-
Konferensbidrag (refereegranskat)abstract
- An approach to constructing discrete models of packet losses suitable for a wide variety of communication network applications is studied. It is based on estimating parameters of probabilistic automata described via so-called pseudo-Markov chains. The new technique is applied both to approximating a discrete time analog process at the output of known channel models and to the experimental data stream. Comparison of models is performed by computing probabilities of more than m losses out of n transmitted packets (P (≥ m, n)). It is shown that for the Rician fading channel with exponential correlation and correlation determined by a Bessel filter, the obtained rank-two and rank-three discrete modes, respectively, provide high accuracy coincidence of P (≥ m, n) performances. The rank-three discrete model computed on the experimental data stream obtained from the LTE network provides significantly better approximation of P (≥ m, n) performance than that obtained by the Baum-Welch algorithm.
|
|
| 6. |
- Campolo, Claudia, et al.
(författare)
-
Service Discovery and Access in Vehicle-to-Roadside Multi-Channel VANETs
- 2015
-
Ingår i: 2015 IEEE International Conference on Communication Workshop. - Piscataway, NJ : IEEE Press. - 9781467363051 ; , s. 2477-2482
-
Konferensbidrag (refereegranskat)abstract
- A wide portfolio of safety and non-safety services will be provided to drivers and passengers on top of Vehicular Ad Hoc Networks (VANETs).Non-safety services are announced by providers, e.g., road-side units (RSUs), on a channel that is different from the one where the services are delivered. The dependable and timely delivery of the advertisement messages is crucial for vehicles to promptly discover and access the announced services in challenging vehicle-to-roadside scenarios, characterized by intermittent and short lived connectivity.In this paper, we present an analytical framework that models the service advertisement and access mechanisms in multichannel vehicular networks.The model accounts for dual-radio devices, and computes the mean service discovery time and the service channel utilization by considering the disruption periods due to the switching of the RSU from the advertising channel (where announcements are transmitted) to the advertised channel (where services are exchanged), under different channel and mobility conditions. It provides quick insights on parameter settings to allow providers to improve service provisioning. © 2015 IEEE
|
|
| 7. |
- Díez Rodríguez, Victor, 1992-, et al.
(författare)
-
An Approach for Receiver-Side Awareness Control in Vehicular Ad Hoc Networks
- 2018
-
Ingår i: IEEE transactions on intelligent transportation systems (Print). - Piscataway : Institute of Electrical and Electronics Engineers (IEEE). - 1524-9050 .- 1558-0016. ; 19:4, s. 1227-1236
-
Tidskriftsartikel (refereegranskat)abstract
- Vehicular Ad hoc networks (VANET) are a key element of cooperative intelligent transport systems. One of the challenges in VANETs is dealing with awareness and congestion due to the high amount of messages received from the vehicles in communication range. As VANETs are used in critical applications, congestion on the receiver side caused by the buffering of the packets is a safety hazard. In this paper, we propose a streamwise queuing system on the receiver side and show how it improves the timeliness of the messages received and maintains the awareness of the system in a congestion situation. © Copyright 2017 IEEE
|
|
| 8. |
- Evdokimova, Ekaterina, et al.
(författare)
-
Internet Provisioning in VANETs : Performance Modeling of Drive-Thru Scenarios
- 2020
-
Ingår i: IEEE transactions on intelligent transportation systems (Print). - Piscataway, NJ : Institute of Electrical and Electronics Engineers (IEEE). - 1524-9050 .- 1558-0016. ; 21:7, s. 2801-2815
-
Tidskriftsartikel (refereegranskat)abstract
- Drive-thru-Internet is a scenario in cooperative intelligent transportation systems (C-ITSs), where a road-side unit (RSU) provides multimedia services to vehicles that pass by. Performance of the drive-thru-Internet depends on various factors, including data traffic intensity, vehicle traffic density, and radio-link quality within the coverage area of the RSU, and must be evaluated at the stage of system design in order to fulfill the quality-of-service requirements of the customers in C-ITS. In this paper, we present an analytical framework that models downlink traffic in a drive-thru-Internet scenario by means of a multidimensional Markov process: the packet arrivals in the RSU buffer constitute Poisson processes and the transmission times are exponentially distributed. Taking into account the state space explosion problem associated with multidimensional Markov processes, we use iterative perturbation techniques to calculate the stationary distribution of the Markov chain. Our numerical results reveal that the proposed approach yields accurate estimates of various performance metrics, such as the mean queue content and the mean packet delay for a wide range of workloads. © 2019 IEEE.
|
|
| 9. |
- Kleyko, Denis, et al.
(författare)
-
Modified Algorithm of Dynamic Frequency Hopping (DFH) in the IEEE 802.22 Standard
- 2014
-
Ingår i: Multiple Access Communications. - Cham : Springer. - 9783319102610 - 9783319102627 ; , s. 75-83
-
Konferensbidrag (refereegranskat)abstract
- IEEE 802.22 Cognitive Wireless Regional Area Networks is a first standard of wireless terrestrial system relying on cognitive radio concept and operating as an opportunistic system in the the vacant unoccupied frequency spaces of the licensed TV-frequency band. Concept of the proposed standard assumes special functionality to protect the operation of the primary licensed subscribers. Dynamic Frequency Hopping is the mechanism for providing connectionless operation of Wireless Regional Area Networks systems while ensuring protection of transmissions from the primary users. During its operation regular time gaps appear on the involved frequency channels. This paper introduces the concept of the efficient reuse of the vacant frequency resources appearing when using the Dynamic Frequency Hopping mode. The scheme for consecutive-parallel inclusion of the new Dynamic Frequency Hopping Communities-members in the Dynamic Frequency Hopping mode is presented. The proposed approach allows significantly decrease time of inclusion the new members into a new Dynamic Frequency Hopping Communities. © Springer International Publishing Switzerland 2014
|
|
| 10. |
- Kleyko, Denis, et al.
(författare)
-
Vehicle Classification using Road Side Sensors and Feature-free Data Smashing Approach
- 2016
-
Ingår i: 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC). - Piscataway : IEEE. - 9781509018895 - 9781509018888 - 9781509018901 ; , s. 1988-1993
-
Konferensbidrag (refereegranskat)abstract
- The main contribution of this paper is a study of the applicability of data smashing - a recently proposed data mining method - for vehicle classification according to the "Nordic system for intelligent classification of vehicles" standard, using measurements of road surface vibrations and magnetic field disturbances caused by passing vehicles. The main advantage of the studied classification approach is that it, in contrast to the most of traditional machine learning algorithms, does not require the extraction of features from raw signals. The proposed classification approach was evaluated on a large dataset consisting of signals from 3074 vehicles. Hence, a good estimate of the actual classification rate was obtained. The performance was compared to the previously reported results on the same problem for logistic regression. Our results show the potential trade-off between classification accuracy and classification method's development efforts could be achieved.
|
|
