Learn More
We study the problem of scheduling activities of several types under the constraint that at most a fixed number of activities can be scheduled in any single time-slot. Any given activity type is associated with a service cost and an operating cost that increases linearly with the number of time-slots since the last service of this type. The problem is to(More)
— Multiple Input Multiple Output (MIMO) antennas use sophisticated physical layer techniques to provide significant benefits over conventional antenna technology. Multiple independent data streams can be sent over the MIMO antenna elements. MIMO link can also suppress interference from neighboring links as long as the total useful streams and interfering(More)
Multi-hop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their single-hop counterpart, wireless LANs. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using orthogonal channels. Efficient channel assignment and(More)
—In third generation (3G) wireless data networks, multicast throughput decreases with the increase in multicast group size, since a conservative strategy for the base station is to use the lowest data rate of all the receivers so that the receiver with the worst downlink channel condition can decode the transmission correctly. This paper proposes ICAM,(More)
— In this paper we present a framework for providing fair service and supporting QoS requirements in IEEE 802.11 networks with multiple access-points (APs). These issues becomes critical as IEEE 802.11 wireless LAN are widely deployed in nationwide networks, linking tens of thousands of " hot-spots " for providing both real-time (voice) and non real-time(More)
In this paper, we present a framework for providing fair service and supporting quality of service (QoS) requirements in IEEE 802.11 networks with multiple access points (APs). These issues becomes critical as IEEE 802.11 wireless LAN are widely deployed in nationwide networks, linking tens of thousands of "hotspots" for providing both real-time (voice) and(More)
The full degree spanning tree problem is deened as follows: given a connected graph G = (V; E) nd a spanning tree T so as to maximize the number of vertices whose degree in T is the same as in G (these are called vertices of \full" degree). We show that this problem is NP-hard. We also present almost optimal approximation algorithms for it assuming coR 6 =(More)