Sciweavers

7133 search results - page 372 / 1427
» Communication algorithms with advice
Sort
View
VTC
2006
IEEE
113views Communications» more  VTC 2006»
16 years 23 days ago
On the Practical Issues in Hop Count Localization of Sensors in a Multihop Network
– Simple algorithms have been developed in the area of node localization in a wireless sensor network. For these simple algorithms to work, several assumptions were made. However...
Eddie B. S. Tan, Joo Ghee Lim, Winston Khoon Guan ...
ISPAN
2005
IEEE
16 years 10 days ago
Increasing Sensor Network Lifetime by Identifying and Leveraging Nodes with Excess Energy In Heterogeneous Networks
We propose and evaluate wireless sensor routing algorithms designed to extend the lifetime of a heterogeneous wireless sensor network. The network is heterogeneous in the sensorsā...
Keith Hellman, Michael Colagrosso
ICOIN
2004
Springer
16 years 4 days ago
On Generating Random Network Structures: Connected Graphs
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
Alexey S. Rodionov, Hyunseung Choo
EUROPAR
2003
Springer
15 years 12 months ago
Dynamic Load Partitioning Strategies for Managing Data of Space and Time Heterogeneity in Parallel SAMR Applications
This paper presents the design and experimental evaluation of two dynamic load partitioning and balancing strategies for parallel Structured Adaptive Mesh Refinement (SAMR) applic...
Xiaolin Li, Manish Parashar
GD
2001
Springer
15 years 11 months ago
A Characterization of DFS Cotree Critical Graphs
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph ...
Hubert de Fraysseix, Patrice Ossona de Mendez