On the Set Cover Problem for Broadcasting in Wireless Ad Hoc Networks
| Autor: | Evangelos Papapetrou, Spiros N. Agathos |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Vehicular ad hoc network
business.industry Wireless ad hoc network Computer science Distributed computing Set cover problem Mobile ad hoc network Broadcasting Ad hoc wireless distribution service Computer Science Applications Optimized Link State Routing Protocol Modeling and Simulation Computer Science::Networking and Internet Architecture Electrical and Electronic Engineering business Greedy algorithm Computer network |
| Zdroj: | IEEE Communications Letters. 17:2192-2195 |
| ISSN: | 1089-7798 |
| DOI: | 10.1109/lcomm.2013.091913.131765 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|