#### DMCA

## Cooperative multihop broadcast for wireless networks (2004)

### Cached

### Download Links

- [wwwpub.zih.tu-dresden.de]
- [wwwpub.zih.tu-dresden.de]
- [wwwpub.zih.tu-dresden.de]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE J. Sel. Areas Commun |

Citations: | 67 - 1 self |

### Citations

12164 |
Elements of Information Theory
- Cover, Thomas
- 1991
(Show Context)
Citation Context ...ition code for all nodes beyond the transmission range. We view each orthogonal channel as a discrete-time Gaussian channel by representing a waveform of duration as a vector in the dimensional space =-=[28]-=-. Then, during the th slot, a source node, labeled node 1, transmits a codeword (vector) from a Gaussian code that is generated according to the distribution , where . Under the reliable forwarding co... |

2858 | Capacity of multi-antenna Gaussian channels
- Telatar
- 1995
(Show Context)
Citation Context ...nsmission of different nodes to occur in orthogonal channels. For the network, orthogonal signaling enables us to determine the maximum achievable rate using repetition coding strategy, at every node =-=[21]-=-, and to formulate the accumulative broadcast problem. Since during the accumulative broadcast, more radiated energy is captured than by using the minimum-energy broadcast tree approach, it is straigh... |

2192 | Data Networks
- Bertsekas, Gallager
- 1992
(Show Context)
Citation Context ...on can be received by all nodes in the transmission range. In [2], the authors proposed the broadcast incremental power (BIP) algorithm, a greedy heuristic that uses the principle of Prim’s algorithm =-=[8]-=-, while assigning costs to the nodes in a way that exploits the wireless multicast advantage. Analytical results for the performance of BIP are given in [9]. Several other heuristics for constructing ... |

1925 | Cooperative diversity in wireless networks: efficient protocols and outage behavior
- Laneman, Tse, et al.
- 2004
(Show Context)
Citation Context ...OADCAST FOR WIRELESS NETWORKS 1081 The advantages of coherent signaling and unreliable forwarding have been recognized for networks in which one or more relay nodes forward to a destination node [12]–=-=[15]-=-. However, it is not apparent that coherent signal combining can be achieved simultaneously at multiple receivers nor is it clear that networks can support the precise sychronization of transmitting n... |

1892 | A survey on sensor networks
- Akyildiz, Su, et al.
- 2002
(Show Context)
Citation Context ...ires global knowledge of the channel gains. However, centralized algorithms are not well suited for sensor networks consisting of many nodes which are all limited in power and computational resources =-=[23]-=-. For the minimum-energy broadcast problem, localized distributed algorithms were proposed in [5] and [6]. Both solutions rely on a distributed algorithm for constructing minimum-weight spanning trees... |

1660 |
Combinatorial Optimization: Algorithms and Complexity
- Papadimitriou, Steiglitz
- 1982
(Show Context)
Citation Context ...herein). In [2], the minimum-energy broadcast problem was formulated as a minimum-energy broadcast tree problem. Although the minimum-cost broadcast tree can be found in operations in a wired network =-=[3]-=-, the equivalent wireless problem was shown in [4] to be NP-hard and later on, in [5]–[7] to be NP-complete. The greater difficulty of the wireless broadcast tree problem stems from the wireless multi... |

1199 | Mobility increases the capacity of ad hoc wireless networks - Grossglauser, Tse - 2002 |

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

546 | On the construction of energy-efficient broadcast and multicast trees in wireless networks
- Wieselthier, Nguyen, et al.
(Show Context)
Citation Context ...ta reliably to all network nodes at a given rate with minimum transmitted power. The problem of broadcasting in a wireless network has been researched extensively (see [1] and references therein). In =-=[2]-=-, the minimum-energy broadcast problem was formulated as a minimum-energy broadcast tree problem. Although the minimum-cost broadcast tree can be found in operations in a wired network [3], the equiva... |

534 | Critical power for asymptotic connectivity in wireless networks
- Gupta, Kumar
- 1998
(Show Context)
Citation Context ... addition, ACK control packets will allow node to determine the neighborhood . Specifically, any ACK packet will be sent with a fixed power level and rate chosen to guarantee the network connectivity =-=[30]-=-. Distributed algorithms for determining such a power level have been proposed (see [31] and [32]). The neighborhood is then defined as the set of nodes that receive the ACK from node , with received ... |

518 | Protocols for self-organization of a wireless sensor network
- Sohrabi, Gao, et al.
- 2000
(Show Context)
Citation Context ...is the limiting resource. Thus, the data rate is very small compared with the bandwidth, resulting in a low spectral efficiency. In the sensor networks where the energy-efficiency is the primary goal =-=[17]-=-, operating in the wideband regime seems like the right choice: at the expense of using the large number of degrees of freedom per transmitted bit, the transmit energy per bit can be minimized [18]. H... |

502 | Comparison of broadcasting techniques for mobile ad hoc networks
- Williams, Camp
- 2002
(Show Context)
Citation Context ...dcast problem is to broadcast data reliably to all network nodes at a given rate with minimum transmitted power. The problem of broadcasting in a wireless network has been researched extensively (see =-=[1]-=- and references therein). In [2], the minimum-energy broadcast problem was formulated as a minimum-energy broadcast tree problem. Although the minimum-cost broadcast tree can be found in operations in... |

454 | Information capacity and power control in single-cell multiuser communications - Knopp, Humblet - 1995 |

432 | A Distributed Algorithm for Minimum-Weight Spanning Trees
- Gallager, Humblet, et al.
- 1983
(Show Context)
Citation Context ...problem, localized distributed algorithms were proposed in [5] and [6]. Both solutions rely on a distributed algorithm for constructing minimum-weight spanning trees in undirected and directed graphs =-=[24]-=-, [25]. Other localized algorithms for broadcasting were suggested recently in [10] and [26]. Two distributed versions of BIP were presented in [27]. In this paper, we present a distributed version of... |

390 | Spectral efficiency in the wideband regime
- Verdú
- 2002
(Show Context)
Citation Context ...to be captured, accumulative broadcast will increase the energy efficiency of broadcasting in any wireless network. However, the focus of our work will be on networks operating in the wideband regime =-=[16]-=-, where the spectral efficiency is low. This assumption was motivated by applications for wireless sensor networks, where power, rather than bandwidth, is the limiting resource. Thus, the data rate is... |

231 | On the capacity of wireless networks: The relay case - Gastpar, Vetterli |

208 |
On Channel Capacity Per Unit Cost
- Verdu
- 1990
(Show Context)
Citation Context ...al [17], operating in the wideband regime seems like the right choice: at the expense of using the large number of degrees of freedom per transmitted bit, the transmit energy per bit can be minimized =-=[18]-=-. However, finding the minimum energy per bit in networks with relays is still an open problem. We will show that for a network operating in the wideband regime, the forwarding nodes can employ a simp... |

183 | Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol
- Narayanaswamy, Kawadia, et al.
(Show Context)
Citation Context ...ACK packet will be sent with a fixed power level and rate chosen to guarantee the network connectivity [30]. Distributed algorithms for determining such a power level have been proposed (see [31] and =-=[32]-=-). The neighborhood is then defined as the set of nodes that receive the ACK from node , with received power above a threshold that assures reliable reception. Neighborhood , thus, contains node and a... |

128 |
The throughput of Hybrid ARQ protocols for the Gaussian collision channel
- Caire, Tuninetti
- 2001
(Show Context)
Citation Context ...e, the forwarding nodes can employ a simple repetition coding strategy in which all the nodes use the same codebook. While there is a benefit from using more general codes with incremental redundancy =-=[19]-=- in a general wireless network, this benefit diminishes when broadcasting in a network operating in the wideband regime [20]. The assumption of large bandwidth resources allows for transmission of dif... |

121 | I.: Localized minimum-energy broadcasting in adhoc networks
- Cartigny, Simplot, et al.
- 2003
(Show Context)
Citation Context ...on a distributed algorithm for constructing minimum-weight spanning trees in undirected and directed graphs [24], [25]. Other localized algorithms for broadcasting were suggested recently in [10] and =-=[26]-=-. Two distributed versions of BIP were presented in [27]. In this paper, we present a distributed version of the accumulative broadcast heuristic algorithm that uses only local information at the node... |

118 | Constructing minimum-energy broadcast trees in wireless ad hoc networks
- Liang
- 2002
(Show Context)
Citation Context ...broadcast tree problem. Although the minimum-cost broadcast tree can be found in operations in a wired network [3], the equivalent wireless problem was shown in [4] to be NP-hard and later on, in [5]–=-=[7]-=- to be NP-complete. The greater difficulty of the wireless broadcast tree problem stems from the wireless multicast advantage [2], the fact that a Manuscript received July 15, 2003; revised February 1... |

91 | The infostations challenge: balancing cost and ubiquity in delivering wireless data - Frenkiel, Badrinath, et al. - 2000 |

52 | On minimum-energy broadcasting in all-wireless networks
- Li, Nikolaidis
(Show Context)
Citation Context ...lem was formulated as a minimum-energy broadcast tree problem. Although the minimum-cost broadcast tree can be found in operations in a wired network [3], the equivalent wireless problem was shown in =-=[4]-=- to be NP-hard and later on, in [5]–[7] to be NP-complete. The greater difficulty of the wireless broadcast tree problem stems from the wireless multicast advantage [2], the fact that a Manuscript rec... |

45 | Energy-Efficient Broadcasting with Cooperative Transmission - Hong, Scaglione - 2003 |

43 | Minimum-energy broadcasting in static ad hoc wireless networks
- Wan, Călinescu, et al.
(Show Context)
Citation Context ...that uses the principle of Prim’s algorithm [8], while assigning costs to the nodes in a way that exploits the wireless multicast advantage. Analytical results for the performance of BIP are given in =-=[9]-=-. Several other heuristics for constructing energy-efficient broadcast trees have been proposed in the literature and evaluated by simulations (see [4]–[7], [10], and references therein). The wireless... |

36 | On the Complexity and Distributed Construction of Energy-Efficient Broadcast Trees in Wireless Ad Hoc Widest Spanning Tree (with time fractions) 2: 1 6: 1 9: 1 t0 t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 t11 Number of NICs at each node 2: 1 6: 1 9
- Ahluwalia, Modiano
(Show Context)
Citation Context ...rgy broadcast tree problem. Although the minimum-cost broadcast tree can be found in operations in a wired network [3], the equivalent wireless problem was shown in [4] to be NP-hard and later on, in =-=[5]-=-–[7] to be NP-complete. The greater difficulty of the wireless broadcast tree problem stems from the wireless multicast advantage [2], the fact that a Manuscript received July 15, 2003; revised Februa... |

28 |
Minimum-Energy Broadcast
- Cagalj, Hubaux, et al.
- 2002
(Show Context)
Citation Context ... networks consisting of many nodes which are all limited in power and computational resources [23]. For the minimum-energy broadcast problem, localized distributed algorithms were proposed in [5] and =-=[6]-=-. Both solutions rely on a distributed algorithm for constructing minimum-weight spanning trees in undirected and directed graphs [24], [25]. Other localized algorithms for broadcasting were suggested... |

26 | Efficient Multihop Broadcast for Wideband Systems
- Maric, Yates
- 2002
(Show Context)
Citation Context ...e the accumulative broadcast problem. Since during the accumulative broadcast, more radiated energy is captured than by using the minimum-energy broadcast tree approach, it is straightforward to show =-=[22]-=- that accumulative broadcast results in a more energy-efficient solution. As we will show, finding the best solution to the accumulative broadcast problem is NP-complete. This motivates an efficient h... |

18 | Multiple–accessing over frequency–selective fading channels - Knopp, Humblet - 1995 |

16 |
The energy efficiency of distributed algorithms for broadcasting in ad hoc networks
- Wieselthier, Nguyen, et al.
- 2002
(Show Context)
Citation Context ...ht spanning trees in undirected and directed graphs [24], [25]. Other localized algorithms for broadcasting were suggested recently in [10] and [26]. Two distributed versions of BIP were presented in =-=[27]-=-. In this paper, we present a distributed version of the accumulative broadcast heuristic algorithm that uses only local information at the nodes. This paper is organized as follows. In the following ... |

14 |
BLMST: A scalable, power-efficient broadcast algorithm for wireless sensor networks
- Li, Hou
- 2003
(Show Context)
Citation Context ...for the performance of BIP are given in [9]. Several other heuristics for constructing energy-efficient broadcast trees have been proposed in the literature and evaluated by simulations (see [4]–[7], =-=[10]-=-, and references therein). 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 ... |

9 |
Is tdma optimal in the low power regime
- Verdú, Caire, et al.
- 2002
(Show Context)
Citation Context ...the accumulative broadcast in the system (1), the required energy is collected in repeated transmissions. In the wideband regime, the maximum achievable rate at node , as given by (3), becomes (6) In =-=[29]-=-, it was shown that time-division multiple access (TDMA) is first-order optimal in the wideband regime as it achieves the minimum energy per information bit of a multiaccess channel. Using (6), it is ... |

7 | asymptotic capacity of Gaussian relay networks - “On - 2002 |

3 | Performance of Repetition Codes and Punctured Codes for Accumulative Broadcast
- Maric, Yates
- 2003
(Show Context)
Citation Context ...here is a benefit from using more general codes with incremental redundancy [19] in a general wireless network, this benefit diminishes when broadcasting in a network operating in the wideband regime =-=[20]-=-. The assumption of large bandwidth resources allows for transmission of different nodes to occur in orthogonal channels. For the network, orthogonal signaling enables us to determine the maximum achi... |

1 |
Bluetooth Specification Version I.Ob
- Spec
- 1999
(Show Context)
Citation Context ...received power is below the required threshold, but above the receiver noise floor, a node can collect energy from the unreliable reception of the sent information. For example, in a Bluetooth system =-=[11]-=-, the nominal transmitted power is 1 mW resulting in a transmission range of 10 ms. However, for a typical path exponent of , the received signal at a node within 90 m of the transmitter is likely to ... |