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: Reliable data transmission over wireless multi-hop networks, called ad hoc networks, has proven to be non-trivial. TCP (Transmission Control Protocol), a widely used end-...
— Intermittently Connected Mobile Ad Hoc Networks (ICMANs) are mobile networks in which complete source-todestination paths do not exist most of the time because of their sparse ...
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile ho...