In the Internet of Things various traffic streams generated by sensors will trade with intermediate relay nodes to forward their traffic to
the destination. Since, these relay nodes receive compensation for forwarding the traffic, they will compete among themselves for doing
this. This talk will first present an introduction to the Internet of Things and to the Routing problem. Then it will formulate and solve
the problem as a Stackelberg game. Finally, it will present simulation results for various scenarios, and discuss open research issues.
Prof. Anastasios A. Economides
is Full Professor on Computer Networks and Telematic Applications
at the University of Macedonia, Thessaloniki, Greece. He received the Dipl.Eng. degree in electrical engineering from Aristotle University of Thessaloniki, in 1984. Holding a Fulbright and a Greek State Fellowship, he received the M.Sc. and the Ph.D. degrees in computer engineering from the University of Southern California, Los Angeles, in 1987 and 1990, respectively. The title of his Ph.D. thesis is: "A unified game-theoretic methodology for the joint load sharing, routing and congestion control problem". At graduation, he received the Outstanding Academic Achievement Award from the University of Southern California.
He is the director of CONTA (COmputer Networks and Telematic Applications
) Laboratory. His research interests include networking protocols, competition & techno-economics, educational technology and smart services. He has published over 200 peer-reviewed papers.
He has been the plenary speaker in International Conferences, on the editorial board of several International Journals, and on the program committee of many International Conferences. He is an IEEE Senior member. Finally, he has been the principal investigator of 10 funded projects and participated in 25 funded projects.