We consider an ad-hoc wireless network operating within a free market economic model. Users send data over a choice of paths, and scheduling and routing decisions are updated dyna...
Abstract— This paper presents three algorithms that outperform all other published work for allocating a limited number of orthogonal frequency channels to access points (APs) in...
Jeremy K. Chen, Gustavo de Veciana, Theodore S. Ra...
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
—The operation of widely-deployed random access to wireless networks is based on limited information on the result of each access attempt. When making a random access attempt, us...
— This paper examines the achievable performance gains when a particular class of cooperative relaying known as best-select is employed. In essence, best-select seeks to improve ...