Name
Abstract | ||
|---|---|---|
This study deals with the scaling laws of ad hoc cognitive networks. In the network, m primary users and n secondary users (m<n) are randomly located in the same geographic area and share one common frequency spectrum. By loosening some of the restrictions for the network, the authors obtained the throughput upper bounds for both primary and secondary users. To obtain the lower bounds (achievable throughputs), we proposed a cooperative transmission scheme between the primary and secondary users by using the percolation theory, and the results showed that the achievable throughputs can meet the upper bounds, thus, the authors obtained the throughputs. On the basis of our results, per primary user can transmit with a throughput of min(Θ(1), Θ(√n/m)), which is higher than the throughput of Θ(√1/m) in the cognitive network without cooperative relay. This may serve as a strong incentive for primary users to cooperative with secondary users. Meanwhile, secondary users can achieve the same scale as if there is no primary network exists. © 2012 The Institution of Engineering and Technology. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1049/iet-com.2010.0555 | Communications, IET |
Keywords | Field | DocType |
ad hoc networks,cognitive radio,cooperative communication,percolation,ad hoc cognitive networks,cooperative relay,cooperative transmission scheme,percolation theory,primary network,primary users,scaling laws,secondary users | Computer network,Frequency spectrum,Wireless ad hoc network,Throughput,Relay,Mathematics,Scaling law,Cognitive radio,Cognitive network | Journal |
Volume | Issue | ISSN |
6 | 8 | 1751-8628 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei-Xing Zhou | 1 | 206 | 15.05 |
| Jin-Long Wang | 2 | 1402 | 94.86 |
| Weijun Tang | 3 | 7 | 0.90 |
| Siyang Liu | 4 | 226 | 20.43 |