A QoS routing algorithm based on game theory for ad hoc networks having small-world characteristics

Rong Hua Zhou*, Nan Zhang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Citations (Scopus)

Abstract

With the development of network theory, the new science of complex networks has brought new ideas for the ad hoc network research. The small-world network has a high clustering coefficient and small average path length characteristics. This paper designs a multi-constraint QoS routing algorithm of ad hoc network having small-world characteristics. It is aimed at the dynamic environment of ad hoc network and link state information is uncertain, even ambiguous. Through Game analysis, this paper looks for the NP-complete problem of optimal or sub-optimal solution and enables users and network providers to meet the utility of Nash Equilibrium Pareto optimal. The simulation shows that the algorithm is feasible and effective.

Original languageEnglish
Title of host publicationProceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009
DOIs
Publication statusPublished - 2009
Event5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009 - Beijing, China
Duration: 24 Sept 200926 Sept 2009

Publication series

NameProceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009

Conference

Conference5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009
Country/TerritoryChina
CityBeijing
Period24/09/0926/09/09

Keywords

  • Ad hoc network
  • Game theory
  • Multi-constraint QoS
  • Small-world characteristics

Fingerprint

Dive into the research topics of 'A QoS routing algorithm based on game theory for ad hoc networks having small-world characteristics'. Together they form a unique fingerprint.

Cite this