Sciweavers

6682 search results - page 326 / 1337
» network 2006
Sort
View
PERCOM
2006
ACM
16 years 6 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece
GLOBECOM
2006
IEEE
16 years 24 days ago
Topology Control for Constant Rate Mobile Networks
Abstract— Controlling the topology of a wireless ad hoc network is very important from the point of view of performance. One known technique for controlling the topology is throu...
Liang Zhao, Errol L. Lloyd, S. S. Ravi
LCN
2006
IEEE
16 years 23 days ago
Packet Dispersion in IEEE 802.11 Wireless Networks
— Packet dispersion techniques have been commonly used to estimate bandwidth in wired networks. However, current packet dispersion techniques were developed for wired network env...
Mingzhe Li, Mark Claypool, Robert E. Kinicki
IWCMC
2006
ACM
16 years 21 days ago
DSMA: an access method for MIMO ad hoc networks based on distributed scheduling
In this work, we analyze the effects of a distributed transmission coordination scheme that is particularly suited for ad hoc networks with the ability to exploit spatially–mult...
Paolo Casari, Marco Levorato, Michele Zorzi
CN
2006
107views more  CN 2006»
15 years 6 months ago
Sub-graph routing: A generalized fault-tolerant strategy for link failures in WDM optical networks
Single- and multiple-link failure resilience are of critical importance in survivable wavelength division multiplexed (WDM) optical network design. Networks are not made up simply...
Michael T. Frederick, Pallab Datta, Arun K. Somani