DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jeon, Sang-Woon | ko |
dc.contributor.author | Devroye, Natasha | ko |
dc.contributor.author | Vu, Mai | ko |
dc.contributor.author | Chung, Sae-Young | ko |
dc.contributor.author | Tarokh, Vahid | ko |
dc.date.accessioned | 2013-03-11T08:00:53Z | - |
dc.date.available | 2013-03-11T08:00:53Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2011-08 | - |
dc.identifier.citation | IEEE TRANSACTIONS ON INFORMATION THEORY, v.57, no.8, pp.5103 - 5115 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.uri | http://hdl.handle.net/10203/98714 | - |
dc.description.abstract | Two distinct, but overlapping, networks that operate at the same time, space, and frequency is considered. The first network consists of 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(beta) with beta > 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 n(1/2) and, for any delta > 0, the secondary network achieves the sum throughput of order m(1/2-delta) with an arbitrarily small fraction of outage. Thus, almost all secondary source-destination pairs can communicate at a rate of order m(-1/2-delta). | - |
dc.language | English | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | WIRELESS NETWORKS | - |
dc.subject | TRANSPORT CAPACITY | - |
dc.subject | UPPER-BOUNDS | - |
dc.subject | RADIO | - |
dc.subject | PERCOLATION | - |
dc.subject | CHANNELS | - |
dc.subject | LIMITS | - |
dc.title | Cognitive Networks Achieve Throughput Scaling of a Homogeneous Network | - |
dc.type | Article | - |
dc.identifier.wosid | 000295738500016 | - |
dc.identifier.scopusid | 2-s2.0-79960980250 | - |
dc.type.rims | ART | - |
dc.citation.volume | 57 | - |
dc.citation.issue | 8 | - |
dc.citation.beginningpage | 5103 | - |
dc.citation.endingpage | 5115 | - |
dc.citation.publicationname | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.contributor.localauthor | Chung, Sae-Young | - |
dc.contributor.nonIdAuthor | Devroye, Natasha | - |
dc.contributor.nonIdAuthor | Vu, Mai | - |
dc.contributor.nonIdAuthor | Tarokh, Vahid | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | WIRELESS NETWORKS | - |
dc.subject.keywordPlus | TRANSPORT CAPACITY | - |
dc.subject.keywordPlus | UPPER-BOUNDS | - |
dc.subject.keywordPlus | RADIO | - |
dc.subject.keywordPlus | PERCOLATION | - |
dc.subject.keywordPlus | CHANNELS | - |
dc.subject.keywordPlus | LIMITS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.