skip to main content
10.1145/2107502.2107523acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article

Towards cheat-proof cooperative relay for cognitive radio networks

Published: 17 May 2011 Publication History

Abstract

In cognitive radio networks, cooperative relay is a new technology that can significantly improve spectrum efficiency and system throughput. While the existing protocols for cooperative relay are very interesting and useful, there is a crucial problem that has not been investigated: In reality, selfish users may cheat in cooperative relay, in order to benefit themselves. Here by cheating we mean the behavior of reporting misleading information to other users. Such cheating behavior may harm other users and thus lead to poor system throughput.
Given the threat of selfish users' cheating, our objective in this paper is to suppress the cheating behavior of selfish users in cooperative relay. Hence, we design the first cheat-proof scheme for cooperative relay in cognitive radio networks, and rigorously prove that under our scheme, selfish users have incentives to faithfully follow the protocol. Our design and analysis start in the model of strategic game for interactions among secondary users; then they are extended to the entire cooperative replay process, which can be modeled as an extensive game. Results of extensive simulations demonstrate that our scheme suppresses cheating behavior and thus improves the system throughput in face of selfish users.

References

[1]
L. Anderegg and S. Eidenbenz. Ad hoc-VCG: A truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In Proceedings of ACM MOBICOM, 245--259, Sept. 2003.
[2]
E. V. Belmega, B. Djeumou, and S. Lasaulce. What happens when cognitive terminals compete for a relaying node? In Proceedings of ICASSP, 2609--2612, Apr. 2009.
[3]
N. Ben Salem, L. Buttyan, J. P. Hubaux, and M. Jakobsson. A charging and rewarding scheme for packet forwarding in multi-hop cellular networks. In Proceedings of ACM MOBIHOC, 13--24, Jun. 2003.
[4]
S. Buchegger and J. Y. L. Boudec. Performance analysis of the CONFIDANT protocol: Cooperation of nodes fairness In dynamic Ad-hoc networks. In Proceedings of ACM MOBIHOC, 226--236, Jun. 2002.
[5]
T. Chen and S. Zhong. INPAC: An enforceable incentive scheme for wireless networks using network coding. In Proceedings of IEEE INFOCOM, Mar. 2010.
[6]
N. Devroye, P. Mitran, and V. Tarokh. Achievable rates in cognitive radio channels. Information Theory, IEEE Transactions, 52(5):1813--1827, May 2006.
[7]
L. Giupponi and C. Ibars. Bayesian potential games to model cooperation for cognitive radios with incomplete information. In Proceedings of IEEE International Conference on Communications, Jun. 2009.
[8]
I. M. A. Goldsmith, S. A. Jafar and S. Srinivasa. Breaking spectrum gridlock with cognitive radios: An information theoretic perspective. In Proceedings of the IEEE, 97(5):894--914, May 2009.
[9]
Z. Han, Z. Ji, and K. Liu. Fair multiuser channel allocation for ofdma networks using nash bargaining solutions and coalitions. Communications, IEEE Transactions, 53(8):1366--1376, Aug. 2005.
[10]
J. Huang, R. Berry, and M. Honig. Auction-based spectrum sharing. Mobile Networks and Applications, 11(3):405--408, Jun. 2006.
[11]
W. C. Jakes, editor. Microwave Mobile Communications. IEEE Press, Piscataway, NJ, 1994
[12]
M. Jakobsson, J. P. Hubaux, and L. Buttyan. A micro-payment scheme encouraging collaboration in multi-hop cellular networks. In Proceedings of Financial Crypto, 15--33, Jan. 2003.
[13]
Z. Ji and K. Liu. Cognitive radios for dynamic spectrum access - dynamic spectrum sharing: A game theoretical overview. Communications Magazine, IEEE, 45(5):88--94, May 2007.
[14]
J. Jia, J. Zhang, and Q. Zhang. Cooperative relay for cognitive radio networks. In Proceedings of IEEE INFOCOM, 2304--2312, Apr. 2009.
[15]
J. Jiang and Y. Xin. On the achievable rate regions for interference channels with degraded message sets. Information Theory, IEEE Transactions, 54(10):4707--4712, Oct. 2008.
[16]
B. Lamparter, K. Paul, and D. Westhoff. Charging support for ad hoc stub networks. Computer Communications, Vol 26: 1504--1514, 2003.
[17]
S. Marti, T. Giuli, K. Lai, and M. Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of ACM MOBICOM, 255--265, Aug. 2000.
[18]
P. Michiardi, R. Molva. Game theoretic analysis of security in mobile ad hoc networks. Research Report No.02--070, Institute Eurecom, 2002.
[19]
P. Michiardi, R. Molva. CORE: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In Proceedings of the Communication and Multimedia Security Conference, Sept. 2002.
[20]
O. Simeone, I. Stanojev, S. Savazzi, Y. Bar-Ness, U. Spagnolini, and R. Pickholtz. Spectrum leasing to cooperating secondary ad hoc networks. IEEE Journal on Selected Areas in Communications, Vol 26, 203--213, Jan. 2008.
[21]
W. Wan, X. Y. Li, and Y. Wang. Truthful multicast routing in selfish wireless networks. In Proceedings of ACM MOBICOM, Sept. 2004.
[22]
W. Wang, S. Eidenbez, Y. Wang, and X. Y. Li. OURS- Optimal unicast routing systems in non-cooperative wireless networks. In Proceedings of ACM MOBICOM, 402--413, Sept. 2006.
[23]
F. Wu, T. Chen, S. Zhong, L. E. Li, and Y. R. Yang. Incentive-compatible opportunistic routing for wireless networks. In Proceedings of ACM MOBICOM, 303--314, Sept. 2008.
[24]
J. Zhang, Q. Zhang. Stackelberg game for utility-based cooperative cognitive radio networks. In Proceedings of ACM MOBIHOC, 23--32, May 2009.
[25]
Q. Zhang, J. Jia, and J. Zhang. Cooperative relay to improve diversity in cognitive radio networks. IEEE Communications Magazine, 111--117, Feb. 2009.
[26]
S. Zhong, L. E. Li, Y. G. Liu, and Y. R. Yang. On designing incentive-compatible routing and forwarding protocols in wireless ad hoc networks. In Proceedings of ACM MOBICOM, 117--131, Aug. 2005.

Cited By

View all
  • (2019)Towards Green Wireless Networking: Fading-Resistant Time Constraint Broadcasts Using Cooperative CommunicationIEEE Transactions on Network Science and Engineering10.1109/TNSE.2018.28297806:3(548-561)Online publication date: 1-Jul-2019
  • (2018)Bandwidth allocation and distributed relay selection for multiple‐user and multiple‐relay cooperative systems using Stackelberg gameInternational Journal of Communication Systems10.1002/dac.351531:6Online publication date: 10-Jan-2018
  • (2015)Resource Allocation for Multiple-User AF-OFDMA Systems Using the Auction FrameworkIEEE Transactions on Wireless Communications10.1109/TWC.2014.238585914:5(2377-2393)Online publication date: May-2015
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
MobiHoc '11: Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
May 2011
269 pages
ISBN:9781450307222
DOI:10.1145/2107502
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 May 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. cheat-proof
  2. cognitive radio networks
  3. cooperative relay

Qualifiers

  • Research-article

Funding Sources

Conference

MobiHoc '11
Sponsor:

Acceptance Rates

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 02 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2019)Towards Green Wireless Networking: Fading-Resistant Time Constraint Broadcasts Using Cooperative CommunicationIEEE Transactions on Network Science and Engineering10.1109/TNSE.2018.28297806:3(548-561)Online publication date: 1-Jul-2019
  • (2018)Bandwidth allocation and distributed relay selection for multiple‐user and multiple‐relay cooperative systems using Stackelberg gameInternational Journal of Communication Systems10.1002/dac.351531:6Online publication date: 10-Jan-2018
  • (2015)Resource Allocation for Multiple-User AF-OFDMA Systems Using the Auction FrameworkIEEE Transactions on Wireless Communications10.1109/TWC.2014.238585914:5(2377-2393)Online publication date: May-2015
  • (2015)COMO: A Game-Theoretic Approach for Joint Multirate Opportunistic Routing and Forwarding in Non-Cooperative Wireless NetworksIEEE Transactions on Wireless Communications10.1109/TWC.2014.236291414:2(948-959)Online publication date: Feb-2015
  • (2015)MICOR: A Market for Incentive-Compatible Cooperative Relay in Cognitive Radio NetworksIEEE Transactions on Vehicular Technology10.1109/TVT.2014.237837264:11(5350-5367)Online publication date: Nov-2015
  • (2014)Towards Cheat-Proof Cooperative Relayfor Cognitive Radio NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2013.15125:9(2442-2451)Online publication date: Sep-2014
  • (2014)Stimulating traffic information transfer in non-cooperative vehicular ad hoc networks2014 International Wireless Communications and Mobile Computing Conference (IWCMC)10.1109/IWCMC.2014.6906361(225-230)Online publication date: Aug-2014
  • (2014)Energy-efficient cooperative broadcast in fading wireless networksIEEE INFOCOM 2014 - IEEE Conference on Computer Communications10.1109/INFOCOM.2014.6848042(1114-1122)Online publication date: Apr-2014
  • (2013)A Game-Theoretic Approach to Stimulate Cooperation for Probabilistic Routing in Opportunistic NetworksIEEE Transactions on Wireless Communications10.1109/TWC.2013.022113.12028212:4(1573-1583)Online publication date: Apr-2013
  • (2013)Joint Power and Bandwidth Allocation for Amplify-and-Forward Cooperative Communications Using Stackelberg GameIEEE Transactions on Vehicular Technology10.1109/TVT.2012.223110462:4(1678-1691)Online publication date: May-2013
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media