Mobile agents acting in wireless ad hoc networks are energy constrained, which leads to potential selfishness as nodes are not necessarily willing to forward packets for other nodes. Situations like this are traditionally analyzed using game theory and recently also the ad hoc networking community has witnessed game-theoretic approaches to especially routing. However, from a theoretical point-of-view the contemporary game-theoretic approaches have mainly ignored two important aspects: non-simultaneous decision making and incorporating history information into the decision making process. In this article we propose a new model that fills these gaps and allows to analyze routing theoretically.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Modelling routing in wireless ad hoc networks with dynamic Bayesian games


    Beteiligte:
    Nurmi, P. (Autor:in)


    Erscheinungsdatum :

    01.01.2004


    Format / Umfang :

    534086 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Bayesian Optimization for Multi-Agent Routing in Markov Games

    Shou, Zhenyu / Chen, Xu / Di, Xuan | IEEE | 2022



    Population games on dynamic community networks

    Alain Govaert / Lorenzo Zino / Emma Tegling | BASE | 2022

    Freier Zugriff

    Routing Protocols for Wireless Sensor Networks

    Liang, Y. / Yu, H.-b. / Zeng, P. | British Library Online Contents | 2005


    Modelling pedestrian crossing behaviour using Bayesian networks

    Lee, Earl ‘Rusty' | Online Contents | 2013