Research Article
An MSCN-Based Virtual Computing Cell-Oriented BSM Dissemination Mechanism
| Input: cluster member set C, bus and taxi set B, center coordinates of the cluster (xcn, ycn), and VirCC number n. | | Output: MSCN vector: MSCN_vector | (1) | For each c ∈ C, do | (2) | BSMvehicle_brocast (c) | (3) | Tneighbor.pushback (BSMvehicle) | (4) | End for | (5) | For each b ∈ B, do | (6) | W ← cal_MSCNcriteria (Tneighbor) | (7) | (xtn, ytn) ← Getposition (b) | (8) | VirCCnum ← getVirCC_num ((xtn, ytn), (xcn, ycn)) | (9) | If W ≥ getW_min (VirCCnum), then | (10) | Set W_min (VirCCnum, W) | (11) | MSCNid ← getid (b) | (12) | set_MSCN (VirCCnum, MSNCid) | (13) | End if | (14) | End for | (15) | For i = 1 to n, do | (16) | MSCN_vector.pushback (get_MSCN (i)) | (17) | End for | (18) | Return MSCN_vector |
|