522 search results - page 30 / 105 » Connected k-Hop Clustering in Ad Hoc Networks |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
MASS
2010
13 years 5 months ago
2010
With the popularity of wireless devices and the increase of computing and storage resources, there are increasing interests in supporting mobile computing techniques. Particularly...
PIMRC
2010
IEEE
13 years 5 months ago
2010
IEEE
Wireless multihop ad hoc networks face a multitude of challenging problems including highly dynamic multihop topologies, lossy and noisy communications channels, and sporadic conne...
TPDS
2002
13 years 7 months ago
2002
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...
TON
2012
11 years 10 months ago
2012
—This paper presents DAWN, a declarative platform that creates highly adaptive policy-based MANET protocols. DAWN leverages declarative networking techniques to achieve extensibl...