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 networks and the voice over Internet protocol (VoIP) have recently been widely adapted. VoIP services over Ad-hoc network can be accomplished by middleware embedded in mob...
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not sup...
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with th...