On some sufficient conditions for distributed Quality-of-Service support in wireless networks - Computer Science > Information TheoryReportar como inadecuado




On some sufficient conditions for distributed Quality-of-Service support in wireless networks - Computer Science > Information Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Given a wireless network where some pairs of communication links interferewith each other, we study sufficient conditions for determining whether a givenset of minimum bandwidth Quality of Service QoS requirements can besatisfied. We are especially interested in algorithms which have lowcommunication overhead and low processing complexity. The interference in thenetwork is modeled using a conflict graph whose vertices are the communicationlinks in the network. Two links are adjacent in this graph if and only if theyinterfere with each other due to being in the same vicinity and hence cannot besimultaneously active. The problem of scheduling the transmission of thevarious links is then essentially a fractional, weighted vertex coloringproblem, for which upper bounds on the fractional chromatic number are soughtusing only localized information. We present some distributed algorithms forthis problem, and discuss their worst-case performance. These algorithms areseen to be within a bounded factor away from optimal for some well knownclasses of networks and interference models.



Autor: Ashwin Ganesan

Fuente: https://arxiv.org/







Documentos relacionados