Grant: Discovery Grants Program - Individual
École de technologie supérieure
$14,000.00
Secure Telecommunication Infrastructures - Mechanisms to mitigate the impacts of non-cooperative participants in distributed systems
EF 2013-14
Résumé
One for all, all for one. Distributed systems are generally composed of independent participants who have to collaborate with each other for their own benefit. Without a strong cooperation among the participants, these systems would be ineffective. Unfortunately, participants cooperate legitimately, act maliciously or behave selfishly. For example, in mobile ad hoc networks, the participants may have to forward traffic flows from others. Thus, selfish participants can be seen as passive participants who retrieve some network services from others without providing back any such service. These participants can have major impacts on the performance of such a network. Ultimately, legitimate participants may not be able to communicate properly.Without any incentive mechanism, selfish participants would behave for their own benefit without any regard for others. Traditionally, game theory has been used to model incentive mechanisms to reward legitimate participants with a faked currency. Repeated non-cooperative game approaches can also be used to force selfish participants to collaborate under the threat of potential retaliation. Unfortunately, traditional approaches assume that cooperative participants can always collaborate truthfully. They cannot cope easily with stochastic participants who are unfortunately unable to collaborate momentarily. Similarly, traditional approaches assume that cooperative and uncooperative participants can always be distinguished without any error. If a participant misidentifies another participant, this latter participant may be facing unjustifiable retaliations. This research program would investigate how to adapt the classical approaches of game theory (i) to allow the presence of stochastic cooperative participants and (ii) to cope with misidentification of the cooperative/uncooperative participants.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
138440-2012
Name nom
Robert, JeanMarc
Department département
Génie logiciel et des TI
Organization id
53
Institution établissement
École de technologie supérieure
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2012
Award amount
14000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2700
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Information technology
Research subject fr
Technologie de l'information
Partie
2
Nb partie
5
Application title
Secure Telecommunication Infrastructures - Mechanisms to mitigate the impacts of non-cooperative participants in distributed systems
Keyword
NSERC
Application summary
One for all, all for one. Distributed systems are generally composed of independent participants who have to collaborate with each other for their own benefit. Without a strong cooperation among the participants, these systems would be ineffective. Unfortunately, participants cooperate legitimately, act maliciously or behave selfishly. For example, in mobile ad hoc networks, the participants may have to forward traffic flows from others. Thus, selfish participants can be seen as passive participants who retrieve some network services from others without providing back any such service. These participants can have major impacts on the performance of such a network. Ultimately, legitimate participants may not be able to communicate properly.Without any incentive mechanism, selfish participants would behave for their own benefit without any regard for others. Traditionally, game theory has been used to model incentive mechanisms to reward legitimate participants with a faked currency. Repeated non-cooperative game approaches can also be used to force selfish participants to collaborate under the threat of potential retaliation. Unfortunately, traditional approaches assume that cooperative participants can always collaborate truthfully. They cannot cope easily with stochastic participants who are unfortunately unable to collaborate momentarily. Similarly, traditional approaches assume that cooperative and uncooperative participants can always be distinguished without any error. If a participant misidentifies another participant, this latter participant may be facing unjustifiable retaliations. This research program would investigate how to adapt the classical approaches of game theory (i) to allow the presence of stochastic cooperative participants and (ii) to cope with misidentification of the cooperative/uncooperative participants.