基于时隙的R2V网络上行链路规划通信价值最大化研究

Time-Slot Based Transmission Value Maximization of Uplink in R2V Network

对路边单元与车辆之间(R^2V)进行上行数据传输的价值最大化问题进行了研究,通过对RSU时域进行时隙划分,采用Santa Claus Problem进行规约,证明了传输价值最大化是NPC问题,并进行了线性规划描述.分别对静态和动态的场景进行了模拟,针对静态场景,提出了近似比为1+ε的多项式时间近似调度算法(PTAS);针对动态场景,分别模拟了先到先服务算法(FCFS),以及基于速度、权重、传输量为启发函数的启发式算法(WFCS).仿真结果表明:WFCS算法能更好地适应网络通信价值最大化的需要,在保证网络服务质量的同时有效提升网络整体通信价值.

This paper focused on the transmission value maximization problem of uplink between RSU to Vehicles（R2V）.Through division of the RSU time-slot and reduction from Santa Claus Problem,the problem was proved to be NP-Complete problem,and this problem was formulated by linear programming method. Both the static and dynamic scenarios were simulated,for static scenario,the Polynomial-Time Approximate Scheme（PTAS） was proposed which can achieve 1 ＋ εperformance ratio. For dynamic scenario,the First Come First Serve（FCFS） algorithm,and the heuristic algorithm Weight Fixed Communication Scheme（WFCS） based on speed,weight and data transmission rate were simulated respectively. The results showed that the WFCS algorithm can meet the needs of network transmission value maximization better. Both improved maximum transmission value and guaranteed the network Qo S.