Paper Info
Title
On the Set Cover Problem for Broadcasting in Wireless Ad Hoc Networks.
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.
Year
DOI
Venue
2013
10.1109/LCOMM.2013.091913.131765
IEEE Communications Letters
Keywords
Field
DocType
Mobile ad hoc networks,Broadcasting,Context,Heuristic algorithms,Wireless communication,Mobile communication
Mobile ad hoc network,Broadcasting,Set cover problem,Computer science,Computer network,Greedy algorithm,Ad hoc wireless distribution service,Optimized Link State Routing Protocol,Wireless ad hoc network,Vehicular ad hoc network,Distributed computing
Journal
Volume
Issue
ISSN
17
11
1089-7798
Citations 
PageRank 
References 
4
0.44
9
Authors
2
Name
Order
Citations
PageRank
Spiros N. Agathos1293.68
Evangelos Papapetrou2547.26