Sciweavers

710 search results - page 25 / 142
» On Minimum Power Connectivity Problems
Sort
View
SAMOS
2007
Springer
14 years 1 months ago
k  +   Neigh : An Energy Efficient Topology Control for Wireless Sensor Networks
For most applications in wireless sensor networks (WSNs), it is often assumed that the deployment of sensor nodes is unmanaged and random, so the density of local node may vary thr...
Dong-Min Son, Young-Bae Ko
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
13 years 6 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou
INFOCOM
2003
IEEE
14 years 27 days ago
Localized minimum-energy broadcasting in ad-hoc networks
— In the minimum energy broadcasting problem, each node can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from...
Julien Cartigny, David Simplot, Ivan Stojmenovic
ADHOC
2005
102views more  ADHOC 2005»
13 years 7 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 ...
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
14 years 1 months ago
Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
Weiping Shi, Zhuo Li, Charles J. Alpert