Vehicle-cluster-based opportunistic relays for data collection in intelligent transportation systems

被引:5
作者
Sun, Sheng [1 ]
Zhang, Zengqi [1 ,2 ]
Pan, Quyang [4 ]
Liu, Min [1 ,2 ,3 ]
Li, Zhongcheng [1 ,2 ]
机构
[1] Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China
[2] Univ Chinese Acad Sci, Sch Comp Sci & Technol, Beijing, Peoples R China
[3] Zhongguancun Lab, Beijing, Peoples R China
[4] Xidian Univ, Xian, Peoples R China
基金
中国国家自然科学基金;
关键词
Intelligent transportation system; Channel allocation; Device association; MACHINE-TYPE COMMUNICATION; RESOURCE-ALLOCATION; DATA AGGREGATION; NETWORKS; TRANSMISSION;
D O I
10.1016/j.comnet.2022.109509
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Intelligent transportation system (ITS) is envisioned to greatly improve traffic and enhance safety on roads. ITS relies on a huge amount of data generated from roadside sensor devices to make decisions. Due to the limited channel resources, the base station (BS) that connects with an ITS server can only collect data from parts of sensor devices at a time. To improve the number of device associations, we regard vehicle clusters as relays to collect data, which can avoid high capital expenditure and operating expenses from dedicated relays. Due to the frequently varying channel interference and the limited communication coverage of a vehicle cluster relay (VCR), it is challenging to guarantee the transmission rates and the fairness of sensor devices, which will affect the decisions of ITS. For this reason, we propose a Movement-and Fairness-Aware Heuristic (MFAH) algorithm to tackle the above challenges. MFAH sequentially conducts two novel channel allocation schemes, i.e., exclusive channel allocation scheme and compatible channel allocation scheme, to fast allocate channels and improve the channel utilization, which increases the number of device associations while guaranteeing the transmission rates. Regarding the fairness of each device's associations, we propose a device association scheme based on the cumulative number of device associations and the distance from the target VCR to select appropriate sensor devices to upload data. We theoretically analyze the lower bound of the obtained network utility. Extensive simulations show that compared with benchmarks, the proposed MFAH algorithm converges fast and effectively improves the network utility (i.e., increasing the number of device associations while guaranteeing the fairness of device associations).
引用
收藏
页数:13
相关论文
共 35 条
[31]   An Efficient Collaboration and Incentive Mechanism for Internet of Vehicles (IoV) With Secured Information Exchange Based on Blockchains [J].
Yin, Bo ;
Wu, Yulei ;
Hu, Tianshi ;
Dong, Jiaqing ;
Jiang, Zexun .
IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (03) :1582-1593
[32]   New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks [J].
Zhang, Degan ;
Ge, Hui ;
Zhang, Ting ;
Cui, Yu-Ya ;
Liu, Xiaohuan ;
Mao, Guoqiang .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2019, 20 (04) :1517-1530
[33]   Artificial Intelligence Inspired Transmission Scheduling in Cognitive Vehicular Communications and Networks [J].
Zhang, Ke ;
Leng, Supeng ;
Peng, Xin ;
Pan, Li ;
Maharjan, Sabita ;
Zhang, Yan .
IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (02) :1987-1997
[34]   Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading in Wireless Sensor Networks [J].
Zhao, Miao ;
Yang, Yuanyuan ;
Wang, Cong .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2015, 14 (04) :770-785
[35]   Energy Efficient V2X-Enabled Communications in Cellular Networks [J].
Zheng, Canjian ;
Feng, Daquan ;
Zhang, Shengli ;
Xia, Xiang-Gen ;
Qian, Gongbin ;
Li, Geoffrey Ye .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2019, 68 (01) :554-564