The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
— In this paper, we discuss the information–theoretic approach to finding the pattern of transmission powers of the stations in a CDMA system which maximizes the aggregate cap...
Arash Abadpour, Attahiru Sule Alfa, Anthony C. K. ...
In IEEE 802.11 wireless LANs, the DCF access method and the PCF access method operate alternatively within a superframe to service the time-varying traffic demands. Due to differ...
X. James Dong, Mustafa Ergen, Pravin Varaiya, Anuj...
Abstract— Service level agreements (SLAs) specify performance guarantees made by service providers, typically in terms of packet loss, delay, delay variation, and network availab...
Joel Sommers, Paul Barford, Nick G. Duffield, Amos...
— Coverage is an important issue related to WSN quality of service. Several centralized/decentralized solutions based on the geometry information of sensors and under the assumpt...
Azzedine Boukerche, Xin Fei, Regina Borges de Arau...