Sciweavers

295 search results - page 33 / 59
» An approximation algorithm for the wireless gathering proble...
Sort
View
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
14 years 7 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
TMC
2011
261views more  TMC 2011»
14 years 4 months ago
Breath: An Adaptive Protocol for Industrial Control Applications Using Wireless Sensor Networks
—An energy-efficient, reliable and timely data transmission is essential for wireless sensor networks (WSNs) employed in scenarios where plant information must be available for ...
Pan Gun Park, Carlo Fischione, Alvise Bonivento, K...
MST
2010
155views more  MST 2010»
14 years 4 months ago
Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks
We consider the important problem of energy balanced data propagation in wireless sensor networks and we extend and generalize previous works by allowing adaptive energy assignment...
Pierre Leone, Sotiris E. Nikoletseas, José ...
ICNP
2006
IEEE
15 years 3 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
14 years 11 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau