Sciweavers

710 search results - page 52 / 142
» On Minimum Power Connectivity Problems
Sort
View
TON
2010
197views more  TON 2010»
13 years 6 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
FOCS
1996
IEEE
13 years 12 months ago
Path Coloring on the Mesh
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
Yuval Rabani
SECON
2010
IEEE
13 years 5 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 11 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
TSP
2008
122views more  TSP 2008»
13 years 7 months ago
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing tot...
Eleftherios Karipidis, Nikos D. Sidiropoulos, Zhi-...