Sciweavers

390 search results - page 36 / 78
» Computing shortest paths for any number of hops
Sort
View
INFOCOM
2003
IEEE
15 years 11 months ago
Protection Mechanisms for Optical WDM Networks based on Wavelength Converter
Abstract— This paper studies the problem of designing survivable optical wavelength division multiplexed (WDM) networks. A wavelength-routed wide area backbone network supporting...
Sunil Gowda, Krishna M. Sivalingam
INFOCOM
2007
IEEE
16 years 11 days 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...
PODC
2006
ACM
16 years 1 days ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
176
Voted
IPPS
2003
IEEE
15 years 11 months ago
Contact-Based Architecture for Resource Discovery (CARD) in Large Scale MANets
In this paper we propose a novel architecture, CARD, for resource discovery in large scale MANets that may scale up to thousands of nodes. Our mechanism is suitable for resource d...
Ahmed Helmy, Saurabh Garg, Priyatham Pamu, Nitin N...
COMCOM
2006
213views more  COMCOM 2006»
15 years 6 months ago
Energy efficient information dissemination protocols by negotiation for wireless sensor networks
In this paper we consider a distributed and efficient information dissemination and retrieval system for wireless sensor networks. In such a system each sensor node operates auton...
Dandan Liu, Xiaodong Hu, Xiaohua Jia