A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model
Open Access
- 12 September 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 20 (7) , 913-924
Abstract
Network-wide broadcast (simply broadcast) is a frequently used operation in wireless ad hoc networks (WANETs). One promising practical approach for energy-efficient broadcast is to use localized algorithms to minimize the number of nodes involved in the propagation of the broadcast messages. In this context, the minimum forwarding set problem (MFSP) (also known as multipoint relay (MPR) problem) has received a considerable attention in the research community. Even though the general form of the problem is shown to be NP-complete, the complexity of the problem has not been known under the practical application context of ad hoc networks. In this paper, we present a polynomial time algorithm to solve the MFSP for wireless network under unit disk coverage model. We prove the existence of some geometrical properties for the problem and then propose a polynomial time algorithm to build an optimal solution based on these properties. To the best of our knowledge, our algorithm is the first polynomial time solution to the MFSP under the unit disk coverage model. We believe that the work presented in this paper will have an impact on the design and development of new algorithms for several wireless network applications including energy-efficient multicast, broadcast, and topology control protocols for WANETs and sensor networks.Keywords
This publication has 27 references indexed in Scilit:
- A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networksNetworks, 2003
- Algorithmic, geometric and graphs issues in wireless networksWireless Communications and Mobile Computing, 2003
- Forward‐node‐set‐based broadcast in clustered mobile ad hoc networksWireless Communications and Mobile Computing, 2003
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsJournal of Algorithms, 1998
- A survey of approximately optimal solutions to some covering and packing problemsACM Computing Surveys, 1997
- Simple heuristics for unit disk graphsNetworks, 1995
- Unit disk graphsDiscrete Mathematics, 1990
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975