Self-Organization in Decentralized Networks: A Trial and Error Learning Approach

Rose, Luca; Perlaza, Samir M.; Martret, Christophe J. Le; Debbah, Mérouane

doi:10.1109/twc.2013.112613.130405

Cited by 26 publications

(24 citation statements)

References 31 publications

(37 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, we explain the methodology to obtain them. To the best of our knowledge, a first attempt to analyse the convergence rate of TEL in a practical context was addressed in [9]. However, the analysis provided in this paper provides a better approximation (as one will see in the sequel).…”

Section: Arxiv:171101788v1 [Csgt] 6 Nov 2017mentioning

confidence: 95%

See 1 more Smart Citation

Performance Analysis of Trial and Error Algorithms

Gaveau

Martret

Assaad

2020

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

Model-free decentralized optimizations and learning are receiving increasing attention from theoretical and practical perspectives. In particular, two fully decentralized learning algorithms, namely Trial and Error (TEL) and Optimal Dynamical Learning (ODL), are very appealing for a broad class of games. In fact, ODL has the property to spend a high proportion of time in an optimum state that maximizes the sum of utility of all players. And the TEL has the property to spend a high proportion of time in an optimum state that maximizes the sum of utility of all players if there is a Pure Nash Equilibrium (PNE), otherwise, it spends a high proportion of time in an optimum state that maximizes a tradeoff between the sum of utility of all players and a predefined stability function. On the other hand, estimating the mean fraction of time spent in the optimum state (as well as the mean time duration to reach it) is challenging due to the high complexity and dimension of the inherent Markov Chains.In this paper, under some specific system model, an evaluation of the above performance metrics is provided by proposing an approximation of the considered Markov chains, which allows overcoming the problem of high dimensionality. A comparison between the two algorithms is then performed which allows a better understanding of their performances.

show abstract

Section: Arxiv:171101788v1 [Csgt] 6 Nov 2017mentioning

confidence: 95%

“…The trial and error algorithms, proposed in [4], [12] and then applied to various resource sharing problems e.g. [8], [9], [10], [11], are very appealing in these contexts.…”

Section: Arxiv:171101788v1 [Csgt] 6 Nov 2017mentioning

confidence: 99%

Performance Analysis of Trial and Error Algorithms

Gaveau

Martret

Assaad

2020

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Different test of force control and channel determination is broke down. [10]. Creator in [11] presents a proficient verification plan for vehicular and impromptu systems.…”

Section: Literature Surveymentioning

confidence: 99%

IPTTA: Leveraging Token-based node IP assignment and verification for WSN

Vinayagam

Parthasarathy

2014

2014 International Conference on Science Engineering and Management Research (ICSEMR)

View full text Add to dashboard Cite

This paper is focusing on detection and prevention Sybil nodes in Wireless Sensor Networks. Sybil is a fake-ID based malicious activity destroying the networks behavior. Here IPTTA -[IP Traceback and Token Assigner] approach is proposed to detect and prevent Sybil attack by assigning and verifying IP address with assigned unique Token for each node in the route. IPTTA verify the node IP, Token with time stamp and fetch the contradictory node as Sybil node. The simulation results show that the IPTTA provides better result than the existing systems and reduces cost and time

show abstract

“…The interested reader, is referred to [11], [16] for a more comprehensive analysis of the state of the art.…”

Section: A Dynamic Frequency Allocationmentioning

confidence: 99%

“…In order to stabilize the cluster channel and power adaptation, the authors proposed a new solution based upon some heuristics in [16], [21].…”

Section: B Learning Solution For Cluster Frequency and Power Allocationmentioning

confidence: 99%

CORASMA Program on Cognitive Radio for Tactical Networks: High Fidelity Simulator and First Results on Dynamic Frequency Allocation

Rose

Massin

Vijayandran

et al. 2013

MILCOM 2013 - 2013 IEEE Military Communications Conference

Self Cite

View full text Add to dashboard Cite

Abstract-This paper reports some preliminary results of the "cognitive radio for dynamic spectrum management" (CORASMA) program that is dedicated to the evaluation of cognitive solutions for tactical wireless networks. It presents two main aspects of the program: the simulator and the cognitive solutions proposed by the authors. The first part is dedicated to the simulator. We explain the rationale used to design its architecture, and how this architecture allows to assess and compare different cognitive solutions in an operational context. The second part addresses the dynamic frequency allocation topic that is part of the cognitive solutions tackled in the program CORASMA. We first give an overview of the challenges attached to this problem in the military context and then we expose the technical solutions studied by the authors for this purpose. Finally, we present some results obtained from the simulator as an illustration.

show abstract

Self-Organization in Decentralized Networks: A Trial and Error Learning Approach

Cited by 26 publications

References 31 publications

Performance Analysis of Trial and Error Algorithms

Performance Analysis of Trial and Error Algorithms

IPTTA: Leveraging Token-based node IP assignment and verification for WSN

CORASMA Program on Cognitive Radio for Tactical Networks: High Fidelity Simulator and First Results on Dynamic Frequency Allocation

Contact Info

Product

Resources

About