Communication Networks: Fundamental Concepts and Key Architectures
Communication Networks: Fundamental Concepts and Key Architectures
Achieving cooperation in multihop wireless networks of selfish nodes
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
OMH: suppressing selfish behavior in ad hoc networks with One More Hop
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Cognitive radio: brain-empowered wireless communications
IEEE Journal on Selected Areas in Communications
Game theory for cognitive radio networks: An overview
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling the lion attack in cognitive radio networks
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
Hi-index | 0.00 |
Dynamic spectrum access has been studied to exploit instantaneous spectrum availability by opening licensed spectrum to secondary users. To achieve high spectrum efficiency, secondary unlicensed users need to continuously sense spectrum to detect the presence of primary licensed users. Cooperative spectrum sensing has been recognized as a powerful solution to improve spectrum sensing performance, which requires nearby wireless nodes to share sensing results with each other. However, information sharing is achieved through broadcasting in wireless networks, which can provide free-riding opportunity for selfish nodes. Selfish nodes can benefit from receiving the sensing results from its neighbors by free without sharing. Therefore, appropriate strategies are essential to enforce and sustain the cooperation among neighboring nodes. In this paper we model cooperative spectrum sensing as an N-player horizontal infinite game, and study varies strategies for it. In wireless networks, the frequently occurred collisions make the cooperation enforcement problem quite challenging as it is hard to tell whether the information lost is due to nodes' selfishness or wireless collision. In this paper, we prove that Grim Trigger strategy, a classical strategy to stimulate cooperation in an infinite game, can result in poor performance due to random errors. We then propose a strategy basing on Carrot-and-Stick strategy, which can recover cooperation among multiple players from deviation. We prove that if nodes are sufficiently far-sight, or equivalently the entire system runs sufficiently long, the Nash Equilibrium of the proposed strategy for spectrum sensing game is still mutual cooperation, even under collision situation. We also prove that the proposed strategy is robust to collisions and colluding cheat.