Skip to main content

Part of the book series: SpringerBriefs in Electrical and Computer Engineering ((BRIEFSELECTRIC))

  • 393 Accesses

Abstract

In D2D communications the users work both as servers and clients, thus cooperation stimulation is an important technology as the system availability mainly depends on the cooperation degree of the users. Considering the particular features of D2D communication, resource-exchange-based incentive mechanism is a superior choice as it neither relies on the use of tamper-proof hardware nor monitors other’s behavior as implemented in CB or RB. We propose a resource-exchange-based cooperation stimulation scheme in this chapter. Specifically, the users obtain their demanding contents at the cost of sending contents to their counterparts. By this method, contents are disseminated cooperatively with D2D communications in the network. Furthermore, as multimedia dominates the contents with Quality of Experience (QoE) as a key measurement, the cooperation stimulation mechanism is constructed for maximizing user QoE characterized by Mean Opinion Score (MOS). In the proposed scheme, the users compute their transmitter MOS and receiver MOS, and send them to the content provider (CP). Then, the CP formulates a weighted directed graph based on the network topology and connection MOS. By factorizing the graph, the content dissemination scheme is designed according to the 1-Factor with the maximum weight. Additionally, in order to realize cheat-proof, a debt mechanism is introduced in the scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    \(\mu _{i}^{j}\) is estimated by node j through channel state information estimation with fixed transmission power and noise variance [3].

References

  1. Zhang A, Chen J, Zhou L, Yu S, Graph Theory based QoE-driven cooperation stimulation for content dissemination in device-to-device communication. IEEE Trans Emerg Topics Comput, to appear. doi:10.1109/TETC.2015.2430816

    Google Scholar 

  2. Khan A, Sun L, Ifeachor E (2012) QoE prediction model and its application in video quality adaptation over UMTS networks. IEEE Trans Multimedia 14(2):431–442

    Article  Google Scholar 

  3. Host-Madsen A, Zhang J (2005) Capacity bounds and power allocation for wireless relay channels. IEEE Trans Inf Theory 51(6):2020–2040

    Article  MathSciNet  MATH  Google Scholar 

  4. Chung S, Goldsmith AJ (2001) Degrees of freedom in adaptive modulation: a unified view. IEEE Trans Commun 49(9):1561–1571

    Article  MATH  Google Scholar 

  5. Chen WK (1965) Flow graphs: some properties and methods of simplification. IEEE Trans Circuit Theory 12(1):128–130

    Article  Google Scholar 

  6. Tutte WT (1953) The 1-factors of oriented graphs. Proc Am Math Soc 4:922–931

    MathSciNet  MATH  Google Scholar 

  7. Khan A, Sun L, Jammeh E, Ifeachor E (2010) Quality of experience-driven adaptation scheme for video applications over wireless networks. IEEE Trans Multimedia 4(11):1337–1347

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2016 The Author(s)

About this chapter

Cite this chapter

Zhang, A., Zhou, L., Wang, L. (2016). Cooperation Stimulation. In: Security-Aware Device-to-Device Communications Underlaying Cellular Networks. SpringerBriefs in Electrical and Computer Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-32458-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-32458-6_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-32457-9

  • Online ISBN: 978-3-319-32458-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics