Sciweavers

4962 search results - page 420 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
16 years 4 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
ICDCSW
2009
IEEE
16 years 1 months ago
A Geometric Routing Protocol in Disruption Tolerant Network
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
Jingzhe Du, Evangelos Kranakis, Amiya Nayak
ICNP
2009
IEEE
16 years 1 months ago
oCast: Optimal Multicast Routing Protocol for Wireless Sensor Networks
—In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermitten...
Lu Su, Bolin Ding, Yong Yang, Tarek F. Abdelzaher,...
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
16 years 1 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
16 years 1 months ago
On frame and orientation localization for relative sensing networks
We develop a novel localization theory for planar networks of nodes that measure each other’s relative position, i.e., we assume that nodes do not have the ability to perform me...
Giulia Piova, Iman Shames, Baris Fidan, Francesco ...