Sciweavers

296 search results - page 1 / 60
» An Upper Bound on Network Size in Mobile Ad-Hoc Networks
Sort
View
GLOBECOM
2008
IEEE
13 years 10 months ago
An Upper Bound on Network Size in Mobile Ad-Hoc Networks
—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...
PERCOM
2004
ACM
14 years 3 months ago
Towards Scalable P2P Computing for Mobile Ad Hoc Networks
In mobile ad hoc networks, nodes interact peer-to-peer. They self-organize, share workloads and provide services that they also use. There are middleware platforms, designed for t...
Marco Conti, Enrico Gregori, Giovanni Turi
MOBIHOC
2001
ACM
14 years 3 months ago
A probabilistic analysis for the range assignment problem in ad hoc networks
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
Paolo Santi, Douglas M. Blough, Feodor S. Vainstei...
COMCOM
2004
90views more  COMCOM 2004»
13 years 4 months ago
Understanding bandwidth-delay product in mobile ad hoc networks
Bandwidth-delay product (BDP) and its upper bound (BDP-UB) have been well-understood in wireline networks such as the Internet. However, they have not been carefully studied in th...
Kai Chen, Yuan Xue, Samarth H. Shah, Klara Nahrste...
INFOCOM
2002
IEEE
13 years 9 months ago
Clustering Overhead for Hierarchical Routing in Mobile Ad hoc Networks
Numerous clustering algorithms have been proposed that can support routing in mobile ad hoc networks (MANETs). However, there is very little formal analysis that considers the comm...
John Sucec, Ivan Marsic