34 citations · 135 across the 24 of their papers we have counts for
9 papers · 1 filter
Performance analysis of a distributed algorithm for admission control in wireless networks under the -hop interference model
Ashwin Ganesan
A general open problem in networking is: what are the fundamental limits to the performance that is achievable with some given amount of resources? More specifically, if each node…
On some distributed scheduling algorithms for wireless networks with hypergraph interference models
Ashwin Ganesan
It is shown that the performance of the maximal scheduling algorithm in wireless ad hoc networks under the hypergraph interference model can be further away from optimal than previ…
Performance Guarantees of Distributed Algorithms for QoS in Wireless Ad Hoc Networks
Ashwin Ganesan
Consider a wireless network where each communication link has a minimum bandwidth quality-of-service requirement. Certain pairs of wireless links interfere with each other due to b…
Performance of distributed mechanisms for flow admission in wireless adhoc networks
Ashwin Ganesan
Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth…
On some upper bounds on the fractional chromatic number of weighted graphs
Ashwin Ganesan
Given a weighted graph $G_\bx$, where is a non-negative, real-valued weight assigned to the vertices of G, let $B(G_\bx)$ be an upper bound on the fractional chro…
On some sufficient conditions for distributed Quality-of-Service support in wireless networks
Ashwin Ganesan
Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth…