A novel routing approach for wireless ad hoc networks based on game theory

Keyphrases

• Wireless Ad-hoc Networks (WANETs) 100%
• Network Applications 100%
• Network Node 100%
• Game Theory 100%
• Routing Approach 100%
• Time Constraints 50%
• Nash Equilibrium 50%
• Routing Protocol 50%
• Vehicular Ad Hoc Networks 50%
• Network Environment 50%
• Ad Hoc Networks 50%
• Base Station 50%
• Actual Situation 50%
• Access Point 50%
• Mobile Ad Hoc Network (MANET) 50%
• Wireless Mesh Networks 50%
• Large-scale Networks 50%
• Geographical Constraints 50%
• Routing Cost 50%
• Routing Algorithm 50%
• Pricing Mechanism 50%
• Fixed Infrastructure 50%
• Reasonable Cost 50%
• Node Routing 50%

Computer Science

• wireless ad hoc network 100%
• Time Constraint 50%
• Nash Equilibrium 50%
• Routing Protocol 50%
• Network Environment 50%
• vehicular ad-hoc network 50%
• ad-hoc network 50%
• Actual Situation 50%
• Access Point 50%
• mobile ad-hoc network 50%
• Wireless Mesh Network 50%
• Routing Algorithm 50%
• Fixed Infrastructure 50%