Traditional routing strategies for multi-hop wireless networks forward packets by selecting at the sender side the next hop for each packet. Recently, such a paradigm has been call...
Angela Sara Cacciapuoti, Marcello Caleffi, Luigi P...
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...
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
—For a wireless network with ¢ nodes distributed in an area £ , with ¢ source-destination pairs communicating with each other at some common rate, the hierarchical cooperation...
Many previous papers have pointed out that TCP performance in multi-hop ad hoc networks is not optimal. This is due to several TCP design principles that reflect the characteristi...
Giuseppe Anastasi, Emilio Ancillotti, Marco Conti,...