Application of evolutionary game theory to wireless mesh networks

Vasilakos, A; Anastasopoulos, M

dc.contributor.author	Vasilakos, A	en
dc.contributor.author	Anastasopoulos, M	en
dc.date.accessioned	2014-03-01T01:25:56Z
dc.date.available	2014-03-01T01:25:56Z
dc.date.issued	2007	en
dc.identifier.issn	1860949X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/17824
dc.subject	Evolutionary Game Theory	en
dc.subject	Numerical Simulation	en
dc.subject	Physical Layer	en
dc.subject	Routing Protocol	en
dc.subject	Temporal Properties	en
dc.subject	Wireless Network	en
dc.subject	Wireless Mesh Network	en
dc.title	Application of evolutionary game theory to wireless mesh networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/978-3-540-72377-6_11	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-72377-6_11	en
heal.publicationDate	2007	en
heal.abstract	Wireless Mesh Networks (WMN) with static nodes, consisting of pointto-point links operating at frequencies above 10GHz are studied in this chapter. The dominant fading mechanism deteriorating the performance of these wireless networks is rain attenuation. Due to spatial-temporal properties of rain fading, routing protocols that usually operate well under clear sky conditions seem to be inefficient. In this chapter, a new routing protocol applying evolutionary game theory is presented. Traffic is being controlled if one considers an infinite number of agents that each is responsible for an infinitesimal load. Their aim is to maximize their individual throughput selfishly without considering the performance of the whole network. The routing strategy of every agent is being revised continuously by sampling another path using input from the physical layer. Finally, the performance of the proposed routing scheme is evaluated through extended numerical simulations for its stability and scalability. © 2007 Springer-Verlag Berlin Heidelberg.	en
heal.journalName	Studies in Computational Intelligence	en
dc.identifier.doi	10.1007/978-3-540-72377-6_11	en
dc.identifier.volume	66	en
dc.identifier.spage	249	en
dc.identifier.epage	267	en