DocumentCode
28129
Title
On the Set Cover Problem for Broadcasting in Wireless Ad Hoc Networks
Author
Agathos, Spiros ; Papapetrou, Evangelos
Volume
17
Issue
11
fYear
2013
fDate
Nov-13
Firstpage
2192
Lastpage
2195
Abstract
The set cover problem has been extensively used in broadcast algorithms to model the process of selecting the nodes that should forward a message. Surprisingly, none of the research efforts focuses on solving the set cover problem. Instead, virtually every broadcast scheme uses the well known and generic purpose Greedy Set Cover (GSC) algorithm to tackle the problem. We focus on solving the set cover problem in the context of wireless ad hoc networks and show that providing an efficient solution has a significant performance impact on broadcast algorithms.
Keywords
ad hoc networks; broadcasting; greedy algorithms; set theory; GSC algorithm; broadcast algorithms; broadcasting; greedy set cover algorithm; set cover problem; virtually every broadcast scheme; wireless ad hoc networks; Broadcasting; Context; Heuristic algorithms; Mobile ad hoc networks; Mobile communication; Wireless communication; Broadcasting; dominant pruning; multipoint relay; set cover; wireless ad hoc networks;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2013.091913.131765
Filename
6612768
Link To Document