A Robust Emergency Messages Routing Scheme for Urban VANETs

Vehicular ad-hoc networks(VANETs)play an essential role in enhancing transport infrastructure by making vehicles intelligent and proficient in preventing traffic fatalities.Direction-based greedy protocols pick the next route vehicle for transmitting emergency messages(EMs)depending upon the present location of adjacent vehicles towards sink vehicles by using an optimal uni-directional road traffic approach.Nevertheless,such protocols suffer performance degradation by ignoring the moving directions of vehicles in bi-directional road traffic where topological changes happen continuously.Due to the high number of vehicles,it is essential to broadcast EMs to all vehicles to prevent traffic delays and collisions.A cluster-based EM transmitting technique is proposed in this paper.For urban VANETs,this paper pioneers the clustering of bi-directional road traffic for robust and efficient routing of EMs.In this regard,this paper introduces a routing protocol,namely,the bi-directional urban routing protocol(BURP).In addition to the paths and relative locations of vehicles,BURP takes account of the distance parameter by using the Hamming distance function to determine the direction ofmotion of vehicles and communicates EMs through the cluster head(CH).Amodified k-medoids algorithm is presented for the clustering of bi-directional road traffic.A median method is presented for selecting CH to ensure the longrunning of a cluster.Simulation results show that BURP provides enhanced throughput,a maximized packet delivery ratio,low energy consumption,and network delay relative to eminent routing protocols.

NEW NONSTANDARD JOB SHOP SCHEDULING ALGORITHM

Considering the complex constraint between operations in nonstandard job shop scheduling problem （NJSSP）, critical path of job manufacturing tree is determined according to priority scheduling function constructed. Operations are divided into dependent operations and independent operations with the idea of subsection, and corresponding scheduling strategy is put forward according to operation characteristic in the segment and the complementarities of identical function machines. Forward greedy rule is adopted mainly for dependent operations to make operations arranged in the right position of machine selected, then each operation can be processed as early as possible, and the total processing time of job can be shortened as much as possible. For independent operations optimum scheduling rule is adopted mainly, the inserting position of operations will be determined according to the gap that the processing time of operations is subtracted from idle time of machine, and the operation will be inserted in the position with minimal gap. Experiments show, under the same conditions, the result that operations are scheduled according to the object function constructed, and the scheduling strategy adopted is better than the result that operations are scheduled according to efficiency scheduling algorithm.