Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISIT.2011.6034250
Title: On throughput and delay scaling with cooperative spectrum sharing
Authors: Han, Y.
Ting, S.H.
Motani, M. 
Pandharipande, A.
Issue Date: 2011
Source: Han, Y.,Ting, S.H.,Motani, M.,Pandharipande, A. (2011). On throughput and delay scaling with cooperative spectrum sharing. IEEE International Symposium on Information Theory - Proceedings : 821-825. ScholarBank@NUS Repository. https://doi.org/10.1109/ISIT.2011.6034250
Abstract: In this paper, we propose a cooperative spectrum sharing protocol (CSSP) between two overlapping static ad hoc wireless networks where the primary and secondary networks consist of n and m randomly distributed nodes respectively. The secondary network achieves spectrum access along with the primary network by allowing its nodes to relay the primary traffic. Taking advantage of the broadcast nature of wireless channels, the secondary nodes are able to forward primary and secondary packets simultaneously by transmitting a superimposed signal. We analyze the throughput and delay scaling performance of the proposed protocol and show that given m ≥ n, the primary network is able to achieve a per-node throughput scaling which is better than that of a stand-alone network with n nodes. At the same time, the secondary network achieves the same throughput scaling as a stand-alone network with m nodes. We also derive the throughput-delay tradeoff for both the primary and secondary systems in this scenario. © 2011 IEEE.
Source Title: IEEE International Symposium on Information Theory - Proceedings
URI: http://scholarbank.nus.edu.sg/handle/10635/51225
ISBN: 9781457705953
ISSN: 21578104
DOI: 10.1109/ISIT.2011.6034250
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

9
checked on Dec 5, 2017

Page view(s)

17
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.