Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Abstract— Network service providers contract with network owners for connection rights, then offer individual users network access at a price. Within this hierarchy, the service ...
— We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless ...
Nikolaus Correll, Jonathan Bachrach, Daniel Vicker...
—The architecture of a device that is optimized for wireless information access and display of multimedia data is substantially different than configurations designed for portabl...
Thomas E. Truman, Trevor Pering, Roger Doering, Ro...