Abstract
In the opportunistic spectrum access architecture, secondary users have to vacate from a channel once a primary user signal re-appears on the channel. However, the arbitrary disruption to secondary user communications by primary users results in poor performance for secondary users. We introduce a new spectrum sharing architecture called incentivized cooperative dynamic spectrum access (IC-DSA). This architecture enables secondary users to simultaneously access spectrum with primary users, and creates a win-win situation for both, i.e., both primary users and secondary users achieve significantly higher performance by enabling simultaneous spectrum access.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Note that network coding does not increase the packet size nor the transmission time for the coded packet.
- 2.
This implies that in a coded packet, a node can encode at most one (native) packet intended to a receiver.
- 3.
If \(\gamma_{1}\) has been sent as native by node C, then node D must have overheard it. If \(\gamma_{1}\) has been sent as coded, then it should not have been initiated from node C, since a node cannot encode a packet locally initiated from itself. Thus in this case, \(\gamma_{1}\) must have come from node D, since all transit paths of node B either terminate at node C or go to node D. Packet \(\gamma_{1}\) may come to node D as coded from node E. However, the coding application condition ensures that node D (actually every node on the path) can decode the coded packet to get \(\gamma_{1}\). Hence node D has \(\gamma_{1}\) in the key set.
- 4.
Note that with CoN, node 38 will not encode the four native packets as \(\gamma_{1}\oplus\gamma_{7}\oplus\gamma_{3}\oplus\gamma_{5}\) to all neighbors, as this would require nodes 31,37,39 send \(\gamma _{1},\gamma_{3},\gamma_{5}\) as native, which would then make nodes 31,37,39 send \(\gamma_{2},\gamma_{4},\gamma_{6}\) as native too, resulting in 3 additional packet transmissions.
References
Shi Y, Hou T (2008) A distributed optimization algorithm for multi-hop cognitive radio networks. Proceedings of IEEE Infocom, pp 1292–1300
Jain K, Padhye J, Padmanabhan VN, Qiu L (2003) Impact of interference on multi-hop wireless network performance. In Proc. ACM MobiCom, pp 66–80
Sengupta S, Rayanchu S, Banerjee S (2007) An analysis of wireless network coding for unicast sessions: the case for coding-aware routing. Proceedings of IEEE Infocom, pp 1028–1036
Gupta P, Kumar PR (2000) The capacity of wireless networks. IEEE Trans Inf Theory 46(2):388–404
Katti S, Katabi D, Hu W, Rahul H, Medard M (2005) The importance of being opportunistic: practical network coding for wireless environments. Proceedings of 43rd Allerton Annual Conference on Communication, Control, and Computing
Katti S, Rahul H, Hu W, Katabi D, M édard M, Crowcroft J (2006) XORs in the air: practical wireless network coding. Proceedings of the ACM SIGCOMM, pp 243–254
Dong Q, Wu J, Hu W, Crowcroft J (2007) Practical network coding in wireless networks. In Proc. ACM MobiCom, pp 306–309
Wu Y, Chou P, Kung S-Y (2005) Information exchange in wireless networks with network coding and physical-layer broadcast. Proceedings of 39th Annual Conference on Information Sciences and Systems (CISS)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 The Author(s)
About this chapter
Cite this chapter
Xin, C., Song, M. (2015). Incentivized Cooperative Dynamic Spectrum Access. In: Spectrum Sharing for Wireless Communications. SpringerBriefs in Electrical and Computer Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-13803-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-13803-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13802-2
Online ISBN: 978-3-319-13803-9
eBook Packages: Computer ScienceComputer Science (R0)