Sciweavers

41 search results - page 3 / 9
» Constructing minimum-energy broadcast trees in wireless ad h...
Sort
View
ADHOC
2005
102views more  ADHOC 2005»
13 years 5 months ago
Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
Julien Cartigny, François Ingelrest, David ...
IMCSIT
2010
13 years 3 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
LCN
2003
IEEE
13 years 11 months ago
Improving Multicast Tree Construction in Static Ad Hoc Networks
We consider wireless multicast tree construction for energy efficiency. We introduce a novel algorithm, Incremental Shortest Path Tree (ISPT), to generate source-based multicast ...
Aleksi Penttinen, Jorma T. Virtamo
ADHOC
2010
135views more  ADHOC 2010»
13 years 24 days ago
Efficient broadcast for wireless ad hoc networks with a realistic physical layer
In this paper, we investigate the low coverage problem of efficient broadcast protocols in wireless ad hoc networks with realistic physical layer models. To minimize energy consum...
Hui Xu, J. J. Garcia-Luna-Aceves
GLOBECOM
2006
IEEE
13 years 11 months ago
Maximizing Broadcast Tree Lifetime in Wireless Ad Hoc Networks
— In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that t...
Guofeng Deng, Sandeep K. S. Gupta