Abstract
The broadcast is a fundamental operation in computer and communication networks. We study broadcast in multiradio multichannel multi-hop wireless networks. Suppose through configuration, each node is already assigned with a transmission power level and a set of radio channels for receiving and forwarding data. Our problem is to select a forward scheme for broadcasting from a given source node and to minimize total energy consumption. This is a known NP-hard minimization problem. In this paper, we construct a polynomial-time (1.35 + ε)(1+ln(n-1))-approximation algorithm where n is the number of nodes in given network and ε is any positive constant. We also show that there is no polynomial-time (ρ ln n)-approximation for 0 < ρ < 1 unless NP ⊆ DTIME(n O(log log n)).
| Original language | English |
|---|---|
| Title of host publication | 2012 Proceedings IEEE INFOCOM, INFOCOM 2012 |
| Pages | 1907-1915 |
| Number of pages | 9 |
| DOIs | |
| State | Published - 2012 |
| Externally published | Yes |
| Event | IEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States Duration: 25 Mar 2012 → 30 Mar 2012 |
Publication series
| Name | Proceedings - IEEE INFOCOM |
|---|---|
| ISSN (Print) | 0743-166X |
Conference
| Conference | IEEE Conference on Computer Communications, INFOCOM 2012 |
|---|---|
| Country/Territory | United States |
| City | Orlando, FL |
| Period | 25/03/12 → 30/03/12 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 7 Affordable and Clean Energy
Fingerprint
Dive into the research topics of 'Energy efficient broadcast in multiradio multichannel wireless networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver