A traffic flow-based and dynamic grouping-enabled resource allocation algorithm for LTE-D2D vehicular networks

Li, Guozhi; Yang, Zhihua; Chen, Shoufeng; Li, Yunhe; Yuan, Peng

doi:10.1109/iccchina.2016.7636858

Cited by 11 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Vehicular networks may also benefit from the adoption of D2D. In [7], the authors propose a traffic flow model based on a dynamic resource allocation algorithm to deal with the problem of vehicular communication, sharing the same licensed frequency spectrum as D2D communications, in a single LTE cell. In [8], the combination of LTE-D2D with MIMO is proposed to achieve low latency and better reliability in vehicular communication.…”

Section: Related Workmentioning

confidence: 99%

GROUPS-NET: Group meetings aware routing in multi-hop D2D networks

et al. 2017

View full text Add to dashboard Cite

Abstract-Device-to-device (D2D) communication will allow direct transmission between nearby mobile devices in the next generation cellular networks. A fundamental problem in multi-hop D2D networks is the design of forwarding algorithms that achieve, at the same time, high delivery ratio and low network overhead. In this work, we study group meetings' properties by looking at their structure and regularity with the goal of applying such knowledge in the design of a forwarding algorithm for D2D multi-hop networks. We introduce a forwarding protocol, namely GROUPS-NET, which is aware of social group meetings and their evolution over time. Our algorithm is parameter-calibration free and does not require any knowledge about the social network structure of the system. In particular, different from the state of the art algorithms, GROUPS-NET does not need communities' detection, which is a complex and expensive task. We validate our algorithm by using different publicly available data sources. In real-world large scale scenarios, our algorithm achieves approximately the same delivery ratio of the state-of-the-art solution with 40% less network overhead.

show abstract

Section: Related Workmentioning

confidence: 99%

GROUPS-NET: Group meetings aware routing in multi-hop D2D networks

et al. 2017

View full text Add to dashboard Cite

show abstract

“…With the envisioned new technologies such as traffic monitoring and management, active safety, route planning, clean transportation, unmanned driving, toll collection, entertainment and advertisement quickly developed [1], a dramatic burst of on-board data traffic demand can be expected shortly. Vehicular communication, as a potential solution, which includes vehicle-to-vehicle (V2V) communication and vehicle-to-infrastructure (V2I) communication, is gaining more and more attention recently from both academia and industry [2,3]. V2V communication adopts device-to-device (D2D) as its underlay enabling technology.…”

Section: Introductionmentioning

confidence: 99%

Iterative greedy user clustering algorithm for D2D–relay in vehicular communication systems

Wang

Zhou

et al. 2019

IET Microwaves, Antennas & Propagation

View full text Add to dashboard Cite

Device‐to‐device (D2D) communications help in improving the performance of wireless services in cellular networks via enabling cooperation among mobile users. Further, compared to traditional pairwise cooperation, cluster‐wise cooperation can achieve even higher spectral and power efficiency. D2D clustering certainly can be a great supporting technology for the future of intelligent transportation. In this study, the authors investigate the D2D–relay clustering network in the vehicular scenario and propose a new clustering scheme named iterative greedy user clustering (IGUC). By exploiting those vehicles with better channel state, system resources can be saved. Here, they mainly focus on the question which is by applying D2D–relay clustering among vehicles, how much bandwidth could be saved in the uplink. This problem is mathematically formulated into a non‐linear binary programming problem with the goal being minimum spectrum usage. Due to the NP‐hardness, the low‐complexity suboptimal algorithm IGUC is introduced to tackle it. Simulation results show that compared to the non‐cooperative uplink system, IGUC saves a considerable proportion of the spectrum. Furthermore, clusters in denser and further areas tend to produce a higher gain. Influence of the fast time‐varying characteristic of vehicular wireless channels is also investigated, upon which an adaptive switch mechanism is proposed to further facilitate IGUC.

show abstract

“…Resource allocation in resource-limited vehicular networks with a selected set of served services is an important topic and has been well studied [ 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 ]. The optimization objective in References [ 10 , 11 , 12 , 13 ] was the maximization of the network capacity. A resource allocation scheme with flexible node grouping was proposed in Reference [ 10 ] to utilize resources in a more efficient manner.…”

Section: Introductionmentioning

confidence: 99%

“…The optimization objective in References [ 10 , 11 , 12 , 13 ] was the maximization of the network capacity. A resource allocation scheme with flexible node grouping was proposed in Reference [ 10 ] to utilize resources in a more efficient manner. To meet different requirements for different vehicular links, the authors of References [ 11 , 12 ] maximized the ergodic capacity of V2I links while ensuring the reliability for each V2V link with a robust resource allocation.…”

Section: Introductionmentioning

confidence: 99%

A Low-Cost Resource Re-Allocation Scheme for Increasing the Number of Guaranteed Services in Resource-Limited Vehicular Networks

Meng

Yuan

et al. 2018

Sensors

View full text Add to dashboard Cite

Vehicular networks are becoming increasingly dense due to expanding wireless services and platooning has been regarded as a promising technology to improve road capacity and on-road safety. Constrained by limited resources, not all communication links in platoons can be allocated to the resources without suffering interference. To guarantee the quality of service, it is required to determine the set of served services at which the scale of demand exceeds the capability of the network. To increase the number of guaranteed services, the resource allocation has to be adjusted to adapt to the dynamic environment of the vehicular network. However, resource re-allocation results in additional costs, including signal overhead and latency. To increase the number of guaranteed services at a low-cost in a resource-limited vehicular network, we propose a time dynamic optimization method that constrains the network re-allocation rate. To decrease the computational complexity, the time dynamic optimization problem is converted into a deterministic optimization problem using the Lyapunov optimization theory. The simulation indicates that the analytical results do approximate the reality, and that the proposed scheme results in a higher number of guaranteed services as compared to the results of a similar algorithm.

show abstract

A traffic flow-based and dynamic grouping-enabled resource allocation algorithm for LTE-D2D vehicular networks

Cited by 11 publications

References 10 publications

GROUPS-NET: Group meetings aware routing in multi-hop D2D networks

GROUPS-NET: Group meetings aware routing in multi-hop D2D networks

Iterative greedy user clustering algorithm for D2D–relay in vehicular communication systems

A Low-Cost Resource Re-Allocation Scheme for Increasing the Number of Guaranteed Services in Resource-Limited Vehicular Networks

Contact Info

Product

Resources

About