Sciweavers

4 search results - page 1 / 1
» Optimal Gathering Algorithms in Multi-Hop Radio Tree-Network...
Sort
View
AHSWN
2010
105views more  AHSWN 2010»
13 years 5 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu
ADHOCNOW
2008
Springer
13 years 6 months ago
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
Jean-Claude Bermond, Min-Li Yu
INFOCOM
2008
IEEE
13 years 12 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
ADHOCNOW
2009
Springer
14 years 1 days ago
Minimum Delay Data Gathering in Radio Networks
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are presen...
Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes...