基于博弈激励的移动自组织网络关键技术研究
|
摘要
移动Ad Hoc网络是一种多跳的临时性自治系统，组网方便、迅速。但由于网络中的组成节点存在自私性的特点，所以网络在数据转发等方面遇到的挑战要远远超过有线或其它无线网络。无线ad hoc网络中，移动性和数据流模型十分复杂，拓扑动态变化，链路质量不可预测。本文通过使用博弈论来对现有协议、资源管理机制以及均衡诱导机制的设计进行分析。并使用博弈论对一些关键技术进行研究。
本文的研究内容主要包括：
（1）分析和研究了相关的博弈论理论，并根据博弈论相关理论和移动ad hoc网络的特点，分析和建立适合移动ad hoc网络各层间数据转发行为的博弈策略；并分别给出了adhoc网络在物理层、介质访问层、网络层和传输层的博弈论模型。基于前述的研究成果，分析和研究了两类激励机制：信任交换系统和基于信誉系统。并在此基础上，分析和研究了两类激励机制在移动ad hoc网络中的一些应用。
（2）研究和提出了基于博弈论的自适应信誉机制。在分析和研究了相关博弈触发机制的基础上，提出了适合移动ad hoc网络的移动节点间数据转发的自适应博弈机制，该机制实现了：（a）尽最大努力促使网络中节点遵守确定的路由策略；（b）对合不合作的节点，不作报复行为，只将其排除在源节点之外，但其仍可转发数据；（c）鼓励犯错的节点进行改过自新。同时针对移动节点间存在的共谋情况，进行了分析和研究。
（3）数据复制技术是解决当网络中源数据节点不可用时，而确保该数据继续有效使用的一种技术。如何在网络拓扑结构变化的移动ad hoc网络中实现数据的复制技术，同时还要针对移动的节点的自私性来解决数据副本放置问题。研究实现如何将博弈论中的投标原理用于解决数据复制问题。
（4）由于移动ad hoc网络拓扑结构的动态变化，以及移动节点的自主移动，造成传输路由的经常性重新链接，从而会出现传输的中断。当实时性和完整性（或分布式计算）要求较高的应用需要网络提供稳定的路由服务时，如何为这样的路由选择相应的中继节点，以及按照何种条件选择。本文对这些问题进行了详细的分析和研究，并给出实现算法。从而为实时性和完整性（或分布式计算）要求较高的应用需要网络提供稳定的鲁棒路由服务。
Mobile Ad Hoc network is a multi-hop temporary autonomous system. It is convenient andrapid to form a network. However, due to the selfish characteristics of the composed nodes in thenetwork, the network encounters much more challenges than the wired or other wirelessnetworks in the fields of data forwarding, etc. In wireless ad hoc networks, mobility and dataflow model is very complex; topology changes dynamically; link quality is unpredictable. Thearticle analyzes existing protocols, the resource management mechanisms, as well as aequilibrium induction mechanism via the use of game theory. And use game theory to studysome key technologies.The article mainly includes
(1) Analyzes and studies related game theory; and according to the knowledge of gametheory and features of mobile ad hoc networks, analyszes and establishes game-theoreticstrategies that are suitable for the data forwarding between layers of a mobile ad hoc network;Also, corresponding game-theoretic models of the physical layer, media access layer, networklayer and the transport layer of a mobile ad hoc network are given. Based on the aforementionedresearch, analyzes and studies two types of incentive mechanisms: the credit exchanging systemand the reputation-based system. On this basis, analyzes and studies these two incentivemechanisms in mobile ad hoc networks.
(2) Studies and proposes an adaptive reputation-based mechanism based on game theory.On the basis of analysis and research of related game-theoretic incentive mechanisms, proposean adaptive game mechanism for data forwarding between mobile nodes in a mobile ad hocnetwork. The mechanism is to achieve:(a) to endeavor to procure nodes in the network tocomply the determined routing strategy;(b) not to apply retaliation to the uncooperative node;instead, exclude them from being the source node while they can still forward data;(c) toencourag nodes with mistakes to rehabilitate. And at the same time analyzes and studies thepotential "collusion" between mobile nodes.
(3) The data replication technique is the solution to ensure that data continues to be validwhen the network source data node becomes unavailable. Studies how to achieve data replicationtechnique in the mobile ad hoc networks where the network topology changes, and also solvesthe problem of data replica placement considering selfishness of the mobile nodes. The study aims to implement how to adopt bid theory in game theory to solve the problem of datareplication.
(4) Due to the dynamic topology changes and autonomous mobility of mobile nodes inmobile ad hoc networks, the transmission route re-links frequently, which will interrupttransmission. When the network is required to provide stable routing services for applicationsthat demand real-time performance and integrity (distributed computing), how to select theappropriate relay node for this route and what conditions to choose accordingly remaining aproblem. The article provides a detailed analysis and study of these problems, and proposes thealgorithm to implement. Thus it provides stable and robust routing services for the networks thatserve applications demanding real-time performance and integrity (distributed computing).
本文的研究内容主要包括：
（1）分析和研究了相关的博弈论理论，并根据博弈论相关理论和移动ad hoc网络的特点，分析和建立适合移动ad hoc网络各层间数据转发行为的博弈策略；并分别给出了adhoc网络在物理层、介质访问层、网络层和传输层的博弈论模型。基于前述的研究成果，分析和研究了两类激励机制：信任交换系统和基于信誉系统。并在此基础上，分析和研究了两类激励机制在移动ad hoc网络中的一些应用。
（2）研究和提出了基于博弈论的自适应信誉机制。在分析和研究了相关博弈触发机制的基础上，提出了适合移动ad hoc网络的移动节点间数据转发的自适应博弈机制，该机制实现了：（a）尽最大努力促使网络中节点遵守确定的路由策略；（b）对合不合作的节点，不作报复行为，只将其排除在源节点之外，但其仍可转发数据；（c）鼓励犯错的节点进行改过自新。同时针对移动节点间存在的共谋情况，进行了分析和研究。
（3）数据复制技术是解决当网络中源数据节点不可用时，而确保该数据继续有效使用的一种技术。如何在网络拓扑结构变化的移动ad hoc网络中实现数据的复制技术，同时还要针对移动的节点的自私性来解决数据副本放置问题。研究实现如何将博弈论中的投标原理用于解决数据复制问题。
（4）由于移动ad hoc网络拓扑结构的动态变化，以及移动节点的自主移动，造成传输路由的经常性重新链接，从而会出现传输的中断。当实时性和完整性（或分布式计算）要求较高的应用需要网络提供稳定的路由服务时，如何为这样的路由选择相应的中继节点，以及按照何种条件选择。本文对这些问题进行了详细的分析和研究，并给出实现算法。从而为实时性和完整性（或分布式计算）要求较高的应用需要网络提供稳定的鲁棒路由服务。
Mobile Ad Hoc network is a multi-hop temporary autonomous system. It is convenient andrapid to form a network. However, due to the selfish characteristics of the composed nodes in thenetwork, the network encounters much more challenges than the wired or other wirelessnetworks in the fields of data forwarding, etc. In wireless ad hoc networks, mobility and dataflow model is very complex; topology changes dynamically; link quality is unpredictable. Thearticle analyzes existing protocols, the resource management mechanisms, as well as aequilibrium induction mechanism via the use of game theory. And use game theory to studysome key technologies.The article mainly includes
(1) Analyzes and studies related game theory; and according to the knowledge of gametheory and features of mobile ad hoc networks, analyszes and establishes game-theoreticstrategies that are suitable for the data forwarding between layers of a mobile ad hoc network;Also, corresponding game-theoretic models of the physical layer, media access layer, networklayer and the transport layer of a mobile ad hoc network are given. Based on the aforementionedresearch, analyzes and studies two types of incentive mechanisms: the credit exchanging systemand the reputation-based system. On this basis, analyzes and studies these two incentivemechanisms in mobile ad hoc networks.
(2) Studies and proposes an adaptive reputation-based mechanism based on game theory.On the basis of analysis and research of related game-theoretic incentive mechanisms, proposean adaptive game mechanism for data forwarding between mobile nodes in a mobile ad hocnetwork. The mechanism is to achieve:(a) to endeavor to procure nodes in the network tocomply the determined routing strategy;(b) not to apply retaliation to the uncooperative node;instead, exclude them from being the source node while they can still forward data;(c) toencourag nodes with mistakes to rehabilitate. And at the same time analyzes and studies thepotential "collusion" between mobile nodes.
(3) The data replication technique is the solution to ensure that data continues to be validwhen the network source data node becomes unavailable. Studies how to achieve data replicationtechnique in the mobile ad hoc networks where the network topology changes, and also solvesthe problem of data replica placement considering selfishness of the mobile nodes. The study aims to implement how to adopt bid theory in game theory to solve the problem of datareplication.
(4) Due to the dynamic topology changes and autonomous mobility of mobile nodes inmobile ad hoc networks, the transmission route re-links frequently, which will interrupttransmission. When the network is required to provide stable routing services for applicationsthat demand real-time performance and integrity (distributed computing), how to select theappropriate relay node for this route and what conditions to choose accordingly remaining aproblem. The article provides a detailed analysis and study of these problems, and proposes thealgorithm to implement. Thus it provides stable and robust routing services for the networks thatserve applications demanding real-time performance and integrity (distributed computing).
引文
[1] Bang Nan Xu, Hischke. S, Walke. B,“The Role of Ad hoc Networking in FutureWireless Communications”, Communication Technology proceedings,2003.ICCT, April2003.
[2] Hewes, C.R,“SOC technology for future wireless communications”, WirelessCommunication Technology,2003. IEEE Topical Conference on15-17Oct.2003
[3] J.Broch, D. B.Johnson, and D. A. Maltz,“The Dynamic Source Routing Protocol forMobile Ad hoc Network”, Internet draft-ietf-manet-dsr-07.txt, Feb.2002.
[4] C. Perkins, E. Belding. Royer and S. Das,“Ad hoc On-Demand DistanceVector(AODV) Routing” IETF Request for Comments: RFC3561, Jul.2003.
[5] Z. J. Hass, M. R. Pearlman and P. Samar,“The Zone Routing Protocol (ZRP) for AdHoc Networks”, Internet Draft draft-ietf-manet-zone-zrp-04.txt, Jul.2002.
[6] M. Gerla, X. Hong and G. Pei,“Fisheye State Routing Protocol (FSR) for Ad HocNetworks”, Internet Draft draft-ietf-manet-fsr-03.txt, Jun.2002.
[7] M. Gerla, X. Hong and G. Pei,“Landmark Routing Protocol (LANMAR) for LargeScale Ad Hoc Networks”, Internet Draft draft-ietf-manet-lanmar-05.txt, Nov.2002.
[8] V. Park and M. Corson.“Temporally-ordered Routing Algorithm (TORA): Version1Functional Specification”, Internet Draft, IETF draft-ietf-manet-tora-spec-04.txt,2001.7
[9]（美）朱.弗登博格，（法）让.梯若尔著，《博弈论》，黄涛等译，中国人民大学出版社，1999.
[10] P. K. Dutta, Strategies and Games: Theory and Practice, MIT Press,2001.
[11] N. Christin, J. Grossklags and J. Chuang,“Near Rationality and Competitive Equilibriain Networked Systems,” ACM SIGCOMM Wksp. Practice and Theory of Incentives andGame Theory in Networked Systems (PINS), Sept.2004.
[12] J. P. Monks et al.,“A Study of the Energy Saving and Capacity Improvement Potentialof Power Control in Multi-hop Wireless Networks,” Proc.26th Annual IEEE Conf. LocalComp. Net., Nov.2001, pp.550–59.
[13] S. Agarwal et al.,“Distributed Power Control in Ad-hoc Wireless Networks,” Int’l.Symp. Pers. Indoor and Mobile Radio Commun.,2001, pp. F-59–F-66.
[14] R. Yates,“A Framework for Uplink Power Control in Cellular Radio Systems,” IEEEJSAC, vol.13, no.7, Sept.1995, pp.1341–47.
[15] X. Lin, Y. Kwok, and V. Lau,“Power Control for IEEE802.11Ad Hoc Networks:Issues and a New Algorithm,” Proc. Int’l. Conf. Parallel Proc., Oct.2003, pp.249–56.
[16] J. P. Monks, V. Bharghavan, and W. W. Hwu,“Transmission Power Control for MultipleAccess Wireless Packet Networks,” Proc. the25th Annual IEEE Conf. on Local Comp. Net.,Nov.2000, pp.12–21.
[17] M. Krunz and A. Muqattash,“A Power Control Scheme for MANETs with ImprovedThroughput and Energy Consumption,” Proc.5th Int’l. Conf. Wireless Pers. MultimediaCommun., vol.2, Oct.2002, pp.771–5.
[18] Z. Huang et al.,“Topology Control for Ad Hoc Networks with Directional Antennas,”Comp. Commun. and Networks,2002, pp.16–21.
[19] I. Glicksberg,“A Further Generalization of the Kakutani Fixed Point Theorem, withApplication to Nash Equilibrium Points,” Proc. American Mathematical Society, vol.3,1952,pp.170–74.
[20] K. Fan,“Fixed Point and Minima Theorems in Locally Convex Topological LinearSpaces,” Proc. National Academy of Sciences, vol.38,1952, pp.121–26.
[21] J. Neel, J. Reed, and R. Gilles,“The Role of Game Theory in the Analysis of SoftwareRadio Networks,” SDR Forum Tech. Conf., Nov.2002.
[22] J. Neel et al.,“Using Game Theory to Aid the Design of Physical Layer Cognitive RadioAlgorithms,” Conf. Economics, Tech. and Policy of Unlicensed Spectrum, May2005.
[23] S. Ulukus and R. D. Yates,“Iterative Construction of Optimum Signature Sequence Setsin Synchronous CDMA Systems,” IEEE Trans. Info. Theory, vol.47, no.5, July2001,pp.1989–98.
[24] C. Rose, S. Ulukus, and R. D. Yates,“Wireless Systems and Interference Avoidance,”IEEE Trans. Wireless Commun., vol.1, no.3, July2002, pp.415–27.
[25] S. Ulukus and R. D. Yates,“Signature Sequence Optimization in Asynchronous CDMASystems,” Proc. IEEE Int’l. Conf. Commun., vol.2, June2001, pp.545–49.
[26] J. I. Concha and S. Ulukus,“Optimization of CDMA Signature Sequences in MultipathChannels,” Proc. IEEE Vehic. Tech. Conf., vol.3, May2001, pp.1978–82.
[18] D. C. Popescu and C. Rose,“Interference Avoidance Applied to Multiaccess DispersiveChannels,” Proc. IEEE Int’l. Symp. Info. Theory, July2002.
[27] J. Hicks et al.,“A Game Theory Perspective on Interference Avoidance,” IEEE GlobalTelecommun. Conf., vol.1, Dec.2004, pp.257–61.
[28] C. W. Sung, K. W. Shum, and K. K. Leung,“Multi-objective Power Control andSignature Sequence Adaptation for Synchronous CDMA Systems—a Game-theoreticViewpoint,” Proc. IEEE Intl. Symp. Info. Theory, July2003, pp.335–35.
[29] C. W. Sung and K. K. Leung,“On the Stability of Distributed Sequence Adaptation forCellular Asynchronous DS-CDMA Systems,” IEEE Trans. Info. Theory, vol.49, no.7, July2003, pp.1828–31.
[30] K. K. Leung, T. M. Lok, and C. W. Sung,“Sequence Adaptation for Cellular Systems,”Proc.57th IEEE Semiannual Vehic. Tech. Conf., vol.3, Apr.2003, pp.2066–70.
[31] R. Menon et al.,“A Game-theoretic Framework for Interference Avoidance in Ad HocNetworks,” June2005; http://www.mprg.org/people/gametheory/publications.shtml
[32] D. Monderer and L. Shapley,“Potential Games,” Games and Economic Behavior,1996,pp.124–43.
[33] W. Santipach and M. L. Honig,“Signature Optimization for DS-CDMA with LimitedFeedback,” IEEE7th Int’l. Symp. Spread Spectrum Techniques and Applications,2002, vol.1, pp.180–84.
[34] R. Menon et al.,“Game Theory and Interference Avoidance in Decentralized Networks,”Software Defined Radio Technical Conf. and Product Exposition,2010.
[27] J. Zander,“Jamming Games in Slotted Aloha Packet Radio Networks,” Proc. IEEEMilitary Commun. Conf., vol.2,1990, pp.830-834.
[35] J. Zander,“Jamming in Slotted Aloha Multi Hop Packet Radio Networks,” IEEE Trans.Commun., vol.39, no.10, Oct.1991,pp.1525–31.
[36] A. B. MacKenzie and S. B. Wicker,“Selfish Users in Aloha: a Game TheoreticApproach,” Proc. Vehic. Tech. Conf., vol.3,Oct.2001, pp.1354–57.
[37] A. B. MacKenzie and S. B. Wicker,“Game Theory and the Design of Self-configuring,Adaptive Wireless Networks,” IEEE Commun. Mag., Nov.2001.
[38] A. B. MacKenzie and S. B. Wicker,“Stability of Multipacket Slotted Aloha with SelfishUsers and Perfect Information,” Proc. IEEE INFOCOM, vol.3, Apr.2003, pp.1583–90.
[39] A. B. MacKenzie,“Game Theoretic Analysis of Power Control and Medium AccessControl,” Ph.D. Dissertation, Cornell University, May2003.
[40] E. Altman, R. E. Azouzi, and T. Jimenez,“Slotted Aloha as a Stochastic Game withPartial Information,” Proc.1st Wksp. Modeling and Optimization in Mobile, Ad Hoc andWireless Net., Mar.2003.
[41] Y. Jin and G. Kesidis,“Equilibria of a Non-cooperative Game for Heterogeneous Usersof an Aloha Network,” IEEE Commun. Letters, vol.6, no.7, July2002, pp.282–84.
[42] Y. Jin and G. Kesidis,“A Pricing Strategy for an Aloha Network of Heterogeneous Userswith Inelastic Bandwidth Requirements,” Proc. Conf. Info. Sciences and Systems, PrincetonUniversity, Mar.2002.
[43] J. Konorski,“Multiple Access in Ad-hoc Wireless LANs with Non-cooperative Stations,”Proc.2nd International IFIP-TC6Net. Conf. Net. Tech., Services, and Protocols, May2002,pp.1141–46.
[37] M. Cagalj et al.,“On Selfish Behavior in CSMA/CA Networks,” Proc. IEEE INFOCOM,Mar.2005.
[44] I. Zaikiuddin, T. Hawkins, and N. Moffat,“Towards a Gametheoretic Understanding ofAd-hoc Routing,” Proc. Wksp. Games in Design and Verification, July2004, ElectronicNotes in Theoretical Computer Science, vol.119, no.1, Feb.2010, pp.67–92.
[45] A. Urpi, M. Bonuccelli, and S. Giordano,“Modeling Cooperation in Mobile Ad HocNetworks: A Formal Description of Selfishness,” Proc.1st Workshop Modeling andOptimization in Mobile, Ad Hoc and Wireless Networks, Mar.2003.
[46] M. Felegyhazi, L. Buttyan, and J.-P. Hubaux,“Nash Equilibria of Packet ForwardingStrategies in Wireless Ad Hoc Networks,” to appear in IEEE Trans. Mobile Computing.
[47] P. Michiardi and R. Molva,“Analysis of Coalition Formation and Cooperation Strategiesin Mobile Ad Hoc Networks,” J. Ad Hoc Networks, vol.3, no.2, Mar.2010, pp.193–219.
[48] V. Srinivasan et al.,“Cooperation in Wireless Ad Hoc Networks,” Proc. IEEEINFOCOM, vol.2, Apr.2003, pp.808–17.
[49] M. Felegyhazi, L. Buttyan, and J.-P. Hubaux,“Equilibrium Analysis of PacketForwarding Strategies in Wireless Ad Hoc Networks—the Dynamic Case,” Proc.2nd Wksp.Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar.2009.
[50] E. Altman et al.,“Non-cooperative Forwarding in Ad Hoc Networks,” INRIA,Sophia-Antipolis, France, Report no.5116, Feb.2009.
[51] R. Axelrod, The Evolution of Cooperation, Basic Books, reprint edition, New York,1984.
[52] L. A. DaSilva and V. Srivastava,“Node Participation in Peerto-peer and Ad HocNetworks: A Game Theoretic Formulation,” Wksp. Games and Emergent Behavior inDistributed Comp., Sept.2004.
[53] L. Johansson, N. Xiong, and H. Christensen,“A Game Theoretic Model for Managementof Mobile Sensors,” Proc.=6th Conf. Info. Fusion, July2003, pp.583–91.
[54] S. Shenker,“Making Greed Work in Networks: A Game-theoretic Analysis of SwitchService Disciplines,” IEEE/ACM Trans. Net., vol.3, no.6, Dec.1995, pp.819–31.
[55] R. Garg, A. Kamra, and V. Khurana,“A Game Theoretic Approach Towards CongestionControl in Communication Networks,” ACM SIGCOMM Comp. Commun. Rev., vol.32, no.3, July2002, pp.47–61.
[56] A. Akella et al.,“Selfish Behavior and Stability of Internet: A Game Theoretic Analysisof TCP,” Proc. ACM SIGCOMM Conf. on Applications, Technologies, Architectures, andProtocols for Comp. Commun., Aug.2002, pp.117–30.
[57] P. Michiardi and R. Molva,“A Game Theoretical Approach to Evaluate CooperationEnforcement Mechanisms in Mobile Ad Hoc Networks,” Proc.1st Wksp. Modeling andOptimization in Mobile, Ad Hoc and Wireless Networks, Mar.2003.
[58] L. Buttyan and J. P. Hubaux,“Stimulating Cooperation in elf-organizing Ad HocNetworks,” ACM J. Mobile Networks and Applications (MONET), vol.8, no.5, Oct.2003,pp.579–92.
[59] S. Zhong, J. Chen, and Y. R. Yang,“Sprite: A Simple, Cheatproof, Credit-based Systemfor Mobile Ad Hoc networks,” Proc. IEEE INFOCOM, vol.3, Apr.2003, pp.1987–97.
[60] J. Crowcroft et al.,“Modelling Incentives for Collaboration in Mobile Ad Hoc Networks,”Proc.1st Wksp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks,Mar.2003.
[61] S. Eidenbenz, G. Resta, and P. Santi,“COMMIT: A Sendercentric Truthful andEnergy-efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes,” Proc. IEEEInt’l. Parallel and Distributed Proc. Symp. Wksp.12, vol.13, no.13, Apr.2010
[62] L. Anderegg and S. Eidenbenz,“Ad hoc-VCG: A Truthful and Cost-efficient RoutingProtocol for Mobile Ad Hoc Networks with Selfish Agents,” Proc.9th Annual Int’l. Conf.Mobile Comp. and Net.(MobiCom2003), Sept.2003, pp.245–59.
[63] V. Srinivasan et al.,“Energy Efficiency of Ad Hoc Wireless Networks with SelfishUsers,” Proc. European Wireless Conf., Feb.2002.
[64] W. Wang, X.-Y. Li, and Y.Wang,“Truthful Multicast Routing in Selfish WirelessNetworks,” Proc.10th Annual Intl. Conf. Mobile Comp. and Net.(MobiCom2004), Sept.2004, pp.245–59.
[65] Y. Qiu and P. Marbach,“Bandwidth Allocation in Ad Hoc Networks: a Price-basedApproach,” Proc. IEEE INFOCOM, vol.2, Apr.2003, pp.797–807.
[66] Y. Xue, B. Li, and K. Nahrstedt,“Price based Resource Allocation in Wireless Ad HocNetworks,” Proc.11th Int’l. Wksp. Quality of Service, June2003.
[67] S. Buchegger and J. Y. Le Boudec,“Performance Analysis of the CONFIDANT Protocol:Cooperation of Nodes—Fairness in Dynamic Ad-hoc Networks,” Proc.3rd ACM Intl. Symp.Mobile Ad Hoc Net. and Comp.(MobiHoc2002), June2002.
[68] M. T. Refaei et al.,“A Reputation-based Mechanism for Isolating Selfish Nodes in AdHoc Networks,” Proc.2nd Annual Int’l. Conf. Mobile and Ubiquitous Systems (MobiQuitous2005), July2005.
[69] S. Marti et al.,“Mitigating Routing Misbehavior in Mobile Ad Hoc Networks,” Proc.6thAnnual IEEE/ACM Int’l. Conf. Mobile Comp. and Net., Apr.2000, pp.255–65.
[70] S. Bansal and M. Baker,“Observation-based Cooperation Enforcement in Ad HocNetworks,” technical report, Computer Science Department, Stanford University,2003.
[71] J.J. Jaramillo, R. Srikant,“DARWIN: distributed and adaptive reputation mechanism forwireless ad-hoc networks”, in: Proceedings of the13th Annual International Conference onMobile Computing and Networking (Mobicom), Montreal, Canada,2007, pp.87–97.
[72L. Buttyán, J.-P. Hubaux,“Enforcing service availability in mobile ad hoc WANs”, in:Proceedings of the International Symposium on Mobile Ad Hoc Networking&Computing(MobiHoc’00), Boston, MA,2000, pp.87–96.
[73] V. Srinivasan, P. Nuggehalli, C.F. Chiasserini, R.R. Rao,“Energy efficiency of ad hocwireless networks with selfish users,”, in: Proceedings of the European Wireless Conference,Florence, Italy,2002.
[74] S. Buchegger and Jean-Yves Le Boudec.“The Effect of Rumor Spreading in ReputationSystems for Mobile Ad Hoc Networks”, In WiOpt’03: Modeling and Optimization in Mobile,Ad Hoc and Wireless Networks, March,2003.
[75] S. Zhong, J. Chen, Y.R. Yang,“Sprite: a simple, cheat-proof, creditbased system formobile ad-hoc networks”, in: Proceedings of the IEEE INFOCOM’03, vol.3, San Francisco,CA,2003, pp.1987–1997.
[76] L. Buttyán, J.-P. Hubaux,“Stimulating cooperation in self-organizing mobile ad hocnetworks”, ACM/Kluwer Mobile Networks and Applications8(5)(2003)579–592.
[77] J. Crowcroft, R. Gibbens, F. Kelly, S.“Modelling incentives for collaboration inmobile ad hoc networks”, in: Proceedings of the WiOpt’03, France,2003.
[78] L. Anderegg, S. Eidenbenz,“Ad hoc-VCG: a truthful and cost-efficient routing protocolfor mobile ad hoc networks with selfish agents”, in: Proceedings of the ACM Ninth AnnualInternational Conference on Mobile Computing and Networking (MobiCom’03), San Diego,CA,2003, pp.245–259.
[79] S. Marti, T.J. Giuli, K. Lai, M. Baker,“Mitigating routing misbehavior in mobile adhoc networks”, in: Proceedings of the Sixth Annual International Conference on MobileComputing and Networking (MobiCom’00), Boston, MA,2000, pp.255–265.
[80] J.-P. Hubaux, T. Gross, J.-Y. Le Boudec, and M. Vetterli.“Toward self-organizedmobile ad hoc networks: The Terminodes Project”, IEEE Communications Magazine, January2001.
[81] Sonja Buchegger and Jean-Yves Le Boudec.“Nodes Bearing Grudges: TowardsRouting Security, Fairness, and Robustness in MobileAd Hoc Networks”, In Proceedings ofthe Tenth Euromicro Workshop on Parallel, Distributed and Network-based Processing, pages403–410, Canary Islands, Spain, January2002. IEEE Computer Society.
[82] S. Marti, T. Giuli, K. Lai, and M. Baker.“Mitigating routing misbehavior in mobile adhoc networks “, In Proceedings of MOBICOM,2000.
[83] S. Buchegger and Jean-Yves Le Boudec.“Coping with False Accusations in MisbehaviorReputation Systems for MobileAd Hoc Networks”, EPFL Technical Report NumberIC/2003/31,2003.
[84] L. Buttyan and J. Hubaux.” Stimulating Co-Operation in Self Organizing Mobile Ad HocNetworks”, Technical Report DSC/2001/046, EPFL-DI-ICA,August2002.
[85] Juan José Jaramillo, R. Srikant,“A game theory based reputation mechanism toincentivize cooperation in wireless ad hoc networks”, Ad Hoc Networks8(2010),pp.416–429
[86]“A reputationbased mechanism for isolating selfish nodes in ad hoc networks”, M.T.Refaei, V. Srivastava, L. DaSilva, M. Eltoweissy, in: Proceedings of the IEEE Second AnnualInternational Conference on Mobile and Ubiquitous Systems: Networking and Services(MobiQuitous’05), San Diego, CA,2005, pp.3–11.
[87] T. Anantvalee, J. Wu,“Reputation-based system for encouraging the cooperation ofnodes in mobile ad hoc networks”, in: Proceedings of the IEEE International Conference onCommunications (ICC), Glasgow, Scotland,2007, pp.3383–3388.
[88] F. Milan, J.J. Jaramillo, R. Srikant,“Achieving cooperation in multihop wirelessnetworks of selfish nodes”, in: Workshop on Game Theory for Networks (GameNets2006),Pisa, Italy,2006.
[89]“Moderately hard, memory-bound functions”, M. Abadi, M. Burrows, M. Manasse, T.Wobber, ACM Transactions on Internet Technology5(2)(2005)299–327.
[90] C. Dwork, A. Goldberg, M. Naor,“On memory-bound functions for fighting spam”, in:Proceedings of the23rd Annual International Cryptology Conference (CRYPTO’03), SantaBarbara, CA,2003.
[91] The Terminodes Project. www.terminodes.org.
[92] S. Buchegger and Jean-Yves Le Boudec.“Performance Analysis of the CONFIDANTProtocol; Cooperation of Nodes Fairness in Dynamic Ad Hoc Networks”, In Proceedings ofIEEE/ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC),Lausanne, CH, June2002.
[93] S. Bansal, M. Baker,“Observation-based Cooperation Enforcement in Ad HocNetworks “, Tech. Rep., Stanford University, Stanford, CA, July2003.
[94] L. Buttyan and J-P. Hubaux.“Enforcing service availability in mobile ad hoc networks”,In proceedings of MobiHOC,2000
[95] L. Blazevic, L. Buttyan, S. Capkun, S. Giordano, J-P. Hubaux, and J-Y. Le Boudec.“Selforganization in mobile ad hoc networks: The approach of Terminodes”, IEEECommunications Magazine, June2001.
[96] P. Michiardi, R. Molva,“CORE: a collaborative reputation mechanism to enforce nodecooperation in mobile ad hoc networks”, in: Proceedings of the Communications andMultimedia Security Conference (CMS’02), Portoroz, Slovenia,2002.
[97] R. Mahajan, M. Rodrig, D. Wetherall, J. Zahorjan,“Sustaining cooperation in multi-hopwireless networks”, in: Proceedings of the Second Symposium on Networked Systems Designand Implementation (NSDI’05), Boston, MA,2005.
[98] Q. He, D. Wu, P. Khosla,“SORI: a secure and objective reputation based incentivescheme for ad-hoc networks”, in: Proceedings of the IEEE Wireless Communications andNetworking Conference (WCNC’04), vol.2, Atlanta, GA,2004, pp.825–830.
[99] V. Srinivasan, P. Nuggehalli, C.F. Chiasserini, R.R. Rao,“Cooperation in wireless adhoc networks”, in: Proceedings of the IEEE INFOCOM’03, vol.2, San Francisco, CA,2003,pp.808–817
[100] S. Buchegger, J.-Y. Le Boudec,““Performance analysis of the CONFIDANT protocol(cooperation of nodes: Fairness in dynamic ad-hoc networks)”, in: Proceedings of theInternational Symposium on Mobile Ad Hoc Networking&Computing (MobiHoc’02),ausanne, Switzerland,2002, pp.226–236.
[101] Levente Butty′an and Jean-Pierre Hubaux.“Enforcing service availability in mobilead-hoc wans “, In Proceedings of IEEE/ACM Workshop on Mobile Ad Hoc Networking andComputing (MobiHOC), Boston, MA, USA, August2000.
[102] Levente Butty′an and Jean-Pierre Hubaux.“Stimulating cooperation inself-organizing mobile ad hoc networks.“, MONET Journal of Mobile Networks, to appear2002.
[103] Sergio Marti, T.J. Giuli, Kevin Lai, and Mary Baker.“Mitigating routing misbehaviorin mobile ad hoc networks”, In Proceedings of MOBICOM2000, pages255–265,2000.
[104] Andreas Pfitzmann, Birgit Pfitzmann, Matthias Schunter, and Michael Waidner.“Trusting mobile user devices and security modules”, In Computer, pages61–68. IEEE,February1997.
[105] Paul Resnick, Richard Zeckhauser, Eric Friedman, and Ko Kuwabara.“Reputationsystems”, Communications of theACM,43(12):45–48,2000.
[106] John Wiley&Sons,“Digital Security in a Networked World”, Bruce Schneier. Secretsand Lies. Inc.,1edition,2000.
[107] P. Michiardi, R. Molva,“Analysis of coalition formation and cooperation strategies inmobile ad hoc networks”, Ad Hoc Networks3(2)(2005)193–219.
[108] Hara T, Madria “SK (2004) Dynamic data replication using aperiodic updates in mobilead hoc networks”, In: Proc of9th international conference on database systems for advanceapplications,2004, pp869–881.
[109] Gerbia HA, Cenan,“(2005) Distributed database replication—a game theory?”, In:Proc of7th international symposium on symbolic and numeric algorithms for scientificcomputing,2005.
[110] Hirsch, D.; Madria, S.”A cooperative game theoretic approach for data replication inmobile ad-hoc networks”, Collaborative Computing: Networking, Applications andWorksharing (CollaborateCom),20117th International Conference on2011, Page(s):115–124
[111] Theodorakopoulos, G.; Baras, J.S.“A Game for Ad Hoc Network Connectivity in thePresence of Malicious Users”, Global Telecommunications Conference,2006. GLOBECOM'06. IEEE2006Page(s):1–5
[112] Bin Lu; Pooch, U.W.“A Game Theoretic Framework for Bandwidth Reservation inMobile Ad Hoc Networks”, Quality of Service in Heterogeneous Wired/Wireless Networks,2004. QSHINE2004. First International Conference on2004, Page(s):234–241
[113] Hui Jing; Aida, H.“A game theoretical approach to clustering of ad-hoc and sensornetworks”,Communications, Computers and Signal Processing,2009. Page(s):140–145
[114] Sergi, S.; Pancaldi, F.; Vitetta, G.M.“A Game Theoretical Approach to theManagement of Transmission Selection Scheme in Wireless Ad-Hoc Network”,Communications, IEEE Transactions on Volume:58, Issue:102010, Page(s):2799-2804
[115] Khan, S.U.; Maciejewski, A.A.; Siegel, H.J.; Ahmad, I.“A Game Theoretical DataReplication Technique for Mobile Ad Hoc Networks”, Parallel and Distributed Processing,2008. IPDPS2008. EEE International Symposium on2008, Page(s):1–12
[116] Enneya, N.; Elmeziane, R.; Elkoutbi, M.“A Game Theory Approach for EnhancingQoS-Aware Routing in Mobile Ad hoc Networks”, Networked Digital Technologies,2009.NDT '09. First International Conference on Page(s):327–333
[117] Sergi, S.; Pancaldi, F.; Vitetta, G.M.“A Game Theory Approach to Selection Diversityin Wireless Ad-Hoc Networks”, Communications,2009. ICC '09. IEEE InternationalConference onPage(s):1–6
[118] Kamhoua, C.A.; Pissinou, N.; Busovaca, A.; Makki, K.“Belief-free equilibrium ofpacket forwarding game in ad hoc networks under imperfect monitoring”, PerformanceComputing and Communications Conference (IPCCC),2010IEEE29th International Page(s):315–324
[119] Mumtaz, S.; Marques, P.; Gameiro, A.; Rodriguez, J.“Application of Game Theory inAd-Hoc Opportunistic Radios“, Networks,2009. ICN '09. Eighth International Conference onPage(s):46–51
[120] Khan SU, Ahmad I,“(2007) Discriminatory algorithmic mechanism design basedWWW content replication.”, Information31(1):105–119.
[121] Hara T.“(2001) Effective replica allocation in ad hoc networks for improving dataaccessibility”, In: Proc of IEEE INFOCOM,2001, pp1568–1576.
[122] Hara T,“(2003) Replica allocation in ad hoc networks with data update”, MobileNetw Appl8:343–354.
[123] Khan SU, Ahmad I,“(2004) Heuristic-based replication schemas for fast informationretrieval over the Internet”, In: Proc of17th international conference on parallel anddistributed computing systems,2004, pp278–283.
[124] Khan SU, Ahmad I.“(2005) A powerful direct mechanism for optimal WWW contentreplication “, In: Proc of19th IEEE International parallel and distributed processingsymposium,2005.
[125]谢识予，《经济学博弈论》，复旦大学出版社，2001，第二版。
[126] Nisan N, Ronen A,“(1999) Algorithmic mechanism design”, Proc31st annual ACMsymposium on theory of computing (STOC’99),1999, pp129–140.
[127] Jing J, Elmagarmid. A, Helal. A, Alonso R.“(1997) Bit-sequences: an adaptive cacheinvalidation method in mobile client/server environments “, Mobile Netw Appl2(2):115–127.
[128] Samee Ullah Khan, J,“Mosaic-Net: a game theoretical method for selection andallocation of replicas in ad hoc networks”, Supercomput (2011)55, pp.321–366
[58] Rappaport TS.“(1996) Wireless communications: principles and practices “, PrenticeHall, New York.
[129] Archer A, Tardos E.“(2001) Truthful mechanisms for one-parameter agents”, In:Proc of42nd IEEE annual symposium on foundations of computer science,2001, pp482–491.
[130] Khan SU, Ahmad I.“(2009) A pure Nash equilibrium-based game theoretical methodfor data replication across multiple servers “, IEEE Trans Knowl Data Eng20(3):346–360
[131] Crovella M, Bestavros A.“(1997) Self-similarity in world wide web traffic: evidenceand possible causes”, IEEE/ACM Trans Netw5(6):835–846.
[132] Izhak Rubin, Runhe Zhang,“Robust throughput and routing for mobile ad hoc wirelessnetworks”, Ad Hoc Networks7(2009) pp.265–280
[133] C.E. Perkins, E.M. Royer,“Ad hoc on-demand distance vector routing”, Proceedings ofthe2nd IEEE Workshop on Mobile Computing Systems and Applications, WMCSA’99,February1999, New Orleans, pp.90–100.
[134] Z. Ye, S.V. Krishnamurthy, S.K. Tripathi,“Effects of multipath routing on TCPperformance in ad hoc networks”, in: Proceedings of Global Telecommunications Conference,GLOBECOM’04. IEEE, vol.6, November2004, Dallas, pp.4125–4131.
[135] Y.C. Hu, D.B. Johnson,“Exploiting congestion information in network and higher layerprotocols in multihop wireless ad hoc networks”, in: Proceedings of24th InternationalConference on Distributed Computing Systems, March2004, Tokyo, Japan,2004, pp.301–310.
[136] K. Fall,“A delay-tolerant network architecture for challenged internets”, in:Proceedings of the2003Conference on Applications, Technologies, Architectures, andProtocols for Computer Communications,2003, Karlsruhe, Germany, pp.27–34.
[137] J. Burgess, B. Gallagher, D. Jensen, B. Levine,“Maxprop: routing for vehicle-baseddisruption-tolerant networks”, in: Proceedings of INFOCOM2006,25th IEEE InternationalConference on Computer Communications, April2006, Barcelona, Spain, pp.1–11.
[138] R. Zhang, I. Rubin,“Mobility induced robust throughput behavior in mobile ad hocnetworks”, in: Proceedings of IEEE60th Vehicular Technology Conference,2004.VTC2004-Fall, vol.4,2004, Los Angeles, pp.2708–2711.
[139] R. Zhang, I. Rubin,“Robust flow admission and routing for mobile ad hoc networks”,in: Proceedings of Military Communications Conference (Milcom), October2006,Washington DC.
[140] J. Hsu, I. Rubin,“Performance analysis of multi-rate capable random access MACprotocols in wireless multi-hop networks”, in: Proceedings IEEE International Symposium onPersonal, Indoor and Mobile Radio Communications (PIMRC’06), September2006, Helsinki,Finland.
[141] I. Rubin, R. Zhang, H. Ju,“Topological performance of mobile backbone basedwireless ad hoc network with unmanned vehicles”, in: Proceedings of IEEE WirelessCommunications and Networking Conference, WCNC’03, vol.3,2003, New Orleans,pp.1498–1503.
[142] I. Rubin, A. Behzad, H. Ju, R. Zhang, X. Huang, Y. Liu, R. Khalaf,“Ad hoc wirelessnetworks with mobile backbones”, in: Proceedings of the15th IEEE International Symposiumon Personal, Indoor and Mobile Radio Communications (PIMRC), vol.1, September2004,Barcelona, Spain, pp.566–573.
[143] X. Huang, I. Rubin, H. Ju,“A mobile backbone network routing protocol with flowcontrol”, in: Proceedings of Military Communications Conference (MILCOM), vol.2,2004,pp.1086–1092.
[144] H. Ju, I. Rubin,“Backbone topology synthesis for multi-radio meshed wireless LANs”,in: Proceedings IEEE INFOCOM2006Conference, April2006, Barcelona, Spain.
[145] D.B. Johnson,“Routing in ad hoc network of mobile hosts”, in: Proceedings of theIEEE Workshop on Mobile Computing Systems and Applications, December1994, pp.158–163, Santa Cruz.
[146] Chen, Yutian; Tang, Bin,“Data Caching in Ad Hoc Networks Using Game-TheoreticAnalysis”, Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC),2010IEEEInternational Conference on Page(s):43–49
[147] Majeed, S.J.; Mahmood, H.,“Topological Importance as an Incentive to Cooperate inMobile Ad Hoc Networks----A Game Theoretic Analysis”, Advanced CommunicationTechnology (ICACT),201214th International Conference on Page(s):46–51
[148] Macharla, P.; Kumar, R.; Sarje, A.K.; Misra, M.“Throughput-oriented MAC for mobilead hoc networks “, Communication Systems Software and Middleware and Workshops,2008.COMSWARE2008.3rd International Conference on Page(s):720–727
[149] Bo-qing Yang; Hao Sun,“Packet Forwarding Based on Cooperative Game and AuctionTheory in Wireless Ad Hoc Network”, Multimedia Information Networking and Security(MINES),2010International Conference on Page(s):149–153
[150] Tootaghaj, D.Z.; Farhat, F.; Pakravan, M.-R.; Aref, M.-R.“Game-Theoretic Approachto Mitigate Packet Dropping in Wireless Ad-hoc Networks“, Consumer Communicationsand Networking Conference (CCNC),2011IEEE Page(s):163–165
[151] Seredynski, M.; Bouvry, P.“Energy-efficient topology control in wireless ad hoc
networks with selfish nodes”, Parallel&Distributed Processing,2009. IPDPS2009. IEEE
International Symposium Page(s):1-8
[2] Hewes, C.R,“SOC technology for future wireless communications”, WirelessCommunication Technology,2003. IEEE Topical Conference on15-17Oct.2003
[3] J.Broch, D. B.Johnson, and D. A. Maltz,“The Dynamic Source Routing Protocol forMobile Ad hoc Network”, Internet draft-ietf-manet-dsr-07.txt, Feb.2002.
[4] C. Perkins, E. Belding. Royer and S. Das,“Ad hoc On-Demand DistanceVector(AODV) Routing” IETF Request for Comments: RFC3561, Jul.2003.
[5] Z. J. Hass, M. R. Pearlman and P. Samar,“The Zone Routing Protocol (ZRP) for AdHoc Networks”, Internet Draft draft-ietf-manet-zone-zrp-04.txt, Jul.2002.
[6] M. Gerla, X. Hong and G. Pei,“Fisheye State Routing Protocol (FSR) for Ad HocNetworks”, Internet Draft draft-ietf-manet-fsr-03.txt, Jun.2002.
[7] M. Gerla, X. Hong and G. Pei,“Landmark Routing Protocol (LANMAR) for LargeScale Ad Hoc Networks”, Internet Draft draft-ietf-manet-lanmar-05.txt, Nov.2002.
[8] V. Park and M. Corson.“Temporally-ordered Routing Algorithm (TORA): Version1Functional Specification”, Internet Draft, IETF draft-ietf-manet-tora-spec-04.txt,2001.7
[9]（美）朱.弗登博格，（法）让.梯若尔著，《博弈论》，黄涛等译，中国人民大学出版社，1999.
[10] P. K. Dutta, Strategies and Games: Theory and Practice, MIT Press,2001.
[11] N. Christin, J. Grossklags and J. Chuang,“Near Rationality and Competitive Equilibriain Networked Systems,” ACM SIGCOMM Wksp. Practice and Theory of Incentives andGame Theory in Networked Systems (PINS), Sept.2004.
[12] J. P. Monks et al.,“A Study of the Energy Saving and Capacity Improvement Potentialof Power Control in Multi-hop Wireless Networks,” Proc.26th Annual IEEE Conf. LocalComp. Net., Nov.2001, pp.550–59.
[13] S. Agarwal et al.,“Distributed Power Control in Ad-hoc Wireless Networks,” Int’l.Symp. Pers. Indoor and Mobile Radio Commun.,2001, pp. F-59–F-66.
[14] R. Yates,“A Framework for Uplink Power Control in Cellular Radio Systems,” IEEEJSAC, vol.13, no.7, Sept.1995, pp.1341–47.
[15] X. Lin, Y. Kwok, and V. Lau,“Power Control for IEEE802.11Ad Hoc Networks:Issues and a New Algorithm,” Proc. Int’l. Conf. Parallel Proc., Oct.2003, pp.249–56.
[16] J. P. Monks, V. Bharghavan, and W. W. Hwu,“Transmission Power Control for MultipleAccess Wireless Packet Networks,” Proc. the25th Annual IEEE Conf. on Local Comp. Net.,Nov.2000, pp.12–21.
[17] M. Krunz and A. Muqattash,“A Power Control Scheme for MANETs with ImprovedThroughput and Energy Consumption,” Proc.5th Int’l. Conf. Wireless Pers. MultimediaCommun., vol.2, Oct.2002, pp.771–5.
[18] Z. Huang et al.,“Topology Control for Ad Hoc Networks with Directional Antennas,”Comp. Commun. and Networks,2002, pp.16–21.
[19] I. Glicksberg,“A Further Generalization of the Kakutani Fixed Point Theorem, withApplication to Nash Equilibrium Points,” Proc. American Mathematical Society, vol.3,1952,pp.170–74.
[20] K. Fan,“Fixed Point and Minima Theorems in Locally Convex Topological LinearSpaces,” Proc. National Academy of Sciences, vol.38,1952, pp.121–26.
[21] J. Neel, J. Reed, and R. Gilles,“The Role of Game Theory in the Analysis of SoftwareRadio Networks,” SDR Forum Tech. Conf., Nov.2002.
[22] J. Neel et al.,“Using Game Theory to Aid the Design of Physical Layer Cognitive RadioAlgorithms,” Conf. Economics, Tech. and Policy of Unlicensed Spectrum, May2005.
[23] S. Ulukus and R. D. Yates,“Iterative Construction of Optimum Signature Sequence Setsin Synchronous CDMA Systems,” IEEE Trans. Info. Theory, vol.47, no.5, July2001,pp.1989–98.
[24] C. Rose, S. Ulukus, and R. D. Yates,“Wireless Systems and Interference Avoidance,”IEEE Trans. Wireless Commun., vol.1, no.3, July2002, pp.415–27.
[25] S. Ulukus and R. D. Yates,“Signature Sequence Optimization in Asynchronous CDMASystems,” Proc. IEEE Int’l. Conf. Commun., vol.2, June2001, pp.545–49.
[26] J. I. Concha and S. Ulukus,“Optimization of CDMA Signature Sequences in MultipathChannels,” Proc. IEEE Vehic. Tech. Conf., vol.3, May2001, pp.1978–82.
[18] D. C. Popescu and C. Rose,“Interference Avoidance Applied to Multiaccess DispersiveChannels,” Proc. IEEE Int’l. Symp. Info. Theory, July2002.
[27] J. Hicks et al.,“A Game Theory Perspective on Interference Avoidance,” IEEE GlobalTelecommun. Conf., vol.1, Dec.2004, pp.257–61.
[28] C. W. Sung, K. W. Shum, and K. K. Leung,“Multi-objective Power Control andSignature Sequence Adaptation for Synchronous CDMA Systems—a Game-theoreticViewpoint,” Proc. IEEE Intl. Symp. Info. Theory, July2003, pp.335–35.
[29] C. W. Sung and K. K. Leung,“On the Stability of Distributed Sequence Adaptation forCellular Asynchronous DS-CDMA Systems,” IEEE Trans. Info. Theory, vol.49, no.7, July2003, pp.1828–31.
[30] K. K. Leung, T. M. Lok, and C. W. Sung,“Sequence Adaptation for Cellular Systems,”Proc.57th IEEE Semiannual Vehic. Tech. Conf., vol.3, Apr.2003, pp.2066–70.
[31] R. Menon et al.,“A Game-theoretic Framework for Interference Avoidance in Ad HocNetworks,” June2005; http://www.mprg.org/people/gametheory/publications.shtml
[32] D. Monderer and L. Shapley,“Potential Games,” Games and Economic Behavior,1996,pp.124–43.
[33] W. Santipach and M. L. Honig,“Signature Optimization for DS-CDMA with LimitedFeedback,” IEEE7th Int’l. Symp. Spread Spectrum Techniques and Applications,2002, vol.1, pp.180–84.
[34] R. Menon et al.,“Game Theory and Interference Avoidance in Decentralized Networks,”Software Defined Radio Technical Conf. and Product Exposition,2010.
[27] J. Zander,“Jamming Games in Slotted Aloha Packet Radio Networks,” Proc. IEEEMilitary Commun. Conf., vol.2,1990, pp.830-834.
[35] J. Zander,“Jamming in Slotted Aloha Multi Hop Packet Radio Networks,” IEEE Trans.Commun., vol.39, no.10, Oct.1991,pp.1525–31.
[36] A. B. MacKenzie and S. B. Wicker,“Selfish Users in Aloha: a Game TheoreticApproach,” Proc. Vehic. Tech. Conf., vol.3,Oct.2001, pp.1354–57.
[37] A. B. MacKenzie and S. B. Wicker,“Game Theory and the Design of Self-configuring,Adaptive Wireless Networks,” IEEE Commun. Mag., Nov.2001.
[38] A. B. MacKenzie and S. B. Wicker,“Stability of Multipacket Slotted Aloha with SelfishUsers and Perfect Information,” Proc. IEEE INFOCOM, vol.3, Apr.2003, pp.1583–90.
[39] A. B. MacKenzie,“Game Theoretic Analysis of Power Control and Medium AccessControl,” Ph.D. Dissertation, Cornell University, May2003.
[40] E. Altman, R. E. Azouzi, and T. Jimenez,“Slotted Aloha as a Stochastic Game withPartial Information,” Proc.1st Wksp. Modeling and Optimization in Mobile, Ad Hoc andWireless Net., Mar.2003.
[41] Y. Jin and G. Kesidis,“Equilibria of a Non-cooperative Game for Heterogeneous Usersof an Aloha Network,” IEEE Commun. Letters, vol.6, no.7, July2002, pp.282–84.
[42] Y. Jin and G. Kesidis,“A Pricing Strategy for an Aloha Network of Heterogeneous Userswith Inelastic Bandwidth Requirements,” Proc. Conf. Info. Sciences and Systems, PrincetonUniversity, Mar.2002.
[43] J. Konorski,“Multiple Access in Ad-hoc Wireless LANs with Non-cooperative Stations,”Proc.2nd International IFIP-TC6Net. Conf. Net. Tech., Services, and Protocols, May2002,pp.1141–46.
[37] M. Cagalj et al.,“On Selfish Behavior in CSMA/CA Networks,” Proc. IEEE INFOCOM,Mar.2005.
[44] I. Zaikiuddin, T. Hawkins, and N. Moffat,“Towards a Gametheoretic Understanding ofAd-hoc Routing,” Proc. Wksp. Games in Design and Verification, July2004, ElectronicNotes in Theoretical Computer Science, vol.119, no.1, Feb.2010, pp.67–92.
[45] A. Urpi, M. Bonuccelli, and S. Giordano,“Modeling Cooperation in Mobile Ad HocNetworks: A Formal Description of Selfishness,” Proc.1st Workshop Modeling andOptimization in Mobile, Ad Hoc and Wireless Networks, Mar.2003.
[46] M. Felegyhazi, L. Buttyan, and J.-P. Hubaux,“Nash Equilibria of Packet ForwardingStrategies in Wireless Ad Hoc Networks,” to appear in IEEE Trans. Mobile Computing.
[47] P. Michiardi and R. Molva,“Analysis of Coalition Formation and Cooperation Strategiesin Mobile Ad Hoc Networks,” J. Ad Hoc Networks, vol.3, no.2, Mar.2010, pp.193–219.
[48] V. Srinivasan et al.,“Cooperation in Wireless Ad Hoc Networks,” Proc. IEEEINFOCOM, vol.2, Apr.2003, pp.808–17.
[49] M. Felegyhazi, L. Buttyan, and J.-P. Hubaux,“Equilibrium Analysis of PacketForwarding Strategies in Wireless Ad Hoc Networks—the Dynamic Case,” Proc.2nd Wksp.Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar.2009.
[50] E. Altman et al.,“Non-cooperative Forwarding in Ad Hoc Networks,” INRIA,Sophia-Antipolis, France, Report no.5116, Feb.2009.
[51] R. Axelrod, The Evolution of Cooperation, Basic Books, reprint edition, New York,1984.
[52] L. A. DaSilva and V. Srivastava,“Node Participation in Peerto-peer and Ad HocNetworks: A Game Theoretic Formulation,” Wksp. Games and Emergent Behavior inDistributed Comp., Sept.2004.
[53] L. Johansson, N. Xiong, and H. Christensen,“A Game Theoretic Model for Managementof Mobile Sensors,” Proc.=6th Conf. Info. Fusion, July2003, pp.583–91.
[54] S. Shenker,“Making Greed Work in Networks: A Game-theoretic Analysis of SwitchService Disciplines,” IEEE/ACM Trans. Net., vol.3, no.6, Dec.1995, pp.819–31.
[55] R. Garg, A. Kamra, and V. Khurana,“A Game Theoretic Approach Towards CongestionControl in Communication Networks,” ACM SIGCOMM Comp. Commun. Rev., vol.32, no.3, July2002, pp.47–61.
[56] A. Akella et al.,“Selfish Behavior and Stability of Internet: A Game Theoretic Analysisof TCP,” Proc. ACM SIGCOMM Conf. on Applications, Technologies, Architectures, andProtocols for Comp. Commun., Aug.2002, pp.117–30.
[57] P. Michiardi and R. Molva,“A Game Theoretical Approach to Evaluate CooperationEnforcement Mechanisms in Mobile Ad Hoc Networks,” Proc.1st Wksp. Modeling andOptimization in Mobile, Ad Hoc and Wireless Networks, Mar.2003.
[58] L. Buttyan and J. P. Hubaux,“Stimulating Cooperation in elf-organizing Ad HocNetworks,” ACM J. Mobile Networks and Applications (MONET), vol.8, no.5, Oct.2003,pp.579–92.
[59] S. Zhong, J. Chen, and Y. R. Yang,“Sprite: A Simple, Cheatproof, Credit-based Systemfor Mobile Ad Hoc networks,” Proc. IEEE INFOCOM, vol.3, Apr.2003, pp.1987–97.
[60] J. Crowcroft et al.,“Modelling Incentives for Collaboration in Mobile Ad Hoc Networks,”Proc.1st Wksp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks,Mar.2003.
[61] S. Eidenbenz, G. Resta, and P. Santi,“COMMIT: A Sendercentric Truthful andEnergy-efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes,” Proc. IEEEInt’l. Parallel and Distributed Proc. Symp. Wksp.12, vol.13, no.13, Apr.2010
[62] L. Anderegg and S. Eidenbenz,“Ad hoc-VCG: A Truthful and Cost-efficient RoutingProtocol for Mobile Ad Hoc Networks with Selfish Agents,” Proc.9th Annual Int’l. Conf.Mobile Comp. and Net.(MobiCom2003), Sept.2003, pp.245–59.
[63] V. Srinivasan et al.,“Energy Efficiency of Ad Hoc Wireless Networks with SelfishUsers,” Proc. European Wireless Conf., Feb.2002.
[64] W. Wang, X.-Y. Li, and Y.Wang,“Truthful Multicast Routing in Selfish WirelessNetworks,” Proc.10th Annual Intl. Conf. Mobile Comp. and Net.(MobiCom2004), Sept.2004, pp.245–59.
[65] Y. Qiu and P. Marbach,“Bandwidth Allocation in Ad Hoc Networks: a Price-basedApproach,” Proc. IEEE INFOCOM, vol.2, Apr.2003, pp.797–807.
[66] Y. Xue, B. Li, and K. Nahrstedt,“Price based Resource Allocation in Wireless Ad HocNetworks,” Proc.11th Int’l. Wksp. Quality of Service, June2003.
[67] S. Buchegger and J. Y. Le Boudec,“Performance Analysis of the CONFIDANT Protocol:Cooperation of Nodes—Fairness in Dynamic Ad-hoc Networks,” Proc.3rd ACM Intl. Symp.Mobile Ad Hoc Net. and Comp.(MobiHoc2002), June2002.
[68] M. T. Refaei et al.,“A Reputation-based Mechanism for Isolating Selfish Nodes in AdHoc Networks,” Proc.2nd Annual Int’l. Conf. Mobile and Ubiquitous Systems (MobiQuitous2005), July2005.
[69] S. Marti et al.,“Mitigating Routing Misbehavior in Mobile Ad Hoc Networks,” Proc.6thAnnual IEEE/ACM Int’l. Conf. Mobile Comp. and Net., Apr.2000, pp.255–65.
[70] S. Bansal and M. Baker,“Observation-based Cooperation Enforcement in Ad HocNetworks,” technical report, Computer Science Department, Stanford University,2003.
[71] J.J. Jaramillo, R. Srikant,“DARWIN: distributed and adaptive reputation mechanism forwireless ad-hoc networks”, in: Proceedings of the13th Annual International Conference onMobile Computing and Networking (Mobicom), Montreal, Canada,2007, pp.87–97.
[72L. Buttyán, J.-P. Hubaux,“Enforcing service availability in mobile ad hoc WANs”, in:Proceedings of the International Symposium on Mobile Ad Hoc Networking&Computing(MobiHoc’00), Boston, MA,2000, pp.87–96.
[73] V. Srinivasan, P. Nuggehalli, C.F. Chiasserini, R.R. Rao,“Energy efficiency of ad hocwireless networks with selfish users,”, in: Proceedings of the European Wireless Conference,Florence, Italy,2002.
[74] S. Buchegger and Jean-Yves Le Boudec.“The Effect of Rumor Spreading in ReputationSystems for Mobile Ad Hoc Networks”, In WiOpt’03: Modeling and Optimization in Mobile,Ad Hoc and Wireless Networks, March,2003.
[75] S. Zhong, J. Chen, Y.R. Yang,“Sprite: a simple, cheat-proof, creditbased system formobile ad-hoc networks”, in: Proceedings of the IEEE INFOCOM’03, vol.3, San Francisco,CA,2003, pp.1987–1997.
[76] L. Buttyán, J.-P. Hubaux,“Stimulating cooperation in self-organizing mobile ad hocnetworks”, ACM/Kluwer Mobile Networks and Applications8(5)(2003)579–592.
[77] J. Crowcroft, R. Gibbens, F. Kelly, S.“Modelling incentives for collaboration inmobile ad hoc networks”, in: Proceedings of the WiOpt’03, France,2003.
[78] L. Anderegg, S. Eidenbenz,“Ad hoc-VCG: a truthful and cost-efficient routing protocolfor mobile ad hoc networks with selfish agents”, in: Proceedings of the ACM Ninth AnnualInternational Conference on Mobile Computing and Networking (MobiCom’03), San Diego,CA,2003, pp.245–259.
[79] S. Marti, T.J. Giuli, K. Lai, M. Baker,“Mitigating routing misbehavior in mobile adhoc networks”, in: Proceedings of the Sixth Annual International Conference on MobileComputing and Networking (MobiCom’00), Boston, MA,2000, pp.255–265.
[80] J.-P. Hubaux, T. Gross, J.-Y. Le Boudec, and M. Vetterli.“Toward self-organizedmobile ad hoc networks: The Terminodes Project”, IEEE Communications Magazine, January2001.
[81] Sonja Buchegger and Jean-Yves Le Boudec.“Nodes Bearing Grudges: TowardsRouting Security, Fairness, and Robustness in MobileAd Hoc Networks”, In Proceedings ofthe Tenth Euromicro Workshop on Parallel, Distributed and Network-based Processing, pages403–410, Canary Islands, Spain, January2002. IEEE Computer Society.
[82] S. Marti, T. Giuli, K. Lai, and M. Baker.“Mitigating routing misbehavior in mobile adhoc networks “, In Proceedings of MOBICOM,2000.
[83] S. Buchegger and Jean-Yves Le Boudec.“Coping with False Accusations in MisbehaviorReputation Systems for MobileAd Hoc Networks”, EPFL Technical Report NumberIC/2003/31,2003.
[84] L. Buttyan and J. Hubaux.” Stimulating Co-Operation in Self Organizing Mobile Ad HocNetworks”, Technical Report DSC/2001/046, EPFL-DI-ICA,August2002.
[85] Juan José Jaramillo, R. Srikant,“A game theory based reputation mechanism toincentivize cooperation in wireless ad hoc networks”, Ad Hoc Networks8(2010),pp.416–429
[86]“A reputationbased mechanism for isolating selfish nodes in ad hoc networks”, M.T.Refaei, V. Srivastava, L. DaSilva, M. Eltoweissy, in: Proceedings of the IEEE Second AnnualInternational Conference on Mobile and Ubiquitous Systems: Networking and Services(MobiQuitous’05), San Diego, CA,2005, pp.3–11.
[87] T. Anantvalee, J. Wu,“Reputation-based system for encouraging the cooperation ofnodes in mobile ad hoc networks”, in: Proceedings of the IEEE International Conference onCommunications (ICC), Glasgow, Scotland,2007, pp.3383–3388.
[88] F. Milan, J.J. Jaramillo, R. Srikant,“Achieving cooperation in multihop wirelessnetworks of selfish nodes”, in: Workshop on Game Theory for Networks (GameNets2006),Pisa, Italy,2006.
[89]“Moderately hard, memory-bound functions”, M. Abadi, M. Burrows, M. Manasse, T.Wobber, ACM Transactions on Internet Technology5(2)(2005)299–327.
[90] C. Dwork, A. Goldberg, M. Naor,“On memory-bound functions for fighting spam”, in:Proceedings of the23rd Annual International Cryptology Conference (CRYPTO’03), SantaBarbara, CA,2003.
[91] The Terminodes Project. www.terminodes.org.
[92] S. Buchegger and Jean-Yves Le Boudec.“Performance Analysis of the CONFIDANTProtocol; Cooperation of Nodes Fairness in Dynamic Ad Hoc Networks”, In Proceedings ofIEEE/ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC),Lausanne, CH, June2002.
[93] S. Bansal, M. Baker,“Observation-based Cooperation Enforcement in Ad HocNetworks “, Tech. Rep., Stanford University, Stanford, CA, July2003.
[94] L. Buttyan and J-P. Hubaux.“Enforcing service availability in mobile ad hoc networks”,In proceedings of MobiHOC,2000
[95] L. Blazevic, L. Buttyan, S. Capkun, S. Giordano, J-P. Hubaux, and J-Y. Le Boudec.“Selforganization in mobile ad hoc networks: The approach of Terminodes”, IEEECommunications Magazine, June2001.
[96] P. Michiardi, R. Molva,“CORE: a collaborative reputation mechanism to enforce nodecooperation in mobile ad hoc networks”, in: Proceedings of the Communications andMultimedia Security Conference (CMS’02), Portoroz, Slovenia,2002.
[97] R. Mahajan, M. Rodrig, D. Wetherall, J. Zahorjan,“Sustaining cooperation in multi-hopwireless networks”, in: Proceedings of the Second Symposium on Networked Systems Designand Implementation (NSDI’05), Boston, MA,2005.
[98] Q. He, D. Wu, P. Khosla,“SORI: a secure and objective reputation based incentivescheme for ad-hoc networks”, in: Proceedings of the IEEE Wireless Communications andNetworking Conference (WCNC’04), vol.2, Atlanta, GA,2004, pp.825–830.
[99] V. Srinivasan, P. Nuggehalli, C.F. Chiasserini, R.R. Rao,“Cooperation in wireless adhoc networks”, in: Proceedings of the IEEE INFOCOM’03, vol.2, San Francisco, CA,2003,pp.808–817
[100] S. Buchegger, J.-Y. Le Boudec,““Performance analysis of the CONFIDANT protocol(cooperation of nodes: Fairness in dynamic ad-hoc networks)”, in: Proceedings of theInternational Symposium on Mobile Ad Hoc Networking&Computing (MobiHoc’02),ausanne, Switzerland,2002, pp.226–236.
[101] Levente Butty′an and Jean-Pierre Hubaux.“Enforcing service availability in mobilead-hoc wans “, In Proceedings of IEEE/ACM Workshop on Mobile Ad Hoc Networking andComputing (MobiHOC), Boston, MA, USA, August2000.
[102] Levente Butty′an and Jean-Pierre Hubaux.“Stimulating cooperation inself-organizing mobile ad hoc networks.“, MONET Journal of Mobile Networks, to appear2002.
[103] Sergio Marti, T.J. Giuli, Kevin Lai, and Mary Baker.“Mitigating routing misbehaviorin mobile ad hoc networks”, In Proceedings of MOBICOM2000, pages255–265,2000.
[104] Andreas Pfitzmann, Birgit Pfitzmann, Matthias Schunter, and Michael Waidner.“Trusting mobile user devices and security modules”, In Computer, pages61–68. IEEE,February1997.
[105] Paul Resnick, Richard Zeckhauser, Eric Friedman, and Ko Kuwabara.“Reputationsystems”, Communications of theACM,43(12):45–48,2000.
[106] John Wiley&Sons,“Digital Security in a Networked World”, Bruce Schneier. Secretsand Lies. Inc.,1edition,2000.
[107] P. Michiardi, R. Molva,“Analysis of coalition formation and cooperation strategies inmobile ad hoc networks”, Ad Hoc Networks3(2)(2005)193–219.
[108] Hara T, Madria “SK (2004) Dynamic data replication using aperiodic updates in mobilead hoc networks”, In: Proc of9th international conference on database systems for advanceapplications,2004, pp869–881.
[109] Gerbia HA, Cenan,“(2005) Distributed database replication—a game theory?”, In:Proc of7th international symposium on symbolic and numeric algorithms for scientificcomputing,2005.
[110] Hirsch, D.; Madria, S.”A cooperative game theoretic approach for data replication inmobile ad-hoc networks”, Collaborative Computing: Networking, Applications andWorksharing (CollaborateCom),20117th International Conference on2011, Page(s):115–124
[111] Theodorakopoulos, G.; Baras, J.S.“A Game for Ad Hoc Network Connectivity in thePresence of Malicious Users”, Global Telecommunications Conference,2006. GLOBECOM'06. IEEE2006Page(s):1–5
[112] Bin Lu; Pooch, U.W.“A Game Theoretic Framework for Bandwidth Reservation inMobile Ad Hoc Networks”, Quality of Service in Heterogeneous Wired/Wireless Networks,2004. QSHINE2004. First International Conference on2004, Page(s):234–241
[113] Hui Jing; Aida, H.“A game theoretical approach to clustering of ad-hoc and sensornetworks”,Communications, Computers and Signal Processing,2009. Page(s):140–145
[114] Sergi, S.; Pancaldi, F.; Vitetta, G.M.“A Game Theoretical Approach to theManagement of Transmission Selection Scheme in Wireless Ad-Hoc Network”,Communications, IEEE Transactions on Volume:58, Issue:102010, Page(s):2799-2804
[115] Khan, S.U.; Maciejewski, A.A.; Siegel, H.J.; Ahmad, I.“A Game Theoretical DataReplication Technique for Mobile Ad Hoc Networks”, Parallel and Distributed Processing,2008. IPDPS2008. EEE International Symposium on2008, Page(s):1–12
[116] Enneya, N.; Elmeziane, R.; Elkoutbi, M.“A Game Theory Approach for EnhancingQoS-Aware Routing in Mobile Ad hoc Networks”, Networked Digital Technologies,2009.NDT '09. First International Conference on Page(s):327–333
[117] Sergi, S.; Pancaldi, F.; Vitetta, G.M.“A Game Theory Approach to Selection Diversityin Wireless Ad-Hoc Networks”, Communications,2009. ICC '09. IEEE InternationalConference onPage(s):1–6
[118] Kamhoua, C.A.; Pissinou, N.; Busovaca, A.; Makki, K.“Belief-free equilibrium ofpacket forwarding game in ad hoc networks under imperfect monitoring”, PerformanceComputing and Communications Conference (IPCCC),2010IEEE29th International Page(s):315–324
[119] Mumtaz, S.; Marques, P.; Gameiro, A.; Rodriguez, J.“Application of Game Theory inAd-Hoc Opportunistic Radios“, Networks,2009. ICN '09. Eighth International Conference onPage(s):46–51
[120] Khan SU, Ahmad I,“(2007) Discriminatory algorithmic mechanism design basedWWW content replication.”, Information31(1):105–119.
[121] Hara T.“(2001) Effective replica allocation in ad hoc networks for improving dataaccessibility”, In: Proc of IEEE INFOCOM,2001, pp1568–1576.
[122] Hara T,“(2003) Replica allocation in ad hoc networks with data update”, MobileNetw Appl8:343–354.
[123] Khan SU, Ahmad I,“(2004) Heuristic-based replication schemas for fast informationretrieval over the Internet”, In: Proc of17th international conference on parallel anddistributed computing systems,2004, pp278–283.
[124] Khan SU, Ahmad I.“(2005) A powerful direct mechanism for optimal WWW contentreplication “, In: Proc of19th IEEE International parallel and distributed processingsymposium,2005.
[125]谢识予，《经济学博弈论》，复旦大学出版社，2001，第二版。
[126] Nisan N, Ronen A,“(1999) Algorithmic mechanism design”, Proc31st annual ACMsymposium on theory of computing (STOC’99),1999, pp129–140.
[127] Jing J, Elmagarmid. A, Helal. A, Alonso R.“(1997) Bit-sequences: an adaptive cacheinvalidation method in mobile client/server environments “, Mobile Netw Appl2(2):115–127.
[128] Samee Ullah Khan, J,“Mosaic-Net: a game theoretical method for selection andallocation of replicas in ad hoc networks”, Supercomput (2011)55, pp.321–366
[58] Rappaport TS.“(1996) Wireless communications: principles and practices “, PrenticeHall, New York.
[129] Archer A, Tardos E.“(2001) Truthful mechanisms for one-parameter agents”, In:Proc of42nd IEEE annual symposium on foundations of computer science,2001, pp482–491.
[130] Khan SU, Ahmad I.“(2009) A pure Nash equilibrium-based game theoretical methodfor data replication across multiple servers “, IEEE Trans Knowl Data Eng20(3):346–360
[131] Crovella M, Bestavros A.“(1997) Self-similarity in world wide web traffic: evidenceand possible causes”, IEEE/ACM Trans Netw5(6):835–846.
[132] Izhak Rubin, Runhe Zhang,“Robust throughput and routing for mobile ad hoc wirelessnetworks”, Ad Hoc Networks7(2009) pp.265–280
[133] C.E. Perkins, E.M. Royer,“Ad hoc on-demand distance vector routing”, Proceedings ofthe2nd IEEE Workshop on Mobile Computing Systems and Applications, WMCSA’99,February1999, New Orleans, pp.90–100.
[134] Z. Ye, S.V. Krishnamurthy, S.K. Tripathi,“Effects of multipath routing on TCPperformance in ad hoc networks”, in: Proceedings of Global Telecommunications Conference,GLOBECOM’04. IEEE, vol.6, November2004, Dallas, pp.4125–4131.
[135] Y.C. Hu, D.B. Johnson,“Exploiting congestion information in network and higher layerprotocols in multihop wireless ad hoc networks”, in: Proceedings of24th InternationalConference on Distributed Computing Systems, March2004, Tokyo, Japan,2004, pp.301–310.
[136] K. Fall,“A delay-tolerant network architecture for challenged internets”, in:Proceedings of the2003Conference on Applications, Technologies, Architectures, andProtocols for Computer Communications,2003, Karlsruhe, Germany, pp.27–34.
[137] J. Burgess, B. Gallagher, D. Jensen, B. Levine,“Maxprop: routing for vehicle-baseddisruption-tolerant networks”, in: Proceedings of INFOCOM2006,25th IEEE InternationalConference on Computer Communications, April2006, Barcelona, Spain, pp.1–11.
[138] R. Zhang, I. Rubin,“Mobility induced robust throughput behavior in mobile ad hocnetworks”, in: Proceedings of IEEE60th Vehicular Technology Conference,2004.VTC2004-Fall, vol.4,2004, Los Angeles, pp.2708–2711.
[139] R. Zhang, I. Rubin,“Robust flow admission and routing for mobile ad hoc networks”,in: Proceedings of Military Communications Conference (Milcom), October2006,Washington DC.
[140] J. Hsu, I. Rubin,“Performance analysis of multi-rate capable random access MACprotocols in wireless multi-hop networks”, in: Proceedings IEEE International Symposium onPersonal, Indoor and Mobile Radio Communications (PIMRC’06), September2006, Helsinki,Finland.
[141] I. Rubin, R. Zhang, H. Ju,“Topological performance of mobile backbone basedwireless ad hoc network with unmanned vehicles”, in: Proceedings of IEEE WirelessCommunications and Networking Conference, WCNC’03, vol.3,2003, New Orleans,pp.1498–1503.
[142] I. Rubin, A. Behzad, H. Ju, R. Zhang, X. Huang, Y. Liu, R. Khalaf,“Ad hoc wirelessnetworks with mobile backbones”, in: Proceedings of the15th IEEE International Symposiumon Personal, Indoor and Mobile Radio Communications (PIMRC), vol.1, September2004,Barcelona, Spain, pp.566–573.
[143] X. Huang, I. Rubin, H. Ju,“A mobile backbone network routing protocol with flowcontrol”, in: Proceedings of Military Communications Conference (MILCOM), vol.2,2004,pp.1086–1092.
[144] H. Ju, I. Rubin,“Backbone topology synthesis for multi-radio meshed wireless LANs”,in: Proceedings IEEE INFOCOM2006Conference, April2006, Barcelona, Spain.
[145] D.B. Johnson,“Routing in ad hoc network of mobile hosts”, in: Proceedings of theIEEE Workshop on Mobile Computing Systems and Applications, December1994, pp.158–163, Santa Cruz.
[146] Chen, Yutian; Tang, Bin,“Data Caching in Ad Hoc Networks Using Game-TheoreticAnalysis”, Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC),2010IEEEInternational Conference on Page(s):43–49
[147] Majeed, S.J.; Mahmood, H.,“Topological Importance as an Incentive to Cooperate inMobile Ad Hoc Networks----A Game Theoretic Analysis”, Advanced CommunicationTechnology (ICACT),201214th International Conference on Page(s):46–51
[148] Macharla, P.; Kumar, R.; Sarje, A.K.; Misra, M.“Throughput-oriented MAC for mobilead hoc networks “, Communication Systems Software and Middleware and Workshops,2008.COMSWARE2008.3rd International Conference on Page(s):720–727
[149] Bo-qing Yang; Hao Sun,“Packet Forwarding Based on Cooperative Game and AuctionTheory in Wireless Ad Hoc Network”, Multimedia Information Networking and Security(MINES),2010International Conference on Page(s):149–153
[150] Tootaghaj, D.Z.; Farhat, F.; Pakravan, M.-R.; Aref, M.-R.“Game-Theoretic Approachto Mitigate Packet Dropping in Wireless Ad-hoc Networks“, Consumer Communicationsand Networking Conference (CCNC),2011IEEE Page(s):163–165
[151] Seredynski, M.; Bouvry, P.“Energy-efficient topology control in wireless ad hoc
networks with selfish nodes”, Parallel&Distributed Processing,2009. IPDPS2009. IEEE
International Symposium Page(s):1-8