Was FARP1 Actually Worth The Bucks?

e., priority list, into the data message and sends it. When the neighbors of the sender receive the data, a delay-contention scheme is used to convert the rebroadcast order to the respective delay and perform a rebroadcast schedule. Thus, the neighbors start to contest the opportunity to rebroadcast. A neighbor having higher order will rebroadcast earlier. If a vehicle receives redundant data (an echo) from a member of the same directional cluster, it will cancel its rebroadcast schedule and switch to an idle state. When the delay timer has expired, if a vehicle does not receive any data or just receives the data from the vehicles of other directional cluster, it will rebroadcast first. Therefore, the suppression technique not only can suppress redundant broadcasts, but also let Doxorubicin datasheet the data messages be disseminated in all potential directions. Notice that the protocol makes a local centralized decision in the sender to decide the rebroadcast order of neighbors. In fact, the local centralized decision can solve the hidden terminal problem in the multi-directional dissemination [10,29]. 3.1.1. Vector-Angle-Based Cluster Classification Mechanism A lightweight and flexible classification algorithm is designed, which only utilizes the position information rather than the digital road map. Therefore, it requires less computational power and fits more complex road topologies. Vector angle is used to identify whether the vehicles FARP1 belong to a directional cluster or not. Algorithm 1 describes the steps used to classify directional clusters. Algorithm 1. Vector-angle-based cluster classification algorithm Condition: the sender S receives a data message Input : the position of the sender S and its neighbors N(S) 1: while N(S)��? do 2: for i = 1 to num[N(S)], d = 1 do 3: N(S)=N(S)?ni? eliminate ni from N(S) 4: Cd��ni? sort ni into directional cluster Cd 5: for j = i to num [N(S)] do 6: if?(niSnj^selleck chemicals llc the angle ��1 between SN1�� and SN2�� can be obtained from their dot product (��1��[0,?��]). The algorithm compares ��1 with a threshold angle ��, e.g., ��=10��. If the angle ��1 is less than ��, the neighbor N2 is classified in the directional cluster C1. If not, the neighbor N2 still remains in the neighbor list for the next step. In the case of Figure 1, ��1