DMCA
A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model
Cached
Download Links
| Citations: | 2 - 0 self |
BibTeX
@MISC{Baysan_apolynomial,
author = {Mehmet Baysan and Kamil Sarac and R. Chandrasekaran and Sergey Bereg},
title = {A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Network-wide broadcast (simply broadcast) is a frequently used operation in wireless ad hoc networks. 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 multi-point 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 problem 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 problem 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 wireless ad hoc networks and sensor networks.
Keyphrases
unit disk coverage model wireless network polynomial time solution minimum forwarding set problem polynomial time algorithm mfsp problem wireless ad hoc network general form optimal solution multi-point relay geometrical property energy efficient broadcast localized algorithm considerable attention minimum forwarding new algorithm network-wide broadcast several wireless network application broadcast message research community practical application context practical approach topology control energy efficient multicast ad hoc network sensor network first polynomial time solution
