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...
This paper presents the first analytical model to derive the saturation throughput of collision avoidance protocols in multi-hop ad hoc networks with nodes randomly placed accord...
This paper reevaluates the multicast protocols for MANETs in terms of energy efficiency and proposes a new robust multicast protocol, called Two-Tree Multicast (TTM). Multicast pr...
— With the explosive growth of network techniques, in particular wireless communications, the traditional centralized, fixed networks can no longer satisfy the enormous demands ...
Opportunistic networking - forwarding messages in a disconnected mobile ad hoc network via any encountered nodes - otters a new mechanism for exploiting the mobile devices that man...