Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
Wireless technology promises a realization of the long-standing vision of ubiquitous high-speed Internet access. WiFi-based wireless mesh networks that provide user access and wir...
Roger Karrer, Alessio Botta, Antonio Pescapè...
In this paper we examine the capabilities of Switched Ethernet for building wireless mesh networks (WMNs) and more specific for the support of fast moving users. We will motivate...
Filip De Greve, Wim Vandenberghe, Filip De Turck, ...
Wireless mesh network can increase service coverage by low-cost multiple-paths between a source and a destination. But because of the wireless nature, wireless mesh network is vuln...