Polynomial time solution to minimum forwarding set problem in wireless networks under disk coverage model

  • Authors:

  • Mehmet Baysan;Kamil Sarac;R. Chandrasekaran

  • Affiliations:

  • Neuro-Oncology Branch, National Cancer Institute, National Institute of Neurological Disease and Stroke, National Institutes of Health, Bethesda, MD, United States;Dept. of Computer Sci., Univ. Texas at Dallas, Richardson, TX, United States;Dept. of Computer Sci., Univ. Texas at Dallas, Richardson, TX, United States

  • Venue:
  • Ad Hoc Networks
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we consider a practical problem, called Minimum Forwarding Set Problem (MFSP), that emerges within the context of implementing (energy efficient) communication protocols for wireless ad hoc or sensor networks. For a given node v, MFSP asks for a minimum cardinality subset of 1-hop neighbors of v to cover v's 2-hop neighbors. MFSP problem is also known as multi-point relay (MPR) problem. It is shown to be an NP-complete problem for its general case that does not consider the coverage characteristics of wireless transmissions. In this paper, we present two polynomial time algorithms to solve the MFSP problem under disk coverage model for wireless transmissions. In our earlier work, we presented a polynomial time algorithm for this problem under unit disk coverage model. In the current work, we present several observations on the geometric characteristics of wireless transmissions under disk coverage model and build two alternative dynamic programming based solutions with different run time and space complexities to the problem. Disk coverage model is a more general model because it allows nodes to use arbitrary power levels for transmissions. As a result, the presented algorithms provide a more practical solution that can be used as a building block for energy efficient communication protocols designed for wireless ad hoc and sensor networks.