Cross-Layer Resource Allocation for Multihop V2X Communications

Algorithm 1

Price-Based Matching Algorithm.

(1) Initialization:

Calculate for each queue.

Initialize as an empty set. The set of mobile relays which receive more than one matching

proposal from queues is defined as , at the beginning.

For any mobile relay , setting

(2) Repeating:

If , preform the rule of matching with the mobile relay who has the maximum

preference according to Equation (22).

Each queue proposes to its most preferred vehicle in its preference list .

If any mobile relay receives only one proposal from a queue, then will be directly matched

with the mobile relay which sends the initial proposal. Otherwise, add in to set .

If , perform the price rising rule for mobile relays which received more than one matching

proposal.

Each mobile relay increase its price by adding .

Every queue which has proposed to updates its preference towards and remews its proposal.

Remove the vehicles which receive only proposal from .

End  Every queue has been matched with a mobile relay.