Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2013, Article ID 936536, 9 pages
http://dx.doi.org/10.1155/2013/936536
Research Article

An MPS-BNS Mixed Strategy Based on Game Theory for Wireless Mesh Networks

1Network and Education Technology Center, Jinan University, Guangzhou, Guangdong 510632, China
2School of Computer and Electrical Information, Guangxi University, Nanning, Guangxi 530004, China
3College of Information Science and Technology, Jinan University, Guangzhou, Guangdong 510632, China

Received 31 October 2012; Accepted 17 December 2012

Academic Editors: G. Bordogna and P. Melin

Copyright © 2013 S. Q. Huang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Krishnan, M. D. Smith, Z. Tang, and R. Telang, “The impact of free-riding on peer-to-peer networks,” in Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS '04), pp. 3137–3146, January 2004. View at Scopus
  2. P. Michiardi and R. Molva, “Simulation-based analysis of security exposures in mobile ad hoc networks,” in Proceedings of the European Wireless Conference, Florence, Italy, February 2002.
  3. V. Srinivasan, P. Nuggehalli, C. F. Chiasserini, and R. R. Rao, “Cooperation in wirelessad hoc networks,” in Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '03), vol. 2, pp. 808–817, San Francisco, Calif, USA, March 2003.
  4. S. Zhong, J. Chen, and Y. R. Yang, “Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks,” in Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '03), pp. 1987–1997, San Francisco, Calif, USA, March 2003. View at Scopus
  5. F. Wu, T. Chen, S. Zhong, L. E. Li, and Y. R. Yang, “Incentive-compatible opportunistic routing for wireless networks,” in Proceedings of the 14th ACM International Conference on Mobile Computing and Networking (MobiCom '08), pp. 303–314, San Francisco, Calif, USA, September 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. S. Chachulski, M. Jennings, S. Katti, and D. Katabi, “Trading structure for randomness in wireless opportunistic routing,” in Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '07), pp. 169–180, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. N. Saxena and M. Denko, “A hierarchical architecture for detecting selfish behaviour in community wireless mesh networks,” Computer Communications, vol. 34, no. 4, pp. 548–555, 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. P. Michiardi and R. Molva, “CORE: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks,” in Proceedings of the Communications and Multimedia Security Conference (CMS '02), Portoroz, Slovenia, September 2002.
  9. S. Bansal and M. Baker, “Observation-based cooperation enforcement in ad hoc networks,” Tech. Rep., Stanford University, Stanford, Calif, USA, 2003. View at Google Scholar
  10. Q. He, D. Wu, and P. Khosla, “SORI: a secure and objective reputation-based incentive scheme for ad-hoc networks,” in Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC '04), vol. 2, pp. 825–830, Atlanta, Ga, USA, March 2004.
  11. M. T. Refaei, V. Srivastava, L. DaSilva, and M. Eltoweissy, “A reputation-based mechanism for isolating selfish nodes in ad hoc networks,” in Proceedings of the IEEE 2nd Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services (MobiQuitous '05), pp. 3–11, San Diego, Calif, USA, July 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. J. J. Jaramillo and R. Srikant, “DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks,” in Proceedings of the 13th annual ACM International Conference on Mobile Computing and Networking (MobiCom '07), pp. 87–98, Montreal, Canada, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  13. F. Wu, T. Chen, S. Zhong, L. E. Li, and Y. R. Yang, “Incentive-compatible opportunistic routing for wireless networks,” in Pyoceedings of the 14th ACM Annual International Conference on Mobile Computing and Networking (MobiCom '08), pp. 303–314, September 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. F. Wu, S. Zhong, and C. Qiao, “Globally optimal channel assignment for non-cooperative wireless networks,” in Proceedings of the 27th Conference on Computer Communications (INFOCOM '08), pp. 1543–1551, April 2008.
  15. A. Joang, R. Hayward, and S. Pope, “Trust network analysis with subjective logic,” in Proceedings of the 29th Australasian Computer Science Conference, pp. 85–94, January 2006.
  16. K. Kane and J. C. Browne, “Using uncertainty in reputation methods to enforce cooperation in ad-hoc networks,” in Proceedings of the 5th ACM Workshop on Wireless Security (WiSE '06), pp. 105–113, September 2006. View at Publisher · View at Google Scholar · View at Scopus
  17. Y. Liu and K. Li, “A novel reputation computation model based on subjective logic for mobile ad hoc networks,” Future Generation Computer Systems, vol. 27, no. 5, pp. 547–554, 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. T. Chen and A. Bansal, “A reputation system for wireless mesh networks using network coding,” Journal of Network and Computer Applications, vol. 34, no. 2, pp. 535–541, 2011. View at Publisher · View at Google Scholar · View at Scopus
  19. J. Luo and X. Liu, “A trust model based on fuzzy recommendation for mobile ad-hoc networks,” Computer Networks, vol. 53, no. 14, pp. 2396–2407, 2009. View at Publisher · View at Google Scholar · View at Scopus
  20. P. Michiardi and R. Molva, “Game theoretic analysis of security in mobile ad hoc networks,” Research Report RR-02-070, Eurecom, 2005. View at Google Scholar
  21. J. J. Jaramillo and R. Srikant, “A game theory based reputation mechanism to incentivize cooperation in wireless ad hoc networks,” Ad Hoc Networks, vol. 8, no. 4, pp. 416–429, 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. V. Srinivasan, P. Nuggehalli, C. F. Chiasserini, and R. R. Rao, “Cooperation in wireless ad hoc networks,” in Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '03), San Francisco, Calif, USA, March 2003.
  23. S. O. Kimbrough, A Model for Learning in Policy Space for Agents in Repeated Games, University of Pennsylvania, Department of Operations and Information Management, Philadelphia, Pa, USA, 2004.
  24. S. O. Kimbrough, M. Lu, and A. Kuo, “A note on strategic learning inpolicy space,” in Formal Modeling in Electronic Commerce: Representation, Inference, and Strategic Interaction, pp. 463–475, Springer, Berlin, Germany, 2004. View at Google Scholar
  25. P. Michiardi and R. Molva, “Analysis of coalition formation and cooperation strategies in mobile ad hoc networks,” Ad Hoc Networks, vol. 3, no. 2, pp. 193–219, 2005. View at Publisher · View at Google Scholar · View at Scopus
  26. K. Komathy and P. Narayanasamy, “Best neighbor strategy to enforce cooperation among selfish nodes in wireless ad hoc network,” Computer Communications, vol. 30, no. 18, pp. 3721–3735, 2007. View at Publisher · View at Google Scholar · View at Scopus