### 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 | Proceedings - IEEE INFOCOM |

Pages | 1907-1915 |

Number of pages | 9 |

DOIs | |

Publication status | Published - 2012 Jun 4 |

Event | IEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States Duration: 2012 Mar 25 → 2012 Mar 30 |

### Other

Other | IEEE Conference on Computer Communications, INFOCOM 2012 |
---|---|

Country | United States |

City | Orlando, FL |

Period | 12/3/25 → 12/3/30 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Electrical and Electronic Engineering

### Cite this

*Proceedings - IEEE INFOCOM*(pp. 1907-1915). [6195566] https://doi.org/10.1109/INFCOM.2012.6195566