Sciweavers

1684 search results - page 44 / 337
» Connectivity in cooperative wireless ad hoc networks
Sort
View
MOBIHOC
2002
ACM
15 years 9 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
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...
Yuanzhu Peter Chen, Arthur L. Liestman
TPDS
2002
155views more  TPDS 2002»
14 years 9 months ago
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
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...
Jie Wu
WWIC
2004
Springer
197views Communications» more  WWIC 2004»
15 years 3 months ago
Context-Aware Group Communication in Mobile Ad-Hoc Networks
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
ICWMC
2006
IEEE
15 years 3 months ago
An Ant-based Routing Protocol using Unidirectional Links for Heterogeneous Mobile Ad-Hoc Networks
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...