DPMS: A Swift Data Dissemination Protocol Based on Map Splitting

Abstract

The main objective of the VANET networks is to improve road safety as well as transport efficiency through the use of communications technology and the emergence of wireless devices at low cost. Thus, the design of an efficient dissemination protocol, that informs vehicles about interesting safety and nonsafety events, is of paramount importance. The thriving challenge would be to maximize the delivery ratio by avoiding as far as possible the broadcast storm problem. A scrutiny of the literature wealthy number of approaches highlights that all of them fail to fulfill with the "sine qua non" requirements that we introduce. In this paper and to palliate this shortage, we introduce a new infrastructure-less geocast approach, called DPMS (data Dissemination Protocol based on Map Splitting). The main thrust of DPMS stands in reaching a high delivery ratio as well as a high geocast precision by sending messages only to vehicles in the Zone of Relevance (ZOR) with a minimum overhead cost. Carried out experiments showed that DPMS outperforms its competitors in terms of effectiveness and efficiency.

Industrial Internet of Things Based Efficient and Reliable Data Dissemination Solution for Vehicular Ad Hoc Networks

“…A geocast Data dissemination Protocol based on Map Splitting (DPMS) [29] does not require any infrastructure support. It splits the map of an urban scenario into multiple regions.…”

“…(angle ≥ 181 ∘ and angle ≤ 360 ∘ ) then //waiting time for priority 1 & 2 (13) if R inside the ideal segment i.e. (angle ≥ 226 ∘ and angle ≤ 324 ∘ ) then (14) Delay = defaultdelay + random(0, 0.01); //set waiting time for priority 1 (15) end (16) else //set the waiting time for and priority 2 (17) Delay = defaultdelay + random(0.02, 0.04); (18) end (19) end (20) else // if inside the ahead segment, set waiting time for priority 3 (21) Delay = defaultdelay + random(0.05, 0.07); (22) end (23) R i .ScheduleMessage(Delay); //R has to schedule the transmission (24) end (25) else (26) if Scheduled message then // if already scheduled, cancel scheduling and discard (27) if Dist(R i , S) > Dist(Tj, S) then// calculate the distance (28) Discards the received message; (29) end (30) end (31) Cancel message scheduled; (32) end (33) end Procedure Algorithm 1: Verifies whether the receiving vehicle (R) is positioned in ideal, normal, or ahead segment of the wagon wheel. It also computes the corresponding waiting time (P1/P2/P3) for R i vehicles to schedule the transmission of received data packet.…”