## Efficient multihop broadcast for wideband systems (2002)

Venue: | In DIMACS Workshop on Signal Processing for Wireless Transmission |

Citations: | 25 - 3 self |

### BibTeX

@INPROCEEDINGS{Maric02efficientmultihop,

author = {Ivana Maric and Roy Yates},

title = {Efficient multihop broadcast for wideband systems},

booktitle = {In DIMACS Workshop on Signal Processing for Wireless Transmission},

year = {2002},

publisher = {American Mathematical Society}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we address the minimum-energy broadcast problem. To increase the energy efficiency, we allow nodes that are out of the transmission range of a transmitter to collect the energy of unreliably received overheard signals. As a message is forwarded through the network, a node will have multiple opportunities to reliably receive the message by collecting energy during each retransmission. We refer to this strategy as accumulative broadcast. Under the assumption that the nodes reliably forward messages, we formulate the minimum-energy accumulative broadcast problem. We present a solution employing two subproblems. First, we identify the ordering in which nodes should transmit. Second, we determine the optimum power levels for that ordering. While the second subproblem can be solved by means of linear programming, the ordering subproblem is found to be NP-complete. We devise a heuristic algorithm to find a good ordering and evaluate the performance of the algorithm. Preliminary results show the performance of the heuristic algorithm is generally close to the optimum solution. Results also show a significant improvement compared to the well known BIP algorithm for constructing an

### Citations

8563 |
Elements of Information Theory
- Cover, Thomas
- 1991
(Show Context)
Citation Context ... all the nodes beyond the transmission range. We view each orthogonal channel as a discrete-time Gaussian channel by representing a waveform of duration T as a vector in the n = 2WT dimensional space =-=[4]-=-. Then, during the ith symbol interval of length T , a source node, labeled node 1, transmits a codeword (vector) X n (i) from a (2 nR ,n) Gaussian code that is generated according to the distribution... |

1832 | Capacity of multi-antenna Gaussian channels
- Telatar
- 1995
(Show Context)
Citation Context ... with covariance matrix Kn = σ2IK. It follows that the mutual information is I(x; y) = 1 2 log � �m−1 k=1 2 1+ hmkPk σ2 � (2) bits. This is precisely the capacity of a multi-antenna system derived in =-=[10]-=- with m − 1 transmitting antennas and one receiving antenna. It follows from Equation (2) that the maximal number of bits per second that can be transmitted in the system given by Equation (1) is � �m... |

1271 |
Combinatorial Optimization: Algorithms and Complexity
- Papadimitriou, Steiglitz
- 1982
(Show Context)
Citation Context ...broadcasting in a wireless network was introduced in [13] and formulated as a minimum-cost broadcast tree problem. In a wired network, the minimum-cost broadcast tree can be found in O(n2 )operations =-=[8]-=-. However, in the wireless network, this problem was shown in [6] to be NP-hard and later on, in [1, 2, 7] to be NP-complete. The greater difficulty of the wireless broadcast problem tree stems from t... |

655 |
El Gamal, “Capacity theorems for the relay channel
- Cover, A
- 1979
(Show Context)
Citation Context ... for a typical path exponent of α = 3, the received signal at a node within 90 meters of the transmitter is likely to be above the receiver noise floor. Moreover, it was observed in the relay channel =-=[3]-=- that utilizing unreliable overheard information was essential to achieving capacity. We borrow this idea and re-examine the minimum energy broadcast problem under the assumption that nodes can exploi... |

418 | Energy-efficient broadcast and multicast trees in wireless networks.” Mobile Networks and Applications
- Wieselthier, Nguyen, et al.
- 2007
(Show Context)
Citation Context ... wireless network, the objective is to broadcast data reliably to all network nodes at a fixed rate with minimum transmitted power. The problem of broadcasting in a wireless network was introduced in =-=[13]-=- and formulated as a minimum-cost broadcast tree problem. In a wired network, the minimum-cost broadcast tree can be found in O(n2 )operations [8]. However, in the wireless network, this problem was s... |

281 | Spectral Efficiency in the Wideband Regime
- Verdú
- 2002
(Show Context)
Citation Context ... /(N0 ln 2) bits requires received energy of ET = PT, revealing the well known fact that for the reliable reception of one information bit, a receiver has to collect at least ET = N0 ln 2 Joules/bit. =-=[11]-=-. This energy can be collected at a node m during one transmission interval [0,T] when a transmitter j is signaling with power p =(N0ln 2)/(hmjT ). However, ins4 IVANA MARIC AND ROY YATES the system g... |

181 | On the capacity of wireless networks: The relay case
- Gastpar, Vetterli
- 2002
(Show Context)
Citation Context ... since it would violate the condition for the upper bound. 2 Not allowing the noisy observations to be amplified and sent at relays makes achieving the broadcast cut-set bound impossible. As shown in =-=[5]-=-, this bound can be asymptotically achieved in a network with one source-destination pair as the number of relays goes to infinity. Again, this situation is equivalent to the multi-antenna system [10]... |

129 | Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
- Cagalj, Hubaux, et al.
- 2002
(Show Context)
Citation Context ...ree problem. In a wired network, the minimum-cost broadcast tree can be found in O(n 2 ) operations [8]. However, in the wireless network, this problem was shown in [6] to be NP-hard and later on, in =-=[1, 2, 7]-=- to be NP-complete. The greater difficulty of the wireless broadcast problem tree stems from the “wireless multicast advantage” [13], the fact that a wireless transmission can be received by all nodes... |

111 | Minimum-energy broadcast routing in static ad hoc wireless networks
- Cǎlinescu, Li, et al.
(Show Context)
Citation Context ...heuristics for constructing energy-efficient broadcast trees have been proposed in literature and evaluated through simulations. The quantitative characterization of three such algorithms is given in =-=[12]-=-. The wireless formulation of the minimum energy broadcast problem assumes that a node can benefit from a certain transmission only if the received power is above a threshold required for reliable com... |

96 |
Constructing minimum-energy broadcast trees in wireless ad hoc networks
- Liang
- 2002
(Show Context)
Citation Context ... tree problem. In a wired network, the minimum-cost broadcast tree can be found in O(n2 )operations [8]. However, in the wireless network, this problem was shown in [6] to be NP-hard and later on, in =-=[1, 2, 7]-=- to be NP-complete. The greater difficulty of the wireless broadcast problem tree stems from the “wireless multicast advantage” [13], the fact that a wireless transmission can be received by all nodes... |

67 | Algorithms for energyefficient multicasting in static ad hoc wireless networks - Wieselthier, Nguyen, et al. |

41 | On minimum-energy broadcasting in all-wireless networks
- Li, Nikolaidis
(Show Context)
Citation Context ...mulated as a minimum-cost broadcast tree problem. In a wired network, the minimum-cost broadcast tree can be found in O(n2 )operations [8]. However, in the wireless network, this problem was shown in =-=[6]-=- to be NP-hard and later on, in [1, 2, 7] to be NP-complete. The greater difficulty of the wireless broadcast problem tree stems from the “wireless multicast advantage” [13], the fact that a wireless ... |

30 | On the complexity and distributed construction of energy-efficient broadcast trees in static ad hoc networks
- Ahluwalia, Modiano, et al.
(Show Context)
Citation Context ... tree problem. In a wired network, the minimum-cost broadcast tree can be found in O(n2 )operations [8]. However, in the wireless network, this problem was shown in [6] to be NP-hard and later on, in =-=[1, 2, 7]-=- to be NP-complete. The greater difficulty of the wireless broadcast problem tree stems from the “wireless multicast advantage” [13], the fact that a wireless transmission can be received by all nodes... |

1 |
specification version 1.0b
- Bluetooth
- 1999
(Show Context)
Citation Context ...for Wireless Technology. 1s2 IVANA MARIC AND ROY YATES but above the receiver noise floor, can collect energy from the unreliable reception of the sent information. For example, in a Bluetooth system =-=[9]-=-, the nominal transmitted power is 1 mW resulting in a transmission range of 10 meters. However, for a typical path exponent of α = 3, the received signal at a node within 90 meters of the transmitter... |