Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke





.......................

.......................


Publications [#336725] of Vahid Tarokh

Papers Published

  1. Jeon, SW; Devroye, N; Vu, M; Chung, SY; Tarokh, V, Cognitive networks achieve throughput scaling of a homogeneous network, Ieee Transactions on Information Theory, vol. 57 no. 8 (August, 2011), pp. 5103-5115, Institute of Electrical and Electronics Engineers (IEEE) [doi]
    (last updated on 2023/06/01)

    Abstract:
    Two distinct, but overlapping, networks that operate at the same time, space, and frequency is considered. The first network consists of n randomly distributed primary users, which form an ad hoc network. The second network again consists of m randomly distributed ad hoc secondary users or cognitive users. The primary users have priority access to the spectrum and do not need to change their communication protocol in the presence of the secondary users. The secondary users, however, need to adjust their protocol based on knowledge about the locations of the primary users to bring little loss to the primary network's throughput. By introducing preservation regions around primary receivers, a modified multihop routing protocol is proposed for the cognitive users. Assuming m=nβ with β>1, it is shown that the secondary network achieves almost the same throughput scaling law as a stand-alone network while the primary network throughput is subject to only a vanishingly small fractional loss. Specifically, the primary network achieves the sum throughput of order n1/2 and, for any δ>0, the secondary network achieves the sum throughput of order m1/2-δ with an arbitrarily small fraction of outage. Thus, almost all secondary source-destination pairs can communicate at a rate of order m -1/2-δ. © 2011 IEEE.

 

dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320