Abstract: Traffic demands in networks play a vital role in determining the transmission rate that a network can support between communicating users.

Information theoretic upper bounds on communication rates are derived under an assumption that transmitting nodes as well as receiving nodes cooperate. It is ...

We obtain a precise information-theoretic upper bound on the rate per communication pair in a one-dimensional ad hoc wireless network.

This work considers two strategies for communication in ad hoc networks with local node cooperation and derives achievability bounds on the communication ...

This paper analytically investigates the instantaneous communication capacities of vehicular ad hoc networks (VANETs), which measure the upper bounds of the ...

All the above mentioned information theoretic upper bounds were derived for networks with uniform traffic pattern. Moreover, several results on the ...

Table 2.1: Upper bounds on rate per communicating pair in ad-hoc networks for a uniform traffic pattern. Page 30. 18 relays to the destination only when the ...

A separation theorem for heterogeneous traffic is presented showing that the optimum order throughput capacity can be attained in a wireless network in ...

Abstract—We develop bounds on the capacity of wireless multihop networks when the traffic pattern is non-uniform, i.e., not all nodes are the sources and ...

Abstract. Early simulation experience with wireless ad hoc networks sug- gests that their capacity can be surprisingly low, due to the require-.