A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
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,...
: Internet-based Mobile Ad Hoc Networking (MANET) is an emerging technology that supports self-organizing mobile networking infrastructures. This is expected to be of great use in ...
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...
Wireless and ad hoc networks often have local regions of highly intra-connected modules or communities of nodes against a backdrop of sparser longer-range intercommunity connectiv...