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...
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
Abstract. The widespread availability of both fixed and wireless network connectivity and the growing market of portable devices are enabling anytime and anywhere impromptu collabo...
Dario Bottazzi, Antonio Corradi, Rebecca Montanari
Because of the heterogeneity in radio transceiver capabilities and influence of surroundings, unidirectional links arise in wireless mobile ad-hoc networks. Since most of existin...
Taro Maekawa, Harumasa Tada, Naoki Wakamiya, Makot...