—Most publications on the capacity and performance of wireless ad hoc networks share the underlying assumption of a uniform random distribution of nodes. In this paper, we study ...
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
A wireless ad hoc network is formed by a group of wireless hosts, without the use of any infrastructure. To enable communication, hosts cooperate among themselves to forward packet...
Moving toward 4G, wireless ad hoc networks receive growing interest due to users’ provisioning of mobility, usability of services, and seamless communications. In ad hoc network...
Qian Zhang, Qing Chen, Fan Yang, Xuemin Shen, Zhis...
Traditionally, the routing problem is addressed at the network layer, an approach that has been extended to the wireless realm. In wireless multihop networks, however, strict laye...