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...
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
In this paper, we investigate the performance of wireless ad hoc networks with traffic loads beyond saturation. While it is desirable to operate a network below saturation, an ad h...
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
Alireza Keshavarz-Haddad, Vinay J. Ribeiro, Rudolf...
A wireless multihop ad hoc network is emerging as an important area for new developments in the ubiquitous network. Although ad hoc network is attractive solution, there are still...
Binod Vaidya, Dong-You Choi, Jong-An Park, Seung J...