Journal of Communications and Networks

  • 제16권4호
  • /
  • Pages.458-464
  • /
  • 2014
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지
DOI QR코드

DOI QR Code

Incentive Mechanism Design for Heterogeneous Networking Routing

  • Shu, Yongan (Computer Science and Technology Institute, Anhui University) ;
  • Shu, Ziyu (School of Information and Electronics, Beijing Institute of Technology) ;
  • Luo, Bin (Computer Science and Technology Institute, Anhui University)
  • 투고 : 2013.04.16
  • 심사 : 2014.04.29
  • 발행 : 2014.08.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In the future, an increasing number of heterogeneous networks will be connected with each other. Each of them has its own interest. Existing systems lack good incentive mechanisms to attract more networks to participate in cooperations. In this paper, we design an auction-based incentive mechanism for routing protocols applied in heterogeneous networking which is computationally efficient, individually rational, profitable, and truthful. Through several simulations, we evaluate the performance and validate the properties of our mechanism.

키워드

과제정보

연구 과제 주관 기관 : Natural Science Foundation

참고문헌

  1. U. Feige, V. S. Mirrokni, and J. Vondrak, "Maximizing non-monotone submodular functions," SIAM J. Comput., 40(4), pp. 1133-1153, 2011. https://doi.org/10.1137/090779346
  2. E. De Poorter, P. Becue, and M. Rovcanin, "A negotiation-based networking methodology to enable cooperation across heterogeneous co-located networks," Ad Hoc Netw., 10, pp. 901-917, 2012. https://doi.org/10.1016/j.adhoc.2011.11.007
  3. S. Zhong, L. Li, Y. G. Liu, and Y. Yang, "On designing incentivecompatible routing and forwarding protocols in wireless ad-hoc networks: An integrated approach using game theoretical and cryptographic techniques," in Proc. ACM MOBICOM, 2005, pp. 117-131.
  4. S. Brahma and M. Chatterjee, "A bayesian based incentive-compatible routing mechanism for dynamic spectrum access networks," in Proc. IEEE INFOCOM, 2012, pp. 2781-2785.
  5. Y. Wang and M. Singhai, "On improving the efficiency of truthful routing in MANETs with selfish nodes," Elsevier Pervasive and Mobile Comput., vol. 3, no. 5, pp. 537-559, Oct. 2007. https://doi.org/10.1016/j.pmcj.2007.02.001
  6. P. Maille and B. Tuffin, "Why VCG auctions can hardly be applied to the pricing of inter-domain and ad-hoc networks," in Proc. 3rd EURO-NGI, May 2007, pp. 36-39.
  7. H. B. Leonard, "Elicitation of honest preferences for the assignment of individuals to positions," J. Political Economy, vol. 91, no. 3, pp. 461- 479, June 1983. https://doi.org/10.1086/261158
  8. V. Krishna, Auction Theory, Academic Press, 2009.
  9. G. Calinescu, C. Chekuri, M. Pal, and J. Vondrak, "Maximizing a submodular set function subject to a matroid constraint," SIAM J. Comput., 40(6), pp. 1740-1766, 2011. https://doi.org/10.1137/080733991
  10. R. B. Myerson, "Optimal auction design," Mathematics of Operations Research, 6(1), pp. 58-73, Feb. 1981. https://doi.org/10.1287/moor.6.1.58
  11. Y. Singer, "Budget feasible mechanisms," in Proc. IEEE FOCS, 2010, pp. 765-774.
  12. NS-2, http://nsnam.isi.edu/nsnam/index.php/Main_Page, 2012.