Subscribe

Issue No.07 - July (2009 vol.20)

pp: 913-924

Mehmet Baysan , University of Toronto, Toronto

Kamil Sarac , The University of Texas at Dallas, Richardson

Ramaswamy Chandrasekaran , The University of Texas at Dallas, Richardson

Sergey Bereg , The University of Texas at Dallas, Richardson

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.169

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.

INDEX TERMS

Multipoint relays, minimum forwarding set problem, network-wide broadcast, unit disk graphs.

CITATION

Mehmet Baysan, Kamil Sarac, Ramaswamy Chandrasekaran, Sergey Bereg, "A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model",

*IEEE Transactions on Parallel & Distributed Systems*, vol.20, no. 7, pp. 913-924, July 2009, doi:10.1109/TPDS.2008.169REFERENCES