Optimized Flooding Protocol (OFP) for Ad Hoc Networks: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:5114:51, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,440 bytes +1,440‎ Created page with "Title: Optimized Flooding Protocol (OFP) for Ad Hoc Networks Research Question: How can we design an efficient and scalable flooding protocol for ad hoc networks to minimize the number of transmissions while still covering the entire region? Methodology: The researchers proposed the Optimized Flooding Protocol (OFP), which is based on a variation of The Covering Problem. This problem involves finding the minimum number of circles needed to cover a region without overla..."
Retrieved from "https://simplesci.org/wiki/Optimized_Flooding_Protocol_(OFP)_for_Ad_Hoc_Networks"