Editing Optimized Flooding Protocol (OFP) for Ad Hoc Networks

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 overlapping. In OFP, nodes with the best coverage are selected to broadcast the message, reducing the number of transmissions.

Results: Simulation results showed that OFP is efficient and scalable. It requires fewer transmissions at higher densities and is resilient to transmission errors. The protocol performed well even in large networks and was able to reach a large fraction of nodes even when nodes were moving at high speeds.

Implications: OFP has several advantages, including minimizing the number of transmissions, not requiring nodes to know locations/addresses of all neighbors, and being robust to transmission errors. These features make OFP a promising solution for ad hoc networks and sensor networks operating in adverse conditions.

Link to Article: https://arxiv.org/abs/0311013v1
Authors: 
arXiv ID: 0311013v1

[[Category:Computer Science]]
[[Category:Ofp]]
[[Category:Networks]]
[[Category:Protocol]]
[[Category:Number]]
[[Category:Transmissions]]