### Citations

12434 |
Elements of Information Theory.
- Cover, Thomas
- 2006
(Show Context)
Citation Context ...Lemma 4: Under total power constraint (2), the broadcast capacity for the extended network is upper bounded as C ext 1 ≤ K log(log N), w.p.a. 1. Proof: The proof is based on the cut-set bound theorem =-=[18]-=-. We are interested in only the cut that separates source from the rest of the network. Based on this cut, the broadcast rate is bounded by the capacity of the single-input multipleoutput (SIMO) chann... |

3243 | The capacity of wireless networks,” - Gupta, Kumar - 2000 |

1220 | Mobility Increases the Capacity of Adhoc Wireless Networks,” - Grossglauser, Tse - 2002 |

811 | Opportunistic beamforming using dumb antennas,”
- Viswanath, Tse, et al.
- 2002
(Show Context)
Citation Context ...at, although source node transmits with a high rate, there is always a group of node which can decode this message. This idea follows from the i.i.d. fading and is very similar to multiuser diversity =-=[19]-=-. In the second phase, successful nodes retransmit the message. Note that each node has a neighbor who has been able to decode the message reliably in the first phase. The nodes that were unsuccessful... |

519 | Comparison of broadcasting techniques for mobile ad hoc networks.
- Williams, Camp
- 2002
(Show Context)
Citation Context ...rk traffic, and they may cause performance bottlenecks. Several authors have studied designing broadcast protocols based on various criteria such as energy efficiency and reduction of retransmissions =-=[1]-=-. In contrast with traditional approaches, an important observation is that “collisions” between different transmitting nodes, which hinder point-to-point communication, may actually be beneficial, wh... |

362 | A network information theory for wireless communication: Scaling laws and optimal operation, - Xie, Kumar - 2004 |

263 | Hierarchical cooperation achieves optimal capacity scaling in Ad Hoc networks,
- Ozgur, Leveque, et al.
- 2007
(Show Context)
Citation Context ... networks with unicast traffic [3]–[11]. These works were initiated by [3], where the authors study the capacity for a multihop wireless network with multiple source-destination pairs. Later, in [5], =-=[6]-=- schemes that exceed the performance of multihopping for wireless unicast communications are presented. Without going into details of these Birsen Sirkeci-Mergen and Michael Gastpar Department of Elec... |

156 | Computing and communicating functions over sensor networks,”
- Giridhar, Kumar
- 2005
(Show Context)
Citation Context ...233,gastpar}@eecs.berkeley.edu works, we would like to mention that taking an information theoretic perspective usually leads to sophisticated physical layer designs with better performance. In [12], =-=[13]-=-, the authors have studied scaling laws of many-to-one networks. A few works, [14]–[17], have studied the scaling laws for broadcast capacity of wireless networks. In [14], the authors assume that eac... |

146 | On the capacity of large Gaussian relay networks”,
- Gastpar, Vetterli
- 2005
(Show Context)
Citation Context .... The goal of this paper is to study the broadcast capacity of wireless networks. In recent years, there has been a lot of interest in fundamental limits of wireless networks with unicast traffic [3]–=-=[11]-=-. These works were initiated by [3], where the authors study the capacity for a multihop wireless network with multiple source-destination pairs. Later, in [5], [6] schemes that exceed the performance... |

112 | Upper bounds to transport capacity of wireless networks, - Jovicic, Viswanath, et al. - 2004 |

103 | On the Broadcast Capacity of Multihop Wireless Networks: Interplay of Power, Density and Interference”,
- Keshavarz-Haddad, Riedi
- 2007
(Show Context)
Citation Context ... relay network where node locations are modelled as a Poisson process. The capacity bounds are derived under the assumption that the link rates are governed by signal-to-interference ratio (SINR). In =-=[16]-=-, the authors show that the broadcast capacity is Θ(1) under the protocol model [3]. As opposed to these works, we follow an information theoretic approach, find upper bounds to the broadcast capacity... |

62 | Wireless ad hoc networks: strategies and scaling laws for the fixed SNR regime,
- Aeron, Saligrama
- 2007
(Show Context)
Citation Context ...eless networks with unicast traffic [3]–[11]. These works were initiated by [3], where the authors study the capacity for a multihop wireless network with multiple source-destination pairs. Later, in =-=[5]-=-, [6] schemes that exceed the performance of multihopping for wireless unicast communications are presented. Without going into details of these Birsen Sirkeci-Mergen and Michael Gastpar Department of... |

59 | On the scaling laws of dense wireless sensor networks
- Gamal
- 2003
(Show Context)
Citation Context ...l: {bs233,gastpar}@eecs.berkeley.edu works, we would like to mention that taking an information theoretic perspective usually leads to sophisticated physical layer designs with better performance. In =-=[12]-=-, [13], the authors have studied scaling laws of many-to-one networks. A few works, [14]–[17], have studied the scaling laws for broadcast capacity of wireless networks. In [14], the authors assume th... |

55 | Information theoretic upper bounds on the capacity of large extended ad hoc wireless networks, - Leveque, Telatar - 2005 |

51 | Information dissemination in power-constrained wireless networks,” in
- Zheng
- 2006
(Show Context)
Citation Context ...oadcast capacity of wireless networks. In [14], the authors assume that each node has a fixed transmission radius, and show that under multihop broadcasting, the broadcast capacity scales as Θ(1). In =-=[15]-=-, the author studies a multihop relay network where node locations are modelled as a Poisson process. The capacity bounds are derived under the assumption that the link rates are governed by signal-to... |

45 |
Broadcast capacity of wireless networks
- Tavli
- 2006
(Show Context)
Citation Context ...rmation theoretic perspective usually leads to sophisticated physical layer designs with better performance. In [12], [13], the authors have studied scaling laws of many-to-one networks. A few works, =-=[14]-=-–[17], have studied the scaling laws for broadcast capacity of wireless networks. In [14], the authors assume that each node has a fixed transmission radius, and show that under multihop broadcasting,... |

37 | On the throughput scaling of wireless relay networks,” - Dousse, Franceschetti, et al. - 2006 |

12 | Asymptotic Analysis of Multi-Stage Cooperative Broadcast in Wireless Networks
- Mergen, Scaglione, et al.
- 2006
(Show Context)
Citation Context ...rvation is that “collisions” between different transmitting nodes, which hinder point-to-point communication, may actually be beneficial, when the transmitting nodes are broadcasting the same message =-=[2]-=-. Motivated by this idea, we are interested in designing novel broadcasting protocols and fundamental performance bounds on practical schemes. The goal of this paper is to study the broadcast capacity... |

12 | Fundamental limits and scaling behavior of cooperative multicasting in wireless networks
- Khisti, Erez, et al.
- 2006
(Show Context)
Citation Context ...on theoretic perspective usually leads to sophisticated physical layer designs with better performance. In [12], [13], the authors have studied scaling laws of many-to-one networks. A few works, [14]–=-=[17]-=-, have studied the scaling laws for broadcast capacity of wireless networks. In [14], the authors assume that each node has a fixed transmission radius, and show that under multihop broadcasting, the ... |