Convergence of distributed learning algorithms for optimal wireless channel allocation

被引：17

作者：

Leith, D. J. ^{[1
]}

Clifford, P. ^{[1
]}

机构：

[1] Natl Univ Ireland, Hamilton Inst, Maynooth, Kildare, Ireland

来源：

PROCEEDINGS OF THE 45TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14 | 2006年

关键词：

D O I：

10.1109/CDC.2006.376821

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper we establish the convergence to an optimal non-interfering channel allocation of a class of distributed stochastic algorithms. We illustrate the application of this result via (i) a communication-free distributed learning strategy for wireless channel allocation and (ii) a distributed learning strategy that can opportunistically exploit communication between nodes to improve convergence speed while retaining guaranteed convergence in the absence of communication.

引用

页码：2980 / 2985

页数：6

共 15 条

[1]

[Anonymous], HDB WIRELESS NETWORK

[2]

[Anonymous], MOBICOM 04

[3]

[Anonymous], SELF ORG INTERFERING

[4] An experimental analysis of simple, distributed vertex coloring algorithms [J].

Finocchi, I ;

Panconesi, A ;

Silvestri, R .

ALGORITHMICA, 2005, 41 (01) :1-23

[5]

JANSSEN J, 1998, P 15 ANN S THEOR ASP, V1373

[6] A better practical algorithm for distributed graph coloring [J].

Kubale, M ;

Kuszner, L .

PAR ELEC 2002: INTERNATIONAL CONFERENCE ON PARALLEL COMPUTING IN ELECTRICAL ENGINEERING, 2002, :72-75

[7]

LEITH D, 2006, P IEEE RAWNET 06

[8]

LEUNG BJ, 2003, P 58 IEEE VEH TECHN

[9]

LUO H, 2001, P IEEE INFOCOM 01

[10] Static frequency assignment in cellular networks [J].

Narayanan, L ;

Shende, SM .

ALGORITHMICA, 2001, 29 (03) :396-409

← 1 2 →