Sciweavers

888 search results - page 124 / 178
» Capacity of Arbitrary Wireless Networks
Sort
View
ADHOC
2007
139views more  ADHOC 2007»
13 years 10 months ago
Bounded-distance multi-clusterhead formation in wireless ad hoc networks
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
Marco Aurélio Spohn, J. J. Garcia-Luna-Acev...
INFOCOM
2007
IEEE
14 years 4 months ago
Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
David Starobinski, Weiyao Xiao, Xiangping Qin, Ari...
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
WWIC
2007
Springer
182views Communications» more  WWIC 2007»
14 years 4 months ago
Multicast Overlay Spanning Tree Protocol for Ad Hoc Networks
In this paper we present an extension to the OLSR unicast routing protocol to support multicast routing in mobile ad hoc networks. The proposed protocol is based on Multicast Overl...
Georgios Rodolakis, Amina Meraihi Naimi, Anis Laou...
WIOPT
2006
IEEE
14 years 4 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi